Genetic algorithm for vehicle routing problem with time windows and a limited number of vehicles

This paper improves the mathematical model for the vehicle routing problem with time windows where a limited number of vehicles is given, which not only reflects the feature of the limited number of vehicles in the depot, but also is compatible with VRPTW; redefines the distance between the customers used in the customer clustering, designs the customer clustering assignment algorithm, which can help achieve the initialization of the genetic algorithm and provides a new method for VRPTW customer clustering assignment; proposes an improved chromosome representation on the basis of customer, which can denote the different vehicle number sent by the depot and the customers unserviced; designs the genetic algorithm to solve m-VRPTW, and proves the validity of the algorithm by the experiments.