한국컴퓨터정보학회논문지 (Journal of the Korea Society of Computer and Information)

한국컴퓨터정보학회 (Korean Society of Computer Information)
권호 표지
DOI QR코드

DOI QR Code

집합 커버링 문제를 위한 정수계획법 기반 지역 탐색

An Integer Programming-based Local Search for the Set Covering Problem

  • 황준하 (금오공과대학교 컴퓨터공학과)
  • Hwang, Jun-Ha (Dept. of Computer Engineering, Kumoh National Institute of Technology)
  • 투고 : 2014.07.22
  • 심사 : 2014.09.11
  • 발행 : 2014.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

집합 커버링 문제는 대표적인 조합 최적화 문제들 중 하나로서 n개의 열로부터 일부를 선택하여 m개의 행을 커버하되 비용을 최소화하는 문제로 정의된다. 본 논문에서는 집합 커버링 문제를 해결하기 위한 정수 계획법 기반 지역 탐색의 적용 방안을 제시하고 있다. 정수계획법 기반 지역 탐색은 이웃해를 탐색하여 현재해를 반복적으로 개선하는 지역 탐색 기법의 일종으로서 이웃해를 생성하기 위한 알고리즘으로 정수계획법을 사용한다. 본 논문에서 제시한 기법의 효과를 검증하기 위해 OR-Library의 테스트 데이터를 대상으로 실험을 수행하였다. 실험 결과, 모든 테스트 데이터에 있어서 정수계획법 기반 지역 탐색을 통해 지금까지 알려진 가장 좋은 해를 탐색할 수 있었다. 특히 4개의 테스트 데이터에 대해서는 지금까지 알려진 가장 좋은 해보다 더 좋은 해를 도출할 수 있음을 확인할 수 있었다.

The set covering problem (SCP) is one of representative combinatorial optimization problems, which is defined as the problem of covering the m-rows by a subset of the n-columns at minimal cost. This paper proposes a method utilizing Integer Programming-based Local Search (IPbLS) to solve the set covering problem. IPbLS is a kind of local search technique in which the current solution is improved by searching neighborhood solutions. Integer programming is used to generate neighborhood solution in IPbLS. The effectiveness of the proposed algorithm has been tested on OR-Library test instances. The experimental results showed that IPbLS could search for the best known solutions in all the test instances. Especially, I confirmed that IPbLS could search for better solutions than the best known solutions in four test instances.

키워드

과제정보

연구 과제 주관 기관 : 금오공과대학교

참고문헌

  1. B. Gopalakrishnan, and E. Johnson, "Airline Crew Scheduling: State-of-the-Art", Anals of Operations Research, Vol. 140, No. 1, pp.305-337, Nov. 2005. https://doi.org/10.1007/s10479-005-3975-3
  2. R.Z. Farahani, N. Asgari, N. Heidari, M. Hosseininia, and M. Goh, "Covering Problems in Facility Location: A Review", Computers & Industrial Engineering, Vol. 62, No. 1, pp.368-407, Feb. 2012. https://doi.org/10.1016/j.cie.2011.08.020
  3. E. Balas, and M.C. Carrera, "A Dynamic Subgradient-based Branch-and-bound Procedure for Set Covering", Operations Research, Vol. 44, No. 6, pp.875-890, Dec. 1996. https://doi.org/10.1287/opre.44.6.875
  4. M. Yagiura, M. Kishida, and T. Ibaraki, "A 3-flip Neighborhood Local Search for the Set Covering Problem", European Journal of Operational Research, Vol. 172, No. 2, pp.472-499, July 2006. https://doi.org/10.1016/j.ejor.2004.10.018
  5. A. Caprara, M. Fischetti, and P. Toth, "A Heuristic Method for the Set Covering Problem", Operations Research, Vol. 47, No. 5, pp.730-743, Oct. 1999. https://doi.org/10.1287/opre.47.5.730
  6. J.E. Beasley, and P.C. Chu, "A Genetic Algorithm for the Set Covering Problem", European Journal of Operational Research, Vol. 94, No. 2, pp.392-404, Oct. 1996. https://doi.org/10.1016/0377-2217(95)00159-X
  7. M. Caserta, "Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems", Metaheuristics: Progress in Complex Systems Optimization, Springer, pp.43-63, 2007.
  8. Z. Ren, Z. Feng, L. Ke, and Z. Zhang, "New Ideas for Applying Ant Colony Optimization to the Set Covering Problem", Computers & Industrial Engineering, Vol. 58, No. 4, pp.774-784, May 2010. https://doi.org/10.1016/j.cie.2010.02.011
  9. B. Crawford, R. Soto, R. Cuesta, and F. Paredes, "Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem", The Scientific World Journal, 2014.
  10. M. Yaghini, M.R. Sarmadi, and M. Momeni, "A Local Branching Approach for the Set Covering Problem", International Journal of Industrial Engineering & Production Research, Vol. 25, No. 2, pp.95-102, June 2014.
  11. J.E. Beasley, "OR-Library: Distributing Test Problems by Electronic Mail", Journal of the Operational Research Society, Vol. 41, No. 11, pp.1069-1072, Nov. 1990. https://doi.org/10.1057/jors.1990.166
  12. J. Hwang, and S. Kim, "Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem", Journal of The Korea Society of Computer and Information, Vol. 15, No. 9, pp. 47-55, Sep. 2010. https://doi.org/10.9708/jksci.2010.15.9.047
  13. L.A. Wolsey, "Integer Programming", Wiley, pp. 91-111, 1998.
  14. J. Hwang, and S. Kim, "An Integer Programming-based Local Search for Large-scale Maximal Covering Problems", International Journal on Computer Science and Engineering, Vol. 3, No. 2, pp. 837-843, Feb. 2011.
  15. J. Hwang, "Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem", Journal of The Korea Society of Computer and Information, Vol. 17, No. 6, pp. 13-27, June 2012. https://doi.org/10.9708/jksci.2012.17.6.013
  16. "IBM ILOG CPLEX Optimization Studio CPLEX User's Manual, Version 12 Release 6", International Business Machines Corporation, 2013.

피인용 문헌

  1. An Integer Programming-based Local Search for the Set Partitioning Problem vol.20, pp.9, 2014, https://doi.org/10.9708/jksci.2015.20.9.021