Solving capacitated vehicle routing problem based on improved genetic algorithm

Aiming at the capacitated vehicle routing problem (CVRP) in the matter stream delivery field, an improved genetic algorithm (GA) based on local mutation operator is adopted. Two layers chromosome coding scheme is designed which can improve initial solutions. This coding method can insure that the sub-routing is effective to satiety the vehicle capacitated constraints. These improved measures have important significance to depress procedural intricacy degree, advance convergence of algorithm velocity and algorithmic local search ability. The simulation experiment results show the improved genetic algorithm compared with BGA can achieve better optimization results and has better efficiency to solve CVRP.