Differential evolution methods based on local searches
In this paper we analyze the behavior of a quite standard Differential Evolution (DE) algorithm applied to the objective function transformed by means of local searches. First some surprising results are presented which concern the application of this method to standard test functions. Later we intr...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2014-03, Vol.43, p.169-180 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 180 |
|---|---|
| container_issue | |
| container_start_page | 169 |
| container_title | Computers & operations research |
| container_volume | 43 |
| creator | Locatelli, Marco Maischberger, Mirko Schoen, Fabio |
| description | In this paper we analyze the behavior of a quite standard Differential Evolution (DE) algorithm applied to the objective function transformed by means of local searches. First some surprising results are presented which concern the application of this method to standard test functions.
Later we introduce an application to disk- and to sphere-packing problems, two well known and particularly hard global optimization problems. For these problems some more refined variations of the basic method are necessary in order to take at least partially into considerations the many symmetries those problems possess. Coupling these techniques with DE and local optimization resulted in a new method which, when tested on moderately sized packing problems, was capable of confirming known putative optima for the problem of packing disks, and of discovering quite a significant number of new putative optima for the problem of packing spheres. |
| doi_str_mv | 10.1016/j.cor.2013.09.010 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1677973667</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054813002724</els_id><sourcerecordid>1530977516</sourcerecordid><originalsourceid>FETCH-LOGICAL-c485t-7704270a83f0c6ffc2166fd9799298c162e1fc8600b64bc980c965482bc54c093</originalsourceid><addsrcrecordid>eNqNkU-LFDEQxYMoOK5-AG8DInjptirpzh88yaqrsOBFwVvIVFfYDD2dNelZ8NubYRYPe1DrEih-7yV5T4iXCD0C6rf7nnLpJaDqwfWA8Ehs0BrVGT3-eCw2oGDsYBzsU_Gs1j20MRI3Qn9IMXLhZU1h3vJdno9rysv2wOtNnup2FypP27aYMzWgcih0w_W5eBLDXPnF_Xkhvn_6-O3yc3f99erL5fvrjgY7rp0xMEgDwaoIpGMkiVrHyRnnpLOEWjJGshpgp4cdOQvkdHuk3NE4EDh1Id6cfW9L_nnkuvpDqsTzHBbOx-pRG-OM0tr8Gx21QQSQ-j9QBc6YEU_oqwfoPh_L0v7scdAO0MIAjcIzRSXXWjj625IOofzyCP7Uj9_71o8_9ePB-dZP07y-dw61RRtLWCjVP0JpVTNXpwjenTluOd8lLr5S4oV4SoVp9VNOf7nlN_OKoZk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1469018040</pqid></control><display><type>article</type><title>Differential evolution methods based on local searches</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Locatelli, Marco ; Maischberger, Mirko ; Schoen, Fabio</creator><creatorcontrib>Locatelli, Marco ; Maischberger, Mirko ; Schoen, Fabio</creatorcontrib><description>In this paper we analyze the behavior of a quite standard Differential Evolution (DE) algorithm applied to the objective function transformed by means of local searches. First some surprising results are presented which concern the application of this method to standard test functions.
Later we introduce an application to disk- and to sphere-packing problems, two well known and particularly hard global optimization problems. For these problems some more refined variations of the basic method are necessary in order to take at least partially into considerations the many symmetries those problems possess. Coupling these techniques with DE and local optimization resulted in a new method which, when tested on moderately sized packing problems, was capable of confirming known putative optima for the problem of packing disks, and of discovering quite a significant number of new putative optima for the problem of packing spheres.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2013.09.010</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Computer science; control theory; systems ; Disk and sphere packing ; Evolution ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Global optimization ; Local optimization ; Mathematical analysis ; Mathematical functions ; Mathematical models ; Mathematical programming ; Memetic algorithms ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Optimization ; Optimization algorithms ; Packing problem ; Population-based methods ; Searches ; Searching ; Studies ; Theoretical computing</subject><ispartof>Computers & operations research, 2014-03, Vol.43, p.169-180</ispartof><rights>2013 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Mar 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c485t-7704270a83f0c6ffc2166fd9799298c162e1fc8600b64bc980c965482bc54c093</citedby><cites>FETCH-LOGICAL-c485t-7704270a83f0c6ffc2166fd9799298c162e1fc8600b64bc980c965482bc54c093</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2013.09.010$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,778,782,3539,27911,27912,45982</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28301839$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Locatelli, Marco</creatorcontrib><creatorcontrib>Maischberger, Mirko</creatorcontrib><creatorcontrib>Schoen, Fabio</creatorcontrib><title>Differential evolution methods based on local searches</title><title>Computers & operations research</title><description>In this paper we analyze the behavior of a quite standard Differential Evolution (DE) algorithm applied to the objective function transformed by means of local searches. First some surprising results are presented which concern the application of this method to standard test functions.
Later we introduce an application to disk- and to sphere-packing problems, two well known and particularly hard global optimization problems. For these problems some more refined variations of the basic method are necessary in order to take at least partially into considerations the many symmetries those problems possess. Coupling these techniques with DE and local optimization resulted in a new method which, when tested on moderately sized packing problems, was capable of confirming known putative optima for the problem of packing disks, and of discovering quite a significant number of new putative optima for the problem of packing spheres.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Disk and sphere packing</subject><subject>Evolution</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Global optimization</subject><subject>Local optimization</subject><subject>Mathematical analysis</subject><subject>Mathematical functions</subject><subject>Mathematical models</subject><subject>Mathematical programming</subject><subject>Memetic algorithms</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Packing problem</subject><subject>Population-based methods</subject><subject>Searches</subject><subject>Searching</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNqNkU-LFDEQxYMoOK5-AG8DInjptirpzh88yaqrsOBFwVvIVFfYDD2dNelZ8NubYRYPe1DrEih-7yV5T4iXCD0C6rf7nnLpJaDqwfWA8Ehs0BrVGT3-eCw2oGDsYBzsU_Gs1j20MRI3Qn9IMXLhZU1h3vJdno9rysv2wOtNnup2FypP27aYMzWgcih0w_W5eBLDXPnF_Xkhvn_6-O3yc3f99erL5fvrjgY7rp0xMEgDwaoIpGMkiVrHyRnnpLOEWjJGshpgp4cdOQvkdHuk3NE4EDh1Id6cfW9L_nnkuvpDqsTzHBbOx-pRG-OM0tr8Gx21QQSQ-j9QBc6YEU_oqwfoPh_L0v7scdAO0MIAjcIzRSXXWjj625IOofzyCP7Uj9_71o8_9ePB-dZP07y-dw61RRtLWCjVP0JpVTNXpwjenTluOd8lLr5S4oV4SoVp9VNOf7nlN_OKoZk</recordid><startdate>20140301</startdate><enddate>20140301</enddate><creator>Locatelli, Marco</creator><creator>Maischberger, Mirko</creator><creator>Schoen, Fabio</creator><general>Elsevier Ltd</general><general>Elsevier</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140301</creationdate><title>Differential evolution methods based on local searches</title><author>Locatelli, Marco ; Maischberger, Mirko ; Schoen, Fabio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c485t-7704270a83f0c6ffc2166fd9799298c162e1fc8600b64bc980c965482bc54c093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Disk and sphere packing</topic><topic>Evolution</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Global optimization</topic><topic>Local optimization</topic><topic>Mathematical analysis</topic><topic>Mathematical functions</topic><topic>Mathematical models</topic><topic>Mathematical programming</topic><topic>Memetic algorithms</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Packing problem</topic><topic>Population-based methods</topic><topic>Searches</topic><topic>Searching</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Locatelli, Marco</creatorcontrib><creatorcontrib>Maischberger, Mirko</creatorcontrib><creatorcontrib>Schoen, Fabio</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Locatelli, Marco</au><au>Maischberger, Mirko</au><au>Schoen, Fabio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Differential evolution methods based on local searches</atitle><jtitle>Computers & operations research</jtitle><date>2014-03-01</date><risdate>2014</risdate><volume>43</volume><spage>169</spage><epage>180</epage><pages>169-180</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>In this paper we analyze the behavior of a quite standard Differential Evolution (DE) algorithm applied to the objective function transformed by means of local searches. First some surprising results are presented which concern the application of this method to standard test functions.
Later we introduce an application to disk- and to sphere-packing problems, two well known and particularly hard global optimization problems. For these problems some more refined variations of the basic method are necessary in order to take at least partially into considerations the many symmetries those problems possess. Coupling these techniques with DE and local optimization resulted in a new method which, when tested on moderately sized packing problems, was capable of confirming known putative optima for the problem of packing disks, and of discovering quite a significant number of new putative optima for the problem of packing spheres.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2013.09.010</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2014-03, Vol.43, p.169-180 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1677973667 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Disk and sphere packing Evolution Exact sciences and technology Flows in networks. Combinatorial problems Global optimization Local optimization Mathematical analysis Mathematical functions Mathematical models Mathematical programming Memetic algorithms Operational research and scientific management Operational research. Management science Operations research Optimization Optimization algorithms Packing problem Population-based methods Searches Searching Studies Theoretical computing |
| title | Differential evolution methods based on local searches |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T18%3A20%3A07IST&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=Differential%20evolution%20methods%20based%20on%20local%20searches&rft.jtitle=Computers%20&%20operations%20research&rft.au=Locatelli,%20Marco&rft.date=2014-03-01&rft.volume=43&rft.spage=169&rft.epage=180&rft.pages=169-180&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2013.09.010&rft_dat=%3Cproquest_cross%3E1530977516%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1469018040&rft_id=info:pmid/&rft_els_id=S0305054813002724&rfr_iscdi=true |