Discrete Cuckoo Search for Combinatorial Optimization by Aziz Ouaarab
Author:Aziz Ouaarab
Language: eng
Format: epub
ISBN: 9789811538360
Publisher: Springer Singapore
4.2 Improved CS
The robustness of CS is based on how to explore and exploit the space of solutions by a cuckoo. This cuckoo can have some “intelligence” to find much better solutions. We considered in our improvement (Ouaarab et al. 2014) the cuckoo as the first level of control of intensification and diversification, and since this cuckoo is an individual of a population, then this population is qualified to be the second level of control. The idea of improvement is to restructure the population by integrating a new, relatively smarter category of cuckoos with more efficiency into their research, compared to other cuckoos.
Studies have shown that the cuckoo is able to initiate surveillance around potential host nests (Payne and Sorenson 2005). This behavior can serve as an inspiration to design a new cuckoo category that has the ability to change host nests during incubation. The purpose of this behavior is to avoid abandoning cuckoo eggs. These cuckoos adopt mechanisms before and after brooding. They observe the chosen host nest to be sure that the choice of this nest is the right decision or not (in this case, they start looking for a new choice much better than the current one). We speak, therefore, of an ability to search locally for a much better solution around the current solution.
Inspired by this observed behavior, the mechanism adopted by this new fraction of cuckoos can be divided into two main stages: (1) A cuckoo initially moves by Lévy flights to a new solution (which represents a new region); (2) From the current solution, a cuckoo in the same region is looking for a new best solution (in this stage, it is possible to carry out a local search). According to these two steps, the population of the improved CS algorithm (Algorithm 2) can be structured according to three main categories of cuckoos: 1.A cuckoo looking for (from the best position) regions that may contain new solutions that are much better than the solution of an individual randomly selected in the population;
Download
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.
Deep Learning with Python by François Chollet(12569)
Hello! Python by Anthony Briggs(9914)
OCA Java SE 8 Programmer I Certification Guide by Mala Gupta(9795)
The Mikado Method by Ola Ellnestam Daniel Brolund(9777)
Dependency Injection in .NET by Mark Seemann(9337)
Algorithms of the Intelligent Web by Haralambos Marmanis;Dmitry Babenko(8296)
Test-Driven iOS Development with Swift 4 by Dominik Hauser(7763)
Grails in Action by Glen Smith Peter Ledbrook(7696)
The Well-Grounded Java Developer by Benjamin J. Evans Martijn Verburg(7557)
Becoming a Dynamics 365 Finance and Supply Chain Solution Architect by Brent Dawson(7064)
Microservices with Go by Alexander Shuiskov(6825)
Practical Design Patterns for Java Developers by Miroslav Wengner(6744)
Test Automation Engineering Handbook by Manikandan Sambamurthy(6688)
Secrets of the JavaScript Ninja by John Resig Bear Bibeault(6413)
Angular Projects - Third Edition by Aristeidis Bampakos(6092)
The Art of Crafting User Stories by The Art of Crafting User Stories(5617)
NetSuite for Consultants - Second Edition by Peter Ries(5556)
Demystifying Cryptography with OpenSSL 3.0 by Alexei Khlebnikov(5360)
Kotlin in Action by Dmitry Jemerov(5062)
