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
Book ChapterDOI
Vehicle routing for food rescue programs: a comparison of different approaches
TL;DR: The 1-PDVRP arises in several practical contexts, ranging from bike-sharing programs in which bikes at each station need to be redistributed at various points in time, to food rescue Programs in which excess food is collected from restaurants and schools and redistributed through agencies to people in need.
Journal ArticleDOI
Delivering meals for multiple suppliers: Exclusive or sharing logistics service
TL;DR: Managerial analysis shows that two sharing services generally yield much less total costs than the exclusive service, and develops two mainstream heuristics, iterated local search and adaptive large neighborhood search.
Journal ArticleDOI
A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem
TL;DR: In this article, a set covering model is developed for the problem based on a novel route representation and a container-flow mapping, and a lower bound of the problem is also obtained by relaxing the time window constraints to the nearest shifts and transforming the problem into a service network design problem.
Journal ArticleDOI
Minimising average passenger waiting time in personal rapid transit systems
TL;DR: Three lower bounds on achievable mean passenger waiting time are developed, one based on queuing theory,One based on the static problem, in which it is assumed that perfect information is available, and onebased on a Markov Decision Process model, which suggests important economies of scale.
Journal ArticleDOI
Multi-trip pickup and delivery problem with time windows and synchronization
TL;DR: A tabu search algorithm integrating multiple neighborhoods targeted to the decision sets of the Multi-trip Pickup and Delivery Problem with Time Windows and Synchronization is proposed, which is competitive with existing exact and meta-heuristic methods for these two problems.
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.