A binary monkey search algorithm variation for solving the set covering problem

DOI10.1007/S11047-019-09752-8MaRDI QIDQ6151196zbMATH OpenOpenAlexFDO

Authors Broderick Crawford, Ricardo L. Soto, Rodrigo Olivares, Gabriel Embry, Diego Flores, Wenceslao Palma, Fernando Paredes, Jose Miguel Rubio

Publication date 9 February 2024

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-019-09752-8

zbMATH Keywords

metaheuristicsmonkey search algorithmoptimization problemparameter settingset-covering problem

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A binary cat swarm optimization algorithm for the non-unicost set covering problem
• 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 morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A New Metaheuristic Bat-Inspired Algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A probabilistic heuristic for a computationally difficult set covering problem
• Adapting self-adaptive parameters in evolutionary algorithms
• Algorithms for the set covering problem
• Ambulance location and relocation models.
• An algorithm for set covering problem
• Evolutionary approach to machine learning and deep neural networks. Neuro-evolution and gene regulatory networks
• Handbook of metaheuristics
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
• Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Putting continuous metaheuristics to work in binary search spaces
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• The set covering problem revisited: an empirical study of the value of dual information
• Using a facility location algorithm to solve large set covering problems

Cited in

(1)

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

This page was built for publication: A binary monkey search algorithm variation for solving the set covering problem

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