An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints

Yiannis A. Koskosidis, Warren B. Powell and Marius M. Solomon
Additional contact information
Yiannis A. Koskosidis: The City College of CUNY, New York, New York, 10031
Warren B. Powell: Princeton University, Princeton, New Jersey 08544
Marius M. Solomon: College of Business Administration, Northeastern University, Boston, Massachusetts 02155

Transportation Science, 1992, vol. 26, issue 2, 69-85

Abstract: The Vehicle Routing and Scheduling Problem with Time Window constraints is formulated as a mixed integer program, and optimization-based heuristics which extend the cluster-first, route-second algorithm of Fisher and Jaikumar are developed for its solution. We present a new formulation based on the treatment of the time window constraints as soft constraints that can be violated at a cost and we heuristically decompose the problem into an assignment/clustering component and a series of routing and scheduling components. Numerical results based on randomly generated and benchmark problem sets indicate that the algorithm compares favorably to state-of-the-art local insertion and improvement heuristics.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (30)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.26.2.69 (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:26:y:1992:i:2:p:69-85

Access Statistics for this article

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