Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling

Thomas R. Sexton and Lawrence D. Bodin
Additional contact information
Thomas R. Sexton: State University of New York, Stony Brook, New York
Lawrence D. Bodin: University of Maryland, College Park, Maryland

Transportation Science, 1985, vol. 19, issue 4, 378-410

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.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (29)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.4.378 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:19:y:1985:i:4:p:378-410

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().