The Research on VRP Based on Max-Min Ant Colony Algorithm

Abstract:

Article Preview

Vehicle routing problem (VRP) is the key to reducing the cost of logistics, and also an NP-hard problem. Ant colony algorithm is a very effective method to solve the VRP, but it is easy to fall into local optimum and has a long search time. In order to overcome its shortcomings, max-min ant colony algorithm is adopted in this paper, and its simulation system is designed in GUI of MATLAB7.0. The results show that the vehicle routing problem can well achieves the optimization of VRP by accessing the simulation data of database.

Info:

Periodical:

Advanced Materials Research (Volumes 219-220)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

1285-1288

DOI:

10.4028/www.scientific.net/AMR.219-220.1285

Citation:

C. M. Chen et al., "The Research on VRP Based on Max-Min Ant Colony Algorithm", Advanced Materials Research, Vols. 219-220, pp. 1285-1288, 2011

Online since:

March 2011

Export:

Price:

$35.00

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

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