IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v29y1995i1p56-62.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Michel Gendreau & Gilbert Laporte & Marius M. Solomon, 1995. "Single-Vehicle Routing and Scheduling to Minimize the Number of Delays," Transportation Science, INFORMS, vol. 29(1), pages 56-62, February.
    • Handle: RePEc:inm:ortrsc:v:29:y:1995:i:1:p:56-62
    DOI: 10.1287/trsc.29.1.56
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.29.1.56
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.29.1.56?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ann Campbell & Michel Gendreau & Barrett Thomas, 2011. "The orienteering problem with stochastic travel and service times," Annals of Operations Research, Springer, vol. 186(1), pages 61-81, June.
    2. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    3. P. Preston & E. Kozan, 2000. "A Tabu search technique applied to scheduling container transfers," Transportation Planning and Technology, Taylor & Francis Journals, vol. 24(2), pages 135-153, May.
    4. Zografos, Konstantinos G. & Androutsopoulos, Konstantinos N., 2004. "A heuristic algorithm for solving hazardous materials distribution problems," European Journal of Operational Research, Elsevier, vol. 152(2), pages 507-519, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:29:y:1995:i:1:p:56-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.