Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

This paper studies capacitated vehicle routing problem. Since the standard genetic algorithm is short of convergent speed and partial searching ability as well as easily premature, improved genetic algorithm is then adopted as an optimized solution. Firstly, sequence of real numbers coding is used to simplify the problem; it may construct the initial solution pertinently in order to improve the feasibility. The individual amount control choice strategy can guard the diversity of group. The combined hill-climbing algorithm can strengthen the partial searching ability of chromosome. Finally, comparing to a set of standard test problems, simulation results demonstrate the effectiveness and good quality.