Skip to main content
SpringerLink
Log in

Improving solution characteristics of particle swarm optimization using digital pheromones

  • Research Paper
  • Published:
Structural and Multidisciplinary Optimization Aims and scope Submit manuscript

Abstract

In this paper, a new approach to particle swarm optimization (PSO) using digital pheromones to coordinate swarms within an n-dimensional design space is presented. In a basic PSO, an initial randomly generated population swarm propagates toward the global optimum over a series of iterations. The direction of the swarm movement in the design space is based on an individual particle’s best position in its history trail (pBest), and the best particle in the entire swarm (gBest). This information is used to generate a velocity vector indicating a search direction toward a promising location in the design space. The premise of the research presented in this paper is based on the fact that the search direction for each swarm member is dictated by only two candidates—pBest and gBest, which are not efficient to locate the global optimum, particularly in multi-modal optimization problems. In addition, poor move sets specified by pBest in the initial stages of optimization can trap the swarm in a local minimum or cause slow convergence. This paper presents the use of digital pheromones for aiding communication within the swarm to improve the search efficiency and reliability, resulting in improved solution quality, accuracy, and efficiency. With empirical proximity analysis, the pheromone strength in a region of the design space is determined. The swarm then reacts accordingly based on the probability that this region may contain an optimum. The additional information from pheromones causes the particles within the swarm to explore the design space thoroughly and locate the solution more efficiently and accurately than a basic PSO. This paper presents the development of this method and results from several multi-modal test cases.

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

Similar content being viewed by others

