Study on Improved Genetic Algorithm for Min-Max Vehicle Routing Problem

Abstract:

Article Preview

The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). Improved genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply insertion method so as to improve the feasibility; retain the best selection so as to guard the diversity of group; adopt self-adaptive method to strengthen the partial searching ability of chromosome. Finally, the good performance of improved algorithm can be proved by experiment calculation and concrete examples.

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1266-1269

DOI:

10.4028/www.scientific.net/AMR.225-226.1266

Citation:

C. Y. Ren "Study on Improved Genetic Algorithm for Min-Max Vehicle Routing Problem", Advanced Materials Research, Vols. 225-226, pp. 1266-1269, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.