An adaptive bi-flight cuckoo search with variable nests for continuous dynamic optimization problems

This paper presents an adaptive bi-flight cuckoo search algorithm for continuous dynamic optimization problems. Unlike the standard cuckoo search which relies on Levy flight, the proposed method uses two types of flight that are chosen adaptively by a learning automaton to control the global and loc...

Full description

Saved in:
Bibliographic Details
Published in:Applied intelligence (Dordrecht, Netherlands) Netherlands), 2018, Vol.48 (1), p.97-117
Main Authors: Kordestani, Javidan Kazemi, Firouzjaee, Hossein Abedi, Reza Meybodi, Mohammad
Format: Article
Language:English
Subjects:
Adaptive algorithms
Artificial Intelligence
Computer Science
Continuity (mathematics)
Machines
Manufacturing
Mechanical Engineering
Optimization
Processes
Search algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an adaptive bi-flight cuckoo search algorithm for continuous dynamic optimization problems. Unlike the standard cuckoo search which relies on Levy flight, the proposed method uses two types of flight that are chosen adaptively by a learning automaton to control the global and local search ability of the method during the run. Furthermore, a variable nest scheme and a new cuckoo addition mechanism are introduced. A greedy local search method is also integrated to refine the best found solution. An extensive set of experiments is conducted on a variety of dynamic environments generated by the moving peaks benchmark, to evaluate the performance of the proposed approach. Results are also compared with those of other state-of-the-art algorithms from the literature. The experimental results indicate the effectiveness of the proposed approach.
ISSN:0924-669X
1573-7497
DOI:10.1007/s10489-017-0963-7