Multiple-Depot Multiple-Type Vehicle Routing Problems Considering the Real Network

Abstract

Vehicle Routing Problem (VRP) is a typical problem of urban distribution, multi-depot vehicle routing problem is a complex extension of vehicle routing problem. Reams of existing research of path optimization problems were assuming different customers have connected directly and using the straight-line distance between two points as the distance between two customers, it is possible in theory, but does not meet the reality of the road network structure, cannot be applied to the actual vehicle schedule. In this paper, considering both customer’s location within a specific service area and the actual road network structure, based on actual customer orders, research the optimal distribution path about multiple distribution centers with different types of vehicles, meet the needs of each customer, taking into account the loading rate of the vehicles, so that the total transport cost is minimal. Considering the earliness of genetic algorithm, this paper combines simulated annealing algorithm, using an improved genetic algorithm and experimentally verify the feasibility and effectiveness of the algorithm, showing that the algorithm can be directly applied to the actual vehicle schedule.