Title of article
A Local Branching Approach for the Set Covering Problem
Author/Authors
Yaghini، Masoud نويسنده Assistant Professor, School of Railway Engineering, Tehran, Iran , , Sarmadi، Mohammadreza نويسنده MSc., School of Railway Engineering, Tehran, Iran , , Momeni، Mohsen نويسنده Student Research Center,Shiraz University of Medical Sciences,Shiraz, Iran ,
Issue Information
فصلنامه با شماره پیاپی 0 سال 2014
Pages
8
From page
95
To page
102
Abstract
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching-based solution approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is tested on the several standard instances. The results show that the algorithm outperforms the best heuristic approaches found in the literature.
Journal title
International Journal of Industrial Engineering and Production Research
Serial Year
2014
Journal title
International Journal of Industrial Engineering and Production Research
Record number
1314244
Link To Document