TY - JOUR AU - Jin, C. AU - Lu, L.J. AU - Min, J.N. TI - A two-stage construction heuristic approach for vehicle routing problem with split deliveries and pickups: Case studies and performance comparison JO - Advances in Production Engineering & Management PY - 2022 VL - 17 IS - 1 SP - 121 EP - 133 DO - https://doi.org/10.14743/apem2022.1.425 UR - https://apem-journal.org/Archives/2022/Abstract-APEM17-1_121-133.html SN - 1854-6250 AB - The vehicle routing problem with split deliveries and pickups is a hot research topic in recent years, where a customer can be served multiple times with split deliveries and pickups. The objective is to minimize the travel distance, use the fewest number of vehicles and increase the load rate, which will further reduce the carbon emissions that damage the environment. In this paper, we use a two-stage construction heuristic approach to solve this problem. First, partitioning algorithms based on the multi-restart-iterative sweep algorithm are adopted to partition the customer domain into sub-domains according to the vehicle capacity, and to determine the split points and the corresponding values. Second, a modified Clarke-Wright savings algorithm is used to check the possibility of each point in each route based on the load of each point and the vehicle load limitation. The three case studies with 12 instances per each from the reconstructed Solomon benchmark datasets were conducted to evaluate the effectiveness and feasibility of the proposed approaches-Unsplit, Both-Split and Enhanced-Both-Split. The comparison among these approaches reveals that the splits reduce the total travel cost and vehicles used, and increase the average loading rate considerably, especially when customers have larger demand values. Our computation results proves that the vehicle routing problem with split deliveries and pickups is highly beneficial for transportation and logistics enterprises. KW - Vehicle routing KW - Split deliveries and pickups KW - Two-stage construction heuristic KW - Clustering first and routing later KW - Partitioning algorithms KW - Modified Clarke-Wright savings algorithm ER -