Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

J. N. Hooker and N. R. Natraj
Additional contact information
J. N. Hooker: Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
N. R. Natraj: Carnegie Mellon University, Pittsburgh, Pennsylvania 15213

Transportation Science, 1995, vol. 29, issue 1, 30-44

Abstract: We modify the classical chain decomposition model for vehicle routing in order to formulate a very general class of vehicle routing and scheduling problems with time windows, in which vehicles may pick up loads while on the way to deliver others. We use the model as a framework for a tabu search heuristic that exploits the constraint structure these problems have in common while accommodating complex side constraints and objective functions. We test the heuristic computationally on several random problems and a problem supplied by the U.S. Military Airlift Command.

Date: 1995
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.29.1.30 (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:29:y:1995:i:1:p:30-44

Access Statistics for this article

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