Vehicle routing optimization problem with time-windows and its solution by genetic algorithm

Vehicle Routing Problem (VRP) is a hot issue in the field of logistics. Furthermore, the Vehicle Routing Problem with Time-Windows (VRPTW) is an additional constraint of the customer access time windows based on the VRP. It becomes a noticeable problem with the development of logistics distribution and the just-intime distribution demand from customers, which increases a visiting window to traditional VRP. This paper firstly analyzes the distribution vehicle scheduling optimization problem with time-windows. Subsequently, through transforming the capacity and soft time-windows constraint into objective constraint, the authors establish a non-full loaded VSP model. Moreover, genetic algorithm is used to solve this problem, where natural number is adopted to realize problem coding and the maximum reservation crossover and improved inverse mutation technology are used to generate new individuals. Finally through the simulation experiment, the results verify its feasibility and effectiveness.