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

DOI10.1007/s11047-019-09752-8zbMath1530.68274OpenAlexW2960264393MaRDI QIDQ6151196

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

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

metaheuristicsoptimization problemset-covering problemparameter settingmonkey search algorithm

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
• Using a facility location algorithm to solve large set covering problems
• A probabilistic heuristic for a computationally difficult set covering problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A Lagrangian-based heuristic for large-scale set covering problems
• A binary cat swarm optimization algorithm for the non-unicost set covering problem
• An algorithm for set covering problem
• Ambulance location and relocation models.
• Putting continuous metaheuristics to work in binary search spaces
• Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• The set covering problem revisited: an empirical study of the value of dual information
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• A New Metaheuristic Bat-Inspired Algorithm
• A Greedy Heuristic for the Set-Covering Problem
• Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
• Evolutionary Approach to Machine Learning and Deep Neural Networks
• A Heuristic Method for the Set Covering Problem
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Handbook of metaheuristics
• Algorithms for the set covering problem
• Adapting self-adaptive parameters in evolutionary algorithms

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