Survey Paper---Time Window Constrained Routing and Scheduling Problems

Marius M. Solomon and Jacques Desrosiers
Additional contact information
Marius M. Solomon: Northeastern University, Boston, Massachusetts 02115
Jacques Desrosiers: University of Montreal, HEC, Montreal, Quebec, Canada

Transportation Science, 1988, vol. 22, issue 1, 1-13

Abstract: We have witnessed recently the development of a fast growing body of research focused on vehicle routing and scheduling problem structures with time window constraints. It is the aim of this paper to survey the significant advances made for the following classes of routing problems with time windows: the single and multiple traveling salesman problem, the shortest path problem, the minimum spanning tree problem, the generic vehicle routing problem, the pickup and delivery problem including the dial-a-ride problem, the multiperiod vehicle routing problem and the shoreline problem. Having surveyed the state-of-the-art in this area, we then offer some perspectives on future research.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.1.1 (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:22:y:1988:i:1:p:1-13

Access Statistics for this article

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