DOI QR코드

DOI QR Code

Balance between Intensification and Diversification in Ant Colony Optimization

개미 집단 최적화에서 강화와 다양화의 조화

  • 이승관 (경희대학교 후마니타스칼리지) ;
  • 최진혁 (경희대학교 후마니타스칼리지)
  • Received : 2011.02.16
  • Accepted : 2011.03.09
  • Published : 2011.03.28

Abstract

One of the important fields for heuristic algorithm is how to balance between Intensification and Diversification. In this paper, we deal with the performance improvement techniques through balance the intensification and diversification in Ant Colony System(ACS) which is one of Ant Colony Optimization(ACO). In this paper, we propose the hybrid searching method between intensification strategy and diversification strategy. First, 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. And then we consider the overlapping edge of the global best path of the previous and the current, and, to enhance the pheromone for the overlapping edges increases the probability that the optimal path is configured. Finally, the performance of Best and Average-Best of proposed algorithm outperforms ACS-3-opt, ACS-Subpath, ACS-Iter and ACS-Global-Ovelap algorithms.

Keywords

Ant Colony System;Ant Colony Optimozation;Traveling Salesman Problem;Optimization;Heuristic;Intensification;Diversification

References

  1. L. M. Gambardella and M. Dorigo, "Ant Colony System: A Cooperative Learning approach to the Traveling Salesman Problem," IEEE Transactions on Evolutionary Computation, Vol.1, No.1, pp.53-66, 1997. https://doi.org/10.1109/4235.585892
  2. M. Dorigo, L. M. Gambardella, M. Middendorf and T. Stutzle, "Ant Colony Optimization," IEEE Transactions on Evolutionary Computation, Vol.6, No.4, 2002.
  3. M. Dorigo and C. Blum. "Ant colony optimization theory: A survey," Theoretical Computer Science, 344(2-3), pp.243-278, 2005. https://doi.org/10.1016/j.tcs.2005.05.020
  4. M. Dorigo, M. Birattari, and T. Stutzle, "Ant Colony Optimization - Artificial Ants as a Computational Intelligence Technique," IEEE Computational Intelligence Magazine, Vol.1, No.4, pp.28-39, 2006. https://doi.org/10.1109/CI-M.2006.248054
  5. http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib/tsplib.html
  6. I. K. Kim and M. Y. Youn, "Improved Ant Colony System for the Traveling Salesman Problem," The KIPS transactions. Part B, Vol.12, No.7, pp.823-828, 2005. https://doi.org/10.3745/KIPSTB.2005.12B.7.823
  7. S. G. Lee, "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, 2009.
  8. M. Randall and E. Tonkes, "Intensification and diversification strategies in ant colony system," Complexity International, Vol.9, 2002.
  9. R. Sun, S. Tatsumi and G. Zhao, "Multiagent reinforcement learning method with an improved ant colony system," 2001 IEEE International Conference Systems, Man, and Cybernetics, pp.1612-1617, 2001. https://doi.org/10.1109/ICSMC.2001.973515
  10. S. G Lee and T. C Chung, "Performance Improvement of Cooperating Agents through Balance between Intensification and Diversification," The IEEK journals : CI, Vol.40, No.6, pp.87-94, 2003.
  11. S. G Lee, T. U Jung and T. C Chung, "Improved Ant Agents System by the Dynamic Parameter Decision," Proceedings of IEEE International Conference on FUZZ-IEEE 2001, pp.666-669, 2001 https://doi.org/10.1109/FUZZ.2001.1009042
  12. S. G Lee and T. C Chung, "A Study about Additional Reinforcement in Local Updating and Global Updating for Efficient Path Search in Ant Colony System," The KIPS Transactions : Part B, pp.237-242, 2003. https://doi.org/10.3745/KIPSTB.2003.10B.3.237
  13. S. G. Lee and M. J. Kang, "Ant Colony System for solving the traveling Salesman Problem Considering the Overlapping Edge of Global Best Path," Journal of The Korea Society of Computer and Information, Vol.16, No.3, 2011. In press.

Cited by

  1. An Efficient Search Mechanism for Dynamic Path Selection vol.13, pp.3, 2012, https://doi.org/10.9728/dcs.2012.13.3.451
  2. Bio-Inspired Algorithm for the Shortest Path According to the Maximum Time for Each Trial vol.717, pp.1662-8985, 2013, https://doi.org/10.4028/www.scientific.net/AMR.717.455