Home
>
Explore Content
>
All Issues
>
Article View
AIntegration of Integer Programming and Neighborhood Search Algorithm for Solving a Nonlinear Optimization Problem
Journal of The Korea Society of Computer and Information
Abbr :
JKSCI
2009, 14(2), pp.27-35
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
2009, 14(2), pp.27-35
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
Integer programming is a very effective technique for searching optimal solution of combinatorial optimization problems. However, its applicability is limited to linear models. In this paper, I propose an effective method for solving a nonlinear optimization problem by integrating the powerful search performance of integer programming and the flexibility of neighborhood search algorithms. In the first phase, integer programming is executed with subproblem which can be represented as a linear form from the given problem. In the second phase, a neighborhood search algorithm is executed with the whole problem by taking the result of the first phase as the initial solution. Through the experimental results using a nonlinear maximal covering problem, I confirmed that such a simple integration method can produce far better solutions than a neighborhood search algorithm alone. It is estimated that the success is primarily due to the powerful performance of integer programming.
198
Viewed
Print this page
Download PDF