Skip to main content

Advertisement

Log in

An improved multi-agent genetic algorithm for numerical optimization

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

Multi-agent genetic algorithm (MAGA) is a good algorithm for global numerical optimization. It exploited the known characteristics of some benchmark functions to achieve outstanding results. But for some novel composition functions, the performance of the MAGA significantly deteriorates when the relative positions of the variables at the global optimal point are shifted with respect to the search ranges. To this question, an improved multi-agent genetic algorithm for numerical optimization (IMAGA) is proposed. IMAGA make use of the agent evolutionary framework, and constructs heuristic search and a hybrid crossover strategy to complete the competition and cooperation of agents, a convex mutation operator and some local search to achieve the self-learning characteristic. Using the theorem of Markov chain, the improved multi-agent genetic algorithm is proved to be convergent. Experiments are conducted on some benchmark functions and composition functions. The results demonstrate good performance of the IMAGA in solving complicated composition functions compared with some existing algorithms.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Chellapilla K (1998) Combining mutation operators in evolutionary programming. IEEE Trans Evol Comput 2(3):91–96

    Article  Google Scholar 

  • Cui ZH, Zeng JC (2005) A new organizational nonlinear genetic algorithm for numerical optimization. Paper presented at the first international conference on natural computation, Xiangtan University, Changsha, 27–29 August 2005, pp 255–258

  • Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York

    Google Scholar 

  • Jiao LC, Wang L (2000) A novel genetic algorithm based on immunity. IEEE Trans Syst Man Cybernet 30(5):1–10

    Google Scholar 

  • Kamrani AK, Gonzalez R (2003) A genetic algorithm-based solution methodology for modular design. J Intell Manuf 14(6):599–616

    Article  Google Scholar 

  • Kazarlis SA, Papadakis SE, Theocharis JB et al (2001) Micro genetic algorithms as generalized hill-climbing operators for GA optimization. IEEE Trans Evol Comput 5(3):204–217

    Article  Google Scholar 

  • Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5(1):41–53

    Article  Google Scholar 

  • Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. Proceedings of IEEE international swarm intelligence symposium, pp 68–75

  • Liang JJ, Baskar S, Suganthan PN et al (2006a) Performance evaluation of multiagent genetic algorithm. Nat Comput 5:83–96

    Article  MathSciNet  MATH  Google Scholar 

  • Liang JJ, Qin AK, Suganthan PN et al (2006b) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295

    Article  Google Scholar 

  • Liew YH, Joe J (2005) Large-signal diode modeling: an alternative parameter extraction technique. IEEE Trans Microw Theory Tech 53(8):2633–2638

    Article  Google Scholar 

  • Marín J, Solé RV (1999) Macro evolutionary algorithms: a new optimization method on fitness landscapes. IEEE Trans Evol Comput 3(4):272–286

    Article  Google Scholar 

  • Tsai JT, Liu TK, Chou JH (2004) Hybrid Taguchi-genetic algorithm for global numerical optimization. IEEE Trans Evol Comput 8(4):365–377

    Article  Google Scholar 

  • Tu ZG, Lu Y (2004) A robust stochastic genetic algorithms (StGA) for global numerical optimization. IEEE Trans Evol Comput 8(5):456–470

    Article  Google Scholar 

  • Vadde KK, Syrotiuk VR, Montgomery DC (2006) Optimizing protocol interaction using response surface methodology. IEEE Trans Mobile Comput 5(6):627–639

    Article  Google Scholar 

  • Whitley D, Rana D, Dzubera J et al (1996) Evaluating evolutionary algorithms. Artif Intell 85:245–276

    Article  Google Scholar 

  • Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

    Article  Google Scholar 

  • Zhong WC, Liu J, Xue MZ et al (2004) A multiagent genetic algorithm for global numerical optimization. IEEE Trans Syst Man Cybernet 34(2):1128–1141

    Article  Google Scholar 

Download references

Acknowledgements

This study was supported by the National Natural Science Foundation of China (Grant No. 60703107, 60703108), the National High Technology Research and Development Program (863 Program) of China (Grant No. 2006AA01Z107), the National Basic Research Program (973 Program) of China (Grant No. 2006CB705700) and the Program for Cheung Kong Scholars and Innovative Research Team in University (PCSIRT, IRT0645).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoying Pan.

Appendix

Appendix

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pan, X., Jiao, L. & Liu, F. An improved multi-agent genetic algorithm for numerical optimization. Nat Comput 10, 487–506 (2011). https://doi.org/10.1007/s11047-010-9192-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-010-9192-2

Keywords

Navigation