By Topic

An Improved Genetic Algorithm for Vehicle Routing Problem of Non-full Load

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

4 Author(s)
Wang Zhan-feng ; Dept. of Comput., Shijiazhuang Univ. of Econ., Shijiazhuang, China ; Du Hai-lian ; Hu Ji-chao ; Li Guang-xia

The vehicle routing problem is a classical NP (Non-deterministic Polynomial) problem, and it is usually difficult to obtain the satisfied solution by the traditional method. On the basis of analysis of the existing genetic algorithm, the vehicle routing problems is solved through the improved mutation operator and the genetic algorithm of natural number coding scheme. Experiment result indicates that the algorithm can compute the optimal solution rapidly and it is an effective algorithm.

Published in:

Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on  (Volume:2 )

Date of Conference:

21-22 Nov. 2009