Neural re-insertion improvement algorithm for large-scale TSP

DOI10.1007/S40305-025-00669-XMaRDI QIDQ7355253zbMATH OpenFDO

Authors Wenzhao Liu, Congying Han, Tiande Guo

Publication date 22 September 2026

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-025-00669-X

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Research data for problems pertaining to operations research and mathematical programming (90-11)

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving Combinatorial Problems with Machine Learning Methods
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: Neural re-insertion improvement algorithm for large-scale TSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355253)