The multiple depot vehicle routing problems with mix pickups and deliveries are often met in real-life scenarios of transportation logistics, but it has not received much attention by researchers. In this problem, to allocate borderline customer to appropriate depot is a difficulty to overcome. In this paper, a genetic algorithm is supposed to allocate them. Then the tabu search algorithm is incorporated into the genetic algorithm to solve the single depot vehicle routing problems with mix pickups and deliveries. The proposed algorithm is successfully applied to benchmark instances in the literature, generating new best solutions.
A Hybrid Metaheuristic for the Multiple Depot Vehicle Routing Problems with Mix Pickups and Deliveries
Advanced Materials Research ; 538-541 ; 3230-3234
2012-06-14
5 pages
Article (Journal)
Electronic Resource
English
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
|