摘要
Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.
Ant colony optimization （ACO） is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem （TSP） is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups： scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route＇s muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness.
基金
supported by the National Natural Science Foundation of China(60573159)
作者简介
Rongwei Gan was born in 1982. He is now pursing the Ph.D. in the School of Information Science and Technology of Sun Yat-sen Uni- versity. His research interests include evolu- tionary computation algorithm and combination auction. E-mall： ganrongwei@tom.comQingshun Guo was born in 1959. He is a doc- tor and associate professor at the Department of Computer Science of Sun Yat-sen University. His research interests are enterprise information and combination acution. E-mail： gqs@mail.sysu.edu.cnHuiyou Chang was born in 1962. He is a doctor and professor at the Department of Computer Science of Sun Yat-sen University. His research interests are artificial optimization ＆ intelligent algorithm, data mining and workflow. E-mail： isschy @mail.sysu.edu.cnCorresponding author.Yang Yi was born in 1967. She is a doctor and associate professor at the Department of Com- puter Science of Sun Yat-sen University. Her re- search interests include complex system model- ing and optimization, and evolutionary compu- tation algorithm. E-mall： issyy @ mall.sysu.edu.cn
