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
Trends in global E-food supply chain and implications for transport: literature review and research directions
TL;DR: In this article, the authors identify the key characteristics of the food supply chain and review the literature and discuss a few trends that will lead the future of food transport and list a number of relevant and challenging research areas.
Journal ArticleDOI
Load-dependent and precedence-based models for pickup and delivery problems
TL;DR: The one-to-one multi-commodity pickup and delivery traveling salesman problem (m-PDTSP) is addressed which is a generalization of the TSP and arises in several transportation and logistics applications and several models based on this equivalence are presented.
Journal ArticleDOI
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: In this paper, a branch-price-and-cut algorithm was proposed for the pickup and delivery vehicle routing problem with time windows and multiple stacks, where each stack is rearloaded and operated in a last-in-first-out (LIFO) fashion, meaning that an item can only be delivered if it is in that position.
Journal ArticleDOI
A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
TL;DR: The main objective of this communication is to show how realistic-sized instances of the Pickup and Delivery Problem with Transfers (PDPT) can be solved to optimality with a branch- and-cut-and-price method, under realistic hypotheses.
Journal ArticleDOI
The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach
TL;DR: An arc-based mixed-integer formulation for the design of routes for a fleet of vehicles serving customer requests is presented and a branch-and-cut algorithm for solving it is proposed.
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.