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

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

DOI QR Code

Solving the Gale-Shapley Problem by Ant-Q learning

Ant-Q 학습을 이용한 Gale-Shapley 문제 해결에 관한 연구

  • 김현 (경희대학교 컴퓨터공학과) ;
  • 정태충 (경희대학교 컴퓨터공학과)
  • Received : 2010.08.04
  • Accepted : 2010.11.29
  • Published : 2011.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose Ant-Q learning Algorithm[1], which uses the habits of biological ants, to find a new way to solve Stable Marriage Problem(SMP)[3] presented by Gale-Shapley[2]. The issue of SMP is to find optimum matching for a stable marriage based on their preference lists (PL). The problem of Gale-Shapley algorithm is to get a stable matching for only male (or female). We propose other way to satisfy various requirements for SMP. ACS(Ant colony system) is an swarm intelligence method to find optimal solution by using phermone of ants. We try to improve ACS technique by adding Q learning[9] concept. This Ant-Q method can solve SMP problem for various requirements. The experiment results shows the proposed method is good for the problem.

본 논문에서는 생물학의 개미들이 학습을 통해 목표를 획득하는 방법을 응용한 Ant-Q 알고리즘(Ant Q learning System)[1]을 Gale-Shapley[2]알고리즘을 통해 제시되었던 안정된 결혼문제(SMP: Stable Marriage Problem)[3]의 새로운 해법을 찾기 위해 적용 하였다. SMP는 남성($m_i$)들과 여성($w_j$)들은 각자 자신이 좋아하는 이상형에 대한 선호도(PL: preference list)를 바탕으로 안정이면서도 최선의 짝을 찾는 것을 목표로 하고 있다. Gale-Shapley 알고리즘은 남성(혹은 여성) 위주로 안정적(stability)인 짝(Matching)을 성사시키므로 다양한 조건을 수용하지 못한다. 본 논문에 적용된 Ant-Q는 개미(Ant)의 페로몬을 활용한 학습인 ACS(Ant colony system)에 강화학습의 일종인 Q-학습[9]을 추가한 방법으로, SMP의 새로운 해법을 찾을 수 있었다.

Keywords

References

  1. Dorigo M. and L.M. Gambardella, "Ant-Q: A Reinforcement Learning Approach to Combinatorial Optimization" Tech. Rep. IRIDIA/95-01, Universite Librede Bruxelles, Belgium. 1995.
  2. D.Gale and L.S.Shapley, "College admissions and the stability of marriage," American Mat hematical Monthly, Vol.69, pp.9-15, 1962. https://doi.org/10.2307/2312726
  3. D.Gusfield and R.W.Irving, The Stable Marriage Problem: Structure and Algorithms, The MIT Press, 1989.
  4. An efficient algorithm for the "stable roommates" problem", Journal of Algorithms 6 (4): 577-595. Irving, Robert W, 1985. https://doi.org/10.1016/0196-6774(85)90033-1
  5. Marilda Sotomayor, "The stability of the equilibrium outcomes in the admission games induced by stable matching rules",International Journal of Game Theory Vol.36, Numbers 3-4 621-640 0020-7276, Springer-Verlag, 2008 https://doi.org/10.1007/s00182-008-0115-8
  6. Robert W. Irving "Stable matching problems with exchange restrictions", Journal of combinatorial optimization Volume 16, Number 4 344-360 1382-6905, 2008 https://doi.org/10.1007/s10878-008-9153-1
  7. Bettina Klaus, Flip Klijn, Jordi Masso "Some things couples always wanted to know about stable matchings (but were afraid to ask)" Review of Economic Design Vol.11, Number 3 175-184 1434-4742, 2006
  8. A. Colorni, M. Dorigo, and V. Maniezzo, "An Investigation of Some Properties of An Ant Algorithm." Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92), R. Mäanner and B. Manderick(Eds.), Elsevier Publishing, pp.509-520. 1992,
  9. Caironi P.V.C. & M. Dorigo "Training and Delayed Reinforcements in Q-learning Agents" International Journal of Intelligent Systems, in press. (Also available as Tech. Rep. IRIDIA/94-14, Universite Libre de Bruxelles, Belgium.), 1997.
  10. Li Li, F. Qiao, Q. D. Wu,"ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints",The International Journal of Advanced Manufacturing Technology Vol.44, Numbers 9-10 985-994 1433-3015, Springer-Verlag, 2009. https://doi.org/10.1007/s00170-008-1904-8
  11. B. Hoolldobler and E.O. Wilson, "The ants". Springer-Verlag, Berlin, 1990.
  12. 김현,정태충,"ACS 알고리즘을 이용한 안정된 결혼 문제 해결에 관한 연구", 전자공학회 논문지 제 47편 CI편 제 6호 pp.68-74, 2010. 11.
  13. M Dorigo, and L. Ganbardella. Ant Colony System: A Cooperative Learning Approach To The Traveling Salesman Problem, IEEE transactions on Evolutionary Computing, 1(1):53-66, 1997. https://doi.org/10.1109/4235.585892
  14. M. Dorigo, V. Maniezzo, and A.Colorni. The Ant System: Optimization by A Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol.26, No.2, pp.29-41, 1996. https://doi.org/10.1109/3477.484436
  15. R.W. Irving, D.F. Manlove and S. Scott, "The Hospitals/Residents Problem with Ties", in Proceedings of SWAT 2000, the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science (Springer-Verlag, 2000), pp.259-271.