UM
Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm
Deb S.1; Fong S.2; Tian Z.2; Wong R.K.3; Mohammed S.4; Fiaidhi J.4
2016-10-01
Source PublicationJournal of Supercomputing
ISSN15730484 09208542
Volume72Issue:10Pages:3960-3992
AbstractA novel bio-inspired optimization algorithm called elephant search algorithm (ESA) has been applied to solve NP-hard problems including the classical traveling salesman problem (TS) in this paper. ESA emerges from the hybridization of evolutionary mechanism and dual balancing of exploitation and exploration. The design of ESA is inspired by the behavioral characteristics of elephant herds; hence, the name Elephant Search Algorithm which divides the search agents into two groups representing the dual search patterns. The male elephants are search agents that outreach to different dimensions of search space afar; the female elephants form groups of search agents doing local search at certain close proximities. By computer simulation, ESA is shown to outperform other metaheuristic algorithms over the popular benchmarking optimization functions which are NP-hard in nature. In terms of fitness values in optimization, ESA is ranked after Firefly algorithm showing superior performance over the other ones. The performance of ESA is most stable when compared to all other metaheuristic algorithms. When ESA is applied to the traveling salesman problem, different ratios of gender groups yield different results. Overall, ESA is shown to be capable of providing approximate solutions in TSP.
KeywordBio-inspired optimization Elephant search algorithm Metaheuristic
DOI10.1007/s11227-016-1739-2
URLView the original
Language英語
Fulltext Access
Citation statistics
Cited Times [WOS]:9   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionUniversity of Macau
Affiliation1.IT and Educational Consultant
2.Universidade de Macau
3.University of New South Wales (UNSW) Australia
4.Lakehead University
Recommended Citation
GB/T 7714
Deb S.,Fong S.,Tian Z.,et al. Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm[J]. Journal of Supercomputing,2016,72(10):3960-3992.
APA Deb S.,Fong S.,Tian Z.,Wong R.K.,Mohammed S.,&Fiaidhi J..(2016).Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm.Journal of Supercomputing,72(10),3960-3992.
MLA Deb S.,et al."Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm".Journal of Supercomputing 72.10(2016):3960-3992.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Deb S.]'s Articles
[Fong S.]'s Articles
[Tian Z.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Deb S.]'s Articles
[Fong S.]'s Articles
[Tian Z.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Deb S.]'s Articles
[Fong S.]'s Articles
[Tian Z.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.