nach oben

Soft Computing

Erschienen in:

13.12.2019 | Methodologies and Application

A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process

verfasst von: Nirmal Kumar, Sanat Kumar Mahato, Asoke Kumar Bhunia

Erschienen in: Soft Computing | Ausgabe 15/2020

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

The goal of this paper is to propose a new hybrid algorithm based on advanced quantum behaved particle swarm optimization (QPSO) technique and binary tournamenting for solving constrained optimization problems. In binary tournamenting, six different situations/options are considered and accordingly six variants of hybrid algorithms are proposed. Then to test the efficiency and performance of these algorithms and also to select the best algorithm among these, six benchmark optimization problems are selected and solved. Then the computational results are compared graphically as well as numerically. Finally, the best found algorithm is applied to solve three engineering design problems and the computational results are compared with the existing algorithms available in the literature.

Vorheriger Artikel Combining technique for order preference by similarity to ideal solution with relative preference relation for interval-valued fuzzy multi-criteria decision-making

Nächster Artikel Data augmentation using MG-GAN for improved cancer classification on gene expression data

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren

Nur mit Berechtigung zugänglich

Bharati (1994) Controlled random search optimization technique and their applications. Dissertation, Department of Mathematics, University of Roorkee, Roorkee, India

Bhunia AK, Samanta SS (2014) A study of interval metric and its application in multi-objective optimization with interval objectives. Comput Ind Eng 74:169–178

Cagnina LC, Esquivel SC, Coello CAC (2008) Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32(3):319–326MATH

Caraffini F, Neri F, Iacca G, Mol A (2013) Parallel memetic structures. Inf Sci 227:60–82MathSciNet

Caraffini F, Neri F, Picinali L (2014) An analysis on separability for memetic computing automatic design. Inf Sci 265:1–22MathSciNet

Clerc M (1999) The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol 3. IEEE, pp 1951–1957

Clerc M, Kennedy J (2002) The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73

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

Deep K (2007) A new hybrid self organizing migrating genetic algorithm for function optimization. In: 2007 IEEE congress on evolutionary computation. IEEE, pp 2796–2803

Deep K (2008) A self-organizing migrating genetic algorithm for constrained optimization. Appl Math Comput 198(1):237–250MathSciNetMATH

Dos Santos Coelho L (2010) Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems. Expert Syst Appl 37(2):1676–1683

Duary A (2019) Development and Applications of Hybrid algorithms in optimization with crisp and Interval Objectives. Dissertation, The University of Burdwan, West Bengal, India

Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS’95. Proceedings of the sixth international symposium on micro machine and human science. IEEE, pp 39–43

Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Willey, New YorkMATH

Gandomi AH, Yang XS, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(1):17–35

Garg H (2014) Solving structural engineering design optimization problems using an artificial bee colony algorithm. J Ind Manag Optim 10(3):777–794MathSciNetMATH

Garg H (2019) A hybrid GSA-GA algorithm for constrained optimization problems. Inf Sci 478:499–523

Gupta RK, Bhunia AK, Roy D (2009) A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components. J Comput Appl Math 232(2):275–284MathSciNetMATH

Hesse R (1973) A heuristic search procedure for estimating a global solution of nonconvex programming problems. Oper Res 21(6):1267–1280MATH

Himmelblau DM (1972) Applied nonlinear programming. McGraw-Hill, New YorkMATH

Hsu YL, Liu TC (2007) Developing a fuzzy proportional–derivative controller optimization engine for engineering design optimization problems. Eng Optim 39(6):679–700MathSciNet

Kaveh A, Talatahari S (2010) An improved ant colony optimization for constrained engineering design problems. Eng Comput 27(1):155–182MATH

Krink T, Løvbjerg M (2002) The lifecycle model: combining particle swarm optimisation, genetic algorithms and hill climbers. In: International conference on parallel problem solving from nature. Springer, Berlin, pp 621–630

Kuang JK, Rao SS, Chen L (1998) Taguchi-aided search method for design optimization of engineering systems. Eng Optim 30(1):1–23

Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188(2):1567–1579MathSciNetMATH

Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs. Springer, BerlinMATH

Michalewicz Z, Schoenauer M (1996) Evolutionary computation for constrained parameter optimization problems. Evol Comput 4(1):1–32

Omran MG, Salman A (2009) Constrained optimization using CODEQ Chaos. Solitons Fractals 42(2):662–668MATH

Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATH

Salkin HM (1975) Integer programming. Edison Wesley Publishing Com, AmsterdamMATH

Schittkowski K (1987) More examples for mathematical programming codes. Lecture notes in economics and mathematical systems, 282. Springer, Berlin

Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360). IEEE, pp 69–73

Sun J, Feng B, Xu W (2004) Particle swarm optimization with particles having quantum behavior. In: Proceedings of the 2004 congress on evolutionary computation (IEEE Cat. No. 04TH8753), vol 1. IEEE, pp 325–331

Sun J, Fang W, Palade V, Wu X, Xu W (2011) Quantum-behaved particle swarm optimization with Gaussian distributed local attractor point. Appl Math Comput 218(7):3763–3775MATH

Tam JH, Ong ZC, Ismail Z, Ang BC, Khoo SY (2019) A new hybrid GA–ACO–PSO algorithm for solving various engineering design problems. Int J Comput Math 96(5):883–919MathSciNet

Wu T, Xie L, Chen X, He J (2017) Dual sub-swarm interaction QPSO algorithm based on different correlation coefficients. Automatika 58(4):375–383

Xi M, Sun J, Xu W (2008) An improved quantum-behaved particle swarm optimization algorithm with weighted mean best position. Appl Math Comput 205(2):751–759MATH

Xu W, Sun J (2005) Adaptive parameter selection of quantum-behaved particle swarm optimization on global level. In: International conference on intelligent computing. Springer, Berlin, pp 420–428

Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074

Titel: A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process
verfasst von: Nirmal Kumar
Sanat Kumar Mahato
Asoke Kumar Bhunia
Publikationsdatum: 13.12.2019
Verlag: Springer Berlin Heidelberg
Erschienen in: Soft Computing / Ausgabe 15/2020
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI: https://doi.org/10.1007/s00500-019-04601-3

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 15/2020

Development of harmonic aggregation operator with trapezoidal Pythagorean fuzzy numbers

Multi-objective cluster analysis using a gradient evolution algorithm

Study on Green’s relations in ordered semihypergroups

Adaptive wavelet ELM-fuzzy inference system-based soft computing model for power estimation in sustainable CMOS VLSI circuits

Western culture correct guidance and penetration teaching and its multi-dimensional training mode

Engaging soft computing in material and modeling uncertainty quantification of dam engineering problems