Algorithm Improvement of Sequential Expansion Method About Vehicle Routing Problem
Zhiguang Zhang · Computer and Modernization · 2008
Sequential expansion method is a feasible heuristic algorithm to solve vehicle routing problem(VRP),but in the cases of uneven distribution network and extreme constrains,it is hard to acquire satisfied solution for applying the sequential expansion method.In this paper,sequential expansion method is introduced by an example of postal routes planning in the city,and put forward a improved algorithm of sequential expansion method,by comparing,explained that the improved algorithm can obtain better solution than sequential expansion method.