Metaheuristic search algorithms in solving the n-similarity problem

DOI10.3233/FI-2017-1516MaRDI QIDQ4595591zbMATH OpenOpenAlexFDO

Authors Mina Mirhosseini, Hossein Nezamabadi-Pour

Publication date 5 December 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1516

zbMATH Keywords

particle swarm optimizationgravitational search algorithmimperialist competition algorithm\(n\)-similarityfuzzy imperialist competition algorithmtext document similarity

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems
• Metaheuristic optimization: nature-inspired algorithms and applications
• scientific article; zbMATH DE number 5308434
• Optimization of fuzzy clustering criteria by a hybrid PSO and fuzzy \(c\)-means clustering algorithm
• Firefly Algorithms for Multimodal Optimization

Cited in

(2)

• Similarity in metaheuristics: a gentle step towards a comparison methodology
• Improving metaheuristics convergence properties in inductive query by example using two strategies for reducing the search space

This page was built for publication: Metaheuristic search algorithms in solving the \(n\)-similarity problem

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