Journal ArticleDOI
Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
Thomas R. Sexton,Lawrence Bodin +1 more
TLDR
A heuristic routing and scheduling algorithm is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithers-burg, Maryland, and Baltimore, Maryland.Abstract:
A set of n customers is given. Each customer has a desired point of pickup, a desired point of delivery and a desired time of delivery. The problem is to determine the order of pickup and delivery and the times of pickup and delivery of these n customers by a single vehicle in order to minimize total customer inconvenience. Here, a mathematical programming formulating of this problem is subjected to Benders' decomposition procedure. The result is a heuristic routing and scheduling algorithm which is shown to produce high quality solutions in reasonable computation time by testing on moderately sized real data bases from both Gaithers-burg, Maryland, and Baltimore, Maryland. This study is divided into two parts, the first detailing the scheduling analysis and the second focusing on the routing component.read more
Citations
More filters
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Journal ArticleDOI
The General Pickup and Delivery Problem
TL;DR: Several characteristics that distinguish pickup and delivery problems from standard vehicle routing problems are discussed and a survey of the problem types and solution methods found in the literature is presented.
Journal ArticleDOI
The dial-a-ride problem: models and algorithms
TL;DR: The Dial-a-Ride Problem (DARP) as mentioned in this paper is a well-known problem in the field of vehicle scheduling for door-to-door transportation for elderly or disabled people.
Journal ArticleDOI
A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations
TL;DR: Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.
Journal ArticleDOI
Static pickup and delivery problems: a classification scheme and survey
TL;DR: 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.
References
More filters
Book
Graph theory with applications
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Journal ArticleDOI
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Journal ArticleDOI
Partitioning procedures for solving mixed-variables programming problems
TL;DR: In this article, the 8th International Meeting of the Institute of Management Sciences, Brussels, August 23-26, 1961, the authors presented a paper entitled "The International Journal of Management Science and Management Sciences".
Journal ArticleDOI
An Algorithm for the Vehicle-dispatching Problem
Nicos Christofides,Samuel Eilon +1 more
TL;DR: The vehicle-scheduling problem involves the design of several vehicle tours to meet a given set of requirements for customers with known locations, subject to a capacity constraint for the vehicles and a distance constraint for vehicles.
Journal ArticleDOI
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
TL;DR: An investigation of the single-vehicle, many-to-many, immediate-request dial-a-ride problem is developed, with a Dynamic Programming approach which exhibits a computational effort which is asymptotically lower than the corresponding effort of the classical Dynamic Programming algorithm applied to a Traveling Salesman Problem of the same size.