{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T08:31:37Z","timestamp":1773477097159,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T00:00:00Z","timestamp":1723852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T00:00:00Z","timestamp":1723852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106199"],"award-info":[{"award-number":["62106199"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Projects of Shaanxi Province","doi-asserted-by":"publisher","award":["2020KW-068"],"award-info":[{"award-number":["2020KW-068"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"name":"General Project of Education of Shannxi Provincial Government","award":["22JK058"],"award-info":[{"award-number":["22JK058"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s40747-024-01600-2","type":"journal-article","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:02:30Z","timestamp":1723885350000},"page":"8233-8247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A hybrid neural combinatorial optimization framework assisted by automated algorithm design"],"prefix":"10.1007","volume":"10","author":[{"given":"Liang","family":"Ma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3590-2392","authenticated-orcid":false,"given":"Xingxing","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Qianbao","family":"He","sequence":"additional","affiliation":[]},{"given":"Ruibang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"1600_CR1","unstructured":"Kool W, van Hoof H, Welling M (2019) Attention, learn to solve routing problems! In: 7th International conference on learning representations (ICLR). arXiv preprint http:\/\/arxiv.org\/ abs\/1803.08475"},{"issue":"8","key":"1600_CR2","doi-asserted-by":"publisher","first-page":"3152","DOI":"10.1109\/TITS.2019.2929020","volume":"21","author":"M Veres","year":"2019","unstructured":"Veres M, Moussa M (2019) Deep learning for intelligent transportation systems: A survey of emerging trends. IEEE Trans Intell Trans Syst 21(8):3152\u20133168","journal-title":"IEEE Trans Intell Trans Syst"},{"key":"1600_CR3","unstructured":"Du Y, Fu T, Sun J, et al (2022) Molgensurvey: a systematic survey in machine learning models for molecule design. arXiv preprint http:\/\/arxiv.org\/abs\/2203.14500"},{"issue":"3","key":"1600_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TG.2019.2942773","volume":"12","author":"H Lloyd","year":"2019","unstructured":"Lloyd H, Amos M (2019) Solving Sudoku with ant colony optimization. IEEE Trans Games 12(3):302\u2013311","journal-title":"IEEE Trans Games"},{"issue":"5","key":"1600_CR5","doi-asserted-by":"publisher","first-page":"3973","DOI":"10.1007\/s40747-021-00635-z","volume":"8","author":"S Li","year":"2022","unstructured":"Li S, Luo T, Wang L et al (2022) Tourism route optimization based on improved knowledge ant colony algorithm. Complex Intell Syst 8(5):3973\u20133988","journal-title":"Complex Intell Syst"},{"key":"1600_CR6","volume-title":"An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems","author":"Keld Helsgaun","year":"2017","unstructured":"Helsgaun Keld (2017) An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde University, Roskilde"},{"key":"1600_CR7","unstructured":"Laurent Perron, Vincent Furnon (2023) Or-tools, URL https:\/\/developers.google.com\/optimization\/"},{"issue":"4","key":"1600_CR8","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/TEVC.2022.3197298","volume":"27","author":"W Yi","year":"2023","unstructured":"Yi W, Qu R, Jiao L et al (2023) Automated design of metaheuristics using reinforcement learning within a novel general search framework. IEEE Trans Evol Comput 27(4):1072\u20131084","journal-title":"IEEE Trans Evol Comput"},{"key":"1600_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119639","volume":"649","author":"W Yi","year":"2023","unstructured":"Yi W, Qu R (2023) Automated design of search algorithms based on reinforcement learning. Inform Sci 649:119639","journal-title":"Inform Sci"},{"issue":"2","key":"1600_CR10","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s40747-022-00884-6","volume":"9","author":"J Zhong","year":"2023","unstructured":"Zhong J, Feng Y, Tang S et al (2023) A collaborative neurodynamic optimization algorithm to traveling salesman problem. Complex Intell Syst 9(2):1809\u20131821","journal-title":"Complex Intell Syst"},{"key":"1600_CR11","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. In: 2015 Neural information processing systems (NIPS), pp 2692-2700"},{"issue":"3","key":"1600_CR12","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1007\/s40747-021-00288-y","volume":"7","author":"J Zheng","year":"2021","unstructured":"Zheng J, Wang L, Wang S et al (2021) Solving two-stage stochastic route-planning problem in milliseconds via end-to-end deep learning. Complex Intell Syst 7(3):1207\u20131222","journal-title":"Complex Intell Syst"},{"key":"1600_CR13","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2017) Neural combinatorial optimization with reinforcement learning. In: 2017 International conference on learning representations (ICLR). arXiv preprint http:\/\/arxiv.org\/abs\/1611.09940"},{"key":"1600_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams RJ (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8:229\u2013256","journal-title":"Mach Learn"},{"key":"1600_CR15","unstructured":"Gurobi Optimization, LLC (2023) Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com"},{"key":"1600_CR16","unstructured":"David A, Ribert B, Vasek C et al (2006) Concorde tsp solver. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/"},{"key":"1600_CR17","doi-asserted-by":"crossref","unstructured":"Deudon M, Cournut P, Lacoste A et al (2018) Learning heuristics for the tsp by policy gradient. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR). Springer, Netherlands, pp 170\u2013181","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"1600_CR18","first-page":"21188","volume":"33","author":"YD Kwon","year":"2020","unstructured":"Kwon YD, Choo J, Kim B et al (2020) Pomo: Policy optimization with multiple optima for reinforcement learning. Adv Neural Inform Process Syst 33:21188\u201321198","journal-title":"Adv Neural Inform Process Syst"},{"key":"1600_CR19","unstructured":"Cheng H, Zheng H, Cong Y et al (2023) Select and Optimize: Learning to aolve large-scale TSP instances. In: 26th International Conference on Artificial Intelligence and Statistics 206:1219-1231"},{"key":"1600_CR20","unstructured":"Luo F, Lin X, Liu F et al (2023) Neural combinatorial optimization with heavy decoder: Toward large scale generalization. arXiv preprint http:\/\/arxiv.org\/abs\/2310.07985"},{"key":"1600_CR21","first-page":"10418","volume":"34","author":"M Kim","year":"2021","unstructured":"Kim M, Park J (2021) Learning collaborative policies to solve NP-hard routing problems. Adv Neural Inform Process Syst 34:10418\u201310430","journal-title":"Adv Neural Inform Process Syst"},{"key":"1600_CR22","first-page":"5138","volume":"34","author":"YD Kwon","year":"2021","unstructured":"Kwon YD, Choo J, Yoon I et al (2021) Matrix encoding networks for neural combinatorial optimization. Adv Neural Inform Process Syst 34:5138\u20135149","journal-title":"Adv Neural Inform Process Syst"},{"key":"1600_CR23","doi-asserted-by":"crossref","unstructured":"Xin L, Song W, Cao Z et al (2020) Step-wise deep learning models for solving routing problems. IEEE Trans Ind Inform 17(7):4861\u20134871","DOI":"10.1109\/TII.2020.3031409"},{"issue":"13","key":"1600_CR24","first-page":"12042","volume":"35","author":"L Xin","year":"2021","unstructured":"Xin L, Song W, Cao Z et al (2021) Multi-decoder attention model with embedding glimpse for solving vehicle routing problems. Proc AAAI Conf Artificial Intell 35(13):12042\u201312049","journal-title":"Proc AAAI Conf Artificial Intell"},{"key":"1600_CR25","unstructured":"Chen X, Tian Y (2019) Learning to perform local rewriting for combinatorial optimization. 33rd Conference on Neural Information Processing Systems (NIPS). Vancouver, Canada, pp 6278\u20136289"},{"key":"1600_CR26","unstructured":"Gao L, Chen M, Chen Q et al (2020) Learn to design the heuristics for vehicle routing problem. arXiv preprint http:\/\/arxiv.org\/abs\/2002.08539"},{"key":"1600_CR27","unstructured":"Schulman J, Wolski F, Dhariwal P et al (2017). Proximal policy optimization algorithms. arXiv preprint http:\/\/arxiv.org\/abs\/1707.06347"},{"key":"1600_CR28","doi-asserted-by":"crossref","unstructured":"Meng W, Qu R (2023) Sequential Rule Mining for Automated Design of Meta-heuristics. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (GECCO). arXiv preprint https:\/\/doi.org\/10.1145\/3583133.3596303","DOI":"10.1145\/3583133.3596303"},{"key":"1600_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115493","volume":"185","author":"W Meng","year":"2021","unstructured":"Meng W, Qu R (2021) Automated design of search algorithms: Learning on algorithmic components. Expert Syst Appl 185:115493","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1600_CR30","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MCI.2020.2976182","volume":"15","author":"R Qu","year":"2020","unstructured":"Qu R, Kendall G, Pillay N (2020) The General Combinatorial Optimization Problem: Towards Automated Algorithm Design. IEEE Comput Intell Mag 15(2):14\u201323","journal-title":"IEEE Comput Intell Mag"},{"key":"1600_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119461","volume":"216","author":"W Yi","year":"2023","unstructured":"Yi W, Qu R, Jiao L (2023) Automated algorithm design using proximal policy optimisation with identified features. Expert Syst Appl 216:119461","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1600_CR32","doi-asserted-by":"publisher","first-page":"3135","DOI":"10.1007\/s40747-021-00507-6","volume":"7","author":"L Hong","year":"2021","unstructured":"Hong L, Woodward JR, \u00d6zcan E et al (2021) Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming. Complex Intell Syst 7(6):3135\u20133163","journal-title":"Complex Intell Syst"},{"key":"1600_CR33","unstructured":"Lu H, Zhang X, Yang S (2019) A learning-based iterative method for solving vehicle routing problems. In: 8th International conference on learning representations (ICLR)"},{"key":"1600_CR34","unstructured":"Kingma D P, Ba J et al (2014) Adam: A method for stochastic optimization. In: 3rd International conference on learning representations (ICLR) arXiv preprint http:\/\/arxiv.org\/abs\/1412.6980"},{"key":"1600_CR35","unstructured":"Chen X, Tian Y et al (2019) Learning to perform local rewriting for combinatorial optimization. In: 2019 Neural information processing systems (NIPS). arXiv preprint http:\/\/arxiv.org\/abs\/1810.00337"},{"key":"1600_CR36","unstructured":"Hottung A, Tierney K (2019) Neural large neighborhood search for the capacitated vehicle routing problem. In: 24th European Conference on Artificial Intelligence (ECAI).arXiv preprint http:\/\/arxiv.org\/abs\/1911.09539"},{"key":"1600_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115493","volume":"185","author":"W Meng","year":"2021","unstructured":"Meng W, Qu R (2021) Automated design of search algorithms: learning on algorithmic components. Expert Syst Appl 185:115493","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1600_CR38","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa E, Pecin D, Pessoa A et al (2017) New benchmark instances for the capacitated vehicle routing problem. Euro J Oper Res 257(3):845\u2013858","journal-title":"Euro J Oper Res"},{"key":"1600_CR39","unstructured":"Zhou C, Lin X, Wang Z, et al (2024) Instance-Conditioned Adaptation for Large-scale Generalization of Neural Combinatorial Optimization. arXiv preprint arXiv:2405.01906"},{"key":"1600_CR40","unstructured":"Liu F, Tong X, Yuan M, et al (2024) Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model. arXiv preprint arXiv:2401.02051V2"},{"issue":"4","key":"1600_CR41","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"Gerhard Reinelt","year":"1991","unstructured":"Reinelt Gerhard (1991) TSPLIB-a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01600-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01600-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01600-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T22:18:23Z","timestamp":1729117103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01600-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,17]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1600"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01600-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,17]]},"assertion":[{"value":"19 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}