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

DOI10.1007/978-3-319-18167-7_19zbMATH Open1370.90208OpenAlexW1133383579MaRDI QIDQ5357751FDOQ5357751

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

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

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

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)

Cites Work

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

Cited In (1)

• Exploring further advantages in an alternative formulation for the set covering problem

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)