A hybrid of max-min ant system and linear programming for the k-covering problem

DOI10.1016/J.COR.2016.06.006MaRDI QIDQ342539zbMATH OpenOpenAlexFDO

Authors Sameh Al-Shihabi

Publication date 17 November 2016

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

Full work available at URL https://doi.org/10.1016/j.cor.2016.06.006

zbMATH Keywords

hybrid heuristicslinear programminglocal searchMAX-MIN ant systemmetahueristicsset k-covering problem

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A hybrid heuristic for the set covering problem
• Experiments with LAGRASP heuristic for set \(k\)-covering
• A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
• An algorithm for set covering problem
• A hybrid method for the probabilistic maximal covering location-allocation problem

Cites work

• A fast approximation algorithm for the multicovering problem
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
• An indirect genetic algorithm for set covering problems
• Experiments with LAGRASP heuristic for set \(k\)-covering

Cited in

(7)

• HMS: a hybrid multi-start algorithm for solving binary linear programs
• A hybrid method for the probabilistic maximal covering location-allocation problem
• scientific article; zbMATH DE number 1488089 (Why is no real title available?)
• scientific article; zbMATH DE number 2215631 (Why is no real title available?)
• MLQCC: an improved local search algorithm for the set k‐covering problem
• Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
• An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic

This page was built for publication: A hybrid of max-min ant system and linear programming for the \(k\)-covering problem

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