IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v11y2019i12p3492-d242892.html
   My bibliography  Save this article

Collaborative Mechanism for Pickup and Delivery Problems with Heterogeneous Vehicles under Time Windows

Author

Listed:
  • Yong Wang

    (School of Economics and Management, Chongqing Jiaotong University, Chongqing 400074, China
    School of Management and Economics, University of Electronic Science and Technology, Chengdu 610054, China)

  • Yingying Yuan

    (School of Economics and Management, Chongqing Jiaotong University, Chongqing 400074, China)

  • Xiangyang Guan

    (Department of Civil and Environmental Engineering, University of Washington, Seattle, WA 98195, USA)

  • Haizhong Wang

    (School of Civil and Construction Engineering, Oregon State University, Corvallis, OR 97330, USA)

  • Yong Liu

    (School of Economics and Management, Chongqing Jiaotong University, Chongqing 400074, China)

  • Maozeng Xu

    (School of Economics and Management, Chongqing Jiaotong University, Chongqing 400074, China)

Abstract

The sustainability and complexity of logistics networks come from the temporally and spatially uneven distributions of freight demand and supply. Operation strategies without considering the sustainability and complexity could dramatically increase the economic and environmental costs of logistics operations. This paper explores how the unevenly distributed demand and supply can be optimally matched through collaborations, and formulates and solves a Collaborative Pickup and Delivery Problem under Time Windows (CPDPTW) to optimize the structures of logistics networks and improve city sustainability and liverability. The CPDPTW is a three-stage framework. First, a multi-objective linear optimization model that minimizes the number of vehicles and the total cost of logistics operation is developed. Second, a composite algorithm consisting of improved k-means clustering, Demand-and-Time-based Dijkstra Algorithm (DTDA) and Improved Non-dominated Sorting Genetic Algorithm-II (INSGA-II) is devised to solve the optimization model. The clustering algorithm helps to identify the feasible initial solution to INSGA-II. Third, a method based on improved Shapley value model is proposed to obtain the collaborative alliance strategy that achieves the optimal profit allocation strategy. The proposed composite algorithm outperforms existing algorithms in minimizing terms of the total cost and number of electro-tricycles. An empirical case of Chongqing is employed to demonstrate the efficiency of the proposed mechanism for achieving optimality for logistics networks and realizing a win-win situation between suppliers and consumers.

