جلد 25، شماره 2 - ( 2-1393 )
جلد 25 شماره 2 صفحات 102-95 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Yaghini M, Momeni M, Momeni Sarmadi M. A Local Branching Approach for the Set Covering Problem. IJIEPR 2014; 25 (2) :95-102
URL: http://ijiepr.iust.ac.ir/article-1-464-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-464-fa.html
A Local Branching Approach for the Set Covering Problem. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1393; 25 (2) :95-102
چکیده: (5905 مشاهده)
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching 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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
تحقیق در عملیات
دریافت: 1391/6/25 | پذیرش: 1392/9/2 | انتشار: 1393/3/5
دریافت: 1391/6/25 | پذیرش: 1392/9/2 | انتشار: 1393/3/5
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
