An Effective Genetic Algorithm for the Vehicle Routing Problem with Time Windows

Abstract:

Article Preview

The vehicel routing problem with time windows (VRPTW) was considered in this paper, and a genetic algorithm (GA) for the proposed problem was designed to minimize total travel distance. Finally we tested the proposed approach with Solomon’s test set, the experimental results show that the proposed GA is very effective compared with other approaches pulished recently.

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Edited by:

Yanwen Wu

Pages:

247-250

DOI:

10.4028/www.scientific.net/KEM.439-440.247

Citation:

C. S. Liu and F. H. Huang, "An Effective Genetic Algorithm for the Vehicle Routing Problem with Time Windows", Key Engineering Materials, Vols. 439-440, pp. 247-250, 2010

Online since:

June 2010

Export:

Price:

$35.00

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

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