{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:51:11Z","timestamp":1761897071957,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030227432"},{"type":"electronic","value":"9783030227449"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22744-9_28","type":"book-chapter","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:29:16Z","timestamp":1559928556000},"page":"357-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Comparison of Constraint-Handling Techniques for Metaheuristic Optimization"],"prefix":"10.1007","author":[{"given":"Xing-Shi","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin-Wei","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet","family":"Karamanoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin-She","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ijepes.2015.11.093","volume":"80","author":"AY Abdelaziz","year":"2016","unstructured":"Abdelaziz, A.Y., Ali, E.S., Abd Elazim, S.M.: Combined economic and emission dispatch solution using flower pollination algorithm. Int. J. Electr. Power Energy Syst. 80(2), 264\u2013274 (2016)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"28_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-67669-2_5","volume-title":"Nature-Inspired Algorithms and Applied Optimization","author":"ZAA Alyasseri","year":"2018","unstructured":"Alyasseri, Z.A.A., Khader, A.T., Al-Betar, M.A., Awadallah, M.A., Yang, X.-S.: Variants of the flower pollination algorithm: a review. In: Yang, X.-S. (ed.) Nature-Inspired Algorithms and Applied Optimization. SCI, vol. 744, pp. 91\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-67669-2_5"},{"doi-asserted-by":"crossref","unstructured":"Ameca-Alducin, M.-Y., Hasani-Shoreh, M., Blaidie, W., Neumann, F., Mezura-Montes, E.: A comparison of constraint handling techniques for dynamica constrained optimization problems. arXiv:1802.05825 (2018). Accessed 12 Feb 2019","key":"28_CR3","DOI":"10.1109\/CEC.2018.8477750"},{"issue":"5","key":"28_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0255(03)00177-4","volume":"156","author":"HJC Barbosa","year":"2003","unstructured":"Barbosa, H.J.C., Lemonge, A.C.C.: A new adaptive penalty scheme for genetic algorithms. Inf. Sci. 156(5), 215\u2013251 (2003)","journal-title":"Inf. Sci."},{"unstructured":"Bean, J.C., Hadj-Alouane, A.B.: A dual genetic algorithm for bounded integer programs. Technical report RT 92\u201352. Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, USA (1992)","key":"28_CR5"},{"key":"28_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberge, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"28_CR7","first-page":"319","volume":"32","author":"LC Cagnina","year":"2008","unstructured":"Cagnina, L.C., Esquivel, S.C., Coello, C.A.: Solving engineering optimization problems with the simple constrained particle swarm optimizer. Informatica 32(3), 319\u2013326 (2008)","journal-title":"Informatica"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","volume":"41","author":"CAC Coello","year":"2000","unstructured":"Coello, C.A.C.: Use of a self-adaptive penalty approach for engineering optimization problems. Comput. Ind. 41(2), 113\u2013127 (2000)","journal-title":"Comput. Ind."},{"issue":"11\u201312","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello, C.A.C.: 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\u201312), 1245\u20131287 (2002)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.8.2.173","volume":"6","author":"DW Coit","year":"1996","unstructured":"Coit, D.W., Smith, A.E., Tate, D.M.: Adaptive penalty methods for genetic optimization of constrained combinatorial problems. INFORMS J. Comput. 6(2), 173\u2013182 (1996)","journal-title":"INFORMS J. Comput."},{"key":"28_CR11","volume-title":"Optimization for Engineering Design: Algorithms and Examples","author":"K Deb","year":"1995","unstructured":"Deb, K.: Optimization for Engineering Design: Algorithms and Examples. Prentice-Hall, New Delhi (1995)"},{"issue":"2\u20134","key":"28_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186(2\u20134), 311\u2013338 (2000)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1016\/j.procs.2017.05.020","volume":"108","author":"XS He","year":"2017","unstructured":"He, X.S., Yang, X.S., Karamanoglu, M., Zhao, Y.X.: Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Procedia Comput. Sci. 108(1), 1354\u20131363 (2017)","journal-title":"Procedia Comput. Sci."},{"key":"28_CR14","first-page":"579","volume-title":"Proceedings of the First IEEE Conference on Evolutionary Computation","author":"J Joines","year":"1994","unstructured":"Joines, J., Houck, C.: On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA\u2019s. In: Fogel, D. (ed.) Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 579\u2013584. IEEE Press, Orlando (1994)"},{"key":"28_CR15","volume-title":"Swarm Intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhart, E.C., Shi, Y.: Swarm Intelligence. Academic Press, London (2001)"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1162\/evco.1999.7.1.19","volume":"7","author":"S Koziel","year":"1999","unstructured":"Koziel, S., Michalewicz, Z.: Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evol. Comput. 7(1), 19\u201344 (1999)","journal-title":"Evol. Comput."},{"key":"28_CR17","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00619-7","volume-title":"Constraint-Handling in Evolutionary Optimization","author":"E Mezura-Montes","year":"2009","unstructured":"Mezura-Montes, E.: Constraint-Handling in Evolutionary Optimization. SCI, vol. 198. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-00619-7"},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","volume":"1","author":"E Mezura-Montes","year":"2011","unstructured":"Mezura-Montes, E., Coello, C.A.C.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol. Comput. 1(4), 173\u2013194 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evol. Comput. 4(1), 1\u201332 (1996)","journal-title":"Evol. Comput."},{"key":"28_CR20","first-page":"424","volume-title":"Proceedings of the Fifth International Conference on Genetic Algorithms","author":"D Powell","year":"1993","unstructured":"Powell, D., Skolnick, M.M.: Using genetic algorithms in engineering design optimization with non-linear constraints. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 424\u2013431. Morgan Kaufmann, San Mateo (1993)"},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","volume":"226","author":"I Pavlyukevich","year":"2007","unstructured":"Pavlyukevich, I.: L\u00e9vy flights, non-local search and simulated annealing. J Comput. Phys. 226(2), 1830\u20131844 (2007)","journal-title":"J Comput. Phys."},{"issue":"1","key":"28_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.eswa.2016.06.006","volume":"62","author":"D Rodrigues","year":"2016","unstructured":"Rodrigues, D., Silva, G.F.A., Papa, J.P., Marana, A.N., Yang, X.S.: EEG-based person identificaiton through binary flower pollination algorithm. Expert Syst. Appl. 62(1), 81\u201390 (2016)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"28_CR23","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284\u2013294 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"28_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"doi-asserted-by":"crossref","unstructured":"Takahama, T., Sakai, S.: Solving constrained optimization problems by the $$\\epsilon $$-constrained particle swarm optimizer with adaptive velocity limit control. In: Proceedings of the IEEE Conference on Cybernetics and Intelligent Systems (CIS 2006), 7\u20139 June 2006, pp. 683\u2013689. IEEE Publication, Bangkok (2006)","key":"28_CR25","DOI":"10.1109\/ICCIS.2006.252248"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional Computation and Natural Computation","author":"X-S Yang","year":"2012","unstructured":"Yang, X.-S.: Flower pollination algorithm for global optimization. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 240\u2013249. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32894-7_27"},{"issue":"9","key":"28_CR27","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1080\/0305215X.2013.832237","volume":"46","author":"XS Yang","year":"2014","unstructured":"Yang, X.S., Karamanoglu, M., He, X.S.: Flower pollination algorithm: a novel approach for multiobjective optimization. Eng. Optim. 46(9), 1222\u20131237 (2014)","journal-title":"Eng. Optim."},{"key":"28_CR28","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02141-6","volume-title":"Cuckoo Search and Firefly Algorithm: Theory and Applications","year":"2014","unstructured":"Yang, X.-S. (ed.): Cuckoo Search and Firefly Algorithm: Theory and Applications. SCI, vol. 516. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-02141-6"},{"key":"28_CR29","volume-title":"Nature-Inspired Optimization Algorithms","author":"XS Yang","year":"2014","unstructured":"Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier, London (2014)"},{"issue":"6","key":"28_CR30","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1504\/IJBIC.2013.058910","volume":"5","author":"XS Yang","year":"2013","unstructured":"Yang, X.S., Huyck, C., Karamanoglu, M., Khan, N.: True global optimality of the pressure vessel design problem: a benchmark for bio-inspired optimisation algorithms. Int. J. Bio-Inspired Comput. 5(6), 329\u2013335 (2013)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"28_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/9781119490616","volume-title":"Optimization Technqiues and Applications with Examples","author":"XS Yang","year":"2018","unstructured":"Yang, X.S.: Optimization Technqiues and Applications with Examples. Wiley, Hoboken (2018)"},{"issue":"1","key":"28_CR32","first-page":"45","volume":"10","author":"O Yeniay","year":"2005","unstructured":"Yeniay, O.: Penalty function methods for constrained optimization with genetic algorithms. Math. Computat. Appl. 10(1), 45\u201356 (2005)","journal-title":"Math. Computat. Appl."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22744-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:50:41Z","timestamp":1686099041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22744-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030227432","9783030227449"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22744-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}