정보처리학회논문지B (The KIPS Transactions:PartB)

한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

Mine 알고리즘 : 인간의 행동을 모방한 메타휴리스틱

Mine Algorithm : A Metaheuristic Imitating The Action of The Human Being

  • 고성범 (공주대학교 컴퓨터공학부)
  • 발행 : 2009.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

대부분의 메타휴리스틱들은 동물의 행동을 모방한 것이다. 본 논문에서는 Mine 알고리즘을 제안한다. Mine 알고리즘(Mine Algorithm)은 인간의 행동을 모방한 메타휴리스틱이다. 탐색의 관점에서 인간의 노하우와 휴리스틱이 가장 잘 녹아 있는 업종은 광산업(mining industry)이다. Mine 알고리즘에서는 광산 업무에 초점을 맞추어서 인간의 행동패턴을 형식화한다. Mine 알고리즘은 다양한 탐색기법을 유연하게 구사하며, 그 때문에 광범위한 문제에서 고른 성능을 보인다. 즉, 범용성이 양호하다. 우리는 기존 메타휴리스틱들과의 비교 실험을 통하여 Mine 알고리즘의 개선된 범용성을 보인다.

Most of the metaheuristics are made by imitating the action of the animals. In this paper, we proposed Mine Algorithm. The Mine Algorithm is a metaheuristic that imitates the action of the human being. Speaking of search, the field in which the know-how and the heuristics of the human being are melted best is the mining industry. In the Mine Algorithm we formalize the action pattern of the human being by focusing the mine business. The Mine Algorithm uses various searching techniques fluently and shows equally good performance for broad problems. That is, it has good generality. We show the improved generality of the Mine Algorithm by the comparing experiments with the conventional metaheuristics.

키워드

참고문헌

  1. F. Glover, "Future paths for integer programming and links to artificial intelligence," Computers and Operations Research, Vol.13, No.5, pp.533-549, 1986. https://doi.org/10.1016/0305-0548(86)90048-1
  2. Christian Blum and Andrea Roli, "Metaheuristics in combinatorial optimization: overview and conceptual comparison," ACM Computing Surveys, Vol.35, No.3, pp.268-308, 2003. https://doi.org/10.1145/937503.937505
  3. L. Bianchi, M. Dorigo, L.M. Gambardella, and W.J. Gutjahr, "A survey on metaheuristics for stochastic combinatorial optimization," Natural Computing, 2008. https://doi.org/10.1007/s11047-008-9098-4
  4. David E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," Addison-Wesley, 1989.
  5. M. Clerc, "Particle Swarm Optimization," ISTE, 2006.
  6. M. Dorigo, M. Birattari, and T. Stutzle, "Ant colony optimization," IEEE Computational Computer Science, Vol.344, pp.28-39, 2006.
  7. J. De Vicente, J. Lanchares, R. Hermida, "Placement by Thermodynamic Simulated Annealing," Physics Letters A, Vol.317, Issue 5-6, pp.415-423, 2003. https://doi.org/10.1016/j.physleta.2003.08.070
  8. Cvijovic, D.; Klinowski, J. "Taboo search - an approach to the multiple minima problem," Science 267, 664-666, 1995. https://doi.org/10.1126/science.267.5198.664
  9. Rusell, Stuart J. Norvig, Peter, "Artificial Intelligence : A Modern Approach (2nd ed)," Upper Saddle River, Nj: Prentice Hall, pp.11-114, 2003.
  10. Solis, F.J and Wets, R.J, "Minimization by random search techniques," Mathematics of operations research, Vol.6, No.1, pp.19-30, 1981. https://doi.org/10.1287/moor.6.1.19
  11. Moscato, P. "Memetic algorithms : A short introduction," In Corne, D., et al, eds: New Ideas in Optimization. McGraw Hill, pp. 219-234, 1999.
  12. Glover, F. Laguna, M. Marti, R, "Fundamentals of Scatter Search and Path Relinking," Control and Cybernetics 39(3) 653-684, 2000.
  13. Puchinger, J., Raidl, G.R, "Modles and Algorithms for Three-stage two-dimensional bin Packing," European Journal of Operational Research, Feature Issue on Cutting and Packing, 2006. https://doi.org/10.1016/j.ejor.2005.11.064
  14. Conor Ryan, J.J. Collins, Jj collins, Michael Oneill, "Grammatical Evolution: Evolving programs for an Arbitrary Language," Proceedings of the First European Workshop on Genetic Programming, 1998. https://doi.org/10.1007/BFb0055930
  15. 박찬란외, "유전자와 역전파 알고리즘을 이용한 효율적인 윤곽 선 추출", 정보처리학회논문지, 제5권 제11호, pp.3010-3023, 1998.
  16. Alba, E., ed, "Parallel Metaheuristics, a New Class of Algorithms," John Wiley, New Jersey, 2005.
  17. Tan, Kok Kiong; Wang Qing-Gu, Hang Chang Chieh, "Advances in PID Control", London, UK: Springer-Verlag, 1999.
  18. 김여근, 윤복식, 이상복 공저, "메타휴리스틱", 영지문화사, 1997.
  19. 오일석, "패턴 인식", 교보문고, 2008.
  20. Gonzalez, Teofilo F., "Handbook of Approximation Algorithms And Metaheuristics," Taylor & Francis, 2007.
  21. Dreo, J., Petrowski, A., Siarry, P., Taillard, E., "Metaheuristics For Hard Optimization, Springer Verlag, 2005.
  22. L. Bianchi, L.M. Gambardella et M.Dorigo, "An ant colony optimization approach to the probabilistic traveling salesman problem," PPSN-VII, Seventh International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer Verlag, Berlin, Allemagne, 2002. https://doi.org/10.1007/3-540-45712-7_85

피인용 문헌

  1. S-MINE Algorithm for the TSP vol.18B, pp.2, 2011, https://doi.org/10.3745/KIPSTB.2011.18B.2.073