By Topic

Solving capacitated vehicle routing problem based on improved genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Jie-sheng ; Sch. of Electron. & Inf. Eng., Liaoning Univ. of Sci. & Technol., Anshan, China ; Liu Chang ; Zhang Ying

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.

Published in:

Control and Decision Conference (CCDC), 2011 Chinese

Date of Conference:

23-25 May 2011