KJCKorea
Journal Central

@article{ART001314907},
author={이승관 and Lee Daeho},
title={Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2009},
volume={14},
number={1},
pages={9-15}

TY - JOUR
AU - 이승관
AU - Lee Daeho
TI - Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved
JO - Journal of The Korea Society of Computer and Information
PY - 2009
VL - 14
IS - 1
PB - The Korean Society Of Computer And Information
SP - 9
EP - 15
SN - 1598-849X
AB - Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.
KW - Ant Colony System;Optimization;Heuristic
DO -
UR -
ER -

이승관 and Lee Daeho. (2009). Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved. Journal of The Korea Society of Computer and Information, 14(1), 9-15.

이승관 and Lee Daeho. 2009, "Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved", Journal of The Korea Society of Computer and Information, vol.14, no.1 pp.9-15.

이승관, Lee Daeho "Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved" Journal of The Korea Society of Computer and Information 14.1 pp.9-15 (2009) : 9.

이승관, Lee Daeho. Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved. 2009; 14(1), 9-15.

이승관 and Lee Daeho. "Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved" Journal of The Korea Society of Computer and Information 14, no.1 (2009) : 9-15.

이승관; Lee Daeho. Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved. Journal of The Korea Society of Computer and Information, 14(1), 9-15.

이승관; Lee Daeho. Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved. Journal of The Korea Society of Computer and Information. 2009; 14(1) 9-15.

이승관, Lee Daeho. Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved. 2009; 14(1), 9-15.

이승관 and Lee Daeho. "Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved" Journal of The Korea Society of Computer and Information 14, no.1 (2009) : 9-15.