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
Optimizing ridesharing services for airport access.
TL;DR: In this paper, the authors address the problem of optimally routing and scheduling airport shuttle vehicles that offer pickup and drop-off services to customers through ridesharing, which is a version of the dial-a-ride problem.
Proceedings ArticleDOI
Distributed Cooperative On-Demand Transportation
TL;DR: A novel approach introducing dynamic transfer nodes and a distributed decision process to redeploy transport objects and it can easily be extended to fit specific transportation scenarios or the passenger penetration rate.
Proceedings ArticleDOI
Multi-products Location-Routing Problem with Pickup and Delivery
TL;DR: In this article, an extended variant of LRP with multi-product and pickup and delivery (LRPMPPD) is considered, which deals with simultaneously selecting (locating) one or more facilities from a set of potential hub (locations), assigning customers to the selected hubs and defining routes of the vehicles for serving multiproduct customers demand.
Journal ArticleDOI
Reliability analysis of centralized versus decentralized zoning strategies for paratransit services
TL;DR: Simulation experiments showed that the decentralized strategy, compared to the centralized no-zoning strategy, substantially improves the reliability of paratransit in terms of on-time performance.
Journal ArticleDOI
A Savings-Based Heuristic for Solving the Omnichannel Vehicle Routing Problem with Pick-up and Delivery
TL;DR: This paper proposes a savings-based heuristic for solving large-size instances the VRP in omnichannel retailing and shows that the proposed heuristic is able to find feasible and competitive solutions in a very short computational time.
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.