Skip to main content
SpringerLink
Log in

Fuzzy adaptive imperialist competitive algorithm for global optimization

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Most of the parameters in meta-heuristic algorithms need precise tuning before applying into the optimization problems. The quality of solutions obtained by meta-heuristic algorithms is highly dependent on how efficiently its parameters are tuned by the users. Setting the parameters is not straightforward, and there is no definitive way to determine their appropriate values other than trial and error, which is an inefficient and time-consuming process. Deviation angle parameter in the imperialist competitive algorithm (ICA) plays an important role as driver of search diversification and intensification. In this paper, we propose a fuzzy adaptive imperialist competitive algorithm (FAICA), where the deviation parameter is adaptively adjusted using a fuzzy controller to optimally control diversification and intensification through the search process. A set of benchmark function tests has been carried out to demonstrate the effectiveness and robustness of the proposed algorithm. The results of experiments are compared with the original ICA and other five well-known algorithms. The experimental results exhibit the merit of achieving balance between intensification and diversification in the search which indicates superiority of FAICA over ICA.

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

Similar content being viewed by others

References

  1. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471

    Article  MATH  MathSciNet  Google Scholar 

  2. Holland JH (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann Arbor

    MATH  Google Scholar 

  3. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison Wesley, Boston

    MATH  Google Scholar 

  4. Eberhart R, Kennedy J (1995) A new optimizer particle swarm theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science, IEEE Service Center, pp 39–43

  5. Roy R, Dehuri S, Cho SB (2011) A novel particle swarm optimization algorithm for multi-objective combinatorial optimization problem. Int J Appl Metaheuristic Comput 2(4):41–57

    Article  Google Scholar 

  6. Dorigo M, Colorni A, Maniezzo V (1991) Positive feedback as a search strategy. Technical report 91-016, Dipartimento di Elettronica, Politechnico di Milano, Milan, Italy

  7. Mohan BC, Baskaran R (2012) A survey: ant colony optimization based recent research and implementation on several engineering domain. Expert Syst Appl 39(4):4618–4627

    Article  Google Scholar 

  8. Geem ZW, Kim J, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68

    Article  Google Scholar 

  9. Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567–1579

    Article  MATH  MathSciNet  Google Scholar 

  10. Omran MGH, Mahdavi M (2008) Global best harmony search. Appl Math Comput 198(2):643–656

    Article  MATH  MathSciNet  Google Scholar 

  11. Vadlamani S, Hosseini S (2014) A novel heuristic approach for solving aircraft landing problem with single runway. J Air Transp Manag 40:144–148

    Article  Google Scholar 

  12. Azi N, Gendraeu M, Potvin JY (2014) An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput Oper Res 41:167–173

    Article  MathSciNet  Google Scholar 

  13. Muller LF, Spoorendonk S, Pisinger D (2012) A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup time. Eur J Oper Res 218(3):614–623

    Article  MATH  MathSciNet  Google Scholar 

  14. Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: Proceedings of IEEE congress on evolutionary competition, pp 4661–4667

  15. Hosseini S, Khaled AA, Vadlamani S (2014) Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem. Neural Comput Appl 25(2). doi:10.1007/s00521-014-1678-x

  16. Hosseini S, Khaled AA, Jin M (2012) Solving Euclidean minimal spanning tree problem using a new meta-heuristic approach: imperialist competitive algorithm (ICA). In: International Conference on Industrial Engineering and Engineering Management (IEEM), pp 176–181. doi:10.1109/IEEM.2012.6837725

  17. Hosseini S, Khaled AA (2014) A survey on the imperialist competitive algorithm metaheurisitc: implementation in engineering domain and directions for future research. Appl Soft Comput. doi:10.1016/j.asoc.2014.08.024

    Google Scholar 

  18. Mamdani EH, Assilian S (1975) An experiment in linguistic synthesis with a fuzzy logic controller. Int J Mach Stud 7(1):1–13

    Article  MATH  Google Scholar 

  19. Klir JG, Yuan B (1995) Fuzzy sets and fuzzy logic: theory and applications. Prentice-Hall, Upper Saddle River

    MATH  Google Scholar 

  20. Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York

    Google Scholar 

  21. Cochran WG, Cox GM (1992) Experiment designs, 2nd edn. Wiley, USA

    Google Scholar 

  22. Phadke MS (1995) Quality engineering using robust design, 1st edn. Prentice-Hall, Upper Saddle River

    Google Scholar 

  23. Al-Aomar R (2006) Incorporating robustness into genetic algorithm search of stochastic simulation outputs. Simul Model Pract Theory 14(3):201–223

    Article  Google Scholar 

  24. Pant M, Thangaraj R, Abraham A (2009) Particle swarm optimization: performance tuning and empirical analysis. In: Abraham A et al (eds) Foundations of computational intelligence volume 3, SCI, vol 203. Springer, Berlin, pp 101–128

  25. Secrest BR, Lamont GB (2003) Visualizing particle swarm optimization-Gaussian particle swarm optimization. In: Proceedings of IEEE Swarm Intelligence Symposium, pp 198–204

  26. Evers GI, Ben Ghalia M (2009) Regrouping particle swarm optimization: a new global optimization algorithm with improved performance consistency across benchmarks. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp 3901–3908

  27. Liu X, Cai Z, Yu C (2011) A hybrid harmony search approach based on differential evolution. J Inf Comput Sci 8(10):1889–1900

    Google Scholar 

  28. Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18:50–60

    Article  MATH  MathSciNet  Google Scholar 

  29. Vesterstrom J, Thomsen R (2004) A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Proceedings of Congress on Evolutionary Computation, pp 1980–1987

Download references

Author information

Authors and Affiliations

  1. Influence Health, Birmingham, AL, USA

    Abdullah Al Khaled

  2. School of Industrial and Systems Engineering, University of Oklahoma, Norman, OK, USA

    Seyedmohsen Hosseini

Authors
  1. Abdullah Al Khaled
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyedmohsen Hosseini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyedmohsen Hosseini.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khaled, A.A., Hosseini, S. Fuzzy adaptive imperialist competitive algorithm for global optimization. Neural Comput & Applic 26, 813–825 (2015). https://doi.org/10.1007/s00521-014-1752-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-014-1752-4

Keywords

Search

Navigation