Fetching the paper…
Reading the bibliography…
Traditional solvers for tackling combinatorial optimization (CO) problems are usually designed by human experts.
R. M. Karp, “Reducibility among combinatorial problems,” in Proceedings of a symposium on the Complexity of Computer Computations , 1972, pp. 85–103
1972
Earlier work this paper cites.
J. J. Hopfield and D. W. Tank, ““neural” computation of decisions in optimization problems,” Biol. Cybern. , vol. 52, no. 3, pp. 141–152, 1985
1985
Earlier work this paper cites.
X. Yao, “Simulated annealing with extended neighbourhood,” Int. J. Comput. Math. , vol. 40, no. 3-4, pp. 169–189, 1991
1991
Earlier work this paper cites.
G. Reinelt, “Tsplib—a traveling salesman problem library,” ORSA J. Com. , vol. 3, no. 4, pp. 376–384, 1991
1991
Earlier work this paper cites.
P. Shaw, “A new local search algorithm providing high quality solutions to vehicle routing problems,” APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK , vol. 46, 1997
1997
Earlier work this paper cites.
K. A. Smith, “Neural networks for combinatorial optimization: a review of more than a decade of research,” INFORMS J. Comput. , vol. 11, no. 1, pp. 15–34, 1999
1999
Earlier work this paper cites.
K. Helsgaun, “An effective implementation of the lin–kernighan traveling salesman heuristic,” Eur. J. Oper. Res. , vol. 126, no. 1, pp. 106–130, 2000
2000
Earlier work this paper cites.
——, “A hybrid hopfield network-genetic algorithm approach for the terminal assignment problem,” IEEE Trans. Syst. Man Cybern. Syst., Part B , vol. 34, no. 6, pp. 2343–2353, 2004
2004
Earlier work this paper cites.
J. Puchinger and G. R. Raidl, “Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification,” in Proceedings of IWINAC , 2005, pp. 41–53
2005
Earlier work this paper cites.
G. Gutin and A. P. Punnen, The traveling salesman problem and its variations . Springer Science & Business Media, 2006
2006
Earlier work this paper cites.
D. Applegate, R. Bixby, V. Chvatal, and W. Cook, “Concorde tsp solver,” 2006
2006
Earlier work this paper cites.
S. Salcedo-Sanz and X. Yao, “Assignment of cells to switches in a cellular mobile network using a hybrid hopfield network-genetic algorithm approach,” Appl. Soft Comput. , vol. 8, no. 1, pp. 216–224, 2008
2008
Earlier work this paper cites.
——, “General k -opt submoves for the lin-kernighan TSP heuristic,” Math. Program. Comput. , vol. 1, no. 2-3, pp. 119–163, 2009
2009
Earlier work this paper cites.
C. Ansótegui, M. Sellmann, and K. Tierney, “A gender-based genetic algorithm for the automatic configuration of algorithms,” in Proceedings of CP , 2009, pp. 142–157
2009
Earlier work this paper cites.
K. Tang, Y. Mei, and X. Yao, “Memetic algorithm with extended neighborhood search for capacitated arc routing problems,” IEEE Trans. Evol. , vol. 13, no. 5, pp. 1151–1166, 2009
2009
Earlier work this paper cites.
X. Xie and J. Liu, “Multiagent optimization system for solving the traveling salesman problem (TSP),” IEEE Trans. Syst. Man Cybern. Part B , vol. 39, no. 2, pp. 489–502, 2009
2009
Earlier work this paper cites.
C. H. Reilly, “Synthetic optimization problem generation: Show us the correlations!” INFORMS J. Comput. , vol. 21, no. 3, pp. 458–467, 2009
2009
Earlier work this paper cites.
B. H. Korte, J. Vygen, B. Korte, and J. Vygen, Combinatorial optimization . Springer, 2011
2011
Earlier work this paper cites.
F. Hutter, H. H. Hoos, and K. Leyton-Brown, “Sequential model-based optimization for general algorithm configuration,” in International conference on learning and intelligent optimization . Springer, 2011, pp. 507–523
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Proceedings of NeurIPS , 2012, pp. 1106–1114
2012
Earlier work this paper cites.
Y. Nagata and S. Kobayashi, “A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem,” INFORMS J. Comput. , vol. 25, no. 2, pp. 346–363, 2013
2013
Earlier work this paper cites.
D. Bahdanau, K. Cho, and Y. Bengio, “Neural machine translation by jointly learning to align and translate,” in Proceedings of ICLR , 2015
2015
Cited alongside, same era.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” Proceedings of NeurIPS , pp. 2692–2700, 2015
2015
Cited alongside, same era.
J. Bossek, “netgen: Network generator for combinatorial graph problems,” 2015
2015
Cited alongside, same era.
K. Smith-Miles and S. Bowly, “Generating new test instances by evolving in instance space,” Comput. Oper. Res. , vol. 63, pp. 102–113, 2015
2015
Cited alongside, same era.
Y. Nagata, “Population diversity measures based on variable-order markov models for the traveling salesman problem,” in Proceedings of PPSN , 2016, pp. 973–983
2016
Cited alongside, same era.
B. Peng, J. Wang, and Z. Zhang, “A deep reinforcement learning algorithm using dynamic attention model for vehicle routing problems,” in Proceedings of ISICA , 2019, pp. 636–650
2019
Later among the works it cites.
2019
Later among the works it cites.
H. Lu, X. Zhang, and S. Yang, “A learning-based iterative method for solving vehicle routing problems,” in Proceedings of ICLR , 2019
2019
Later among the works it cites.
A. Hottung and K. Tierney, “Neural large neighborhood search for the capacitated vehicle routing problem,” in Proceedings of ECAI , 2019, pp. 443–450
2019
Later among the works it cites.
Y. Kwon, J. Choo, B. Kim, I. Yoon, Y. Gwon, and S. Min, “POMO: policy optimization with multiple optima for reinforcement learning,” in Proceedings of NeurIPS , 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. López-Ibáñez, J. Dubois-Lacoste, L. P. Cáceres, M. Birattari, and T. Stützle, “The irace package: Iterated racing for automatic algorithm configuration,” Operations Research Perspectives , vol. 3, pp. 43–58, 2016
2016
Cited alongside, same era.
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,” Nat. , vol. 550, no. 7676, pp. 354–359, 2017
2017
Cited alongside, same era.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” in Workshop Track Proceedings of ICLR , 2017
2017
Cited alongside, same era.
I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural combinatorial optimization with reinforcement learning,” in Proceedings of ICLR , 2017
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Proceedings of NeurIPS , pp. 5998–6008, 2017
2017
Cited alongside, same era.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” Proceedings of NeurIPS , 2017
2017
Cited alongside, same era.
K. Tang, J. Wang, X. Li, and X. Yao, “A scalable approach to capacitated arc routing problems based on hierarchical decomposition,” IEEE Trans. Cybern. , vol. 47, no. 11, pp. 3928–3940, 2017
2017
Cited alongside, same era.
2020
Later among the works it cites.
L. Xin, W. Song, Z. Cao, and J. Zhang, “Step-wise deep learning models for solving routing problems,” IEEE Trans. Industr. Inform. , vol. 17, no. 7, pp. 4861–4871, 2020
2020
Later among the works it cites.
K. Li, T. Zhang, and R. Wang, “Deep reinforcement learning for multiobjective optimization,” IEEE Trans. Cybern. , vol. 51, no. 6, pp. 3103–3114, 2020
2020
Later among the works it cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE Trans. Neural Netw. Learn. Syst. , vol. 32, no. 1, pp. 4–24, 2020
2020
Later among the works it cites.
P. R. d. O. da Costa, J. Rhuggenaath, Y. Zhang, and A. Akcay, “Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning,” in Proceedings ACML , 2020, pp. 465–480
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
Y. Bengio, A. Lodi, and A. Prouvost, “Machine learning for combinatorial optimization: A methodological tour d’horizon,” Eur. J. Oper. Res. , vol. 290, no. 2, pp. 405–421, 2021
2021
Later among the works it cites.
Y. Kwon, J. Choo, I. Yoon, M. Park, D. Park, and Y. Gwon, “Matrix encoding networks for neural combinatorial optimization,” in NeurIPS , 2021, pp. 5138–5149
2021
Later among the works it cites.
Y. Ma, J. Li, Z. Cao, W. Song, L. Zhang, Z. Chen, and J. Tang, “Learning to iteratively solve routing problems with dual-aspect collaborative transformer,” in Proceedings of NeurIPS , vol. 34, 2021, pp. 11 096–11 107
2021
Later among the works it cites.
N. Mazyavkina, S. Sviridov, S. Ivanov, and E. Burnaev, “Reinforcement learning for combinatorial optimization: A survey,” Comput. Oper. Res. , vol. 134, p. 105400, 2021
2021
Later among the works it cites.
Y. Wu, W. Song, Z. Cao, J. Zhang, and A. Lim, “Learning improvement heuristics for solving routing problems.” IEEE Trans. Neural Netw. Learn. Syst. , vol. 33, no. 9, pp. 5057–5069, 2021
2021
Later among the works it cites.
L. Xin, W. Song, Z. Cao, and J. Zhang, “Neurolkh: Combining deep learning model with lin-kernighan-helsgaun heuristic for solving the traveling salesman problem,” Proceedings of NeurIPS , pp. 7472–7483, 2021
2021
Later among the works it cites.
J. Zheng, K. He, J. Zhou, Y. Jin, and C.-M. Li, “Combining reinforcement learning with lin-kernighan-helsgaun algorithm for the traveling salesman problem,” in Proceedings AAAI , 2021, pp. 12 445–12 452
2021
Later among the works it cites.
K. Tang, S. Liu, P. Yang, and X. Yao, “Few-shots parallel algorithm portfolio construction via co-evolution,” IEEE Trans. Evol. Comput. , vol. 25, no. 3, pp. 595–607, 2021
2021
Later among the works it cites.
L. Accorsi, A. Lodi, and D. Vigo, “Guidelines for the computational testing of machine learning approaches to vehicle routing problems,” Oper. Res. Lett. , vol. 50, no. 2, pp. 229–234, 2022
2022
Closest in time.
S. Liu, K. Tang, and X. Yao, “Generative adversarial construction of parallel portfolios,” IEEE Trans. Cybern. , vol. 52, no. 2, pp. 784–795, 2022
2022
Closest in time.