Title :
Research on Optimal Loading Problem with Category Restriction for Railway Specific Goods
Author :
Wang Hai-xing ; Li Zhen-jiang
Author_Institution :
Beijing Jiaotong Univ., Beijing, China
Abstract :
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.
Keywords :
goods distribution; optimisation; railways; category restriction; collaborative ant colony algorithm; optimal loading problem; railway specific goods; Ant colony optimization; Capacity planning; Chemical processes; Collaboration; Collaborative tools; NP-complete problem; Rail transportation; Space vehicles; Vehicle safety; Ant Colony Algorithm; Optimal Loading Problem with Category Restriction; Railway Specific Goods Transportation;
Conference_Titel :
Advanced Computer Control (ICACC), 2010 2nd International Conference on
Conference_Location :
Shenyang
Print_ISBN :
978-1-4244-5845-5
DOI :
10.1109/ICACC.2010.5487066