Suggested Citation

  • Yong Wang & Yingying Yuan & Xiangyang Guan & Haizhong Wang & Yong Liu & Maozeng Xu, 2019. "Collaborative Mechanism for Pickup and Delivery Problems with Heterogeneous Vehicles under Time Windows," Sustainability, MDPI, vol. 11(12), pages 1-30, June.
    • Handle: RePEc:gam:jsusta:v:11:y:2019:i:12:p:3492-:d:242892
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/11/12/3492/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/11/12/3492/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yong Wang & Shouguo Peng & Kevin Assogba & Yong Liu & Haizhong Wang & Maozeng Xu & Yinhai Wang, 2018. "Implementation of Cooperation for Recycling Vehicle Routing Optimization in Two-Echelon Reverse Logistics Networks," Sustainability, MDPI, vol. 10(5), pages 1-27, April.
    2. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    3. Jian Li & Yang Li & Panos M. Pardalos, 2016. "Multi-depot vehicle routing problem with time windows under shared depot resources," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 515-532, February.
    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. 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.
    6. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    7. Govindan, K. & Jafarian, A. & Khodaverdi, R. & Devika, K., 2014. "Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food," International Journal of Production Economics, Elsevier, vol. 152(C), pages 9-28.
    8. Cruijssen, Frans & Borm, Peter & Fleuren, Hein & Hamers, Herbert, 2010. "Supplier-initiated outsourcing: A methodology to exploit synergy in transportation," European Journal of Operational Research, Elsevier, vol. 207(2), pages 763-774, December.
    9. Zhang, Yuli & Max Shen, Zuo-Jun & Song, Shiji, 2017. "Lagrangian relaxation for the reliable shortest path problem with correlated link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 501-521.
    10. 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.
    11. Tu, Wei & Fang, Zhixiang & Li, Qingquan & Shaw, Shih-Lung & Chen, BiYu, 2014. "A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 84-97.
    12. Liu, Tian & Luo, Zhixing & Qin, Hu & Lim, Andrew, 2018. "A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints," European Journal of Operational Research, Elsevier, vol. 266(2), pages 487-497.
    13. 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.
    14. Li, Hongqi & Liu, Yinying & Jian, Xiaorong & Lu, Yingrong, 2018. "The two-echelon distribution system considering the real-time transshipment capacity varying," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 239-260.
    15. Kumoi, Yuki & Matsubayashi, Nobuo, 2014. "Vertical integration with endogenous contract leadership: Stability and fair profit allocation," European Journal of Operational Research, Elsevier, vol. 238(1), pages 221-232.
    16. Bektaş, Tolga & Gouveia, Luis & Martínez-Sykora, Antonio & Salazar-González, Juan-José, 2019. "Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 273(2), pages 452-463.
    17. Wu, Qiong & Ren, Hongbo & Gao, Weijun & Ren, Jianxing, 2017. "Benefit allocation for distributed energy network participants applying game theory based solutions," Energy, Elsevier, vol. 119(C), pages 384-391.
    18. Longlong Leng & Yanwei Zhao & Zheng Wang & Jingling Zhang & Wanliang Wang & Chunmiao Zhang, 2019. "A Novel Hyper-Heuristic for the Biobjective Regional Low-Carbon Location-Routing Problem with Multiple Constraints," Sustainability, MDPI, vol. 11(6), pages 1-31, March.
    19. Hafezalkotob, Ashkan & Makui, Ahmad, 2015. "Cooperative maximum-flow problem under uncertainty in logistic networks," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 593-604.
    20. 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.
    21. Mesa-Arango, Rodrigo & Ukkusuri, Satish V., 2015. "Demand clustering in freight logistics networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 36-51.
    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. Yong Wang & Qin Li & Xiangyang Guan & Jianxin Fan & Yong Liu & Haizhong Wang, 2020. "Collaboration and Resource Sharing in the Multidepot Multiperiod Vehicle Routing Problem with Pickups and Deliveries," Sustainability, MDPI, vol. 12(15), pages 1-33, July.
    2. Baofeng Sun & Jiaojiao Liu & Junyi Hao & Xiuxiu Shen & Xinhua Mao & Xianmin Song, 2020. "Maintenance Decision-Making of an Urban Rail Transit System in a Regionalized Network-Wide Perspective," Sustainability, MDPI, vol. 12(22), pages 1-21, November.

    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. Yong Wang & Shouguo Peng & Kevin Assogba & Yong Liu & Haizhong Wang & Maozeng Xu & Yinhai Wang, 2018. "Implementation of Cooperation for Recycling Vehicle Routing Optimization in Two-Echelon Reverse Logistics Networks," Sustainability, MDPI, vol. 10(5), pages 1-27, April.
    2. Shejun Deng & Yingying Yuan & Yong Wang & Haizhong Wang & Charles Koll, 2020. "Collaborative multicenter logistics delivery network optimization with resource sharing," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-31, November.
    3. 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.
    4. Mehmet Onur Olgun, 2022. "Collaborative airline revenue sharing game with grey demand data," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 861-882, September.
    5. 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.
    6. Adil Baykasoğlu & Burcu Kubur Özbel, 2021. "Explicit flow-risk allocation for cooperative maximum flow problems under interval uncertainty," Operational Research, Springer, vol. 21(3), pages 2149-2179, September.
    7. Seung Yoon Ko & Ratna Permata Sari & Muzaffar Makhmudov & Chang Seong Ko, 2020. "Collaboration Model for Service Clustering in Last-Mile Delivery," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
    8. 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.
    9. Yue Lu & Maoxiang Lang & Xueqiao Yu & Shiqi Li, 2019. "A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro–China Expressway," Sustainability, MDPI, vol. 11(19), pages 1-25, October.
    10. Lozano, Miguel A. & Serra, Luis M. & Pina, Eduardo A., 2022. "Optimal design of trigeneration systems for buildings considering cooperative game theory for allocating production cost to energy services," Energy, Elsevier, vol. 261(PB).
    11. 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.
    12. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    13. Liu, Dan & Yan, Pengyu & Pu, Ziyuan & Wang, Yinhai & Kaisar, Evangelos I., 2021. "Hybrid artificial immune algorithm for optimizing a Van-Robot E-grocery delivery system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    14. Li, Hongqi & Wang, Haotian & Chen, Jun & Bai, Ming, 2020. "Two-echelon vehicle routing problem with time windows and mobile satellites," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 179-201.
    15. 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.
    16. 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.
    17. 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.
    18. Defryn, Christof & Sörensen, Kenneth & Dullaert, Wout, 2019. "Integrating partner objectives in horizontal logistics optimisation models," Omega, Elsevier, vol. 82(C), pages 1-12.
    19. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    20. Guajardo, Mario & Jörnsten, Kurt, 2015. "Common mistakes in computing the nucleolus," European Journal of Operational Research, Elsevier, vol. 241(3), pages 931-935.

    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:jsusta:v:11:y:2019:i:12:p:3492-:d:242892. 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.