Journal ArticleDOI
Static pickup and delivery problems: a classification scheme and survey
TLDR
A general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems, is introduced.Abstract:
Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.read more
Citations
More filters
Journal ArticleDOI
A traveling salesman problem with pickups and deliveries, time windows and draft limits
Mari Jevne Arnesen,Magnhild Gjestvang,Xin Wang,Kjetil Fagerholt,Kristian Thun,Jørgen Glomvik Rakke +5 more
TL;DR: Computational studies show that the label extension rules are essential to the DP-algorithm, and the proposed solution method is able to solve real-sized in-port routing and scheduling problems in chemical shipping efficiently.
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
Marilène Cherkesly,Marilène Cherkesly,Guy Desaulniers,Guy Desaulniers,Stefan Irnich,Gilbert Laporte +5 more
TL;DR: Computational results obtained on instances derived from benchmark instances for the pickup and delivery traveling salesman problem with multiple stacks are reported, and the advantage of incorporating the multi-stack policy in the pricing problem is revealed.
Journal ArticleDOI
The multi-commodity pickup-and-delivery traveling salesman problem
TL;DR: A mixed integer linear programming model for the m‐PDTSP is introduced, a classical decomposition technique is discussed, valid inequalities are described to strengthen the linear programming relaxation of the model, and detail separation procedures to develop a branch‐and‐cut procedure are described.
Journal ArticleDOI
The multiple vehicle pickup and delivery problem with LIFO constraints
TL;DR: This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit and proposes two mixed integer formulations and a heuristic procedure that uses tabu search in a multi-start framework.
Journal Article
Solving vehicle routing problem with simultaneous pickup and delivery using parallel simulated annealing algorithm
TL;DR: Computational results indicate that the proposed parallel-SA algorithm is competitive with other well-known algorithms for VRPSPD from both quality of solution and computational time.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Self-organized formation of topologically correct feature maps
TL;DR: In this paper, the authors describe a self-organizing system in which the signal representations are automatically mapped onto a set of output responses in such a way that the responses acquire the same topological order as that of the primary events.