Home > Explore Content > All Issues > Article View
An Integer Programming-based Local Search for the Set Partitioning Problem
Journal of The Korea Society of Computer and Information
Abbr :
JKSCI
2015, 20(9), pp.21-29
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
2015, 20(9), pp.21-29
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
The set partitioning problem is a well-known NP-hard combinatorial optimization problem, and it is formulated as an integer programming model. This paper proposes an Integer Programming-based Local Search for solving the set partitioning problem. The key point is to solve the set partitioning problem as the set covering problem. First, an initial solution is generated by a simple heuristic for the set covering problem, and then the solution is set as the current solution. Next, the following process is repeated. The original set covering problem is reduced based on the current solution, and the reduced problem is solved by Integer Programming which includes a specific element in the objective function to derive the solution for the set partitioning problem. Experimental results on a set of OR-Library instances show that the proposed algorithm outperforms pure integer programming as well as the existing heuristic algorithms both in solution quality and time.
85 Viewed
Print this page
Download PDF