Simulated Annealing 알고리듬을 이용한 SAM-X 추가전력의 최적배치

Efficient Simulated Annealing Algorithm for Optimal Allocation of Additive SAM-X Weapon System

  • 이상헌 (국방대학교 운영분석학과) ;
  • 백장욱 (국방대학교 운영분석학과)
  • Lee, Sang-Heon (Department of Operations Research, Korea National Defense University) ;
  • Baek, Jang-Uk (Department of Operations Research, Korea National Defense University)
  • 투고 : 20050200
  • 심사 : 20051000
  • 발행 : 2005.12.31

초록

This study is concerned with seeking the optimal allocation(disposition) for maximizing utility of consolidating old fashioned and new air defense weapon system like SAM-X(Patriot missile) and developing efficient solution algorithm based on simulated annealing(SA) algorithm. The SED(selection by effectiveness degree) procedure is implemented with an enhanced SA algorithm in which neighboring solutions could be generated only within the optimal feasible region by using a specially designed PERTURB function. Computational results conducted on the problem sets with a variety of size and parameters shows the significant efficiency of our SED algorithm over existing methods in terms of both the computation time and the solution quality.

키워드

참고문헌

  1. Beasley, J. E. and Chu, P. C (1996), Genetic Algorithm for the Set Covering Problem, European Journal of Operational Research, 94, 392-404 https://doi.org/10.1016/0377-2217(95)00159-X
  2. Bellmore, M. and Ratliff, H.D.(1971), Set Covering and Involute Bases, Management Science, 18(3), 194-206 https://doi.org/10.1287/mnsc.18.3.194
  3. Francis, R. L. and White, J. A(1974)., Facility Layout and Location, Prentice-Hall Inc., New Jersey
  4. Garey, M. R. and Johnson, D. S.(1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., New York, 222
  5. Garfinkel, R.S., and Nemhauser, G.L. (1969), The Partitioning Problem: Set Covering with Equality Constraints, Operations Research, 17(5), 840-856
  6. George C. Moors and Charles Revelle(1982), The Hierarchical Service Location Problem, Management Science, 28(7), 775-780 https://doi.org/10.1287/mnsc.28.7.775
  7. Ignizio, J. P.(1971), A Heuristic Solution to Generalized Covering Problems, Unpublished ph. D. Dissertation, Virginia Polytechnic Institute and State University
  8. Jacobs, L. W. and Brusco, M. J.(1994), A Simulated Annealing-Based Heuristic for the Set Coveting Problem, Preceding Decision Sciences Institute, 1994 Annual meeting, 12, 1189-1191
  9. Kim, S. B, (2003), A Study on the Optimal Disposition Model for the Future Missile System by Set Covering, Master Thesis, Korea National Defense University
  10. Kim, S. I, (1987), Development of the Set Covering Model and Its Solution of Optimal Location for the Military Facilities, Proceeding of Hwarangdae Symposium
  11. Kim, T, R, (1983), Set Covering Model for the Facility Having Different Capacity by Reliability, Master Thesis, Korea University
  12. Kim, Y. G, Yeun, B. S, Lee, S. B, (2000), Meta -beuristic, Yeongji Moonhwasa, Seoul, Korea
  13. Kirkpatrick, S., C.D. Gelatt Jr. M.P. Vecchi(1983), Optimization by Simulated Annealing, Science, 220, 671-680 https://doi.org/10.1126/science.220.4598.671
  14. Lawer, E, L., and Wood, D. E. (1996), Branch-and -Bound Method: A Survey, Operations Research, 14(4), 699-719 https://doi.org/10.1287/opre.14.4.699
  15. Lee, D. H, (1989), A Study on the Position Allocation for Artillery Weapon, Master Thesis, Korea National Defense University
  16. Lee, H. L, Han C G, (1999), An Enhance Simulated Annealing Algorithm for the Set Covering Problem, IE Interface, 12(1), 94-101
  17. Norbert Dee and John C Liebman(1972), Optimal Location of Public Facilities, Naval Research Logistics Quarterly, 19, 753-759 https://doi.org/10.1002/nav.3800190415
  18. Oh, J. S, (1981), Set Covering Model for Maximizing Reliability, Master Thesis, Korea University
  19. Oh, W. M, Kim, S. I, (1994), A Study on the Optimal Disposition fo the PATRIOT Missile, Proceedings of 1994 Spring Conference of the Korean Institute of Industrial Engineers
  20. Revelle, C., and R. Swain(1970), Central Facilities Location, Geogr. Analysis, 2(1), 30-42
  21. Yeun, B. S, Cho, G. Y, (1996), Acceleration of Simulated Annealing and Its Application for Virtual Path Management in ATM Network, Journal of the Korean Operations Research and Management Science Society, 21(2), 125-140
  22. Yoshiaki Toyoda(1975), A Simplified Algorithm for Obtaining Approxi- mate Solutions to 0-1 Programming Problems, Management Science, 21(12), 1417-1427 https://doi.org/10.1287/mnsc.21.12.1417