Fetching the paper…
Reading the bibliography…
We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs).
An efficient implementation of local search algorithms for constrained routing problems
Martin WP Savelsbergh · 1990
Earlier work this paper cites.
A heuristic for the pickup and delivery traveling salesman problem
Jacques Renaud, Fayez F Boctor, and Jamal Ouenniche · 2000
Earlier work this paper cites.
Perturbation heuristics for the pickup and delivery traveling salesman problem
Jacques Renaud, Fayez F Boctor, and Gilbert Laporte · 2002
Earlier work this paper cites.
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
Francesco Carrabs, Jean-François Cordeau, and Gilbert Laporte · 2007
Earlier work this paper cites.
A survey on pickup and delivery problems
Sophie N Parragh, Karl F Doerner, and Richard F Hartl · 2008
Earlier work this paper cites.
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
Yongquan Li, Andrew Lim, Wee-Chong Oon, Hu Qin, and Dejian Tu · 2011
Earlier work this paper cites.
An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems
Keld Helsgaun · 2017
Earlier work this paper cites.
Attention is all you need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin · 2017
Earlier work this paper cites.
The pickup and delivery traveling salesman problem with handling costs
Marjolein Veenstra, Kees Jan Roodbergen, Iris FA Vis, and Leandro C Coelho · 2017
Earlier work this paper cites.
Attention, learn to solve routing problems!
Wouter Kool, Herke van Hoof, and Max Welling · 2018
Cited alongside, same era.
Reinforcement learning for solving the vehicle routing problem
Mohammadreza Nazari, Afshin Oroojlooy, Martin Takáč, and Lawrence V Snyder · 2018
Cited alongside, same era.
Learning to perform local rewriting for combinatorial optimization
Xinyun Chen and Yuandong Tian · 2019
Cited alongside, same era.
An efficient graph convolutional network technique for the travelling salesman problem
Chaitanya K Joshi, Thomas Laurent, and Xavier Bresson · 2019
Cited alongside, same era.
Neural large neighborhood search for the capacitated vehicle routing problem
André Hottung and Kevin Tierney · 2020
Cited alongside, same era.
Generalize a small pre-trained model to arbitrarily large TSP instances
Zhang-Hua Fu, Kai-Bin Qiu, and Hongyuan Zha · 2021
Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem
Jingwen Li, Yining Ma, Ruize Gao, Zhiguang Cao, Andrew Lim, Wen Song, and Jie Zhang · 2021
Later among the works it cites.
Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning
Jingwen Li, Liang Xin, Zhiguang Cao, Andrew Lim, Wen Song, and Jie Zhang · 2021
Later among the works it cites.
Learning to delegate for large-scale vehicle routing
Sirui Li, Zhongxia Yan, and Cathy Wu · 2021
Later among the works it cites.
A hierarchical reinforcement learning based optimization framework for large-scale dynamic pickup and delivery problems
Yi Ma, Xiaotian Hao, Jianye Hao, Jiawen Lu, Xing Liu, Tong Xialiang, Mingxuan Yuan, Zhigang Li, Jie Tang, and Zhaopeng Meng · 2021
Later among the works it cites.
Learning to iteratively solve routing problems with dual-aspect collaborative Transformer
Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, and Jing Tang · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning a latent search space for routing problems using variational autoencoders
André Hottung, Bhanu Bhandari, and Kevin Tierney · 2021
Cited alongside, same era.
Learning collaborative policies to solve NP-hard routing problems
Minsu Kim, Jinkyoo Park, and joungho kim · 2021
Cited alongside, same era.
Deep policy dynamic programming for vehicle routing problems
Wouter Kool, Herke van Hoof, Joaquim Gromicho, and Max Welling · 2021
Cited alongside, same era.
Learning improvement heuristics for solving routing problems
Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, and Andrew Lim · 2021
Later among the works it cites.
Domain generalization: A survey
Kaiyang Zhou, Ziwei Liu, Yu Qiao, Tao Xiang, and Chen Change Loy · 2021
Later among the works it cites.
Guidelines for the computational testing of machine learning approaches to vehicle routing problems
Luca Accorsi, Andrea Lodi, and Daniele Vigo · 2022
Closest in time.