DocumentCode :
3583013
Title :
Solving a shortest path problem by ant algorithm
Author :
Fan, Hui ; Hua, Zhen ; Li, Jin-Jiang ; Yuan, Da
Author_Institution :
Dept. of Comput. Sci., Shandong Inst. of Bus. & Technol., Yantai, China
Volume :
5
fYear :
2004
Firstpage :
3174
Abstract :
In this paper, we present a method of solving a shortest path problem by ant algorithm. Taking coal concentrated-station as example, where should we found the station, in a certain range, to minimize the total transporting cost. The corresponding mathematical model is founded. Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years, and it effectively resolves the shortest path problem in the paper.
Keywords :
cost reduction; graph theory; search problems; stochastic programming; transportation; ant algorithm; coal concentrated station; mathematical model; shortest path problem; stochastic searching optimization algorithm; transporting cost minimization; Computer science; Costs; Machine learning; Mathematical model; Production; Rail transportation; Road transportation; Shortest path problem; Stochastic processes; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
Type :
conf
DOI :
10.1109/ICMLC.2004.1378581
Filename :
1378581
Link To Document :
بازگشت