Improved ant colony algorithm and application for vehicle routing problem

Author

Jianhua Zhang ; Zhe Zhang

Author_Institution

Gen. Educ. Center, Beijing Normal Univ., Zhuhai, China

Volume

2

fYear

2011

fDate

20-22 Aug. 2011

Firstpage

424

Lastpage

427

Abstract

In the logistics industry, according to the different tasks and reasonable transport vehicle scheduling, is to save transportation costs and increase economic benefits must be considered. This task needs to start talking, analysis of the features and characteristics of VRP, how to improve the basic ant colony algorithm, will be introduced and used to solve the VRP problem. According to the characteristics of its data structure, the Waiting Queue", "Task List" and "Taboo List" and other integrated data processing measures used in the search algorithm, making the algorithm more general meaning.

Keywords

data structures; industrial economics; logistics; optimisation; scheduling; search problems; transportation; VRP problem; ant colony algorithm; data structure; economic benefits; integrated data processing; logistic industry; search algorithm; taboo list; task list; transport vehicle scheduling; transportation costs; vehicle routing problem; waiting queue; Algorithm design and analysis; Cities and towns; Heuristic algorithms; Logistics; Probability; Vehicles; ant colony algorithm; logistics; vrp;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Technology and Artificial Intelligence Conference (ITAIC), 2011 6th IEEE Joint International

Conference_Location

Chongqing

Print_ISBN

978-1-4244-8622-9

Type

conf

DOI

10.1109/ITAIC.2011.6030364

Filename

6030364