References

  • Batkiewicz T, Dohse K, Kalivarapu V, Dohse T, Walter B, Knutzon J, Parkhurst D, Winer E, Oliver J (2006) Multimodal UAV ground control system. 11th AIAA/ISSMO multidisciplinary analysis and optimization conference, AIAA 2006-6963, Portsmouth, VA, 6–8 September

  • Bochenk P, Fory’s P (2006) Structural optimization for post-buckling behavior using particle Swarm. Struct Multidisc Optim 32(6):521–530

    Article  Google Scholar 

  • Carlisle A, Dozier G (2001) An off-the-shelf PSO. In Proceedings of the workshop on particle swarm optimization, Indianapolis

  • Clerc M (2004) Discrete particle swarm optimization. New optimization techniques in engineering. Springer, Berlin

    Google Scholar 

  • Coello CC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256–279

    Article  Google Scholar 

  • Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Varela F, Bourgine P (eds) Proceedings of the European conference on artificial life. Elsevier, Amsterdam

    Google Scholar 

  • Dorigo M, Maniezzo V, Colorni A (1996) Ant system optimization by a colony of cooperating agents. IEEE Trans Evol Comput B 26(1):29–41

    Google Scholar 

  • Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. Proceedings of the sixth international symposium on micro machine and human science. Institute of Electrical and Electronics Engineers, Piscataway, NJ, pp 39–43

    Book  Google Scholar 

  • Eberhart RC, Shi Y (2001) Particle swarm optimization: developments, applications, and resources. In: Proceedings of the 2001 congress on evolutionary computation, pp 81–86

  • Engelbrecht A (2005) Fundamentals of computational swarm intelligence. Wiley, New York

    Google Scholar 

  • Foo J, Knutzon J, Oliver J, Winer E (2006) Three-dimensional path planning of unmanned aerial vehicles using particle swarm optimization. 11th AIAA/ISSMO multidisciplinary analysis and optimization conference, AIAA 2006-6995, Portsmouth, VA, 6–8 September

  • Fourie PC, Groenwold AA (2001) The particle swarm algorithm in topology optimization. In Proceedings of the fourth world congress of structural and multidisciplinary optimization, Dalian, China

  • Fourie PC, Groenwold AA (2002) The particle swarm optimization algorithm in size and shape optimization. Struct Multidisc Optim 234:259–267

    Article  Google Scholar 

  • Gao F, Liu H, Zhao Q, Cui G (2006) Virus-evolutionary particle swarm optimization algorithm, vol 4222/2006. Springer, Berlin, pp 156–165

    Google Scholar 

  • Gaudiano P, Shargel B, Bonabeau E, Clough B (2003) Swarm intelligence: a new c2 paradigm with an application to control of swarms of UAVs. In: Proceedings of the 8th international command and control research and technology symposium

  • He S, Prempain E, Wu QH (2004) An improved particle swarm optimizer for mechanical design Optimization problems. Eng Optim 36(5):585–605

    Article  MathSciNet  Google Scholar 

  • Hu X, Eberhart R (2002) Solving constrained nonlinear optimization problems with particle swarm optimization. 6th world multiconference on systemics, cybernetics and informatics (SCI 2002), Orlando, USA

  • Hu X, Eberhart R, Shi Y (2003a) Engineering optimization with particle swarm. IEEE swarm intelligence symposium, pp 53–57

  • Hu X, Eberhart R, Shi Y (2003b) Particle swarm with extended memory for multiobjective optimization. Proceedings of 2003 IEEE swarm intelligence symposium, Indianapolis, IN, USA, IEEE Service Center, pp 193–197, Apr 2003

  • Hu X, Eberhart R, Shi Y (2003c) Swarm intelligence for permutation optimization: a case study of n-queens problem. IEEE swarm intelligence symposium, Indianapolis, IN

  • Kalivarapu V, Foo J, Winer E (2006a) Implementation of digital pheromones for use in particle swarm optimization. 47th AIAA/ASME/ASCE/AHS/ASC structures, structural dy namics and materials conference, Newport, RI, AIAA-2006-1917-941, May

  • Kalivarapu V, Foo J, Winer E (2006b) A parallel implementation of particle swarm optimization using digital pheromones. 11th AIAA/ISSMO multidisciplinary analysis and optimi zation conference. AIAA-2006-6908-694, Portsmouth, VA, Sept 2006

  • Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proceedings of the 1995 IEEE international conference on neural networks, vol 4. Institute of Electrical and Electronics Engineers, Piscataway, NJ, pp 1942–1948

    Google Scholar 

  • Kennedy J, Eberhart R (2001) Swarm intelligence. Morgan Kaufmann, San Mateo, CA

    Google Scholar 

  • Kitayama S, Arakawa M, Yamazaki K (2005) Penalty function approach for the mixed discrete non-linear problems by particle swarm optimization. Struct. Multidisc Optim 32(3):191–202

    Article  MathSciNet  Google Scholar 

  • Koh B, George AD, Haftka RT, Fregly B (2006) Parallel asynchronous particle swarm optimization. Int J Numer Methods Eng 67:578–595

    Article  MATH  Google Scholar 

  • Li X, Tian P, Hua J, Zhong N (2006) A hybrid discrete particle swarm optimization for the traveling salesman problem. Lecture notes in computer science, vol 4247/2006. Springer, Berlin, pp 181–188

    Google Scholar 

  • Liu J, Sun J, Xu W (2006) Quantum-behaved particle swarm optimization for integer programming. Lecture notes in computer science, vol 4233/2006. Springer, Berlin, pp 1042–1050

    Google Scholar 

  • Montgomery J (2002) Towards a systematic problem classification scheme for ant colony optimization. Technical report tr02-15, School of Information Technology, Bond University, Australia

  • Natsuki H, Iba H (2003) Particle swarm optimization with Gaussian mutation. Proceedings of IEEE swarm intelligence symposium, Indianapolis, pp 72–79

  • Onwubolu G, Clerc M (2004) Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 42(3):473–491

    Article  MATH  Google Scholar 

  • Parsopoulos KE, Vrahatis MN (2002) Recent approaches to global optimization problems through particle swarm optimization. Nat Comput Ser 1:235–306

    Article  MATH  MathSciNet  Google Scholar 

  • Parsopoulos KE, Vrahatis MN (2004) On the computation of all global minimizers through particle swarm optimization. IEEE Trans Evol Comput 8(3):211–224

    Article  MathSciNet  Google Scholar 

  • Parunak H, Purcell M, O’Conell R (2002) Digital pheromones for autonomous coordination of swarming UAVs. In: Proceedings of first AIAA unmanned aerospace vehicles, systems, technologies, and operations conference, AIAA, Norfolk, VA

  • Pidaparti R, Jayanti S (2003) Corrosion fatigue through particle swarm optimization. AIAA J 41(6):1167–1171

    Article  Google Scholar 

  • Rameshkumar K, Suresh R, Mohanasundaram K (2005) Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan. Lect Notes Comput Sci 3612(2005):572–581

    Article  Google Scholar 

  • Ratnaweera AC, Halgamuge SK, Watson HC (2002) Particle swarm optimiser with time varying acceleration coefficients. In: Proceedings of the international conference on soft computing and intelligent systems, pp 240–255

  • Ray T, Saini P (2001) Engineering design optimization using a swarm with an intelligent information sharing among individuals. Eng Optim 33:735–748

    Article  Google Scholar 

  • Schutte J, Groenwold A (2003) Sizing design of truss structures using the particle swarms. Struct Multidisc Optim 25:261–269

    Article  Google Scholar 

  • Schutte F, Groenwold AA (2005) A study of global optimization using particle swarm. J Glob Optim 31:93–108

    Article  MATH  MathSciNet  Google Scholar 

  • Schutte J, Reinbolt J, Fregly B, Haftka R, George A (2003) Parallel global optimization with the particle swarm algorithm. Int J Numer Meth Eng 61:2296–2315

    Article  Google Scholar 

  • Sedlaczek K, Eberhard P (2006) Using augmented Lagrangian particle swarm optimization for constrained problems in engineering. Struct Multidisc Optim 32:277–286

    Article  Google Scholar 

  • Shen B, Yao M, Yi W (2006) Heuristic information based improved fuzzy discrete PSO method for solving TSP. Lect Notes Comput Sci 4099(2006):859–863

    Google Scholar 

  • Shi Y, Eberhart R (1998a) A modified particle swarm optimizer. Proceedings of the 1998 IEEE international conference on evolutionary computation. IEEE, Piscataway, NJ, pp 69–73

    Google Scholar 

  • Shi Y, Eberhart R (1998b) Parameter selection in particle swarm optimization. Proceedings of the 1998 annual conference on evolutionary computation, Mar 1998

  • Suganthan PN (1999) Particle swarm optimiser with neighborhood operator. Proceedings of the IEEE congress on evolutionary computation. IEEE, Piscataway, NJ, pp 1958–1962

    Google Scholar 

  • Tayal M, Wang B (1999) Particle swarm optimization for mixed discrete, integer and continuous variables. 10th AIAA/ISSMO multidisciplinary analysis and optimization conference, Albany, New York, 30–31 Aug

  • Tianzhu W, Wenhui L, Yi W, Zihou G, Dongfeng H (2006) An adaptive stochastic collision detection between deformable objects using particle swarm optimization. Lect Notes Comput Sci 3907/2006:450–459

    Article  Google Scholar 

  • Venter G, Sobieski J (2003) Particle swarm optimization. AIAA J 41(8):1583–1589

    Article  Google Scholar 

  • Venter G, Sobieski J (2004) Multidisciplinary optimization of a transport aircraft wing using particle swarm optimization. Struct Multidisc Optim 26(1–2):121–131

    Article  Google Scholar 

  • Walter B, Sannier A, Reiners D, Oliver J (2005) UAV swarm control: calculating digital pheromone fields with the GPU. The Interservice/Industry training, simulation and education conference (I/ITSEC), vol 2005 (Conference theme: One team. One fight. One training future).

  • Web Reference for Test Problems (2007a) Global optimization. http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO_files/Page364.htm. Cited 8 Nov 2007

  • Web Reference for Test Problems (2007b) GEATbx: example functions (single and multi-objective functions) 2 parametric optimization. http://www.geatbx.com/docu/fcnindex-01.html. Cited 8 Nov 2007

  • White T, Pagurek B (1998) Towards multi-swarm problem solving in networks, ICMAS. Third international conference on multi agent systems (ICMAS’98), pp 333

  • Yang Q, Sun J, Zhang J, Wang C (2006a) A hybrid particle swarm optimization for binary CSPs. Lect Notes Comput Sci 4115/2006:39–49

    Article  Google Scholar 

  • Yang S, Huang R, Shi H (2006b) Mobile agent routing based on a two-stage optimization model and a hybrid evolutionary algorithm in wireless sensor networks. Lect Notes Comput Sci 4222/2006:938–947

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Iowa State University, 1620 Howe Hall, Virtual Reality Applications Center, Ames, IA, 50011, USA

    Vijay Kalivarapu, Jung-Leng Foo & Eliot Winer

Authors
  1. Vijay Kalivarapu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jung-Leng Foo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eliot Winer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vijay Kalivarapu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalivarapu, V., Foo, JL. & Winer, E. Improving solution characteristics of particle swarm optimization using digital pheromones. Struct Multidisc Optim 37, 415–427 (2009). https://doi.org/10.1007/s00158-008-0240-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00158-008-0240-9

Keywords

Search

Navigation