Applying Genetic Algorithm for Min-Max Vehicle Routing Problem

Abstract:

Article Preview

The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). 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 2- exchange mutation operator to strengthen the partial searching ability of chromosome. Secondly, the improved route crossover operation can avoid destroying good gene parts. Finally, the good performance of improved algorithm can be proved by experiment calculation and concrete examples

Info:

Periodical:

Edited by:

Shucai Li

Pages:

640-643

DOI:

10.4028/www.scientific.net/AMM.97-98.640

Citation:

C. Y. Ren "Applying Genetic Algorithm for Min-Max Vehicle Routing Problem", Applied Mechanics and Materials, Vols. 97-98, pp. 640-643, 2011

Online since:

September 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.