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