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 truck scheduling problem arising in intermodal container transportation
Jenny Nossack,Erwin Pesch +1 more
TL;DR: This work addresses a truck scheduling problem that arises in intermodal container transportation, where containers need to be transported between customers (shippers or receivers) and container terminals (rail or maritime) and vice versa, by solving the problem by a 2-stage heuristic solution approach.
Journal IssueDOI
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
TL;DR: Comparison shows that the proposed two-phase solution procedure for the dial-a-ride problem with two objectives is able to generate high-quality approximations of the true Pareto frontier.
Journal ArticleDOI
Equilibrium network design of shared-vehicle systems
Rahul Nair,Elise Miller-Hooks +1 more
TL;DR: An equilibrium network design model is formulated to determine the optimal configuration of a vehicle sharing program (VSP), which involves a fleet of vehicles positioned strategically across a network.
Journal ArticleDOI
Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
TL;DR: A dynamic version of the SCP, whereby pickup and delivery requests arrive according to a Poisson process, is studied, which serves as a model for large-scale demand-responsive transport (DRT) systems and exhibits novel features that are absent in traditional spatially-distributed queueing systems.
Journal ArticleDOI
The Bike sharing Rebalancing Problem with Stochastic Demands
TL;DR: This paper develops stochastic programming models that are solved using different approaches, in particular, the L-Shaped and branch-and-cut, and proposes heuristic algorithms based on an innovative use of positive and negative correlations among stations’ stochastically demands.
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.