Application of Collaborative Ant Colony Algorithm for Railway Optimal Stowage Problem with Category Restriction

被引:2
作者
Wang Hai-xing [1 ]
Li Zhen-jiang [1 ]
机构
[1] Beijing Jiaotong Univ, Beijing 100044, Peoples R China
来源
2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 2 | 2010年
关键词
VEHICLE-ROUTING PROBLEM;
D O I
10.1109/CAR.2010.5456622
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Collaborative ant colony algorithm (ACA) was presented for Railway Optimal Stowage Problem with Category Restriction (ROSPCR). Having distinguished the differences of specific volume between the used loading capacity and the remained, a new ACA is devised. Then improvement concerning the rules of route construction and pheromone updating is adopted on the basis of former algorithm to optimize the loading capacity and volume of vehicles, besides the least number of vehicles needed in various conditions, thus making the algorithm a more practical one. Finally an example is put forward and analyzed, proving that the ACA designed in this paper is feasible and efficient in determining the optimal loading plan with ROSPCR.
引用
收藏
页码:67 / 70
页数:4
相关论文
共 6 条
[1]  
[Anonymous], 2004, Electronic Notes in Discrete Mathematics, DOI DOI 10.1016/J.ENDM.2004.06.029
[2]   Ant colony optimization techniques for the vehicle routing problem [J].
Bell, JE ;
McMullen, PR .
ADVANCED ENGINEERING INFORMATICS, 2004, 18 (01) :41-48
[3]  
Gambardella LM, 1999, IDSIA0699
[4]  
GAO HM, 2008, TRAFFIC COMPUTER, V26, P11
[5]   D-Ants: Savings Based Ants divide and conquer the vehicle routing problem [J].
Reimann, M ;
Doerner, K ;
Hartl, RF .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) :563-591
[6]  
SUN Y, 1997, J CHANGSHA RAILWAY U, V15, P33