Skip to main content
Erschienen in: Soft Computing 21/2019

08.03.2019 | Methodologies and Application

A nested particle swarm algorithm based on sphere mutation to solve bi-level optimization

verfasst von: Long Zhao, JingXuan Wei

Erschienen in: Soft Computing | Ausgabe 21/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The problem of bi-level optimization has always been a hot topic due to its extensive application. Increasing size and complexity have prompted theoretical and practical interest in the design of effective algorithm. This paper adopts particle swarm algorithm (PSO) at both level. First, given the nested nature of bi-level problem, we introduce a hyper-sphere search into PSO as mutation operator to maintain the swarms diversity. Second, for complex constraints processing, the proposed algorithm adopts a dynamic constraint handling strategy, which makes the solution located on the constraint boundary easier to be obtained. Third, a quadratic approximation mutation is introduced into PSO, which guides particles to a better search area. Finally, the convergence is proved and the simulation results show that the proposed algorithm is effective.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Aiyoshi E, Shimizu K (1981) Hierarchical decentralized systems and its new solution by a barrier method. IEEE Trans Syst Man Cybern 6:444–449MathSciNet Aiyoshi E, Shimizu K (1981) Hierarchical decentralized systems and its new solution by a barrier method. IEEE Trans Syst Man Cybern 6:444–449MathSciNet
Zurück zum Zitat Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396–415MathSciNetCrossRef Arqub OA, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396–415MathSciNetCrossRef
Zurück zum Zitat Arqub OA, Mohammed AS, Momani S, Hayat T (2016) Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Soft Comput 20(8):3283–3302CrossRef Arqub OA, Mohammed AS, Momani S, Hayat T (2016) Numerical solutions of fuzzy differential equations using reproducing kernel Hilbert space method. Soft Comput 20(8):3283–3302CrossRef
Zurück zum Zitat Arqub OA, Al-Smadi M, Momani S, Hayat T (2017) Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems. Soft Comput 21(23):7191–7206CrossRef Arqub OA, Al-Smadi M, Momani S, Hayat T (2017) Application of reproducing kernel algorithm for solving second-order, two-point fuzzy boundary value problems. Soft Comput 21(23):7191–7206CrossRef
Zurück zum Zitat Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9(1):77–100MathSciNetCrossRef Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9(1):77–100MathSciNetCrossRef
Zurück zum Zitat Bendsøe MP, Sigmund O (1995) Optimization of structural topology, shape, and material, vol 414. Springer, BerlinCrossRef Bendsøe MP, Sigmund O (1995) Optimization of structural topology, shape, and material, vol 414. Springer, BerlinCrossRef
Zurück zum Zitat Bianco L, Caramia M, Giordani S (2009) A bilevel flow model for hazmat transportation network design. Transp Res Part C Emerg Technol 17(2):175–196CrossRef Bianco L, Caramia M, Giordani S (2009) A bilevel flow model for hazmat transportation network design. Transp Res Part C Emerg Technol 17(2):175–196CrossRef
Zurück zum Zitat Brotcorne L, Labbé M, Marcotte P, Savard G (2001) A bilevel model for toll optimization on a multicommodity transportation network. Transp Sci 35(4):345–358CrossRef Brotcorne L, Labbé M, Marcotte P, Savard G (2001) A bilevel model for toll optimization on a multicommodity transportation network. Transp Sci 35(4):345–358CrossRef
Zurück zum Zitat Brown G, Carlyle M, Diehl D, Kline J, Wood K (2005) A two-sided optimization for theater ballistic missile defense. Oper Res 53(5):745–763MathSciNetCrossRef Brown G, Carlyle M, Diehl D, Kline J, Wood K (2005) A two-sided optimization for theater ballistic missile defense. Oper Res 53(5):745–763MathSciNetCrossRef
Zurück zum Zitat Brown GG, Carlyle WM, Harney RC, Skroch EM, Wood RK (2009) Interdicting a nuclear-weapons project. Oper Res 57(4):866–877CrossRef Brown GG, Carlyle WM, Harney RC, Skroch EM, Wood RK (2009) Interdicting a nuclear-weapons project. Oper Res 57(4):866–877CrossRef
Zurück zum Zitat Christiansen S, Patriksson M, Wynter L (2001) Stochastic bilevel programming in structural optimization. Struct Multidiscip Optim 21(5):361–371CrossRef Christiansen S, Patriksson M, Wynter L (2001) Stochastic bilevel programming in structural optimization. Struct Multidiscip Optim 21(5):361–371CrossRef
Zurück zum Zitat Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS’95. IEEE, pp 39–43 Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS’95. IEEE, pp 39–43
Zurück zum Zitat Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13(5):1194–1217MathSciNetCrossRef Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13(5):1194–1217MathSciNetCrossRef
Zurück zum Zitat Herskovits J, Leontiev A, Dias G, Santos G (2000) Contact shape optimization: a bi-level programming approach. Struct Multidiscip Optim 20(3):214–221CrossRef Herskovits J, Leontiev A, Dias G, Santos G (2000) Contact shape optimization: a bi-level programming approach. Struct Multidiscip Optim 20(3):214–221CrossRef
Zurück zum Zitat Islam MM, Singh HK, Ray T (2017) A surrogate assisted approach for single-objective bilevel optimization. IEEE Trans Evolut Comput 21(5):681–696CrossRef Islam MM, Singh HK, Ray T (2017) A surrogate assisted approach for single-objective bilevel optimization. IEEE Trans Evolut Comput 21(5):681–696CrossRef
Zurück zum Zitat Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evolut Comput 5(1):41–53CrossRef Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evolut Comput 5(1):41–53CrossRef
Zurück zum Zitat Li X, Tian P, Min X (2006) A hierarchical particle swarm optimization for solving bi-level programming problems. In: International conference on artificial intelligence and soft computing. Springer, pp 1169–1178 Li X, Tian P, Min X (2006) A hierarchical particle swarm optimization for solving bi-level programming problems. In: International conference on artificial intelligence and soft computing. Springer, pp 1169–1178
Zurück zum Zitat Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. RAIRO Oper Res 28(1):1–21MathSciNetCrossRef Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. RAIRO Oper Res 28(1):1–21MathSciNetCrossRef
Zurück zum Zitat Missen RW, Smith WR (1982) Chemical reaction equilibrium analysis: theory and algorithms. Wiley, Hoboken Missen RW, Smith WR (1982) Chemical reaction equilibrium analysis: theory and algorithms. Wiley, Hoboken
Zurück zum Zitat Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: 2002 IEEE international conference on artificial intelligence systems, 2002 (ICAIS 2002). IEEE, pp 322–327 Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: 2002 IEEE international conference on artificial intelligence systems, 2002 (ICAIS 2002). IEEE, pp 322–327
Zurück zum Zitat Rudolph G, Agapie A (2000) Convergence properties of some multi-objective evolutionary algorithms. In: Proceedings of the 2000 congress on evolutionary computation, 2000. IEEE, vol 2, pp 1010–1016 Rudolph G, Agapie A (2000) Convergence properties of some multi-objective evolutionary algorithms. In: Proceedings of the 2000 congress on evolutionary computation, 2000. IEEE, vol 2, pp 1010–1016
Zurück zum Zitat Sinha A, Malo P, Deb K (2013a) Efficient evolutionary algorithm for single-objective bilevel optimization. arXiv preprint arXiv:1303.3901 Sinha A, Malo P, Deb K (2013a) Efficient evolutionary algorithm for single-objective bilevel optimization. arXiv preprint arXiv:​1303.​3901
Zurück zum Zitat Sinha A, Malo P, Frantsev A, Deb K (2013b) Multi-objective stackelberg game between a regulating authority and a mining company: a case study in environmental economics. In: 2013 IEEE congress on evolutionary computation (CEC). IEEE, pp 478–485 Sinha A, Malo P, Frantsev A, Deb K (2013b) Multi-objective stackelberg game between a regulating authority and a mining company: a case study in environmental economics. In: 2013 IEEE congress on evolutionary computation (CEC). IEEE, pp 478–485
Zurück zum Zitat Sinha A, Malo P, Deb K (2014) Test problem construction for single-objective bilevel optimization. Evolut Comput 22(3):439–477CrossRef Sinha A, Malo P, Deb K (2014) Test problem construction for single-objective bilevel optimization. Evolut Comput 22(3):439–477CrossRef
Zurück zum Zitat Sinha A, Malo P, Deb K (2016) Solving optimistic bilevel programs by iteratively approximating lower level optimal value function. In: IEEE Congress on evolutionary computation (CEC) 2016. IEEE, pp 1877–1884 Sinha A, Malo P, Deb K (2016) Solving optimistic bilevel programs by iteratively approximating lower level optimal value function. In: IEEE Congress on evolutionary computation (CEC) 2016. IEEE, pp 1877–1884
Zurück zum Zitat Von Stackelberg H (1952) The theory of the market economy. Oxford University Press, Oxford Von Stackelberg H (1952) The theory of the market economy. Oxford University Press, Oxford
Zurück zum Zitat Zhao L, Wei J, Li M (2017) Research on video server placement and flux plan based on GA. In: 2017 13th international conference on computational intelligence and security (CIS). IEEE, pp 35–38 Zhao L, Wei J, Li M (2017) Research on video server placement and flux plan based on GA. In: 2017 13th international conference on computational intelligence and security (CIS). IEEE, pp 35–38
Metadaten
Titel
A nested particle swarm algorithm based on sphere mutation to solve bi-level optimization
verfasst von
Long Zhao
JingXuan Wei
Publikationsdatum
08.03.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 21/2019
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-019-03888-6

Weitere Artikel der Ausgabe 21/2019

Soft Computing 21/2019 Zur Ausgabe