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

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

DOI QR Code

S-MINE Algorithm for the TSP

TSP 경로탐색을 위한 S-MINE 알고리즘

  • 황숙희 (건국대학교 컴퓨터공학과) ;
  • 원일용 (서울호서전문학교 사이버해킹보안과) ;
  • 고성범 (공주대학교 컴퓨터공학부) ;
  • 이창훈 (건국대학교 컴퓨터공학과)
  • Received : 2010.11.04
  • Accepted : 2011.02.14
  • Published : 2011.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

There are a lot of people trying to solve the Traveling Salesman Problem (TSP) by using the Meta Heuristic Algorithms. TSP is an NP-Hard problem, and is used in testing search algorithms and optimization algorithms. Also TSP is one of the models of social problems. Many methods are proposed like Hybrid methods and Custom-built methods in Meta Heuristic. In this paper, we propose the S-MINE Algorithm to use the MINE Algorithm introduced in 2009 on the TSP.

메타 휴리스틱 알고리즘을 이용해 TSP (Traveling Salesman Problem) 문제를 풀고자 하는 많은 시도가 이루어지고 있다. TSP 문제는 대표적인 NP_Hard 문제로 탐색 알고리즘이나 최적화 알고리즘을 실험하는데 많이 사용되고 있으며, 복잡한 사회의 많은 문제들의 표준 모델로 제시되고 있다. 본 논문에서는 2009년 제안된 MINE 알고리즘을 TSP 에 적용시켜 메타 휴리스틱 알고리즘으로서의 탐색성능을 알아보고자 하였다. 이에 S-MINE (Search - MINE) 알고리즘을 제안하였으며, TSP 에 적용하여 그 결과를 고찰하였다.

Keywords

References

  1. S. Lin and B.W. Kernighan, "An Effective Heuristic Algorithm for the Traveling Salesman Problem," Bell Telephone Laboratories, Incorporated, Murray Hill, N.J. 1971.
  2. M.R. Garey and D.S. Johson, "A Guide to the Theory of NP-Completeness", Computers and Intractability, Freeman, 1979.
  3. B. Freisleben and P. Merz, "Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC96, IEEE Press, pp.616-621, 1996. https://doi.org/10.1109/ICEC.1996.542671
  4. Zhong Yiwen, Yang Xiangang, Ning zhengyuan. "A Discrete Particle Swarm Optimization Algorithm for Solving Traveling alesman Problem," System Engineering and Theory Practice, pp.88-94, 2006.
  5. 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, 1997. https://doi.org/10.1109/4235.585892
  6. Christian Blum and Andrea Roli, "Metaheuristics in combinatorial optimization: overview and Conceptual comparison," ACM Computing Surveys, Vol.35, pp.268-308, 2003. https://doi.org/10.1145/937503.937505
  7. L. Bianchi, M. Dorigo, L.M. Gambarella, and W.J. Gutjahr, "A survey on metaheuristics for Stochastic combinatorial optimization," Natural Computing, 2008.
  8. Sarayut Nonsiri an Siriporn Supratid, "Modifying Ant Colony Optimization," IEEE conference on soft computing in industrial applications, 2008. https://doi.org/10.1109/SMCIA.2008.5045942
  9. X. Hu, R.C. Eberhart, and Y. Shi, "Swarm Intelligence for permutation Optimization: a case study of n-queens problem," in proceedings of the IEEE Swarm Intelligence Symposium, Indianapolis, USA, April, pp.243-246, 2003. https://doi.org/10.1109/SIS.2003.1202275
  10. 고성범, "Mine 알고리즘: 인간의 행동을 모방한 메타휴리스틱", 정보처리논문지, 제16-B권 제5호, pp.411-426, 2009. https://doi.org/10.3745/KIPSTB.2009.16B.5.411
  11. 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
  12. Moscato, P. "Memetic algorithms: A short introduction," In corne, D., et al, eds: New Ideas in Optimization. McGraw Hill, pp.219-234, 1999.
  13. Puchinger, J., Raidl, G.R., "Modules and Algorithms for Three-stage two-dimensional bin Packing," European Journal of Operational Research, Feature Issue on Cutting and Packing, 2006.
  14. TSPLIB - A Traveling Salesman Problem Library.http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
  15. D.E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," Addison-Wesley, 1989.
  16. Z. Michalewicz, "Genetic Algorithms + Data structure = Evolution Program," Springer-Verlag, 1992.
  17. Dorigo M., Maniezzo V., Colorni A., "The Ant System: Optimization by a Colony of Cooperating Agents," IEEE trans. Syst. Man Cybern B 26, pp.29-41, 1996. https://doi.org/10.1109/3477.484436
  18. Dorigo M., Gambardella L.M., " Ant Colony System: A Cooperative Learning Approach," IEEE Trans. Evol. Comp.1, pp.53-66, 1997. https://doi.org/10.1109/4235.585892
  19. Raed Abu Zitar, Huessein Hiyassat, "Optimizating the parameters of Ant colony Algorithm Using the Genetics," Enformatika Transaction on Engineering, Computing and Technology VI, December, pp.228-231, 2004.
  20. J. Kennedy and R. Eberhart, "Particle Swarm Optimization," IEEE conference of Neural Network, Vol.IV, pp.1942-1948, 1995.
  21. J. Kennedy, "The Particle Swarm: Social adaptation of knowledge," IEEE conference of Evolutionary Computing, pp.303-308, 1997. https://doi.org/10.1109/ICEC.1997.592326
  22. X.H. Shi, Y.C. Liang, H.P. Lee, C. Lu, and L.M. Wang, "An improved GA and novel PSO-GA-based hybrid algorithm," Information Processing Letters, 1993.
  23. 고성범, "인터넷기반 의사결정 공간의 설계" GS 인터비젼, 2010.
  24. 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