Loading…
A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design
A generic constraint handling framework for use with any swarm-based optimization algorithm is presented. For swarm optimizers to solve constrained optimization problems effectively modifications have to be made to the optimizers to handle the constraints, however, these constraint handling framewor...
Saved in:
| Published in: | Optimization and engineering 2017-09, Vol.18 (3), p.659-691 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3 |
| container_end_page | 691 |
| container_issue | 3 |
| container_start_page | 659 |
| container_title | Optimization and engineering |
| container_volume | 18 |
| creator | Poole, Daniel J. Allen, Christian B. Rendall, Thomas C. S. |
| description | A generic constraint handling framework for use with any swarm-based optimization algorithm is presented. For swarm optimizers to solve constrained optimization problems effectively modifications have to be made to the optimizers to handle the constraints, however, these constraint handling frameworks are often not universally applicable to all swarm algorithms. A constraint handling framework is therefore presented in this paper that is compatible with any swarm optimizer, such that a user can wrap it around a chosen swarm algorithm and perform constrained optimization. The method, called separation-sub-swarm, works by dividing the population based on the feasibility of individual agents. This allows all feasible agents to move by existing swarm optimizer algorithms, hence promoting good performance and convergence characteristics of individual swarm algorithms. The framework is tested on a suite of analytical test function and a number of engineering benchmark problems, and compared to other generic constraint handling frameworks using four different swarm optimizers; particle swarm, gravitational search, a hybrid algorithm and differential evolution. It is shown that the new framework produces superior results compared to the established frameworks for all four swarm algorithms tested. Finally, the framework is applied to an aerodynamic shape optimization design problem where a shock-free solution is obtained. |
| doi_str_mv | 10.1007/s11081-016-9343-0 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2063601905</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2063601905</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3</originalsourceid><addsrcrecordid>eNp1kMtKBDEQRRtR8PkB7gKuo5WkX1nK4AsEN7oO1d1Jm3E6aZMMov68GVpw5aoK6pxbcIvinMElA2iuImPQMgqsplKUgsJeccSqRlAuebmfd9FKWpYcDovjGNeQwYq3R8X3NRm108H2xASc9IcPb8T4QF7RDRvrRtJ7F1NA61IkHza9EsxCoh1GPRA_JzvZL0zWO4Kb0YdMTJFkmeA8b2y_nJInqIMfPh1O-dWgox3daXFgcBP12e88KV5ub55X9_Tx6e5hdf1Ie1HJRHVlRMOhM3XfDX1nWs4r7KQpETmU0IgGJRqJ1QBYV7Vs2lqbgem-E7xpDIqT4mLJnYN_3-qY1Npvg8svFYda1MAkVJliC9UHH2PQRs3BThg-FQO161gtHatcndp1rCA7fHFiZt2ow1_y_9IPutCCVg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2063601905</pqid></control><display><type>article</type><title>A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design</title><source>Springer Link</source><creator>Poole, Daniel J. ; Allen, Christian B. ; Rendall, Thomas C. S.</creator><creatorcontrib>Poole, Daniel J. ; Allen, Christian B. ; Rendall, Thomas C. S.</creatorcontrib><description>A generic constraint handling framework for use with any swarm-based optimization algorithm is presented. For swarm optimizers to solve constrained optimization problems effectively modifications have to be made to the optimizers to handle the constraints, however, these constraint handling frameworks are often not universally applicable to all swarm algorithms. A constraint handling framework is therefore presented in this paper that is compatible with any swarm optimizer, such that a user can wrap it around a chosen swarm algorithm and perform constrained optimization. The method, called separation-sub-swarm, works by dividing the population based on the feasibility of individual agents. This allows all feasible agents to move by existing swarm optimizer algorithms, hence promoting good performance and convergence characteristics of individual swarm algorithms. The framework is tested on a suite of analytical test function and a number of engineering benchmark problems, and compared to other generic constraint handling frameworks using four different swarm optimizers; particle swarm, gravitational search, a hybrid algorithm and differential evolution. It is shown that the new framework produces superior results compared to the established frameworks for all four swarm algorithms tested. Finally, the framework is applied to an aerodynamic shape optimization design problem where a shock-free solution is obtained.</description><identifier>ISSN: 1389-4420</identifier><identifier>EISSN: 1573-2924</identifier><identifier>DOI: 10.1007/s11081-016-9343-0</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Constraints ; Control ; Design optimization ; Engineering ; Environmental Management ; Evolutionary algorithms ; Feasibility ; Financial Engineering ; Handling ; Mathematics ; Mathematics and Statistics ; Operations Research/Decision Theory ; Optimization ; Optimization algorithms ; Shape optimization ; Systems Theory</subject><ispartof>Optimization and engineering, 2017-09, Vol.18 (3), p.659-691</ispartof><rights>The Author(s) 2016</rights><rights>Copyright Springer Science & Business Media 2017</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3</citedby><cites>FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,786,790,27957,27958</link.rule.ids></links><search><creatorcontrib>Poole, Daniel J.</creatorcontrib><creatorcontrib>Allen, Christian B.</creatorcontrib><creatorcontrib>Rendall, Thomas C. S.</creatorcontrib><title>A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design</title><title>Optimization and engineering</title><addtitle>Optim Eng</addtitle><description>A generic constraint handling framework for use with any swarm-based optimization algorithm is presented. For swarm optimizers to solve constrained optimization problems effectively modifications have to be made to the optimizers to handle the constraints, however, these constraint handling frameworks are often not universally applicable to all swarm algorithms. A constraint handling framework is therefore presented in this paper that is compatible with any swarm optimizer, such that a user can wrap it around a chosen swarm algorithm and perform constrained optimization. The method, called separation-sub-swarm, works by dividing the population based on the feasibility of individual agents. This allows all feasible agents to move by existing swarm optimizer algorithms, hence promoting good performance and convergence characteristics of individual swarm algorithms. The framework is tested on a suite of analytical test function and a number of engineering benchmark problems, and compared to other generic constraint handling frameworks using four different swarm optimizers; particle swarm, gravitational search, a hybrid algorithm and differential evolution. It is shown that the new framework produces superior results compared to the established frameworks for all four swarm algorithms tested. Finally, the framework is applied to an aerodynamic shape optimization design problem where a shock-free solution is obtained.</description><subject>Constraints</subject><subject>Control</subject><subject>Design optimization</subject><subject>Engineering</subject><subject>Environmental Management</subject><subject>Evolutionary algorithms</subject><subject>Feasibility</subject><subject>Financial Engineering</subject><subject>Handling</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Shape optimization</subject><subject>Systems Theory</subject><issn>1389-4420</issn><issn>1573-2924</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp1kMtKBDEQRRtR8PkB7gKuo5WkX1nK4AsEN7oO1d1Jm3E6aZMMov68GVpw5aoK6pxbcIvinMElA2iuImPQMgqsplKUgsJeccSqRlAuebmfd9FKWpYcDovjGNeQwYq3R8X3NRm108H2xASc9IcPb8T4QF7RDRvrRtJ7F1NA61IkHza9EsxCoh1GPRA_JzvZL0zWO4Kb0YdMTJFkmeA8b2y_nJInqIMfPh1O-dWgox3daXFgcBP12e88KV5ub55X9_Tx6e5hdf1Ie1HJRHVlRMOhM3XfDX1nWs4r7KQpETmU0IgGJRqJ1QBYV7Vs2lqbgem-E7xpDIqT4mLJnYN_3-qY1Npvg8svFYda1MAkVJliC9UHH2PQRs3BThg-FQO161gtHatcndp1rCA7fHFiZt2ow1_y_9IPutCCVg</recordid><startdate>20170901</startdate><enddate>20170901</enddate><creator>Poole, Daniel J.</creator><creator>Allen, Christian B.</creator><creator>Rendall, Thomas C. S.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>20170901</creationdate><title>A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design</title><author>Poole, Daniel J. ; Allen, Christian B. ; Rendall, Thomas C. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Constraints</topic><topic>Control</topic><topic>Design optimization</topic><topic>Engineering</topic><topic>Environmental Management</topic><topic>Evolutionary algorithms</topic><topic>Feasibility</topic><topic>Financial Engineering</topic><topic>Handling</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Shape optimization</topic><topic>Systems Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Poole, Daniel J.</creatorcontrib><creatorcontrib>Allen, Christian B.</creatorcontrib><creatorcontrib>Rendall, Thomas C. S.</creatorcontrib><collection>Springer Nature Open Access Journals</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>Optimization and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Poole, Daniel J.</au><au>Allen, Christian B.</au><au>Rendall, Thomas C. S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design</atitle><jtitle>Optimization and engineering</jtitle><stitle>Optim Eng</stitle><date>2017-09-01</date><risdate>2017</risdate><volume>18</volume><issue>3</issue><spage>659</spage><epage>691</epage><pages>659-691</pages><issn>1389-4420</issn><eissn>1573-2924</eissn><abstract>A generic constraint handling framework for use with any swarm-based optimization algorithm is presented. For swarm optimizers to solve constrained optimization problems effectively modifications have to be made to the optimizers to handle the constraints, however, these constraint handling frameworks are often not universally applicable to all swarm algorithms. A constraint handling framework is therefore presented in this paper that is compatible with any swarm optimizer, such that a user can wrap it around a chosen swarm algorithm and perform constrained optimization. The method, called separation-sub-swarm, works by dividing the population based on the feasibility of individual agents. This allows all feasible agents to move by existing swarm optimizer algorithms, hence promoting good performance and convergence characteristics of individual swarm algorithms. The framework is tested on a suite of analytical test function and a number of engineering benchmark problems, and compared to other generic constraint handling frameworks using four different swarm optimizers; particle swarm, gravitational search, a hybrid algorithm and differential evolution. It is shown that the new framework produces superior results compared to the established frameworks for all four swarm algorithms tested. Finally, the framework is applied to an aerodynamic shape optimization design problem where a shock-free solution is obtained.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11081-016-9343-0</doi><tpages>33</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1389-4420 |
| ispartof | Optimization and engineering, 2017-09, Vol.18 (3), p.659-691 |
| issn | 1389-4420 1573-2924 |
| language | eng |
| recordid | cdi_proquest_journals_2063601905 |
| source | Springer Link |
| subjects | Constraints Control Design optimization Engineering Environmental Management Evolutionary algorithms Feasibility Financial Engineering Handling Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Optimization algorithms Shape optimization Systems Theory |
| title | A generic framework for handling constraints with agent-based optimization algorithms and application to aerodynamic design |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T22%3A28%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20generic%20framework%20for%20handling%20constraints%20with%20agent-based%20optimization%20algorithms%20and%20application%20to%20aerodynamic%20design&rft.jtitle=Optimization%20and%20engineering&rft.au=Poole,%20Daniel%20J.&rft.date=2017-09-01&rft.volume=18&rft.issue=3&rft.spage=659&rft.epage=691&rft.pages=659-691&rft.issn=1389-4420&rft.eissn=1573-2924&rft_id=info:doi/10.1007/s11081-016-9343-0&rft_dat=%3Cproquest_cross%3E2063601905%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c359t-e5f3720bf6cbdcbf8225ab9f4aa2040737a9af9a5d0a6569786efd1ecb3277fa3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2063601905&rft_id=info:pmid/&rfr_iscdi=true |