IDEAS home Printed from https://ideas.repec.org/a/wly/jnddns/v2016y2016i1n7841297.html

A Three‐Stage Saving‐Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times

Author

Listed:
  • Zheng Wang
  • Chunyue Zhou

Abstract

This paper presents a saving‐based heuristic for the vehicle routing problem with time windows and stochastic travel times (VRPTWSTT). One of the basic ideas of the heuristic is to advance the latest service start time of each customer by a certain period of time. In this way, the reserved time can be used to cope with unexpected travel time delay when necessary. Another important idea is to transform the VRPTWSTT to a set of vehicle routing problems with time windows (VRPTW), each of which is defined by a given percentage used to calculate the reserved time for customers. Based on the above two key ideas, a three‐stage heuristic that includes the “problem transformation” stage, the “solution construction” stage, and the “solution improvement” stage is developed. After the problem transformation in the first stage, the work of the next two stages is to first construct an initial solution for each transformed VRPTW by improving the idea of the classical Clarke‐Wright heuristic and then further improve the solution. Finally, a number of numerical experiments are conducted to evaluate the efficiency of the described methodology under different uncertainty levels.

Suggested Citation

  • Zheng Wang & Chunyue Zhou, 2016. "A Three‐Stage Saving‐Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
    • Handle: RePEc:wly:jnddns:v:2016:y:2016:i:1:n:7841297
    DOI: 10.1155/2016/7841297
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2016/7841297
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/7841297?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
    ---><---

    References listed on IDEAS

    as
    1. Gilbert Laporte & François Louveaux & Hélène Mercure, 1992. "The Vehicle Routing Problem with Stochastic Travel Times," Transportation Science, INFORMS, vol. 26(3), pages 161-170, August.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    3. Astrid S. Kenyon & David P. Morton, 2003. "Stochastic Vehicle Routing with Random Travel Times," Transportation Science, INFORMS, vol. 37(1), pages 69-82, February.
    4. Connors, Richard D. & Sumalee, Agachai, 2009. "A network equilibrium model with travellers' perception of stochastic travel times," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 614-624, July.
    5. Zheng Wang & Lin Lin, 2013. "A Simulation-Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-10, November.
    6. Zheng Wang & Lin Lin, 2013. "A Simulation‐Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    Full references (including those not matched with items on IDEAS)

    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. Zheng Wang & Lin Lin, 2013. "A Simulation‐Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    2. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
    3. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    4. Ehmke, Jan Fabian & Campbell, Ann Melissa & Urban, Timothy L., 2015. "Ensuring service levels in routing problems with time windows and stochastic travel times," European Journal of Operational Research, Elsevier, vol. 240(2), pages 539-550.
    5. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. Hossein Hashemi Doulabi & Gilles Pesant & Louis-Martin Rousseau, 2020. "Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare," Transportation Science, INFORMS, vol. 54(4), pages 1053-1072, July.
    7. Ruidian Song & Hoong Chuin Lau & Xue Luo & Lei Zhao, 2022. "Coordinated Delivery to Shopping Malls with Limited Docking Capacity," Transportation Science, INFORMS, vol. 56(2), pages 501-527, March.
    8. Topaloglu, H., 2006. "A parallelizable dynamic fleet management model with random travel times," European Journal of Operational Research, Elsevier, vol. 175(2), pages 782-805, December.
    9. R A Russell & T L Urban, 2008. "Vehicle routing with soft time windows and Erlang travel times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1220-1228, September.
    10. Avraham, Edison & Raviv, Tal, 2020. "The data-driven time-dependent traveling salesperson problem," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 25-40.
    11. Liu, Bingbing & Guo, Xiaolong & Yu, Yugang & Zhou, Qiang, 2019. "Minimizing the total completion time of an urban delivery problem with uncertain assembly time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 163-182.
    12. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    13. Mohammed Bazirha & Abdeslam Kadrani & Rachid Benmansour, 2023. "Stochastic home health care routing and scheduling problem with multiple synchronized services," Annals of Operations Research, Springer, vol. 320(2), pages 573-601, January.
    14. Chen, Lu & Gendreau, Michel & Hà, Minh Hoàng & Langevin, André, 2016. "A robust optimization approach for the road network daily maintenance routing problem with uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 40-51.
    15. Rabbani, M. & Heidari, R. & Yazdanparast, R., 2019. "A stochastic multi-period industrial hazardous waste location-routing problem: Integrating NSGA-II and Monte Carlo simulation," European Journal of Operational Research, Elsevier, vol. 272(3), pages 945-961.
    16. Li, Xiangyong & Tian, Peng & Leung, Stephen C.H., 2010. "Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm," International Journal of Production Economics, Elsevier, vol. 125(1), pages 137-145, May.
    17. Biao Yuan & Ran Liu & Zhibin Jiang, 2015. "A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7450-7464, December.
    18. Zhou, Bingjie & Zhang, Yu & Baldacci, Roberto & Tang, Jiafu, 2026. "The service-centric Vehicle Routing Problem with Crowdshipping," European Journal of Operational Research, Elsevier, vol. 331(2), pages 495-519.
    19. Mojtaba Rajabi-Bahaabadi & Afshin Shariat-Mohaymany & Mohsen Babaei & Daniele Vigo, 2021. "Reliable vehicle routing problem in stochastic networks with correlated travel times," Operational Research, Springer, vol. 21(1), pages 299-330, March.
    20. Naoki Ando & Eiichi Taniguchi, 2006. "Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows," Networks and Spatial Economics, Springer, vol. 6(3), pages 293-311, September.

    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:wly:jnddns:v:2016:y:2016:i:1:n:7841297. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/3059 .

    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.