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
Reference EntryDOI
Demand Responsive Transportation
TL;DR: Modeling aspects and solution methods for static and dynamic variants of the dial-a-ride problem are reviewed and discussed.
Journal ArticleDOI
A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem
TL;DR: Four branch- and-cut-and-price algorithms for the Synchronized Pickup and Delivery Problem based on column-generation formulations that use different subproblems are developed and it is indicated that integrating either both types of ride-time constraints or only the maximum ride- time constraints into the subproblem results in the strongest overall approach.
Journal ArticleDOI
The value of information in auction-based carrier collaborations
TL;DR: In this paper, the authors assess the benefit of sharing information in auction-based carrier collaborations where carriers seek to exchange transportation requests in order to decrease vehicle mileage and increase vehicle utilization.
Sampling for Personal Rapid Transit Empty Vehicle Redistribution
R. E. Wilson,John D. Lees-Miller +1 more
TL;DR: A new algorithm for the empty vehicle redistribution (EVR) problem called Sampling and Voting (SV), which produces significantly lower passenger waiting times than existing EVR algorithms.
Journal ArticleDOI
A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
José Brandão,José Brandão +1 more
TL;DR: This paper describes a new deterministic iterated local search algorithm, which is tested using a large number of benchmark problems chosen from the literature and proven that this algorithm competes with the best known algorithms in terms of the quality of the solutions and at the same time, it is simpler and faster.
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.