IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v2y2011i2p40-64.html
   My bibliography  Save this article

Multi Depot Probabilistic Vehicle Routing Problems with a Time Window: Theory, Solution and Application

Author

Listed:
  • Sutapa Samanta

    (Maryland State Highway Administration, USA)

  • Manoj K. Jha

    (Morgan State University, Baltimore, USA)

Abstract

Vehicle Routing Problems (VRPs) are prevalent in all large pick up and delivery logistics systems and are critical to city logistics operations. Of notable significance are three key extensions to classical VRPs: (1) multi-depot scenario; (2) probabilistic demand; and (3) time-window constraints, which are considered simultaneously with VRPs in this paper. The issue then becomes a Multi Depot Probabilistic Vehicle Routing Problem with a Time Window (MDPVRPTW). The underlying complexities of MDPVRPTW are analyzed and a heuristic approach is presented to solve the problem. Genetic algorithms (GAs) are found to be capable of providing an efficient solution to the so-called MDPVRPTW. Within the GAs, two modification operators namely, crossover and mutation, are designed specially to solve the MDPVRPTW. Three numerical examples with 14, 25, and 51 nodes are presented to test the efficiency of the algorithm as the problem size grows. The proposed algorithms perform satisfactorily and the limiting case solutions are in agreement with the constraints. Additional work is needed to test the robustness and efficiency of the algorithms as the problem size grows.

Suggested Citation

  • Sutapa Samanta & Manoj K. Jha, 2011. "Multi Depot Probabilistic Vehicle Routing Problems with a Time Window: Theory, Solution and Application," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 2(2), pages 40-64, April.
    • Handle: RePEc:igg:joris0:v:2:y:2011:i:2:p:40-64
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/joris.2011040103
    Download Restriction: no
    ---><---

    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:igg:joris0:v:2:y:2011:i:2:p:40-64. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.