Solving a shortest path problem by ant algorithm

Proceedings of 2004 International Conference on Machine Learning and Cybernetics

Volumn 5, Issue , 2004, Pages 3174-3177

  Fan, Hui ^a,b   Hua, Zhen ^c   Li, Jin Jiang ^a   Yuan, Da ^a  

^a SHANDONG INSTITUTE OF BUSINESS AND TECHNOLOGY   (China)

^b TAIYUAN UNIVERSITY OF TECHNOLOGY   (China)

^c YANTAI UNIVERSITY   (China)

Author keywords

Ant algorithm; Mass center; Tree graph

Indexed keywords

ALGORITHMS; COSTS; MATHEMATICAL MODELS; MOTION PLANNING; OPERATIONS RESEARCH; RANDOM PROCESSES; THEOREM PROVING; TREES (MATHEMATICS);

ANT ALGORITHM; MASS CENTER; TRANSPORTATION COSTS; TREE GRAPH;

PROBLEM SOLVING;

EID: 6344240905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Bonoly J. A and Marty V. R. S., Graph. Theory with Application, Macmillan Press. London 1976.
2. Graph Theory With Application,Written by Lukai Cheng,1981,Qinhua University Press published.
3. Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling saleman problem[J]. IEEE Trans. on Evolutionary Computation, 1997, 1(1): 53-56.
4. th Int. Conf. On Machine Learning. Tahoe City, CA: Morgan Kaufman, 1995, 252-260.
5. Colorni A, etal. Ant system for job-shop scheduling[J]. JORBEL, 1994, 34(1): 39-53.
6. Costa D, Hertz A. Ants can colour graphs[J]. J. of the Opnl. Res. Soc., 1997,48(3): 295-305.
7. DiCaro G, Dorigo M. Mobile agents for adaptive routing[C]. Proc. of the 31th Haw aii Int. Conf. on system. Los Alamitos, CA: IEEE Computer Society Press, 1998, 74-83.
8. Kaelbling L P, Littman L M, Moore A M. Reinforcement Learning: A Survey[J]. Artif. Intell. Res, 1996,4(1): 237-285.
9. th European Conf. on Artificial Life. Boston: MIT Press. 1997, 417-424.