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
The Backhaul Profit Maximization Problem: Optimization Models and Solution Procedures
TL;DR: In this article , a compact mixed integer program (MIP) is proposed for the backhaul profit maximization problem, in which a freight carrier seeks to generate profit from an empty delivery vehicle's backhaul trip from its last scheduled delivery to its depot by allowing it to deviate from the least expensive (or fastest) route to accept pickup-and-delivery requests between various points on the route as allowed by its capacity and required return time.
Two-Commodity Network Flow Formulations for Vehicle Routing Problems with Simultaneous Pickup & Delivery and a Many-to-Many Structure
TL;DR: In this article, the authors present a model for vehicle routing problems with pickup and delivery in distribution and logistics, where the objective is to generate an optimal route plan ensuring that the demand for heterogeneous commodities can be satisfied by an arbitrary set of suppliers.
Book ChapterDOI
A Freight Adviser for a Delivery Logistics Service e-Marketplace
TL;DR: A Vehicle Routing Problem in which a subset of mandatory customers has to be visited by the vehicle, while the goal consists of maximizing the net revenue with respect to the routing cost to serve the set of mandatory Customers.
Algorithms for routing vehicles and their application to the paratransit vehicle scheduling problem.
TL;DR: Key tasks in accomplishing this objective are efficiently allocating vehicles to service trips and adjusting the schedules of vehicles dynamically in response to calls received by the service providers from the customers on the day of the service.
Journal ArticleDOI
Nature-Inspired Optimal Route Network Design for Shared Autonomous Vehicles
TL;DR: In this paper , an ant colony optimization algorithm is applied to the problem in order to construct a set of routes that satisfy user requests under operational constraints, while exploiting the possibility of ride sharing to reduce operating costs.
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.