IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v271y2018i3p896-912.html
   My bibliography  Save this article

Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands

Author

Listed:
  • Zhu, Lin
  • Sheu, Jiuh-Biing

Abstract

This paper concerns the generation of a priori routes for a fleet of vehicles that pick up and deliver items with stochastic demands. A failure-specific cooperative recourse strategy is proposed to explore a risk pooling mechanism for routing in the context of simultaneous pickup and delivery with stochastic demands. By defining complete failure and semi-failure of routing, the travelling cost under our failure-specific cooperative strategy is estimated. Also, an adaptive large neighbourhood search algorithm is developed. Compared with a strategy that involves no cooperation between vehicles, our strategy performs better in terms of reducing travelling costs, and balancing fleet size and detour frequency.

Suggested Citation

  • Zhu, Lin & Sheu, Jiuh-Biing, 2018. "Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 271(3), pages 896-912.
    • Handle: RePEc:eee:ejores:v:271:y:2018:i:3:p:896-912
    DOI: 10.1016/j.ejor.2018.05.049
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718304600
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.05.049?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. 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.
    2. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    3. Kalayci, Can B. & Kulak, Osman & Günther, Hans-Otto, 2015. "A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time LimitAuthor-Name: Polat, Olcay," European Journal of Operational Research, Elsevier, vol. 242(2), pages 369-382.
    4. Pandelis, D.G. & Kyriakidis, E.G. & Dimitrakos, T.D., 2012. "Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands," European Journal of Operational Research, Elsevier, vol. 217(2), pages 324-332.
    5. Dimitrakos, T.D. & Kyriakidis, E.G., 2015. "A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order," European Journal of Operational Research, Elsevier, vol. 244(3), pages 990-993.
    6. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    7. Luo, Zhixing & Qin, Hu & Zhang, Dezhi & Lim, Andrew, 2016. "Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 69-89.
    8. Gilbert Laporte & Roberto Musmanno & Francesca Vocaturo, 2010. "An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 44(1), pages 125-135, February.
    9. Aykagan Ak & Alan L. Erera, 2007. "A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 41(2), pages 222-237, May.
    10. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    11. Wen-Huei Yang & Kamlesh Mathur & Ronald H. Ballou, 2000. "Stochastic Vehicle Routing Problem with Restocking," Transportation Science, INFORMS, vol. 34(1), pages 99-112, February.
    12. Michel Gendreau & Ola Jabali & Walter Rei, 2016. "50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing," Transportation Science, INFORMS, vol. 50(4), pages 1163-1173, November.
    13. Gilbert Laporte & FranÇois V. Louveaux & Luc van Hamme, 2002. "An Integer L -Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 50(3), pages 415-423, June.
    14. Minis, I. & Tatarakis, A., 2011. "Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence," European Journal of Operational Research, Elsevier, vol. 213(1), pages 37-51, August.
    15. Pandelis, D.G. & Karamatsoukis, C.C. & Kyriakidis, E.G., 2013. "Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery," European Journal of Operational Research, Elsevier, vol. 231(3), pages 577-586.
    16. Gábor Nagy & Niaz A. Wassan & M. Grazia Speranza & Claudia Archetti, 2015. "The Vehicle Routing Problem with Divisible Deliveries and Pickups," Transportation Science, INFORMS, vol. 49(2), pages 271-294, May.
    17. Mauro Dell’Amico & Giovanni Righini & Matteo Salani, 2006. "A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection," Transportation Science, INFORMS, vol. 40(2), pages 235-247, 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. Qinge Guo & Nengmin Wang, 2023. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery Considering the Total Number of Collected Goods," Mathematics, MDPI, vol. 11(2), pages 1-10, January.
    2. Zhou, Jian & Li, Hui & Gu, Yujie & Zhao, Mingxuan & Xie, Xuehui & Zheng, Haoran & Fang, Xinghua, 2021. "A novel two-phase approach for the bi-objective simultaneous delivery and pickup problem with fuzzy pickup demands," International Journal of Production Economics, Elsevier, vol. 234(C).
    3. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2020. "A green delivery-pickup problem for home hemodialysis machines; sharing economy in distributing scarce resources," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).

    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. Kyriakidis, Epaminondas G. & Dimitrakos, Theodosis D. & Karamatsoukis, Constantinos C., 2019. "Optimal delivery of two similar products to N ordered customers with product preferences," International Journal of Production Economics, Elsevier, vol. 209(C), pages 194-204.
    2. 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.
    3. Zhang, Junlong & Lam, William H.K. & Chen, Bi Yu, 2016. "On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows," European Journal of Operational Research, Elsevier, vol. 249(1), pages 144-154.
    4. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    5. Luo, Zhixing & Qin, Hu & Zhang, Dezhi & Lim, Andrew, 2016. "Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 69-89.
    6. 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.
    7. Dell’Amico, Mauro & Iori, Manuel & Novellani, Stefano & Subramanian, Anand, 2018. "The Bike sharing Rebalancing Problem with Stochastic Demands," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 362-380.
    8. Epaminondas G. Kyriakidis & Theodosis D. Dimitrakos & Constantinos C. Karamatsoukis, 2020. "A Stochastic Single Vehicle Routing Problem with a Predefined Sequence of Customers and Collection of Two Similar Materials," Methodology and Computing in Applied Probability, Springer, vol. 22(4), pages 1559-1582, December.
    9. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    10. Neves-Moreira, F. & Amorim, P. & Guimarães, L. & Almada-Lobo, B., 2016. "A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations," European Journal of Operational Research, Elsevier, vol. 248(2), pages 487-506.
    11. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    12. Zhou, Jian & Li, Hui & Gu, Yujie & Zhao, Mingxuan & Xie, Xuehui & Zheng, Haoran & Fang, Xinghua, 2021. "A novel two-phase approach for the bi-objective simultaneous delivery and pickup problem with fuzzy pickup demands," International Journal of Production Economics, Elsevier, vol. 234(C).
    13. Naccache, Salma & Côté, Jean-François & Coelho, Leandro C., 2018. "The multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 269(1), pages 353-362.
    14. Dimitrakos, T.D. & Kyriakidis, E.G., 2015. "A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order," European Journal of Operational Research, Elsevier, vol. 244(3), pages 990-993.
    15. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
    16. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    17. Pandelis, D.G. & Karamatsoukis, C.C. & Kyriakidis, E.G., 2013. "Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery," European Journal of Operational Research, Elsevier, vol. 231(3), pages 577-586.
    18. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    19. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A hybrid recourse policy for the vehicle routing problem with stochastic demands," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 269-298, September.
    20. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.

    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:eee:ejores:v:271:y:2018:i:3:p:896-912. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.