IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v141y2020ics136655452030675x.html
   My bibliography  Save this article

A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas

Author

Listed:
  • Yang, Fei
  • Dai, Ying
  • Ma, Zu-Jun

Abstract

This study proposes a cooperative rich vehicle routing problem (CoRVRP) among three typical logistics providers in the last-mile logistics industry in rural areas. The problem is formulated based on the information fusion system and the ordering interface system, and it is solved by a proposed branch-price-and-cut algorithm. Based on the optimized cooperation scheme, the core and Shapley value are used to fairly allocate the cost savings. The numerical results show that a long-term grand coalition will be beneficial to all the participators. The proposed information-merging-and-algorithm-driven cooperative optimization model will be practicable for intelligent logistics systems.

Suggested Citation

  • Yang, Fei & Dai, Ying & Ma, Zu-Jun, 2020. "A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    • Handle: RePEc:eee:transe:v:141:y:2020:i:c:s136655452030675x
    DOI: 10.1016/j.tre.2020.102024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655452030675X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.102024?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. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    2. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    3. H. A. Eiselt & Michel Gendreau & Gilbert Laporte, 1995. "Arc Routing Problems, Part II: The Rural Postman Problem," Operations Research, INFORMS, vol. 43(3), pages 399-414, June.
    4. Akeb, Hakim & Moncef, Btissam & Durand, Bruno, 2018. "Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 223-233.
    5. M A Krajewska & H Kopfer & G Laporte & S Ropke & G Zaccour, 2008. "Horizontal cooperation among freight carriers: request allocation and profit sharing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1483-1491, November.
    6. Kramer, Raphael & Cordeau, Jean-François & Iori, Manuel, 2019. "Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 162-174.
    7. Stefan Poikonen & Bruce Golden & Edward A. Wasil, 2019. "A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 335-346, April.
    8. Stefan Engevall & Maud Göthe-Lundgren & Peter Värbrand, 1998. "The traveling salesman game: An application ofcost allocation in a gas and oil company," Annals of Operations Research, Springer, vol. 82(0), pages 203-218, August.
    9. Nico Dellaert & Fardin Dashty Saridarq & Tom Van Woensel & Teodor Gabriel Crainic, 2019. "Branch-and-Price–Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 53(2), pages 463-479, March.
    10. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    11. Martin Savelsbergh & Tom Van Woensel, 2016. "50th Anniversary Invited Article—City Logistics: Challenges and Opportunities," Transportation Science, INFORMS, vol. 50(2), pages 579-590, May.
    12. Massimiliano Caramia & Francesca Guerriero, 2010. "A Milk Collection Problem with Incompatibility Constraints," Interfaces, INFORMS, vol. 40(2), pages 130-143, April.
    13. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    14. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.
    15. Paredes-Belmar, Germán & Marianov, Vladimir & Bronfman, Andrés & Obreque, Carlos & Lüer-Villagra, Armin, 2016. "A milk collection problem with blending," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 26-43.
    16. Bruno Durand & Hakim Akeb & Btissam Moncef, 2018. "Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris [L'élaboration d'une solution collaborative de livraisons urbaines en vu," Post-Print hal-01781155, HAL.
    17. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    18. Defryn, Christof & Sörensen, Kenneth & Cornelissens, Trijntje, 2016. "The selective vehicle routing problem in a collaborative environment," European Journal of Operational Research, Elsevier, vol. 250(2), pages 400-411.
    19. Sameer Hasija & Zuo-Jun Max Shen & Chung-Piaw Teo, 2020. "Smart City Operations: Modeling Challenges and Opportunities," Manufacturing & Service Operations Management, INFORMS, vol. 22(1), pages 203-213, January.
    20. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    21. Zhen, Lu & Ma, Chengle & Wang, Kai & Xiao, Liyang & Zhang, Wei, 2020. "Multi-depot multi-trip vehicle routing problem with time windows and release dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    22. Wang, Zheng, 2018. "Delivering meals for multiple suppliers: Exclusive or sharing logistics service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 496-512.
    23. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
    24. Gilbert Laporte & Yves Nobert & Martin Desrochers, 1985. "Optimal Routing under Capacity and Distance Restrictions," Operations Research, INFORMS, vol. 33(5), pages 1050-1073, October.
    25. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    26. Kimms, A. & Kozeletskyi, I., 2016. "Core-based cost allocation in the cooperative traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 910-916.
    27. Letchford, Adam N. & Nasiri, Saeideh D. & Theis, Dirk Oliver, 2013. "Compact formulations of the Steiner Traveling Salesman Problem and related problems," European Journal of Operational Research, Elsevier, vol. 228(1), pages 83-92.
    28. Lozano, S. & Moreno, P. & Adenso-Díaz, B. & Algaba, E., 2013. "Cooperative game theory approach to allocating benefits of horizontal cooperation," European Journal of Operational Research, Elsevier, vol. 229(2), pages 444-452.
    29. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
    30. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Other publications TiSEM 0dd4cf3d-25fa-4179-80f6-6, Tilburg University, School of Economics and Management.
    31. Goel, Asvin & Gruhn, Volker, 2008. "A General Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 650-660, December.
    32. 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.
    33. Said Dabia & David Lai & Daniele Vigo, 2019. "An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier," Transportation Science, INFORMS, vol. 53(4), pages 986-1000, July.
    34. Stefan Engevall & Maud Göthe-Lundgren & Peter Värbrand, 2004. "The Heterogeneous Vehicle-Routing Game," Transportation Science, INFORMS, vol. 38(1), pages 71-85, February.
    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. Shen, Zhiyang & Wang, Songkai & Boussemart, Jean-Philippe & Hao, Yu, 2022. "Digital transition and green growth in Chinese agriculture," Technological Forecasting and Social Change, Elsevier, vol. 181(C).
    2. Yong Wang & Jiayi Zhe & Xiuwen Wang & Yaoyao Sun & Haizhong Wang, 2022. "Collaborative Multidepot Vehicle Routing Problem with Dynamic Customer Demands and Time Windows," Sustainability, MDPI, vol. 14(11), pages 1-37, May.
    3. Małgorzata Markowska & Jakub Marcinkowski, 2022. "Rural E-Customers’ Preferences for Last Mile Delivery: Evidence from Poland," Energies, MDPI, vol. 15(22), pages 1-15, November.
    4. Wang, Haibo & Alidaee, Bahram, 2023. "White-glove service delivery: A quantitative analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    5. Prajapati, Dhirendra & Pratap, Saurabh & Zhang, Mengdi & Lakshay, & Huang, George Q., 2022. "Sustainable forward-reverse logistics for multi-product delivery and pickup in B2C E-commerce towards the circular economy," International Journal of Production Economics, Elsevier, vol. 253(C).
    6. Vakulenko, Yulia & Arsenovic, Jasenko & Hellström, Daniel & Shams, Poja, 2022. "Does delivery service differentiation matter? Comparing rural to urban e-consumer satisfaction and retention," Journal of Business Research, Elsevier, vol. 142(C), pages 476-484.
    7. Öner, Nihat & Kuyzu, Gültekin, 2021. "Core stable coalition selection in collaborative truckload transportation procurement," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(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. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    2. Florian Kellner, 2022. "Generating greenhouse gas cutting incentives when allocating carbon dioxide emissions to shipments in road freight transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 833-874, September.
    3. Kellner, Florian & Schneiderbauer, Miriam, 2019. "Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: The pollution routing game," European Journal of Operational Research, Elsevier, vol. 278(1), pages 296-313.
    4. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    5. Cleophas, Catherine & Cottrill, Caitlin & Ehmke, Jan Fabian & Tierney, Kevin, 2019. "Collaborative urban transportation: Recent advances in theory and practice," European Journal of Operational Research, Elsevier, vol. 273(3), pages 801-816.
    6. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    7. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    8. Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen, 2021. "The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 319-335, January.
    9. Guajardo, Mario & Rönnqvist, Mikael & Flisberg, Patrik & Frisk, Mikael, 2018. "Collaborative transportation with overlapping coalitions," European Journal of Operational Research, Elsevier, vol. 271(1), pages 238-249.
    10. Defryn, Christof & Sörensen, Kenneth & Dullaert, Wout, 2019. "Integrating partner objectives in horizontal logistics optimisation models," Omega, Elsevier, vol. 82(C), pages 1-12.
    11. Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
    12. Boysen, Nils & Emde, Simon & Schwerdfeger, Stefan, 2022. "Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand," European Journal of Operational Research, Elsevier, vol. 296(2), pages 539-556.
    13. Defryn, Christof & Sörensen, Kenneth, 2018. "Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation," European Journal of Operational Research, Elsevier, vol. 267(3), pages 891-903.
    14. Bouchery, Yann & Hezarkhani, Behzad & Stauffer, Gautier, 2022. "Coalition formation and cost sharing for truck platooning," Transportation Research Part B: Methodological, Elsevier, vol. 165(C), pages 15-34.
    15. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    16. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    17. Minyoung Yea & Seokhyun Chung & Taesu Cheong & Daeki Kim, 2018. "The Sharing of Benefits from a Logistics Alliance Based on a Hub-Spoke Network: A Cooperative Game Theoretic Approach," Sustainability, MDPI, vol. 10(6), pages 1-16, June.
    18. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    19. Fernández, Elena & Roca-Riu, Mireia & Speranza, M. Grazia, 2018. "The Shared Customer Collaboration Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1078-1093.
    20. Kimms, A. & Kozeletskyi, I., 2016. "Core-based cost allocation in the cooperative traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 910-916.

    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:transe:v:141:y:2020:i:c:s136655452030675x. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.