A parallel genetic algorithm to solve the set-covering problem

DOI10.1016/S0305-0548(01)00026-0MaRDI QIDQ1603319zbMATH OpenOpenAlexWikidataFDO

Authors Mauricio Solar, Rodrigo Urrutia, Víctor Parada

Publication date 11 July 2002

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(01)00026-0

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Recommendations

• A Genetic Algorithm for the Set Covering Problem
• An empirical study of hybrid genetic algorithms for the set covering problem
• Genetic algorithms and parallel processing
• scientific article; zbMATH DE number 1054926
• Genetic algorithms applied to computationally difficult set covering problems

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 4121754 (Why is no real title available?)
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Enhancing an algorithm for set covering problems
• On the 0,1 facets of the set covering polytope
• On the facial structure of the set covering polytope
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Simplification of the Covering Problem with Application to Boolean Expressions
• The Location of Emergency Service Facilities

Cited in

(9)

• A new approach for solving set covering problem using jumping particle swarm optimization method
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
• A new genetic algorithm encoding for coalition structure generation problems
• A GRASP algorithm to solve the unicost set covering problem
• An electromagnetism metaheuristic for the unicost set covering problem
• An adaptive heuristic algorithm for VLSI test vectors selection
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• Solving a bicriteria problem of optimal service centers location

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A parallel genetic algorithm to solve the set-covering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603319)