Single-Vehicle Routing and Scheduling to Minimize the Number of Delays

Michel Gendreau, Gilbert Laporte and Marius M. Solomon
Additional contact information
Michel Gendreau: Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7
Gilbert Laporte: Centre de recherche sur les transports, Université de Montréal, Montréal, Canada H3C 3J7
Marius M. Solomon: College of Business Administration, Northeastern University, Massachusetts 02115

Transportation Science, 1995, vol. 29, issue 1, 56-62

Abstract: In this paper we examine the following problem arising in vehicle routing and in production scheduling. Consider a single uncapacitated vehicle and n customers j with deadlines d j . The objective is to minimize the number of deliveries completed after their deadline. This problem is NP-hard, but a class of solvable cases can be characterized. An integer linear programming formulation is proposed, and the problem is solved optimally by means of a specialized enumerative algorithm. Computational results are presented for problems involving up to 100 customers.

Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.29.1.56 (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:56-62

Access Statistics for this article

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