Geometric selective harmony search
From MaRDI portal
Publication:506337
DOI10.1016/j.ins.2014.04.001zbMath1354.68236OpenAlexW2058056607WikidataQ62044786 ScholiaQ62044786MaRDI QIDQ506337
Sara Silva, Mauro Castelli, Luca Manzoni, Leonardo Vanneschi
Publication date: 31 January 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.04.001
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved harmony search algorithm for solving optimization problems
- Novel selection schemes for harmony search
- An analysis of selection methods in memory consideration for harmony search
- Parameter-setting-free harmony search algorithm
- Novel derivative of harmony search algorithm for discrete design variables
- A self-adaptive global best harmony search algorithm for continuous optimization problems
- A novel heuristic optimization method: charged system search
- GSA: A gravitational search algorithm
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- Global-best harmony search
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
- Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem
- A New Metaheuristic Bat-Inspired Algorithm
This page was built for publication: Geometric selective harmony search