The impact of a new formulation when solving the set covering problem using the ACO metaheuristic

DOI10.1007/978-3-319-18167-7_19MaRDI QIDQ5357751zbMATH OpenOpenAlexFDO

Authors Broderick Crawford, Wenceslao Palma, Fernando Paredes, Franklin Johnson, Enrique Norero, Ricardo L. Soto

Publication date 12 September 2017

Published in Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18167-7_19

zbMATH Keywords

ant colony optimizationmetaheuristicsset covering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• Exploring further advantages in an alternative formulation for the set covering problem
• Application of ant colony optimization metaheuristic on set covering problems
• A hybrid heuristic for the set covering problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Effective heuristics for the set covering with pairs problem

Cites work

• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A Greedy Heuristic for the Set-Covering Problem
• A Heuristic Method for the Set Covering Problem
• A Lagrangian-based heuristic for large-scale set covering problems
• A genetic algorithm for the set covering problem
• A hybrid soft computing approach for subset problems
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• An electromagnetism metaheuristic for the unicost set covering problem
• Ant colony optimization.
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• Tabu search-based metaheuristic algorithm for large-scale set covering problems
• Using a facility location algorithm to solve large set covering problems

Cited in

(9)

• A metaheuristic framework for nonlinear capacitated covering problems
• Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
• A new approach for solving set covering problem using jumping particle swarm optimization method
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• A self-adaptive biogeography-based algorithm to solve the set covering problem
• Application of ant colony optimization metaheuristic on set covering problems
• Exploring further advantages in an alternative formulation for the set covering problem
• A hybrid heuristic for the set covering problem
• Branch-and-bound method for just-in-time optimization of radar search patterns

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: The impact of a new formulation when solving the set covering problem using the ACO metaheuristic

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