Skip to main content
Erschienen in: Soft Computing 8/2018

29.06.2017 | Foundations

An orthogonal parallel symbiotic organism search algorithm embodied with augmented Lagrange multiplier for solving constrained optimization problems

verfasst von: Arnapurna Panda, Sabyasachi Pani

Erschienen in: Soft Computing | Ausgabe 8/2018

Einloggen

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

search-config
loading …

Abstract

Many practical engineering design problems need constrained optimization. The literature reports several meta-heuristic algorithms have been applied to solve constrained optimization problems. In many cases, the algorithms fail due to violation of constraints. Recently in 2014, a new meta-heuristic algorithm known as symbiotic organism search (SOS) is reported by Cheng and Prayogo. It is inspired by the natural phenomenon of interaction between organisms in an ecosystem which help them to survive and grow. In this paper, the SOS algorithm is combined with augmented Lagrange multiplier (ALM) method to solve the constrained optimization problems. The ALM is accurate and effective as the constraints in this case do not have the power to restrict the search space or search direction. The orthogonal array strategies have gained popularity among the meta-heuristic researchers due to its potentiality to enhance the exploitation process of the algorithms. Simultaneously, researchers are also looking at designing parallel version of the meta-heuristics to reduce the computational burden. In order to enhance the performance, an Orthogonal Parallel SOS (OPSOS) is developed. The OPSOS along with ALM method is a suitable combination which is used here to solve twelve benchmark nonlinear constrained problems and four engineering design problems. Simulation study reveals that the proposed approach has almost similar accuracy with lower run time than ALM with Orthogonal SOS. Comparative analysis also establish superior performance over ALM with orthogonal colliding bodies optimization, modified artificial bee colony, augmented Lagrangian-based particle swarm optimization and Penalty function-based genetic algorithm.

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!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Abdullahi M, Ngadi MA (2015) Symbiotic organism search optimization based task scheduling in cloud computing environment. Future Gener Comput Syst 56:640–650CrossRef Abdullahi M, Ngadi MA (2015) Symbiotic organism search optimization based task scheduling in cloud computing environment. Future Gener Comput Syst 56:640–650CrossRef
Zurück zum Zitat Afonso MV, Bioucas-Dias JM, Figueiredo MA (2011) An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems. IEEE Trans Image Process 20(3):681–695MathSciNetCrossRefMATH Afonso MV, Bioucas-Dias JM, Figueiredo MA (2011) An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems. IEEE Trans Image Process 20(3):681–695MathSciNetCrossRefMATH
Zurück zum Zitat Baghel V, Nanda SJ, Panda G (2011) New GOPSO and its application to robust identification. In: Proceedings of IEEE international conference on energy, automation, and signal, pp 1–6 Baghel V, Nanda SJ, Panda G (2011) New GOPSO and its application to robust identification. In: Proceedings of IEEE international conference on energy, automation, and signal, pp 1–6
Zurück zum Zitat Cagnina LC, Esquivel SC, Coello CAC (2011) Solving constrained optimization problems with a hybrid particle swarm optimization algorithm. Eng Optim 43(8):843–866MathSciNetCrossRef Cagnina LC, Esquivel SC, Coello CAC (2011) Solving constrained optimization problems with a hybrid particle swarm optimization algorithm. Eng Optim 43(8):843–866MathSciNetCrossRef
Zurück zum Zitat Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112CrossRef Cheng MY, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112CrossRef
Zurück zum Zitat Cheng MY, Prayogo D, Tran DH (2015) Optimizing multiple-resources leveling in multiple projects using discrete symbiotic organisms search. J Comput Civil Eng 30(3):04015036CrossRef Cheng MY, Prayogo D, Tran DH (2015) Optimizing multiple-resources leveling in multiple projects using discrete symbiotic organisms search. J Comput Civil Eng 30(3):04015036CrossRef
Zurück zum Zitat Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11):1245–1287MathSciNetCrossRefMATH Coello CAC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11):1245–1287MathSciNetCrossRefMATH
Zurück zum Zitat Cung VD, Martins SL, Ribeiro CC, Roucairol C (2002) Strategies for the parallel implementation of metaheuristics. Essays and surveys in metaheuristics. Springer, USMATH Cung VD, Martins SL, Ribeiro CC, Roucairol C (2002) Strategies for the parallel implementation of metaheuristics. Essays and surveys in metaheuristics. Springer, USMATH
Zurück zum Zitat Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2–4):311–338CrossRefMATH Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2–4):311–338CrossRefMATH
Zurück zum Zitat Fogarty TC, Huang R (1990) Implementing the genetic algorithm on transputer based parallel processing systems. In: International conference on parallel problem solving from nature, Springer, Berlin, pp 145–149 Fogarty TC, Huang R (1990) Implementing the genetic algorithm on transputer based parallel processing systems. In: International conference on parallel problem solving from nature, Springer, Berlin, pp 145–149
Zurück zum Zitat Ghasemishabankareh B, Li X, Ozlen M (2016) Cooperative coevolutionary differential evolution with improved augmented Lagrangian to solve constrained optimisation problems. Inf Sci 369:441–456MathSciNetCrossRef Ghasemishabankareh B, Li X, Ozlen M (2016) Cooperative coevolutionary differential evolution with improved augmented Lagrangian to solve constrained optimisation problems. Inf Sci 369:441–456MathSciNetCrossRef
Zurück zum Zitat Gong W, Cai Z, Ling CX (2006) ODE: a fast and robust differential evolution based on orthogonal design. In: Proceedings of 19th Australian joint conference on artificial intelligence. Advances in artificial intelligence, Springer, Berlin, pp 709–718 Gong W, Cai Z, Ling CX (2006) ODE: a fast and robust differential evolution based on orthogonal design. In: Proceedings of 19th Australian joint conference on artificial intelligence. Advances in artificial intelligence, Springer, Berlin, pp 709–718
Zurück zum Zitat Gong W, Cai Z, Jiang L (2008) Enhancing the performance of differential evolution using orthogonal design method. Appl Math Comput 206(1):56–69MATH Gong W, Cai Z, Jiang L (2008) Enhancing the performance of differential evolution using orthogonal design method. Appl Math Comput 206(1):56–69MATH
Zurück zum Zitat He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99MathSciNetCrossRef He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99MathSciNetCrossRef
Zurück zum Zitat He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MathSciNetMATH He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MathSciNetMATH
Zurück zum Zitat Ho SY, Lin HS, Liauh WH, Ho SJ (2008) OPSO: orthogonal particle swarm optimization and its application to task assignment problems. IEEE Trans Syst Man Cybern A Syst Hum 38(2):288–298 Ho SY, Lin HS, Liauh WH, Ho SJ (2008) OPSO: orthogonal particle swarm optimization and its application to task assignment problems. IEEE Trans Syst Man Cybern A Syst Hum 38(2):288–298
Zurück zum Zitat Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356MathSciNetMATH Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356MathSciNetMATH
Zurück zum Zitat Jansen PW, Perez RE (2011) Constrained structural design optimization via a parallel augmented Lagrangian particle swarm optimization approach. Comput Struct 89(13):1352–1366CrossRef Jansen PW, Perez RE (2011) Constrained structural design optimization via a parallel augmented Lagrangian particle swarm optimization approach. Comput Struct 89(13):1352–1366CrossRef
Zurück zum Zitat Joines JA, Houck CR (1994) On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA’s. In: IEEE congress on evolutionary computation, pp 579–584 Joines JA, Houck CR (1994) On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA’s. In: IEEE congress on evolutionary computation, pp 579–584
Zurück zum Zitat Kamankesh H, Agelidis VG, Kavousi-Fard A (2016) Optimal scheduling of renewable micro-grids considering plug-in hybrid electric vehicle charging demand. Energy 100:285–297CrossRef Kamankesh H, Agelidis VG, Kavousi-Fard A (2016) Optimal scheduling of renewable micro-grids considering plug-in hybrid electric vehicle charging demand. Energy 100:285–297CrossRef
Zurück zum Zitat Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11(3):3021–3031CrossRef Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11(3):3021–3031CrossRef
Zurück zum Zitat Kong H, Li N, Shen Y (2015) Adaptive double chain quantum genetic algorithm for constrained optimization problems. Chin J Aeronaut 28(1):214–228CrossRef Kong H, Li N, Shen Y (2015) Adaptive double chain quantum genetic algorithm for constrained optimization problems. Chin J Aeronaut 28(1):214–228CrossRef
Zurück zum Zitat Lemonge ACC, Barbosa HJC (2004) An adaptive penalty scheme for genetic algorithms in structural optimization. Int J Numer Methods Eng 59:703–736CrossRefMATH Lemonge ACC, Barbosa HJC (2004) An adaptive penalty scheme for genetic algorithms in structural optimization. Int J Numer Methods Eng 59:703–736CrossRefMATH
Zurück zum Zitat Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5(1):41–53CrossRef Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5(1):41–53CrossRef
Zurück zum Zitat Lin CH (2013) A rough penalty genetic algorithm for constrained optimization. Inf Sci 241:119–137CrossRef Lin CH (2013) A rough penalty genetic algorithm for constrained optimization. Inf Sci 241:119–137CrossRef
Zurück zum Zitat Liu H, Li P, Wen Y (2006) Parallel ant colony optimization algorithm. In: 6th IEEE world congress on intelligent control and automation, vol 1, pp 3222–3226 Liu H, Li P, Wen Y (2006) Parallel ant colony optimization algorithm. In: 6th IEEE world congress on intelligent control and automation, vol 1, pp 3222–3226
Zurück zum Zitat Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640CrossRef Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640CrossRef
Zurück zum Zitat Long W, Liang X, Huang Y, Chen Y (2014) An effective hybrid cuckoo search algorithm for constrained global optimization. Neural Comput Appl 25(3–4):911–926CrossRef Long W, Liang X, Huang Y, Chen Y (2014) An effective hybrid cuckoo search algorithm for constrained global optimization. Neural Comput Appl 25(3–4):911–926CrossRef
Zurück zum Zitat Nanda SJ, Panda G (2013) Automatic clustering algorithm based on multi-objective immunized PSO to classify actions of 3D human models. Eng Appl Artif Intell 26(5):1429–1441CrossRef Nanda SJ, Panda G (2013) Automatic clustering algorithm based on multi-objective immunized PSO to classify actions of 3D human models. Eng Appl Artif Intell 26(5):1429–1441CrossRef
Zurück zum Zitat Panda A, Pani S (2016) A symbiotic organisms search algorithm with adaptive penalty function to solve multi-objective constrained optimization problems. Appl Soft Comput 46:344–360CrossRef Panda A, Pani S (2016) A symbiotic organisms search algorithm with adaptive penalty function to solve multi-objective constrained optimization problems. Appl Soft Comput 46:344–360CrossRef
Zurück zum Zitat Panda A, Pani S (2016) A WNN model trained with orthogonal colliding bodies optimization for accurate identification of hammerstein plant. In: Proceedings of IEEE congress on evolutionary computation (CEC-2016), Vancouver Panda A, Pani S (2016) A WNN model trained with orthogonal colliding bodies optimization for accurate identification of hammerstein plant. In: Proceedings of IEEE congress on evolutionary computation (CEC-2016), Vancouver
Zurück zum Zitat Panda A, Pani S (2016) Improved Identification of hammerstein plant using a non-linear model trained with symbiotic organisms search. In: Proceedings of IEEE region 10 conference (TENCON 2016), pp 247–250 Panda A, Pani S (2016) Improved Identification of hammerstein plant using a non-linear model trained with symbiotic organisms search. In: Proceedings of IEEE region 10 conference (TENCON 2016), pp 247–250
Zurück zum Zitat Pattnaik SS, Bakwad KM, Devi S, Panigrahi BK, Das S (2011) Parallel bacterial foraging optimization. In: Handbook of swarm intelligence. Springer, Berlin, pp 487–502 Pattnaik SS, Bakwad KM, Devi S, Panigrahi BK, Das S (2011) Parallel bacterial foraging optimization. In: Handbook of swarm intelligence. Springer, Berlin, pp 487–502
Zurück zum Zitat Prayogo D (2015) An innovative parameter-free symbiotic organisms search (SOS) for solving construction-engineering problems. Ph.D. Thesis, Department of Construction Engineering, National Taiwan University of Science and Technology Prayogo D (2015) An innovative parameter-free symbiotic organisms search (SOS) for solving construction-engineering problems. Ph.D. Thesis, Department of Construction Engineering, National Taiwan University of Science and Technology
Zurück zum Zitat 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–396CrossRef 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–396CrossRef
Zurück zum Zitat Rocha AMA, Martins TF, Fernandes EM (2011) An augmented Lagrangian fish swarm based method for global optimization. J Comput Appl Math 235(16):4611–4620MathSciNetCrossRefMATH Rocha AMA, Martins TF, Fernandes EM (2011) An augmented Lagrangian fish swarm based method for global optimization. J Comput Appl Math 235(16):4611–4620MathSciNetCrossRefMATH
Zurück zum Zitat Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4:284–294CrossRef Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4:284–294CrossRef
Zurück zum Zitat Runarsson TP, Yao X (2005) Search biases in constrained evolutionary optimization. IEEE Trans Syst Man Cybern C Appl Rev 35:233–243CrossRef Runarsson TP, Yao X (2005) Search biases in constrained evolutionary optimization. IEEE Trans Syst Man Cybern C Appl Rev 35:233–243CrossRef
Zurück zum Zitat Schutte JF, Reinbolt JA, Fregly BJ, Haftka RT, George AD (2004) Parallel global optimization with the particle swarm algorithm. Int J Numer Methods Eng 61(13):2296–2315CrossRefMATH Schutte JF, Reinbolt JA, Fregly BJ, Haftka RT, George AD (2004) Parallel global optimization with the particle swarm algorithm. Int J Numer Methods Eng 61(13):2296–2315CrossRefMATH
Zurück zum Zitat Sedlaczek K, Eberhard P (2006) Using augmented Lagrangian particle swarm optimization for constrained problems in engineering. Struct Multidiscip Optim 32(4):277–286CrossRef Sedlaczek K, Eberhard P (2006) Using augmented Lagrangian particle swarm optimization for constrained problems in engineering. Struct Multidiscip Optim 32(4):277–286CrossRef
Zurück zum Zitat Shukla UP, Nanda SJ (2016) Parallel social spider clustering algorithm for high dimensional datasets. Eng Appl Artif Intell 56:75–90CrossRef Shukla UP, Nanda SJ (2016) Parallel social spider clustering algorithm for high dimensional datasets. Eng Appl Artif Intell 56:75–90CrossRef
Zurück zum Zitat Tahk MJ, Sun BC (2000) Coevolutionary augmented Lagrangian methods for constrained optimization. IEEE Trans Evol Comput 4(2):114–124CrossRef Tahk MJ, Sun BC (2000) Coevolutionary augmented Lagrangian methods for constrained optimization. IEEE Trans Evol Comput 4(2):114–124CrossRef
Zurück zum Zitat Tejani GG, Savsani VJ, Patel VK (2016) Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization. J Comput Des Eng 3(3):226–249 Tejani GG, Savsani VJ, Patel VK (2016) Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization. J Comput Des Eng 3(3):226–249
Zurück zum Zitat Tran DH, Cheng MY, Prayogo D (2016) A novel multiple objective symbiotic organisms search (MOSOS) for timecostlabor utilization tradeoff problem. Knowl Based Syst 94:132–145CrossRef Tran DH, Cheng MY, Prayogo D (2016) A novel multiple objective symbiotic organisms search (MOSOS) for timecostlabor utilization tradeoff problem. Knowl Based Syst 94:132–145CrossRef
Zurück zum Zitat Vincent FY, Redi AP, Yang CL, Ruskartina E, Santosa B (2017) Symbiotic organisms search and two solution representations for solving the capacitated vehicle routing problem. Appl Soft Comput 52:657–672CrossRef Vincent FY, Redi AP, Yang CL, Ruskartina E, Santosa B (2017) Symbiotic organisms search and two solution representations for solving the capacitated vehicle routing problem. Appl Soft Comput 52:657–672CrossRef
Zurück zum Zitat Yang J, Bouzerdoum A, Phung SL (2010) A particle swarm optimization algorithm based on orthogonal design. In: Proceedings of IEEE evolutionary computation (CEC 10), pp 1–7 Yang J, Bouzerdoum A, Phung SL (2010) A particle swarm optimization algorithm based on orthogonal design. In: Proceedings of IEEE evolutionary computation (CEC 10), pp 1–7
Zurück zum Zitat Yeniay O (2005) Penalty function methods for constrained optimization with genetic algorithms. Math Comput Appl 10(1):45–56MathSciNet Yeniay O (2005) Penalty function methods for constrained optimization with genetic algorithms. Math Comput Appl 10(1):45–56MathSciNet
Zurück zum Zitat Zahara E, Kao Y (2009) Hybrid NelderMead simplex search and particle swarm optimization for constrained engineering design problems. Expert Syst Appl 36(2):3880–3886CrossRef Zahara E, Kao Y (2009) Hybrid NelderMead simplex search and particle swarm optimization for constrained engineering design problems. Expert Syst Appl 36(2):3880–3886CrossRef
Zurück zum Zitat Zhan ZH, Zhang J, Li Y, Shi YH (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832–847CrossRef Zhan ZH, Zhang J, Li Y, Shi YH (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832–847CrossRef
Zurück zum Zitat Zhang C, Lin Q, Gao L, Li X (2015) Backtracking search algorithm with three constraint handling methods for constrained optimization problems. Expert Syst Appl 42(21):7831–7845CrossRef Zhang C, Lin Q, Gao L, Li X (2015) Backtracking search algorithm with three constraint handling methods for constrained optimization problems. Expert Syst Appl 42(21):7831–7845CrossRef
Zurück zum Zitat Zhang Q, Leung YW (1999) An orthogonal genetic algorithm for multimedia multicast routing. IEEE Trans Evol Comput 3: 53–62CrossRef Zhang Q, Leung YW (1999) An orthogonal genetic algorithm for multimedia multicast routing. IEEE Trans Evol Comput 3: 53–62CrossRef
Metadaten
Titel
An orthogonal parallel symbiotic organism search algorithm embodied with augmented Lagrange multiplier for solving constrained optimization problems
verfasst von
Arnapurna Panda
Sabyasachi Pani
Publikationsdatum
29.06.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 8/2018
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-017-2693-5

Weitere Artikel der Ausgabe 8/2018

Soft Computing 8/2018 Zur Ausgabe

Methodologies and Application

The rainbow spanning forest problem