IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i6d10.1057_palgrave.jors.2601352.html
   My bibliography  Save this article

Partially dynamic vehicle routing—models and algorithms

Author

Listed:
  • A Larsen

    (IMM, The Technical University of Denmark)

  • O Madsen

    (CTT, The Technical University of Denmark)

  • M Solomon

    (Northeastern University)

Abstract

In this paper we propose a framework for dynamic routing systems based on their degree of dynamism. Next, we consider its impact on solution methodology and quality. Specifically, we introduce the Partially Dynamic Travelling Repairman Problem and describe several dynamic policies to minimize routing costs. The results of our computational study indicate that increasing the dynamic level results in a linear increase in route length for all policies studied. Furthermore, a Nearest Neighbour policy performed, on the average, uniformly better than the other dispatching rules studied. Among these, a Partitioning policy produced only slightly higher average route lengths.

Suggested Citation

  • A Larsen & O Madsen & M Solomon, 2002. "Partially dynamic vehicle routing—models and algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(6), pages 637-646, June.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave.jors.2601352
    DOI: 10.1057/palgrave.jors.2601352
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601352
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601352?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave.jors.2601352. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.