Genetic Algorithm for Variable Fleet Vehicle Routing Problem with Time Window
不确定车辆数的有时间窗车辆路径问题的遗传算法

Because the fixed cost of a vehicle is much more than the running cost, it is effective to cut down the total cost to seek the minimum number of vehicles in Vehicle Routing Problem with Time Window (VRPTW). This paper presents a mathematical model of variable fleet VRPTW. A new chromosome code that can express various vehicle number in Genetic Algorithm (GA) is developed from the code based on customers. The GA can search for optimal solution on both route length and vehicle number, which is proved by an experiment, and several points in the optimal process are discussed.