A Local Branching Approach for the Set Covering Problem
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 25، Issue: 2
Publish Year: 1393
نوع سند: مقاله ژورنالی
زبان: English
View: 911
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-25-2_002
تاریخ نمایه سازی: 7 شهریور 1393
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 olver. The algorithm parameters are tuned by design of experiments approach. The proposed method is tested on the several standard instances. Theresults show that the algorithm outperforms the best heuristic approaches found in the literature.
Keywords:
Authors
M. Yaghini
Assistant Professor, School of Railway Engineering, Iran University of Science and Technology, Tehran, Iran
M.R. Sarmadi
MSc., School of Railway Engineering, Iran University of Science and Technology, Tehran, Iran
M. Momeni
MSc., School of Railway Engineering, Iran University of Science and Technology, Tehran, Iran