A 2-level Metaheuristic for the Set Covering Problem
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
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 te...
متن کاملAn electromagnetism metaheuristic for the unicost set covering problem
0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.01.035 * Corresponding author. Tel.: +39 51 2093028; fax: E-mail addresses: [email protected] (Z. Na (P. Toth), [email protected] (L. Galli). In this paper we propose a new heuristic algorithm to solve the unicost version of the well-known set covering problem. The method is based on the electromagnetism metaheuris...
متن کامل2 Set Covering Problem
In the previous lecture, we covered a series of online/offline edge-weighted Steiner tree/forest problems. This lecture extends the discussion to the node-weighted scope. In particular, we will study the nodeweighted Steiner tree/forest problem and introduce an offline O(logn)−approximation polynomial-time algorithm[KR95]. It is well known there is no polynormial-time algorithm that achieves o(...
متن کاملa local branching approach for the set covering problem
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 te...
متن کاملA New Formulation of the Set Covering Problem for Metaheuristic Approaches
Two difficulties arise when solving the set covering problem (SCP) with metaheuristic approaches: solution infeasibility and set redundancy. In this paper, we first present a review and analysis of the heuristic approaches that have been used in the literature to address these difficulties. We then present a new formulation that can be used to solve the SCP as an unconstrained optimization prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2014
ISSN: 1841-9844,1841-9836
DOI: 10.15837/ijccc.2012.2.1417