IDEAS home Printed from https://ideas.repec.org/a/wsi/jikmxx/v13y2014i03ns0219649214500221.html
   My bibliography  Save this article

Stochastic Vehicle Routing Problem: A Literature Survey

Author

Listed:
  • Eshetie Berhan

    (School of Mechanical and Industrial Engineering, Addis Ababa Institute of Technology, Addis Ababa University, Addis Ababa, Ethiopia)

  • Birhanu Beshah

    (School of Mechanical and Industrial Engineering, Addis Ababa Institute of Technology, Addis Ababa University, Addis Ababa, Ethiopia)

  • Daniel Kitaw

    (School of Mechanical and Industrial Engineering, Addis Ababa Institute of Technology, Addis Ababa University, Addis Ababa, Ethiopia)

  • Ajith Abraham

    (Machine Intelligence Research Labs (MIR Labs), Scientific Network for Innovation and Research Excellence, Washington, USA)

Abstract

The purpose of this paper is to develop structural classification of Stochastic Vehicle Routing Problem (SVRP) by different domains and attributes. This research used a systematic review and meta-analysis on SVRP literatures. This includes browsing relevant researches and publications, screening related articles, identifying domains, attributes and categorising the articles based on the identified domains and attributes. The findings of the study show clear differences on the number of studies under each domain and attribute. Most studied attributes are stochastic customer demand, capacitated vehicle, synthesis data and objective function with cost minimization. Whereas the least studied are maximisation objective function, stochastic service time, and an applied model using stochastic with recurs. The research helps to summarise and map a comprehensive survey on SVRP literatures so that various contributions in the field are organised in a manner that provide a clear view for the readers and identify future research directions. This paper is the first of its kind in the field of SVRP that develop a classification scheme for articles published since 1993 to enhances the development of this newly emerging discipline.

Suggested Citation

  • Eshetie Berhan & Birhanu Beshah & Daniel Kitaw & Ajith Abraham, 2014. "Stochastic Vehicle Routing Problem: A Literature Survey," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 13(03), pages 1-12.
    • Handle: RePEc:wsi:jikmxx:v:13:y:2014:i:03:n:s0219649214500221
    DOI: 10.1142/S0219649214500221
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219649214500221
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219649214500221?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. Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2010. "The Vehicle Routing Problem with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 44(4), pages 474-492, November.
    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. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    2. Bekker, René & Bharti, Bharti & Lan, Leon & Mandjes, Michel, 2024. "A queueing-based approach for integrated routing and appointment scheduling," European Journal of Operational Research, Elsevier, vol. 318(2), pages 534-548.
    3. Liu, Zeyu & Li, Xueping & Khojandi, Anahita, 2022. "The flying sidekick traveling salesman problem with stochastic travel time: A reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    4. Lu, Da & Gzara, Fatma, 2019. "The robust vehicle routing problem with time windows: Solution by branch and price and cut," European Journal of Operational Research, Elsevier, vol. 275(3), pages 925-938.

    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. François V. Louveaux & Juan-José Salazar-González, 2018. "Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns," Service Science, INFORMS, vol. 52(6), pages 1463-1478, December.
    2. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    3. Shukla, Nagesh & Choudhary, A.K. & Prakash, P.K.S. & Fernandes, K.J. & Tiwari, M.K., 2013. "Algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance," International Journal of Production Economics, Elsevier, vol. 141(1), pages 146-166.
    4. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency relief routing models for injured victims considering equity and priority," Annals of Operations Research, Springer, vol. 283(1), pages 1573-1606, December.
    5. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    6. Chardy, Matthieu & Klopfenstein, Olivier, 2012. "Handling uncertainties in vehicle routing problems through data preprocessing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 667-683.
    7. Anirudh Subramanyam & Frank Mufalli & José M. Lí?nez-Aguirre & Jose M. Pinto & Chrysanthos E. Gounaris, 2021. "Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty," Operations Research, INFORMS, vol. 69(1), pages 30-60, January.
    8. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
    9. 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.
    10. Briseida Sarasola & Karl F. Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    11. Yuwen Yang & Jayant Rajgopal, 2021. "Outreach Strategies for Vaccine Distribution: A Multi-period Stochastic Modeling Approach," SN Operations Research Forum, Springer, vol. 2(2), pages 1-26, June.
    12. Cheang, Brenda & Gao, Xiang & Lim, Andrew & Qin, Hu & Zhu, Wenbin, 2012. "Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints," European Journal of Operational Research, Elsevier, vol. 223(1), pages 60-75.
    13. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    14. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency Relief Routing Models for Injured Victims Considering Equity and Priority," Post-Print hal-02879681, HAL.
    15. Sheng Liu & Long He & Zuo-Jun Max Shen, 2021. "On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors," Management Science, INFORMS, vol. 67(7), pages 4095-4119, July.
    16. Goodson, Justin C., 2015. "A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 241(2), pages 361-369.
    17. Anirudh Subramanyam & Panagiotis P. Repoussis & Chrysanthos E. Gounaris, 2020. "Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 661-681, July.
    18. Jorge E. Mendoza & Louis-Martin Rousseau & Juan G. Villegas, 2016. "A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints," Journal of Heuristics, Springer, vol. 22(4), pages 539-566, August.
    19. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    20. Zehtabian, Shohre & Larsen, Christian & Wøhlk, Sanne, 2022. "Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting," European Journal of Operational Research, Elsevier, vol. 303(2), pages 616-632.

    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:wsi:jikmxx:v:13:y:2014:i:03:n:s0219649214500221. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/jikm/jikm.shtml .

    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.