An analysis of selection methods in memory consideration for harmony search

DOI10.1016/j.amc.2013.04.053zbMath1298.90131MaRDI QIDQ470929

Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, Zong Woo Geem, Iyad Abu Doush, Mohammed A. Awadallah

Publication date: 13 November 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.04.053

zbMATH Keywords

evolutionary algorithmsharmony searchselection pressureselection methods

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

Related Items

On multi-objective optimization aided drawing of special graphs, Memetic techniques for examination timetabling, Geometric selective harmony search, A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points, HARMONY SEARCH WITH NOVEL SELECTION METHODS IN MEMORY CONSIDERATION FOR NURSE ROSTERING PROBLEM

Uses Software

• CEC 05

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved harmony search algorithm for solving optimization problems
• Novel selection schemes for harmony search
• Parameter-setting-free harmony search algorithm
• Metaheuristics in combinatorial optimization
• Novel derivative of harmony search algorithm for discrete design variables
• A self-adaptive global best harmony search algorithm for continuous optimization problems
• A harmony search algorithm for university course timetabling
• Metaheuristics: A bibliography
• Global-best harmony search
• Introduction to evolutionary computing