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
Development and optimization of a horizontal carrier collaboration vehicle routing model with multi-commodity request allocation
TL;DR: A Mixed Integer Programming (MIP) model to maximize the total profit and the fair sharing of profit among the carriers by considering the travel time minimization is developed and a Genetic Algorithm (GA) is proposed to solve this problem due to its Non-deterministic Polynomial-time hard (NP-hard) nature.
Journal ArticleDOI
A heuristic method for the vehicle routing problem with mixed deliveries and pickups
TL;DR: A metaheuristic based on reactive tabu search is implemented that suggests that this approach to the vehicle routing problem with deliveries and pickups can yield good results.
Journal ArticleDOI
Improving the efficiency of demand-responsive paratransit services
TL;DR: In this article, the authors proposed two approaches for improving the efficiency of paratransit operations and estimates the benefit of using these approaches via experiments that utilize Metro Mobility data, and evaluated the benefit to state agencies of selectively using non-dedicated service providers such as taxis.
Book ChapterDOI
Dynamic pickup and delivery with transfers
TL;DR: This work proposes a novel solution to the dynamic Pickup and Delivery Problem with Transfers based on a graph-based formulation of the problem that treats each request independently and shows that efficient Bellman-Ford or Dijkstra-like algorithms cannot be applied.
Journal ArticleDOI
The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems
TL;DR: The results show that using all valid inequalities improves the solution time of the pure proposed model, and the proposed heuristic works efficiently in finding good-quality solutions for the proposed hub location-routing model.
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.