Collaborative multicenter vehicle routing problem with time windows and mixed deliveries and pickups

被引:33
|
作者
Wang, Yong [1 ]
Ran, Lingyu [1 ]
Guan, Xiangyang [2 ]
Fan, Jianxin [3 ]
Sun, Yaoyao [1 ]
Wang, Haizhong [4 ]
机构
[1] Chongqing Jiaotong Univ, Sch Econ & Management, Chongqing 400074, Peoples R China
[2] Univ Washington, Dept Civil & Environm Engn, Seattle, WA 98195 USA
[3] Chongqing Jiaotong Univ, Sch River & Ocean Engn, Chongqing 400074, Peoples R China
[4] Oregon State Univ, Sch Civil & Construct Engn, Corvallis, OR 97330 USA
基金
中国国家自然科学基金;
关键词
Vehicle routing problem with time windows  and mixed deliveries and pickups; Transportation resource sharing; 3D k-means clustering algorithm; Collaborative alliance; Space-time distance; PARTICLE SWARM OPTIMIZATION; ITERATED LOCAL SEARCH; HEURISTIC ALGORITHMS; REVERSE LOGISTICS; COST ALLOCATION; HORIZONTAL COOPERATION; NEIGHBORHOOD SEARCH; PROFIT-DISTRIBUTION; PROBLEM MODEL;
D O I
10.1016/j.eswa.2022.116690
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study focuses on the collaborative multicenter vehicle routing problem with time windows and mixed deliveries and pickups (CMVRPTWMDP), which is a variant of the vehicle routing problem (VRP) with mixed deliveries and pickups, and VRP with simultaneous deliveries and pickups and time windows. Collaboration and transportation resource sharing are adopted to optimize vehicle routes in the CMVRPTWMDP, to integrate the delivery and pickup services with time windows, and to construct open-closed mixed vehicle routes. First, the CMVRPTWMDP is formulated as a mixed-integer programming model to minimize logistics operating costs. The effect of transportation resource sharing on reducing the number of needed vehicles and the maintenance cost is considered in the model formulation. Second, a two-stage hybrid algorithm combining customer clustering and vehicle routing optimization is designed to solve the CMVRPTWMDP. An improved 3D k-means clustering algorithm based on space-time distances and the customer demand is proposed to reassign customers to logistics facilities (e.g., delivery or pickup centers). Furthermore, a hybrid heuristic algorithm that combines the genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, called GA-PSO, is designed to optimize the vehicle routes. A coordination operator between GA and PSO is designed to allow particles and chromosomes to interact, increasing the diversity of particle swarms and the possibility of finding a feasible solution. Third, the performance and effectiveness of the proposed approach are tested by comparing them with the CPLEX solver using 30 small-scale instances and other existing algorithms using 25 benchmark instances. Fourth, the minimum costs-remaining savings (MCRS) model is adopted to design a fair and reasonable profit allocation scheme for participants in the collaborative alliance and maintain alliance stability. Finally, the optimization results of a real-world case study from Chongqing, China, show that transportation resource misuse and logistics operating costs are significantly reduced, demonstrating the proposed approach's effectiveness and applicability. This study provides insights for logistics enterprises and transportation departments on effectively allocating and utilizing the transportation resources and optimizing the local logistics network.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] Vehicle Routing Problem with Time Windows and Simultaneous Pickups and Deliveries
    Liang Chun-Hua
    Zhou Hong
    Zhao Jian
    [J]. 2009 IEEE 16TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2009, : 685 - 689
  • [2] Vehicle Routing Problem Simultaneous Deliveries and Pickups with Split Loads and Time Windows
    Wang, Yong
    Ma, Xiaolei
    Lao, Yunteng
    Wang, Yinhai
    Mao, Haijun
    [J]. TRANSPORTATION RESEARCH RECORD, 2013, (2378) : 120 - 128
  • [3] An Improved Genetic Algorithm for Vehicle Routing Problem with Simultaneous Pickups and Deliveries and Time Windows
    Huang Wulan
    Zhang Tao
    [J]. PROCEEDINGS OF THE 35TH CHINESE CONTROL CONFERENCE 2016, 2016, : 9639 - 9643
  • [4] A heuristic method for the vehicle routing problem with mixed deliveries and pickups
    Niaz A. Wassan
    Gábor Nagy
    Samad Ahmadi
    [J]. Journal of Scheduling, 2008, 11 : 149 - 161
  • [5] A heuristic method for the vehicle routing problem with mixed deliveries and pickups
    Wassan, Niaz A.
    Nagy, Gabor
    Ahmadi, Samad
    [J]. JOURNAL OF SCHEDULING, 2008, 11 (02) : 149 - 161
  • [6] A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
    Gutierrez-Jarpa, Gabriel
    Desaulniers, Guy
    Laporte, Gilbert
    Marianov, Vladimir
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 341 - 349
  • [7] An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows
    Lai Mingyong
    Cao Erbao
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (02) : 188 - 195
  • [8] The Vehicle Routing Problem with Divisible Deliveries and Pickups
    Nagy, Gabor
    Wassan, Niaz A.
    Speranza, M. Grazia
    Archetti, Claudia
    [J]. TRANSPORTATION SCIENCE, 2015, 49 (02) : 271 - 294
  • [9] Vehicle routing problem with simultaneous deliveries and pickups
    Chen, JF
    Wu, TH
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (05) : 579 - 587
  • [10] Vehicle Routing Problem with Simultaneous Pickups and Deliveries and Time Windows Considering Fuel Consumption and Carbon Emissions
    Hao Gang
    Gou Zhijing
    Yang Peng
    Sun Junqing
    [J]. PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 3000 - 3005