Fetching the paper…
Reading the bibliography…
Recent studies in using deep learning to solve routing problems focus on construction heuristics, the solutions of which are still far from optimality.
1912
Earlier work this paper cites.
G. Laporte and Y. Nobert, “A branch and bound algorithm for the capacitated vehicle routing problem,” Operations-Research-Spektrum
1983
Earlier work this paper cites.
G. Reinelt, “Tsplib—a traveling salesman problem library,” ORSA journal on computing
1991
Earlier work this paper cites.
R. J. Williams, “Simple statistical gradient-following algorithms for connectionist reinforcement learning,” Machine learning
1992
Earlier work this paper cites.
J. Lysgaard, A. N. Letchford, and R. W. Eglese, “A new branch-and-cut algorithm for the capacitated vehicle routing problem,” Mathematical Programming
2004
Earlier work this paper cites.
N. Bansal, A. Blum, S. Chawla, and A. Meyerson, “Approximation algorithms for deadline-tsp and vehicle routing with time-windows,” in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
2004
Earlier work this paper cites.
Springer Science & Business Media, 2006
G. Gutin and A. P. Punnen, The traveling salesman problem and its variations · 2006
Earlier work this paper cites.
S. Ropke and D. Pisinger, “An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows,” Transportation science
2006
Earlier work this paper cites.
D. Applegate, R. Bixby, V. Chvatal, and W. Cook, “Concorde tsp solver,” URL http://www.math.uwaterloo.ca/tsp/concorde
2006
Earlier work this paper cites.
P. Hansen and N. Mladenović, “First vs. best improvement: An empirical study,” Discrete Applied Mathematics
2006
Earlier work this paper cites.
R. Hassin and A. Keinan, “Greedy heuristics with regret, with application to the cheapest insertion algorithm for the tsp,” Operations Research Letters
2008
Earlier work this paper cites.
K. Helsgaun, “General k-opt submoves for the lin–kernighan tsp heuristic,” Mathematical Programming Computation
2009
Earlier work this paper cites.
A. Das and C. Mathieu, “A quasi-polynomial time approximation scheme for euclidean capacitated vehicle routing,” in Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
2010
Earlier work this paper cites.
T. Pichpibul and R. Kawtummachai, “An improved clarke and wright savings algorithm for the capacitated vehicle routing problem,” ScienceAsia
2012
Earlier work this paper cites.
SIAM, 2014
P. Toth and D. Vigo, Vehicle routing: problems, methods, and applications · 2014
Cited alongside, same era.
O. Vinyals, M. Fortunato, and N. Jaitly, “Pointer networks,” in Proceedings of the 29th Conference on Neural Information Processing Systems (NIPS)
2015
Cited alongside, same era.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in Proceedings of the 32nd International Conference on Machine Learning (ICML)
2015
Cited alongside, same era.
D. Bahdanau, K. Cho, and Y. Bengio, “Neural machine translation by jointly learning to align and translate,” in Proceedings of the 3rh International Conference on Learning Representations (ICLR)
2015
Cited alongside, same era.
M.-T. Luong, H. Pham, and C. D. Manning, “Effective approaches to attention-based neural machine translation,” in Proceedings of the 2015 International Conference on Empirical Methods in Natural Language Processing (EMNLP)
E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, T. Vidal, and A. Subramanian, “New benchmark instances for the capacitated vehicle routing problem,” European Journal of Operational Research
2017
Later among the works it cites.
2018
Later among the works it cites.
M. Nazari, A. Oroojlooy, L. Snyder, and M. Takác, “Reinforcement learning for solving the vehicle routing problem,” in Proceedings of the 32nd Conference on Neural Information Processing Systems (NIPS)
2018
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
D. S. Lai, O. C. Demirag, and J. M. Leung, “A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph,” Transportation Research Part E: Logistics and Transportation Review
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition
2016
Cited alongside, same era.
V. Mnih, A. P. Badia, M. Mirza, A. Graves, T. Lillicrap, T. Harley, D. Silver, and K. Kavukcuoglu, “Asynchronous methods for deep reinforcement learning,” in Proceedings of the 33rd International Conference on Machine Learning (ICML)
2016
Cited alongside, same era.
T. D. Kulkarni, K. Narasimhan, A. Saeedi, and J. Tenenbaum, “Hierarchical deep reinforcement learning: Integrating temporal abstraction and intrinsic motivation,” in Advances in neural information processing systems
2016
Cited alongside, same era.
E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, “Learning combinatorial optimization algorithms over graphs,” in Proceedings of the 31st Conference on Neural Information Processing Systems (NIPS)
2017
Cited alongside, same era.
I. Bello and H. Pham, “Neural combinatorial optimization with reinforcement learning,” in Proceedings of the 5th International Conference on Learning Representations (ICLR)
2017
Cited alongside, same era.
K. Helsgaun, “An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems,” Roskilde: Roskilde University
2017
Cited alongside, same era.
M. Deudon, P. Cournut, A. Lacoste, Y. Adulyasak, and L.-M. Rousseau, “Learning heuristics for the tsp by policy gradient,” in Proceedings of the 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR)
2018
Later among the works it cites.
L. Wei, Z. Zhang, D. Zhang, and S. C. Leung, “A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints,” European Journal of Operational Research
2018
Later among the works it cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph Attention Networks,” in Proceedings of the 6th International Conference on Learning Representations (ICLR)
2018
Later among the works it cites.
F. Pardo, A. Tavakoli, V. Levdik, and P. Kormushev, “Time limits in reinforcement learning,” in Proceedings of the 35th International Conference on Machine Learning (ICML)
2018
Later among the works it cites.
Y. Keneshloo, T. Shi, N. Ramakrishnan, and C. K. Reddy, “Deep reinforcement learning for sequence-to-sequence models,” IEEE Transactions on Neural Networks and Learning Systems
2019
Closest in time.
W. Kool, H. van Hoof, and M. Welling, “Attention, learn to solve routing problems!,” in Proceedings of the 7th International Conference on Learning Representations (ICLR)
2019
Closest in time.
X. Chen and Y. Tian, “Learning to perform local rewriting for combinatorial optimization,” in Advances in Neural Information Processing Systems
2019
Closest in time.
B. Zhang, D. Xiong, J. Xie, and J. Su, “Neural machine translation with gru-gated attention model,” IEEE Transactions on Neural Networks and Learning Systems
2020
Closest in time.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE Transactions on Neural Networks and Learning Systems
2020
Closest in time.