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
The Evolution of the Vehicle Routing Problem—A Survey of VRP Research and Practice from 2005 to 2022
TL;DR: In this paper , the authors identify 135 articles published in scholarly, academic journals from January 2005 to June 2022 that survey various aspects of the vehicle routing problem (VRP), ranging from exact and heuristic solution methods to new problem variants such as drone routing to new research areas such as green routing.
Proceedings ArticleDOI
Safe Management of Autonomous Vehicles
TL;DR: In this article , a Safe Shortest Path (SSPP) model is proposed for managing autonomous vehicles inside restricted areas for internal logistics purpose, which handles first tree search in a static context, and next through learning techniques in a dynamic context.
Journal ArticleDOI
Optimal Paths with Impact on a Constraint System: An Application to the 1-Request Insertion for the Pickup and Delivery Problem with Transfers
TL;DR: In this article , the authors deal with the pickup and delivery problem with transfers and focus on the way a new request can be inserted into a current solution, and present an empirical Dijkstra algorithm that computes tentative solutions whose consistence is then checked through constraint propagation.
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.