Improved Ant Colony Algorithm and Application for Vehicle Routing Problem
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.
ant colony algorithm vrp logistics
Jianhua Zhang Zhe Zhang
General Education Center Beijing Normal University Zhuhai Campus,Zhuhai, Guangdong Province, China Technical Logistics, University Duisburg-Essen,Duisburg, Germany
国际会议
重庆
英文
927-930
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）