Limits...
A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.

Ali AF, Tawhid MA - Springerplus (2016)

Bottom Line: Cuckoo search algorithm is a promising metaheuristic population based method.It has been applied to solve many real life problems.We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM).

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Science, Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt ; Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, 900 McGill Road, Kamloop, BC V2C 0C8 Canada.

ABSTRACT
Cuckoo search algorithm is a promising metaheuristic population based method. It has been applied to solve many real life problems. In this paper, we propose a new cuckoo search algorithm by combining the cuckoo search algorithm with the Nelder-Mead method in order to solve the integer and minimax optimization problems. We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM). HCSNM starts the search by applying the standard cuckoo search for number of iterations then the best obtained solution is passing to the Nelder-Mead algorithm as an intensification process in order to accelerate the search and overcome the slow convergence of the standard cuckoo search algorithm. The proposed algorithm is balancing between the global exploration of the Cuckoo search algorithm and the deep exploitation of the Nelder-Mead method. We test HCSNM algorithm on seven integer programming problems and ten minimax problems and compare against eight algorithms for solving integer programming problems and seven algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer and minimax optimization problems in reasonable time.

No MeSH data available.


The general performance of the proposed HCSNM algorithm with integer problems
© Copyright Policy - OpenAccess
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4835425&req=5

Fig2: The general performance of the proposed HCSNM algorithm with integer problems

Mentions: We apply the second experimental test to investigate the general performance of the proposed algorithm on the integer programming problems by plotting the values of function values versus the number of iterations as shown in Fig. 2 for four functions and (randomly picked). The solid line represents the standard cuckoo search algorithm, while the dotted line represents the performance of the NM method after applying he NM on the best obtained solution from the standard cuckoo search. We can conclude from Fig. 2 that invoking the NM method as an intensification process in the final stage of the proposed algorithm can accelerate the search and obtain the optimal or near optimal solution in reasonable time.Fig. 2


A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.

Ali AF, Tawhid MA - Springerplus (2016)

The general performance of the proposed HCSNM algorithm with integer problems
© Copyright Policy - OpenAccess
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4835425&req=5

Fig2: The general performance of the proposed HCSNM algorithm with integer problems
Mentions: We apply the second experimental test to investigate the general performance of the proposed algorithm on the integer programming problems by plotting the values of function values versus the number of iterations as shown in Fig. 2 for four functions and (randomly picked). The solid line represents the standard cuckoo search algorithm, while the dotted line represents the performance of the NM method after applying he NM on the best obtained solution from the standard cuckoo search. We can conclude from Fig. 2 that invoking the NM method as an intensification process in the final stage of the proposed algorithm can accelerate the search and obtain the optimal or near optimal solution in reasonable time.Fig. 2

Bottom Line: Cuckoo search algorithm is a promising metaheuristic population based method.It has been applied to solve many real life problems.We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM).

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Science, Faculty of Computers and Informatics, Suez Canal University, Ismailia, Egypt ; Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, 900 McGill Road, Kamloop, BC V2C 0C8 Canada.

ABSTRACT
Cuckoo search algorithm is a promising metaheuristic population based method. It has been applied to solve many real life problems. In this paper, we propose a new cuckoo search algorithm by combining the cuckoo search algorithm with the Nelder-Mead method in order to solve the integer and minimax optimization problems. We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM). HCSNM starts the search by applying the standard cuckoo search for number of iterations then the best obtained solution is passing to the Nelder-Mead algorithm as an intensification process in order to accelerate the search and overcome the slow convergence of the standard cuckoo search algorithm. The proposed algorithm is balancing between the global exploration of the Cuckoo search algorithm and the deep exploitation of the Nelder-Mead method. We test HCSNM algorithm on seven integer programming problems and ten minimax problems and compare against eight algorithms for solving integer programming problems and seven algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer and minimax optimization problems in reasonable time.

No MeSH data available.