A hybrid neural combinatorial optimization framework assisted by automated algorithm design
Gespeichert in:
| Titel: | A hybrid neural combinatorial optimization framework assisted by automated algorithm design |
|---|---|
| Autoren: | Liang Ma, Xingxing Hao, Wei Zhou, Qianbao He, Ruibang Zhang, Li Chen |
| Quelle: | Complex & Intelligent Systems, Vol 10, Iss 6, Pp 8233-8247 (2024) |
| Verlagsinformationen: | Springer Science and Business Media LLC, 2024. |
| Publikationsjahr: | 2024 |
| Schlagwörter: | Transformer, Electronic computers. Computer science, Reinforcement learning, QA75.5-76.95, Information technology, T58.5-58.64, Neural combinatorial optimization, Automated algorithm design |
| Beschreibung: | In recent years, the application of Neural Combinatorial Optimization (NCO) techniques in Combinatorial Optimization (CO) has emerged as a popular and promising research direction. Currently, there are mainly two types of NCO, namely, the Constructive Neural Combinatorial Optimization (CNCO) and the Perturbative Neural Combinatorial Optimization (PNCO). The CNCO generally trains an encoder-decoder model via supervised learning to construct solutions from scratch. It exhibits high speed in construction process, however, it lacks the ability for sustained optimization due to the one-shot mapping, which bounds its potential for application. Instead, the PNCO generally trains neural network models via deep reinforcement learning (DRL) to intelligently select appropriate human-designed heuristics to improve existing solutions. It can achieve high-quality solutions but at the cost of high computational demand. To leverage the strengths of both approaches, we propose to hybrid the CNCO and PNCO by designing a hybrid framework comprising two stages, in which the CNCO is the first stage and the PNCO is the second. Specifically, in the first stage, we utilize the attention model to generate preliminary solutions for given CO instances. In the second stage, we employ DRL to intelligently select and combine appropriate algorithmic components from improvement pool, perturbation pool, and prediction pool to continuously optimize the obtained solutions. Experimental results on synthetic and real Capacitated Vehicle Routing Problems (CVRPs) and Traveling Salesman Problems(TSPs) demonstrate the effectiveness of the proposed hybrid framework with the assistance of automated algorithm design. |
| Publikationsart: | Article |
| Sprache: | English |
| ISSN: | 2198-6053 2199-4536 |
| DOI: | 10.1007/s40747-024-01600-2 |
| Zugangs-URL: | https://doaj.org/article/bec8f8d726b944ed96992d17dfb9ccba |
| Rights: | CC BY NC ND |
| Dokumentencode: | edsair.doi.dedup.....af67c2449b377a10dec5ec0fcfab5499 |
| Datenbank: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | In recent years, the application of Neural Combinatorial Optimization (NCO) techniques in Combinatorial Optimization (CO) has emerged as a popular and promising research direction. Currently, there are mainly two types of NCO, namely, the Constructive Neural Combinatorial Optimization (CNCO) and the Perturbative Neural Combinatorial Optimization (PNCO). The CNCO generally trains an encoder-decoder model via supervised learning to construct solutions from scratch. It exhibits high speed in construction process, however, it lacks the ability for sustained optimization due to the one-shot mapping, which bounds its potential for application. Instead, the PNCO generally trains neural network models via deep reinforcement learning (DRL) to intelligently select appropriate human-designed heuristics to improve existing solutions. It can achieve high-quality solutions but at the cost of high computational demand. To leverage the strengths of both approaches, we propose to hybrid the CNCO and PNCO by designing a hybrid framework comprising two stages, in which the CNCO is the first stage and the PNCO is the second. Specifically, in the first stage, we utilize the attention model to generate preliminary solutions for given CO instances. In the second stage, we employ DRL to intelligently select and combine appropriate algorithmic components from improvement pool, perturbation pool, and prediction pool to continuously optimize the obtained solutions. Experimental results on synthetic and real Capacitated Vehicle Routing Problems (CVRPs) and Traveling Salesman Problems(TSPs) demonstrate the effectiveness of the proposed hybrid framework with the assistance of automated algorithm design. |
|---|---|
| ISSN: | 21986053 21994536 |
| DOI: | 10.1007/s40747-024-01600-2 |