본문 바로가기
  • Home

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

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2014, 19(10), pp.13-21
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Junha Hwang ORD ID 1

1금오공과대학교

Accredited

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 minimalcost. This paper proposes a method utilizing Integer Programming-based Local Search (IPbLS) tosolve the set covering problem. IPbLS is a kind of local search technique in which the currentsolution is improved by searching neighborhood solutions. Integer programming is used to generateneighborhood solution in IPbLS. The effectiveness of the proposed algorithm has been tested onOR-Library test instances. The experimental results showed that IPbLS could search for the bestknown solutions in all the test instances. Especially, I confirmed that IPbLS could search for bettersolutions than the best known solutions in four test instances.

Citation status

* References for papers published after 2023 are currently being built.