Catfish bat algorithm-ant colony optimization for subset problems

DOI10.3969/J.ISSN.1001-506X.2016.10.31zbMATH Open1374.68511MaRDI QIDQ2987665FDOQ2987665

Authors: Yi Liu, Xingchun Diao, Jianjun Cao, Kun Ding, Yong-Ping Xu 

Publication date: 17 May 2017

Recommendations

• A hybrid soft computing approach for subset problems
• Start Strategies of ACO Applied on Subset Problems
• Sensitivity analysis of ACO start strategies for subset problems
• A new improved bat algorithm for global optimization
• A binary cat swarm optimization algorithm for the non-unicost set covering problem

zbMATH Keywords

bat algorithmchaotic mapcatfish effectgraph-based ant system

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (1)

• A binary cat swarm optimization algorithm for the non-unicost set covering problem

This page was built for publication: Catfish bat algorithm-ant colony optimization for subset problems

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