Research on Optimal Loading Problem with Category Restriction for Railway Specific Goods

摘要：

A new collaborative ant colony algorithm (ACA) is devised to solve Optimal Loading Problem with Category Restriction (OLPCR) for Railway Specific Goods. Improvement 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. 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 OLPCR.

关键词： Optimal Loading Problem with Category Restriction Railway Specific Goods Transportation Ant Colony Algorithm.

作者: WANG Hai-xing LI Zhen-jiang

作者单位: Beijing Jiaotong University,Beijing,100044,China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 328-331

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）