The vehicle routing problem with split deliveries and pickups is an important research topic in which deliveries and pickups to and from each customer are split into multiple visits. The objective is to minimize the travel distance while using the fewest vehicles. Therefore, this paper proposes a two-stage constructive heuristic approach to solve this problem. First, revised sweep algorithms are adopted to partition the customer domain into sub-domains limited in vehicle capacity and customer deliveries and pickups. Second, a modified Clarke-Wright saving algorithm is used to optimize the route in each sub-domain from the delivery and pickup demands of each point. The reconstructed Solomon benchmark datasets were adopted to evaluate the proposed algorithms. The computational results indicate that the proposed algorithms are feasible and efficient in reducing the total travel distance, decreasing the number of vehicles used, and increasing the average loading rate.
A Two-Stage Heuristic Approach for Split Vehicle Routing Problem with Deliveries and Pickups
Lecture Notes in Operations res.
2022-01-28
13 pages
Article/Chapter (Book)
Electronic Resource
English
Vehicle Routing Problem: Simultaneous Deliveries and Pickups with Split Loads and Time Windows
Online Contents | 2013
|The Vehicle Routing Problem with Divisible Deliveries and Pickups
Online Contents | 2013
|The Vehicle Routing Problem with Divisible Deliveries and Pickups
British Library Online Contents | 2015
|Carbon Emissions Reduction in Vehicle Routing Problems with Split Deliveries and Pickups
Springer Verlag | 2023
|Study on Low-Carbon Emissions in Vehicle Routing Problems with Split Deliveries and Pickups
Springer Verlag | 2023
|