Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing

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, 411-435

Abstract: This is the second part of a two-part study treating the single vehicle many-to-many pickup and delivery problem with desired delivery times. Part I detailed the use of the single vehicle algorithm in a multivehicle context, presented a mathematical formulation of the problem, described the application of Benders' decomposition procedure to attack the problem through alternation between a routing, or sequencing, component and a scheduling component, and illustrated a noniterative optimal algorithm for the scheduling subproblem. This part focuses on the routing subproblem, presenting a heuristic algorithm for finding an initial route and a second heuristic algorithm for improving the route sequence. It then integrates the routing and scheduling algorithms, and describes the results of a number of computational experiments on actual data. An example of the complete routing and scheduling algorithm appears as an appendix.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.19.4.411 (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:411-435

Access Statistics for this article

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