Ant colony algorithm based on genetic method for continuous optimization problem
Tóm tắt
A new algorithm is presented by using the ant colony algorithm based on genetic method (ACG) to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions.
Tài liệu tham khảo
Dortgo M, Maniezzo V, Colorni A. Ant system: optimization by a colony cooperating agents [J]. IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics, 1996, 26(1): 29–41.
Dortgo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem [J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53–66.
Maniezzo V, Carbonaro A. An ANTS heuristic for the frequency assignment problem [J]. Future Generation Computer Systems, 2000, 16: 927–935.
Hadeli, Valckenaers P. Multi-agent coordination and control using stigmergy [J]. Computers in Industry, 2004, 53(1): 75–96.
Eggers J, Feillet D. Optimization of the key-board arrangement problem using an Ant Colony algorithm [J]. European Journal of Operational Research, 2003, 148(3): 672–686.
Ding Jian-li, Chen Zeng-qiang. On the combination of genetic algorithm and ant algorithm [J]. Journal of Computer Research and Development, 2003, 40(9): 1351–1356 (in Chinese).
Jiang Jia-fu, Chen Rong-yuan. A multiple constrained QoS routing based on immune-ant algorithm[J]. Journal of China Institute of Communications, 2004, 25(8): 89–95 (in Chinese).
Shao Xiao-wei, Shao Chang-sheng. Ant colony genetic algorithm using pheromone remaining [J]. Control and Decision, 2004, 19(10): 1187–1189 (in Chinese).
Chen Ling, Shen Jie. A method for solving optimization problem in continuous space by using ant colony algorithm [J]. Journal of Software, 2002, 13(12): 2317–2322 (in Chinese).
Xin Y, Yong L. Evolutionary programming made faster [J]. IEEE Transations on Evolutionary Computation, 1999, 3(2): 82–102.