Abstract
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저자 : 황준하 ∙교신저자 : 황준하 ∙투고일 : 2014. 7. 22, 심사일 : 2014. 8. 11, 게재확정일 : 2014. 9. 11. * 금오공과대학교 컴퓨터공학과(Dept. of Computer Engineering, Kumoh National Institute of Technology) ※ 본 연구는 금오공과대학교 학술연구비에 의하여 연구된 논문임 14 Journal of The Korea Society of Computer and Information October 2014 ▸
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Korea Society of Computer and Information
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
