Study on VSP with different constraints based on genetic algorithm
基于遗传算法的不同约束条件车辆调度问题研究*

This paper studied the shortest run distances of vehicle scheduling problem (VSP) with different constraints.Established the vehicle scheduling models with different constraints include driving distance, time window, full loads and non-full loads. And then designed genetic algorithm of natural number coding for vehicle scheduling models and improved the cross algorithm of it.Retained the optimal gene transmissibility as much as possible and accelerated the convergence of the algorithm.Finally,verified the model and algorithm through numerical example.