Improved Genetic Algorithm of Vehicle Routing Problems with Time Window for Military Logistic Distribution
By changing the constrain conditions of delivery time windows and vehicle capacities to objective function, A vehicle scheduling model was built up based on minimum length of total transportation distance, which included penalty function terms of time window and vehicle capacity constrains, and the model characteristics and application prospects was analyzed. A improved Genetic Algorithm program was put forward to solve the model, in which a chromosome coding suitable to describe delivery routes was designed, a suitable-degree function was proposed, and a reproduction operator, a crossover operator and a mutation operator were constructed. An example was given to demonstrate feasibility of the algorithm. The study indicates that the Algorithm has higher algorithm efficiency and can effectively solve vehicle scheduling problems of military distribution centers.
Robin G. Qiu and Yongfeng Ju
Z. G. Zhang and Y. C. Gong, "Improved Genetic Algorithm of Vehicle Routing Problems with Time Window for Military Logistic Distribution", Applied Mechanics and Materials, Vols. 135-136, pp. 585-591, 2012