IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i2d10.1007_s10878-014-9767-4.html
   My bibliography  Save this article

Multi-depot vehicle routing problem with time windows under shared depot resources

Author

Listed:
  • Jian Li

    (Nanjing Agricultural University)

  • Yang Li

    (Nanjing Agricultural University)

  • Panos M. Pardalos

    (University of Florida
    National Research University Higher School of Economics)

Abstract

A new variant of multi-depot vehicle routing problem with time windows is studied. In the new variant, the depot where the vehicle ends is flexible, namely, it is not entirely the same as the depot that it starts from. An integer programming model is formulated with the minimum total traveling cost under the constrains of time window, capacity and route duration of the vehicle, the fleet size and the number of parking spaces of each depot. As the problem is an NP-Hard problem, a hybrid genetic algorithm with adaptive local search is proposed to solve it. Finally, the computational results show that the proposed method is competitive in terms of solution quality. Compared with the classic MDVRPTW, allowing flexible choice of the stop depot can further reduce total traveling cost.

Suggested Citation

  • Jian Li & Yang Li & Panos M. Pardalos, 2016. "Multi-depot vehicle routing problem with time windows under shared depot resources," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 515-532, February.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9767-4
    DOI: 10.1007/s10878-014-9767-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9767-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9767-4?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.

    References listed on IDEAS

    as
    1. L Moccia & J-F Cordeau & G Laporte, 2012. "An incremental tabu search heuristic for the generalized vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 232-244, February.
    2. P P Repoussis & C D Tarantilis & G Ioannou, 2007. "The open vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 355-367, March.
    3. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    4. L Tansini & O Viera, 2006. "New measures of proximity for the assignment algorithms in the MDVRPTW," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 241-249, March.
    5. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    6. J-F Cordeau & G Laporte & A Mercier, 2004. "Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 542-546, May.
    7. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    8. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    9. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    10. J-F Cordeau & G Laporte & A Mercier, 2001. "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(8), pages 928-936, August.
    11. Martin W. P. Savelsbergh, 1992. "The Vehicle Routing Problem with Time Windows: Minimizing Route Duration," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 146-154, May.
    12. S. Irnich, 2008. "A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 270-287, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zahra Sadat Hasanpour Jesri & Kourosh Eshghi & Majid Rafiee & Tom Van Woensel, 2022. "The Multi-Depot Traveling Purchaser Problem with Shared Resources," Sustainability, MDPI, vol. 14(16), pages 1-26, August.
    2. Zhongxin Zhou & Minghu Ha & Hao Hu & Hongguang Ma, 2021. "Half Open Multi-Depot Heterogeneous Vehicle Routing Problem for Hazardous Materials Transportation," Sustainability, MDPI, vol. 13(3), pages 1-17, January.
    3. Dengkai Hou & Houming Fan & Xiaoxue Ren & Panjun Tian & Yingchun Lv, 2021. "Time-Dependent Multi-Depot Heterogeneous Vehicle Routing Problem Considering Temporal–Spatial Distance," Sustainability, MDPI, vol. 13(9), pages 1-16, April.
    4. Izdebski, Mariusz & Jacyna-Gołda, Ilona & Gołda, Paweł, 2022. "Minimisation of the probability of serious road accidents in the transport of dangerous goods," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    5. Ahmadi, Sobhan & Akgunduz, Ali, 2023. "Airport operations with electric-powered towing alternatives under stochastic conditions," Journal of Air Transport Management, Elsevier, vol. 109(C).
    6. Bochra Rabbouch & Foued Saâdaoui & Rafaa Mraihi, 2021. "Efficient implementation of the genetic algorithm to solve rich vehicle routing problems," Operational Research, Springer, vol. 21(3), pages 1763-1791, September.
    7. Niroomand, Iman & Nsakanda, Aaron Luntala, 2018. "Improving collection flows in a public postal network with contractor's obligation considerations," International Journal of Production Economics, Elsevier, vol. 198(C), pages 79-92.
    8. Phan Nguyen Ky Phuc & Nguyen Le Phuong Thao, 2021. "Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets," Logistics, MDPI, vol. 5(2), pages 1-13, May.
    9. Yong Wang & Yingying Yuan & Xiangyang Guan & Haizhong Wang & Yong Liu & Maozeng Xu, 2019. "Collaborative Mechanism for Pickup and Delivery Problems with Heterogeneous Vehicles under Time Windows," Sustainability, MDPI, vol. 11(12), pages 1-30, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    2. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    3. Schneider, M., 2016. "The vehicle-routing problem with time windows and driver-specific times," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65941, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Hoogeboom, Maaike & Dullaert, Wout, 2019. "Vehicle routing with arrival time diversification," European Journal of Operational Research, Elsevier, vol. 275(1), pages 93-107.
    5. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    6. Goeke, Dominik & Schneider, Michael, 2015. "Routing a mixed fleet of electric and conventional vehicles," European Journal of Operational Research, Elsevier, vol. 245(1), pages 81-99.
    7. Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    8. Mohamed Cissé & Semih Yalçindag & Yannick Kergosien & Evren Sahin & Christophe Lenté & Andrea Matta, 2017. "OR problems related to Home Health Care: A review of relevant routing and scheduling problems," Post-Print hal-01736714, HAL.
    9. Schneider, Michael & Schwahn, Fabian & Vigo, Daniele, 2017. "Designing granular solution methods for routing problems with time windows," European Journal of Operational Research, Elsevier, vol. 263(2), pages 493-509.
    10. Michael Schneider & Andreas Stenger & Dominik Goeke, 2014. "The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations," Transportation Science, INFORMS, vol. 48(4), pages 500-520, November.
    11. Ali, Ousmane & Côté, Jean-François & Coelho, Leandro C., 2021. "Models and algorithms for the delivery and installation routing problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 162-177.
    12. Goeke, D. & Schneider, M., 2015. "Routing a Mixed Fleet of Electric and Conventional Vehicles," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65939, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    13. Schneider, Michael, 2016. "The vehicle-routing problem with time windows and driver-specific times," European Journal of Operational Research, Elsevier, vol. 250(1), pages 101-119.
    14. Maximilian Schiffer & Grit Walther, 2018. "An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities," Transportation Science, INFORMS, vol. 52(2), pages 331-352, March.
    15. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    16. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    17. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    18. Masson, Renaud & Lahrichi, Nadia & Rousseau, Louis-Martin, 2016. "A two-stage solution method for the annual dairy transportation problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 36-43.
    19. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    20. Amir Saeed Nikkhah Qamsari & Seyyed-Mahdi Hosseini-Motlagh & Seyed Farid Ghannadpour, 2022. "A column generation approach for an inventory routing problem with fuzzy time windows," Operational Research, Springer, vol. 22(2), pages 1157-1207, April.

    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:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9767-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.springer.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.