An effective and simple heuristic for the set covering problem

Lan, Guanghui; DePuy, Gail W.; Whitehouse, Gary E.

doi:10.1016/j.ejor.2005.09.028

Cited by 143 publications

(89 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An overview of successful methods for solving (single-objective) set covering problems is given by Caprara, Toth, and Fischetti (2000) and Umetani and Yagiura (2007). In particular, the 3-flip neighborhood search heuristic proposed by Yagiura, Kishida, and Ibaraki (2006) and the multi-start heuristic Meta-RaPS of Lan, DePuy, and Whitehouse (2007) have proven superior to previous approaches. Furthermore, the Bi-objective Set Covering Problem (BOSC) investigated by Jaszkiewicz (2004) and Prins, Prodhon, and Calvo (2006) shows similarities to the 2WDP-SC; however, the BOSC differs in the objective function f 2 .…”

Section: Approaches For Related Problemsmentioning

confidence: 99%

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

Buer

Pankratz

2010

Bus Res

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Terms of use: Documents in

show abstract

Section: Approaches For Related Problemsmentioning

confidence: 99%

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

Buer

Pankratz

2010

Bus Res

View full text Add to dashboard Cite

show abstract

“…The work of Grossman and Wool (1997) considers the standard problem of covering, offers a heuristic algorithm and argues that it gives better results than previous techniques of solution. Lan et al (2007) present meta-heuristic algorithm of standard covering. Ananiashvili (2015a) gives precise solutions of problems of the least division and covering and uses technique of branches and limits.…”

Section: Introductionmentioning

confidence: 99%

Solution of a Generalized Problem of Covering by means of a Generic Algorithm

Ananiashvili¹

2017

BJMC

View full text Add to dashboard Cite

An algorithm of solution of a generalized problem of covering is offered. Generalization is made on the basis of subsets with diverse values of minimal summary weight of the given set. In difference from a standard problem of covering, this problem implies selection of particular covering, when rank sum of covering columns (from the covering matrix) gives the particular vector and corresponding values of this vector exceeds not a singular vector, but pre-existing vector b (with nonsingular components). Offered algorithm is based on a general genetic algorithm. It uses variable operator of non-standard mutation.

show abstract

“…Several exact (Fisher and Kedia, 1990;Balas and Carrera, 1996;Caprara et al, 2000) and meta-heuristic (Jacobs and Brusco, 1995;Beasley and Chu, 1996;Lan et al, 2007;Ren et al, 2008;Mulati and Constantino, 2011) methods have been proposed to solve the SCP. Exact methods are recommended only for small instances due to their time complexities.…”

Section: Introductionmentioning

confidence: 99%

“…The Set Covering Problem (SCP) is an important NP-hard combinatorial optimization problem (Cormen et al, 2009) that can be used to model several other problems such as: scheduling, manufacturing, service planning, information retrieval and delivery and routing problem (Lan et al, 2007). The SCP is described by a binary matrix A with m x n dimensions where each element can assume binary values and each column has an associated cost c j .…”

Section: Introductionmentioning

confidence: 99%

An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem

Ferreira

Pozo

Gonçalves³

2015

ADCAIJ

View full text Add to dashboard Cite

KEYWORDABSTRACT ant colony; hyper-heuristic; set covering problem; optimizationThe Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the quality of the results provided by these approaches highly depends on customized operators that demands high effort from researchers and practitioners. In order to alleviate the complexity of designing metaheuristics, a methodology called hyper-heuristic has emerged as a possible solution. A hyper-heuristic is capable of dynamically selecting simple low-level heuristics accordingly to their performance, alleviating the design complexity of the problem solver and obtaining satisfactory results at the same time. In a previous study, we proposed a hyper-heuristic approach based on Ant Colony Optimization (ACO-HH) for solving the SCP. This paper extends our previous efforts, presenting better results and a deeper analysis of ACO-HH parameters and behavior, specially about the selection of low-level heuristics. The paper also presents a comparison with an ACO meta-heuristic customized for the SCP.

show abstract

An effective and simple heuristic for the set covering problem

Cited by 143 publications

References 26 publications

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

Solution of a Generalized Problem of Covering by means of a Generic Algorithm

An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem

Contact Info

Product

Resources

About