Skip to main content
SpringerLink
Log in

A ranking selection-based particle swarm optimizer for engineering design optimization problems

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

Abstract

Particle swarm optimization (PSO) algorithms have been proposed to solve optimization problems in engineering design, which are usually constrained (possibly highly constrained) and may require the use of mixed variables such as continuous, integer, and discrete variables. In this paper, a new algorithm called the ranking selection-based PSO (RSPSO) is developed. In RSPSO, the objective function and constraints are handled separately. For discrete variables, they are partitioned into ordinary discrete and categorical ones, and the latter is managed and searched directly without the concept of velocity in the standard PSO. In addition, a new ranking selection scheme is incorporated into PSO to elaborately control the search behavior of a swarm in different search phases and on categorical variables. RSPSO is relatively simple and easy to implement. Experiments on five engineering problems and a benchmark function with equality constraints were conducted. The results indicate that RSPSO is an effective and widely applicable optimizer for optimization problems in engineering design in comparison with the state-of-the-art algorithms in the area.

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

  • Aguirre AH et al (2004) Handling constraints using multiobjective optimization concepts. Int J Numer Meth Eng 59(15):1989–2017

    Article  MATH  Google Scholar 

  • Blickle T, Thiele L (1996) A comparison of selection schemes used in evolutionary algorithms. Available at: http://citeseer.ist.psu.edu/500714.html

  • Cao YJ, Wu QH (1999) A mixed variable evolutionary programming for optimisation of mechanical design. Eng Intell Syst Electr Eng Comm 7(2):77–82

    Google Scholar 

  • Clerc M (2000) Discrete particle swarm optimization: a fuzzy combinatorial black box. Available at: http://clerc.maurice.free.fr/pso/Fuzzy_Discrete_PSO/Fuzzy_DPSO.htm

  • Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41:113–127

    Article  Google Scholar 

  • Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Meth Appl Mech Eng 191:1245–1287

    Article  MATH  Google Scholar 

  • Coello CAC, Mezura-Montes E (2001) Use of dominance-based tournament selection to handle constraints in genetic algorithms. In: Dagli C, Buczak AL, Ghosh J, Embrechts MJ, Ersoy O, Kercel S (eds) Proceedings of the Intelligent Engineering Systems through Artificial Neural Networks. vol. 11. ASME, St. Louis, MO, pp 177–182

  • Deb K (1991) Optimal design of a welded beam via genetic algorithms. AIAA J 29(11):2013–2015

    Article  Google Scholar 

  • Deb K (1997) Geneas: a robust optimal design technique for mechanical component design. In: Dasgupta D, Michalewicz Z (eds) Evolutionary algorithms in engineering applications. Springer, Berlin, pp 497–451

    Google Scholar 

  • Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338

    Article  MATH  Google Scholar 

  • Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inf 26(4):30–45

    Google Scholar 

  • Deb K, Goyal M (1997) Optimizing engineering designs using a combined genetic search. In: Seventh International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, pp 521–528

  • Dolen M et al (2005) Discrete parameter-nonlinear constrained optimization of a gear train using genetic algorithms. Int J Comput Appl Tech 24(2):110–121

    Article  Google Scholar 

  • He Q, Wang L (2007a) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 86:1407–1422

    Article  MathSciNet  Google Scholar 

  • He Q, Wang L (2007b) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20:89–99

    Article  Google Scholar 

  • He S et al (2004) An improved particle swarm optimizer for mechanical design optimization problems. Eng Optim 36(5):585–605

    Article  MathSciNet  Google Scholar 

  • Hedar A, Fukushima M (2004) Derivative-free filter simulated annealing method for constrained continuous global optimization. Dept Appl Math Phys, Kyoto Univ, Kyoto, Japan, Technical Report 2004-007

  • Hu XH, Eberhart RC (2002) Solving constrained nonlinear optimization problems with particle swarm optimization. In: Proceedings of the Sixth World Multiconference on Systematics, Cybernetics and Informatics, Orlando, FL, pp 203–206

  • Jin YX et al (2007) New discrete method for particle swarm optimization and its application in transmission network expansion planning. Electr Power Syst Res 77:227–233

    Article  Google Scholar 

  • Kannan BK, Kramer SN (1994) An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. ASME J Mech Des 116(2):405–411

    Article  Google Scholar 

  • Kennedy J et al (2001) Swarm intelligence. Morgan Kaufmann, San Mateo, CA

    Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE International Conference on Neural Networks, IEEE, Piscataway, NJ, Perth, Australia 4:1942–1948

  • Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the world multiconference on systemics, cybernetics and informatics, Caracas, Venezuela, pp 4104–4109

  • Khorshid E, Seireg A (1999) Discrete nonlinear optimization by constraint decomposition and designer interaction. Int J Comput Appl Tech 12(2–5):233–244

    Article  Google Scholar 

  • Kitayama S et al (2006) Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization. Struct Multidisc Optim 32:191–202

    Article  MathSciNet  Google Scholar 

  • Lampinen J, Zelinka I (1999) Mixed integer-discrete-continuous optimization by differential evolution. In: Proceedings of the 5th International Conference on Soft Computing, Iizuka, Fukuoka, Japan, pp 71–76

  • Liao CJ et al (2005) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34:3099–3111

    Article  Google Scholar 

  • Lu HY, Chen WQ (2006) Dynamic-objective particle swarm optimization for constrained optimization problems. J Comb Optim 12:409–419

    Article  MATH  MathSciNet  Google Scholar 

  • Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput 9(1):1–17

    Article  Google Scholar 

  • Parsopoulos KE, Vrahatis MN (2002a) Particle swarm optimization method for constrained optimization problems. In: Proceedings of the 2nd Euro-International Symposium on Computational Intelligence, IOS, Kosice, SK, pp 214–220

  • Parsopoulos KE, Vrahatis MN (2002b) Recent approaches to global optimization problems through Particle Swarm Optimization. Nat Comput 1:235–306

    Article  MATH  MathSciNet  Google Scholar 

  • Parsopoulos KE, Vrahatis MN (2005) Unified particle swarm optimization for solving constrained engineering optimization problems. In: International Conference on Natural Computation, Springer, Berlin, pp 582–591

  • Pomrehn LP, Papalambros PY (1995a) Discrete optimal formulation with application to gear train design. ASME J Mech Des 117(3):419–424

    Article  Google Scholar 

  • Pomrehn LP, Papalambros PY (1995b) Infeasibility and non-optimality tests for solution space reduction in discrete optimal design. ASME J Mech Des 117(3):425–432

    Article  Google Scholar 

  • Pulido GT, Coello CAC (2004) A constraint-handling mechanism for particle swarm optimization. In: Proceedings of the 2004 Congress on Evolutionary Computation, IEEE, Piscataway, NJ, pp 1396–1403

  • Ragsdell KM, Phillips DT (1976) Optimal design of a class of welded structures using geometric programming. ASME J Eng Ind 98(3):1021–1025

    Google Scholar 

  • Rao SS (1996) Engineering optimization: theory and practice, 3rd edn. Wiley, New York

    Google Scholar 

  • Ray T, Liew KM (2001) A swarm with an effective information sharing mechanism for unconstrained and constrained single objective optimization problems. In: Proceedings of the 2001 Congress on Evolutionary Computation, IEEE, Piscataway, NJ, pp 75–80

  • Ray T, Liew KM (2003) Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans Evol Comput 7(4):386–396

    Article  Google Scholar 

  • Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294

    Article  Google Scholar 

  • Runarsson TP, Yao X (2005) Search biases in constrained evolutionary optimization. IEEE Trans Syst Man Cybern C Appl Rev 35(2):233–243

    Article  Google Scholar 

  • Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. ASME J Mech Des 112(2):223–229

    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 

  • Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the1998 IEEE Congress on Evolutionary Computation. IEEE, Piscataway, NJ, pp 69–73

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical and Electrical Engineering, Northwestern Polytechnical University, Xi’an, 710072, China

    Jinhua Wang

  2. China Aviation Powerplant Research Institute, Zhuzhou, 412002, China

    Jinhua Wang & Zeyong Yin

Authors
  1. Jinhua Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zeyong Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinhua Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, J., Yin, Z. A ranking selection-based particle swarm optimizer for engineering design optimization problems. Struct Multidisc Optim 37, 131–147 (2008). https://doi.org/10.1007/s00158-007-0222-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00158-007-0222-3

Keywords

Search

Navigation