Fetching the paper…
Reading the bibliography…
The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications.
R. Bellman, “Dynamic programming treatment of the travelling salesman problem,” Journal of the ACM , vol. 9, pp. 61–63, 1962
1962
Earlier work this paper cites.
M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness . W. H. Freeman & Co., 1990
1990
Earlier work this paper cites.
M. Padberg and G. Rinaldi, “A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems,” SIAM Review , vol. 33, pp. 60–100, 1991
1991
Earlier work this paper cites.
R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,” Machine Learning , vol. 8, pp. 229–256, 1992
1992
Earlier work this paper cites.
D. S. Hochba, “Approximation algorithms for np-hard problems,” SIGACT News , vol. 28, p. 40–52, 1997
1997
Earlier work this paper cites.
M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan, “Algorithms for facility location problems with outliers,” in Proceedings of Annual ACM-SIAM Symposium on Discrete Algorithms , 2001, p. 642–651
2001
Earlier work this paper cites.
D. Applegate, R. Bixby, V. Chvátal, and W. Cook, “Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems,” Mathematical Programming , vol. 97, pp. 91–153, 2003
2003
Earlier work this paper cites.
M. Christiansen, K. Fagerholt, and D. Ronen, “Ship routing and scheduling: Status and perspectives,” Transportation Science , vol. 38, pp. 1–18, 2004
2004
Earlier work this paper cites.
D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study . Princeton University Press, 2007
2007
Earlier work this paper cites.
K. Helsgaun, “General k-opt submoves for the Lin-Kernighan TSP heuristic,” Mathematical Programming Computation , pp. 119–163, 2009
2009
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in Proceedings of International Conference on Learning Representations , 2014
2014
Earlier work this paper cites.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” in Proceedings of Advances in Neural Information Processing Systems , 2015, pp. 2692–2700
2015
Earlier work this paper cites.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in Proceedings of International Conference on Machine Learning , 2015, pp. 448–456
2015
Earlier work this paper cites.
S. J. Rennie, E. Marcheret, Y. Mroueh, J. Ross, and V. Goel, “Self-critical sequence training for image captioning,” in Proceedings of IEEE Conference on Computer Vision and Pattern Recognition , 2017, pp. 7008–7024
2017
Earlier work this paper cites.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” in Proceedings of International Conference on Learning Representations Workshop , 2017
2017
Earlier work this paper cites.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” in Proceedings of Advances in Neural Information Processing Systems , 2017, pp. 6351–6361
2017
Earlier work this paper cites.
K. Helsgaun, “An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems,” Roskilde: Roskilde University , pp. 24–50, 2017
2017
Earlier work this paper cites.
H. Wang, N. Zhang, and J.-C. Créput, “A massively parallel neural network approach to large-scale euclidean traveling salesman problems,” Neurocomputing , vol. 240, pp. 137–151, 2017
2017
Earlier work this paper cites.
D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. baker, M. Lai, A. Bolton, Y. Chen, T. P. Lillicrap, F. Hui, L. Sifre, G. van den Driessche, T. Graepel, and D. Hassabis, “Mastering the game of go without human knowledge,” Nature , vol. 550, pp. 354–359, 2017
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in Proceedings of Advances in Neural Information Processing Systems , 2017, pp. 6000–6010
2017
Earlier work this paper cites.
P. Koehn and R. Knowles, “Six challenges for neural machine translation,” in Proceedings of Association for Computational Linguistics Workshop , 2017, pp. 28–39
2017
Earlier work this paper cites.
A. Nowak, D. Folqué, and J. Bruna, “Divide and conquer networks,” in Proceedings of International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
M. Deudon, P. Cournut, A. Lacoste, Y. Adulyasak, and L. M. Rousseau, “Learning heuristics for the TSP by policy gradient,” in Proceedings of Integration of Constraint Programming, Artificial Intelligence, and Operations Research , 2018, pp. 170–181
2018
Cited alongside, same era.
J. Faigl, “GSOA: Growing self-organizing array - unsupervised learning for the close-enough traveling salesman problem and other routing problems,” Neurocomputing , vol. 312, pp. 120–134, 2018
2018
Cited alongside, same era.
J. Faigl and G. A. Hollinger, “Autonomous data collection using a self-organizing map,” IEEE Transactions on Neural Networks and Learning Systems , vol. 29, no. 5, pp. 1703–1715, 2018
2018
Cited alongside, same era.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in Proceedings of International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
W. Deng, L. Zhang, X. Zhou, Y. Zhou, Y. Sun, W. Zhu, H. Chen, W. Deng, H. Chen, and H. Zhao, “Multi-strategy particle swarm and ant colony hybrid optimization for airport taxiway planning problem,” Information Sciences , vol. 612, pp. 576–593, 2022
2022
Later among the works it cites.
J. Deckerová, J. Faigl, and V. Krátký, “Traveling salesman problem with neighborhoods on a sphere in reflectance transformation imaging scenarios,” Expert Systems with Applications , vol. 198, p. 116814, 2022
2022
Later among the works it cites.
Z. Zhang, Z. Wu, H. Zhang, and J. Wang, “Meta-learning-based deep reinforcement learning for multiobjective optimization problems,” IEEE Transactions on Neural Networks and Learning Systems , vol. 34, no. 10, pp. 7978–7991, 2023
2023
Closest in time.
Y. Shao, J. C. Lin, G. Srivastava, D. Guo, H. Zhang, H. Yi, and A. Jolfaei, “Multi-objective neural evolutionary algorithm for combinatorial optimization problems,” IEEE Transactions on Neural Networks and Learning Systems , vol. 34, pp. 2133–2143, 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. K. Joshi, T. Laurent, and X. Bresson, “An efficient graph convolutional network technique for the travelling salesman problem,” in Proceedings of INFORMS Annual Meeting, Session on Boosting Combinatorial Optimization using Machine Learning , 2019
2019
Cited alongside, same era.
W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!” in Proceedings of International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
W. Yang, D. Wang, W. Pang, A.-H. Tan, and Y. Zhou, “Goods consumed during transit in split delivery vehicle routing problems: Modeling and solution,” IEEE Access , vol. 8, pp. 110 336–110 350, 2020
2020
Cited alongside, same era.
Y. Xiao, Z. Xiao, X. Feng, Z. Chen, L. Kuang, and L. Wang, “A novel computational model for predicting potential lncRNA-disease associations based on both direct and indirect features of lncRNA-disease pairs,” BMC Bioinformatics , vol. 21, pp. 1–22, 2020
2020
Cited alongside, same era.
Q. Ma, S. Ge, D. He, D. Thaker, and I. Drori, “Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning,” in Proceedings of AAAI Workshop on Deep Learning on Graphs: Methodologies and Applications , 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
Y. Bengio, A. Lodi, and A. Prouvost, “Machine learning for combinatorial optimization: a methodological tour d’horizon,” European Journal of Operational Research , vol. 290, pp. 405–421, 2021
2021
Cited alongside, same era.
2021
Cited alongside, same era.
2023
Closest in time.
Z. Zhang, H. Liu, M. Zhou, and J. Wang, “Solving dynamic traveling salesman problems with deep reinforcement learning,” IEEE Transactions on Neural Networks and Learning Systems , vol. 34, pp. 2119–2132, 2023
2023
Closest in time.
H. Gao, X. Zhou, X. Xu, Y. Lan, and Y. Xiao, “AMARL: An attention-based multiagent reinforcement learning approach to the min-max multiple traveling salesmen problem,” IEEE Transactions on Neural Networks and Learning Systems , pp. 1–15, 2023
2023
Closest in time.
P. Sankaran, K. McConky, M. Sudit, and H. Ortiz-Peña, “GAMMA: Graph attention model for multiple agents to solve team orienteering problem with multiple depots,” IEEE Transactions on Neural Networks and Learning Systems , vol. 34, pp. 9412–9423, 2023
2023
Closest in time.
2023
Closest in time.
H. Yang, M. Zhao, L. Yuan, Y. Yu, Z. Li, and M. Gu, “Memory-efficient transformer-based network model for traveling salesman problem,” Neural Networks , vol. 161, pp. 589–597, 2023
2023
Closest in time.
J. Zhou, Y. Wu, Z. Cao, W. Song, J. Zhang, and Z. Chen, “Learning large neighborhood search for vehicle routing in airport ground handling,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, pp. 9769–9782, 2023
2023
Closest in time.
J. Li, Y. Ma, Z. Cao, Y. Wu, W. Song, J. Zhang, and Y. M. Chee, “Learning feature embedding refiner for solving vehicle routing problems,” IEEE Transactions on Neural Networks and Learning Systems , pp. 1–13, 2023
2023
Closest in time.
A. I. Garmendia, J. Ceberio, and A. Mendiburu, “Neural improvement heuristics for graph combinatorial optimization problems,” IEEE Transactions on Neural Networks and Learning Systems , pp. 1–13, 2023
2023
Closest in time.
H. Ye, J. Wang, Z. Cao, H. Liang, and Y. Li, “DeepACO: Neural-enhanced ant systems for combinatorial optimization,” in Advances in Neural Information Processing Systems , vol. 36, 2023, pp. 43 706–43 728
2023
Closest in time.
Y. Ma, Z. Cao, and Y. M. Chee, “Learning to search feasible and infeasible regions of routing problems with flexible neural k-opt,” in Advances in Neural Information Processing Systems , vol. 36, 2023, pp. 49 555–49 578
2023
Closest in time.
C. Wang, Z. Yu, S. McAleer, T. Yu, and Y. Yang, “ASP: Learn a universal neural solver!” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 46, pp. 4102–4114, 2024
2024
Closest in time.
2024
Closest in time.
G. Fellek, A. Farid, S. Fujimura, O. Yoshie, and G. Gebreyesus, “G-dganet: Gated deep graph attention network with reinforcement learning for solving traveling salesman problem,” Neurocomputing , vol. 579, p. 127392, 2024
2024
Closest in time.
S. Liu, X. Yan, and Y. Jin, “An edge-aware graph autoencoder trained on scale-imbalanced data for traveling salesman problems,” Knowledge-Based Systems , vol. 291, p. 111559, 2024
2024
Closest in time.
Y. Xiao, D. Wang, B. Li, M. Wang, X. Wu, C. Zhou, and Y. Zhou, “Distilling autoregressive models to obtain high-performance non-autoregressive solvers for vehicle routing problems with faster inference speed,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 38, no. 18, 2024, pp. 20 274–20 283
2024
Closest in time.
C. Wang, Z. Cao, Y. Wu, L. Teng, and G. Wu, “Deep reinforcement learning for solving vehicle routing problems with backhauls,” IEEE Transactions on Neural Networks and Learning Systems , pp. 1–15, 2024
2024
Closest in time.