IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i10p1788-d428443.html
   My bibliography  Save this article

A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing

Author

Listed:
  • Yanjun Shi

    (School of Mechanical Engineering, Dalian University of Technology, Dalian 116023, China
    The authors contributed equally to this work.)

  • Na Lin

    (School of Economics and Management, Dalian University of Technology, Dalian 116023, China
    The authors contributed equally to this work.)

  • Qiaomei Han

    (Department of Electrical and Computer Engineering, Western University, London, ON N6A 3K7, Canada)

  • Tongliang Zhang

    (School of Mechanical Engineering, Dalian University of Technology, Dalian 116023, China)

  • Weiming Shen

    (State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430000, China)

Abstract

This paper addresses a collaborative multi-carrier vehicle routing problem (CMCVRP) where carriers tackle their orders collaboratively to reduce transportation costs. First, a hierarchical heuristics algorithm is proposed to solve the transportation planning problem. This algorithm makes order assignments based on two distance rules and solves the vehicle routing problem with a hybrid genetic algorithm. Second, the profit arising from the coalition is quantified, and an improved Shapley value method is proposed to distribute the profit fairly to individual players. Extensive experiment results showed the effectiveness of the proposed hierarchical heuristics algorithm and confirmed the stability and fairness of the improved Shapley value method.

Suggested Citation

  • Yanjun Shi & Na Lin & Qiaomei Han & Tongliang Zhang & Weiming Shen, 2020. "A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing," Mathematics, MDPI, vol. 8(10), pages 1-23, October.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:10:p:1788-:d:428443
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/10/1788/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/10/1788/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. A. Kimms & I. Kozeletskyi, 2016. "Shapley value-based cost allocation in the cooperative traveling salesman problem under rolling horizon planning," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 371-392, December.
    3. Kangzhou Wang & Shulin Lan & Yingxue Zhao, 2017. "A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1409-1421, November.
    4. Frisk, M. & Göthe-Lundgren, M. & Jörnsten, K. & Rönnqvist, M., 2010. "Cost allocation in collaborative forest transportation," European Journal of Operational Research, Elsevier, vol. 205(2), pages 448-458, September.
    5. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    6. Cruijssen, Frans & Cools, Martine & Dullaert, Wout, 2007. "Horizontal cooperation in logistics: Opportunities and impediments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 129-142, March.
    7. Vanovermeire, Christine & Sörensen, Kenneth, 2014. "Integration of the cost allocation in the optimization of collaborative bundling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 125-143.
    8. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    9. Alinaghian, Mahdi & Shokouhi, Nadia, 2018. "Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search," Omega, Elsevier, vol. 76(C), pages 85-99.
    10. Absalom E Ezugwu & Francis Akutsah & Micheal O Olusanya & Aderemi O Adewumi, 2018. "Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem," PLOS ONE, Public Library of Science, vol. 13(3), pages 1-32, March.
    11. Defryn, Christof & Sörensen, Kenneth & Dullaert, Wout, 2019. "Integrating partner objectives in horizontal logistics optimisation models," Omega, Elsevier, vol. 82(C), pages 1-12.
    12. Lu Zhen & Ziheng Xu & Chengle Ma & Liyang Xiao, 2020. "Hybrid electric vehicle routing problem with mode selection," International Journal of Production Research, Taylor & Francis Journals, vol. 58(2), pages 562-576, January.
    13. Okan Örsan Özener & Özlem Ergun & Martin Savelsbergh, 2013. "Allocating Cost of Service to Customers in Inventory Routing," Operations Research, INFORMS, vol. 61(1), pages 112-125, 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. Arroyo, Federico, 2024. "Cost Allocation in Vehicle Routing Problems with Time Windows," Junior Management Science (JUMS), Junior Management Science e. V., vol. 9(1), pages 1241-1268.

    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. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    2. 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.
    3. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    4. Defryn, Christof & Sörensen, Kenneth & Dullaert, Wout, 2019. "Integrating partner objectives in horizontal logistics optimisation models," Omega, Elsevier, vol. 82(C), pages 1-12.
    5. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    6. Eren Akyol, Derya & De Koster, René B.M., 2018. "Determining time windows in urban freight transport: A city cooperative approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 34-50.
    7. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
    8. Arroyo, Federico, 2024. "Cost Allocation in Vehicle Routing Problems with Time Windows," Junior Management Science (JUMS), Junior Management Science e. V., vol. 9(1), pages 1241-1268.
    9. 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.
    10. 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.
    11. Lotte Verdonck & Katrien Ramaekers & Benoît Depaire & An Caris & Gerrit K. Janssens, 2019. "Analysing the Effect of Partner Characteristics on the Performance of Horizontal Carrier Collaborations," Networks and Spatial Economics, Springer, vol. 19(2), pages 583-609, June.
    12. 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.
    13. Alix Vargas & Shushma Patel & Dilip Patel, 2018. "Towards a Business Model Framework to Increase Collaboration in the Freight Industry," Logistics, MDPI, vol. 2(4), pages 1-32, October.
    14. Basso, Franco & Guajardo, Mario & Varas, Mauricio, 2020. "Collaborative job scheduling in the wine bottling process," Omega, Elsevier, vol. 91(C).
    15. Chabot, Thomas & Bouchard, Florence & Legault-Michaud, Ariane & Renaud, Jacques & Coelho, Leandro C., 2018. "Service level, cost and environmental optimization of collaborative transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 1-14.
    16. 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.
    17. Hacardiaux, Thomas & Defryn, Christof & Tancrez, Jean-Sébastien & Verdonck, Lotte, 2020. "Balancing partner preferences for logistics costs and carbon footprint in a horizontal cooperation," Research Memorandum 002, Maastricht University, Graduate School of Business and Economics (GSBE).
    18. Mario Guajardo & Kurt Jörnsten & Mikael Rönnqvist, 2016. "Constructive and blocking power in collaborative transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 25-50, January.
    19. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    20. Padilla Tinoco, Silvia Valeria & Creemers, Stefan & Boute, Robert N., 2017. "Collaborative shipping under different cost-sharing agreements," European Journal of Operational Research, Elsevier, vol. 263(3), pages 827-837.

    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:gam:jmathe:v:8:y:2020:i:10:p:1788-:d:428443. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.