Skip to main content
SpringerLink
Log in

Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

A 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29

Similar content being viewed by others

References

  1. Reynolds CW (1987) Flocks, herds and schools: a distributed behavioral model. Comput Graph 21(4):25–34

    Article  Google Scholar 

  2. Jarraya B, Bouri A (2012) Metaheuristic optimization backgrounds: a literature review. Int J Contemp Bus Stud 3(12):31–44

    Google Scholar 

  3. Hoang DT (2008) Metaheuristics for NP-hard combinatorial optimization problems. PhD Thesis, Electrical and Computer Engineering, National University of Singapore

  4. Yang XS (2010) Engineering optimization: an introduction with metaheuristic applications. Wiley, Hoboken, NJ p 347

  5. Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO), Series Studies in Computational Intelligence, vol 284, pp 65–74

  6. Yang XS (2009) Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications, SAGA 2009. Lecture Notes in Computer Sciences 5792:169–178

    Article  Google Scholar 

  7. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks IV, pp 1942–1948

  8. Fong S, Deb S, Yang X-S (2015) A heuristic optimization methodinspired by wolf preying behavior. Neural Comput Applic 26:1725–1738

  9. Phelps S, McBurney P, Parsons S (2010) Evolutionary mechanism design: a review. Auton Agent Multi-Agent Syst 21:237–264

  10. Yang XS, Deb S, Fong S (2014) Metaheuristic algorithms: optimal balance of intensification and diversification. Appl Math Inf Sci 8(3):977–983

    Article  Google Scholar 

  11. Elephants Behaviours. http://seaworld.org/animal-info/animal-infobooks/elephants/behavior/

  12. Vidya TNC, Sukumar R (2005) Social and reproductive behaviour in elephants. Curr Sci 89(7):1200–1207

    Google Scholar 

  13. Benchmarking Optimization Functions. http://www.sfu.ca/~ssurjano/optimization.html

  14. Fong S, Wong R, Pichappan P (2015) Debunking the designs of contemporary nature-inspired computing algorithms: from moving particles to roaming elephants. In: The fourth international conference on future generation communication technology (FGCT), IEEE Press, 29–31 July, pp 1–11

  15. TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

  16. Optimal solutions for symmetric TSPs. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/STSP.html

  17. Deb S, Fong S, Tian ZH (2015) Elephant search algorithm for optimization problems. In: 2015 tenth international conference on digital information management (ICDIM) (Oct.) IEEE, Jeju

Download references

Acknowledgments

The authors are thankful for the financial support from the Research Grant Temporal Data Stream Mining Using Incrementally Optimized Very Fast Decision Forest (iOVFDF), Grant No. MYRG2015-00128-FST, offered by the University of Macau, FST, and RDAO.

Author information

Authors and Affiliations

  1. IT and Educational Consultant, Jharkhand, India

    Suash Deb

  2. Department of Computer and Information Science, University of Macau, Taipa, Macau SAR, China

    Simon Fong & Zhonghuan Tian

  3. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia

    Raymond K. Wong

  4. Department of Computer Science, Lakehead University, Thunder Bay, Canada

    Sabah Mohammed & Jinan Fiaidhi

Authors
  1. Suash Deb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon Fong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhonghuan Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raymond K. Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sabah Mohammed
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jinan Fiaidhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Fong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deb, S., Fong, S., Tian, Z. et al. Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm. J Supercomput 72, 3960–3992 (2016). https://doi.org/10.1007/s11227-016-1739-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-016-1739-2

Keywords

Search

Navigation