Loading…

Global optimization based on local searches

In this paper we deal with the use of local searches within global optimization algorithms. We discuss different issues, such as the generation of new starting points, the strategies to decide whether to start a local search from a given point, and those to decide whether to keep the point or discar...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2016-05, Vol.240 (1), p.251-270
Main Authors: Locatelli, Marco, Schoen, Fabio
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-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93
cites cdi_FETCH-LOGICAL-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93
container_end_page 270
container_issue 1
container_start_page 251
container_title Annals of operations research
container_volume 240
creator Locatelli, Marco
Schoen, Fabio
description In this paper we deal with the use of local searches within global optimization algorithms. We discuss different issues, such as the generation of new starting points, the strategies to decide whether to start a local search from a given point, and those to decide whether to keep the point or discard it from further consideration. We present how these topics have been faced in the existing literature and express our opinion on the relative merits of different choices.
doi_str_mv 10.1007/s10479-015-2014-2
format article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_1816026091</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A456368106</galeid><sourcerecordid>A456368106</sourcerecordid><originalsourceid>FETCH-LOGICAL-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93</originalsourceid><addsrcrecordid>eNp1kUFrGzEQhUVJoE6aH5CboZdCuu6MtJJWx2BSJ2DopTkLWat1FNYrV7N7aH59ZVxoHFIEIzHzvceIx9g1wgIB9DdCqLWpAGXFAeuKf2AzlJpXRojmjM2Ay7qSQsBHdkH0DACIjZyxm1WfNq6fp_0Yd_HFjTEN842j0M7Lo0--zCi47J8CfWLnnespXP29L9nj97ufy_tq_WP1sLxdV76WYqxQCy-4FMAb0Nq7UjkYHQxAi0F77VBJMNIIYzbKaNGhwFb5Fn2nMBhxyb4cffc5_ZoCjXYXyYe-d0NIE1lsUAFXYLCgn9-gz2nKQ9nOom6a4t4A_0dtXR9sHLo0ZucPpva2lkqoBkEVavEOVU4bdtGnIXSx9E8EX18JNhPFIVApFLdPI23dRHSK4xH3ORHl0Nl9jjuXf1sEewjRHkO0JUR7CNEeNudHDRV22Ib86n__Ff0BnzyZUA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1788697802</pqid></control><display><type>article</type><title>Global optimization based on local searches</title><source>EBSCOhost Business Source Ultimate</source><source>ABI/INFORM Global</source><source>Springer Nature</source><creator>Locatelli, Marco ; Schoen, Fabio</creator><creatorcontrib>Locatelli, Marco ; Schoen, Fabio</creatorcontrib><description>In this paper we deal with the use of local searches within global optimization algorithms. We discuss different issues, such as the generation of new starting points, the strategies to decide whether to start a local search from a given point, and those to decide whether to keep the point or discard it from further consideration. We present how these topics have been faced in the existing literature and express our opinion on the relative merits of different choices.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-015-2014-2</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Business and Management ; Combinatorics ; Engineering research ; Mathematical optimization ; Operations research ; Operations Research/Decision Theory ; Optimization ; Search theory ; Searches ; Searching ; SI: 4OR Surveys ; Strategy ; Studies ; Theory of Computation</subject><ispartof>Annals of operations research, 2016-05, Vol.240 (1), p.251-270</ispartof><rights>Springer Science+Business Media New York 2015</rights><rights>COPYRIGHT 2016 Springer</rights><rights>Springer Science+Business Media New York 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93</citedby><cites>FETCH-LOGICAL-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1788697802/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1788697802?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11686,27922,27923,36058,36059,44361,74665</link.rule.ids></links><search><creatorcontrib>Locatelli, Marco</creatorcontrib><creatorcontrib>Schoen, Fabio</creatorcontrib><title>Global optimization based on local searches</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>In this paper we deal with the use of local searches within global optimization algorithms. We discuss different issues, such as the generation of new starting points, the strategies to decide whether to start a local search from a given point, and those to decide whether to keep the point or discard it from further consideration. We present how these topics have been faced in the existing literature and express our opinion on the relative merits of different choices.</description><subject>Algorithms</subject><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Engineering research</subject><subject>Mathematical optimization</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Search theory</subject><subject>Searches</subject><subject>Searching</subject><subject>SI: 4OR Surveys</subject><subject>Strategy</subject><subject>Studies</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1kUFrGzEQhUVJoE6aH5CboZdCuu6MtJJWx2BSJ2DopTkLWat1FNYrV7N7aH59ZVxoHFIEIzHzvceIx9g1wgIB9DdCqLWpAGXFAeuKf2AzlJpXRojmjM2Ay7qSQsBHdkH0DACIjZyxm1WfNq6fp_0Yd_HFjTEN842j0M7Lo0--zCi47J8CfWLnnespXP29L9nj97ufy_tq_WP1sLxdV76WYqxQCy-4FMAb0Nq7UjkYHQxAi0F77VBJMNIIYzbKaNGhwFb5Fn2nMBhxyb4cffc5_ZoCjXYXyYe-d0NIE1lsUAFXYLCgn9-gz2nKQ9nOom6a4t4A_0dtXR9sHLo0ZucPpva2lkqoBkEVavEOVU4bdtGnIXSx9E8EX18JNhPFIVApFLdPI23dRHSK4xH3ORHl0Nl9jjuXf1sEewjRHkO0JUR7CNEeNudHDRV22Ib86n__Ff0BnzyZUA</recordid><startdate>20160501</startdate><enddate>20160501</enddate><creator>Locatelli, Marco</creator><creator>Schoen, Fabio</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20160501</creationdate><title>Global optimization based on local searches</title><author>Locatelli, Marco ; Schoen, Fabio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Engineering research</topic><topic>Mathematical optimization</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Search theory</topic><topic>Searches</topic><topic>Searching</topic><topic>SI: 4OR Surveys</topic><topic>Strategy</topic><topic>Studies</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Locatelli, Marco</creatorcontrib><creatorcontrib>Schoen, Fabio</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Databases</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Locatelli, Marco</au><au>Schoen, Fabio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Global optimization based on local searches</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2016-05-01</date><risdate>2016</risdate><volume>240</volume><issue>1</issue><spage>251</spage><epage>270</epage><pages>251-270</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>In this paper we deal with the use of local searches within global optimization algorithms. We discuss different issues, such as the generation of new starting points, the strategies to decide whether to start a local search from a given point, and those to decide whether to keep the point or discard it from further consideration. We present how these topics have been faced in the existing literature and express our opinion on the relative merits of different choices.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-015-2014-2</doi><tpages>20</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0254-5330
ispartof Annals of operations research, 2016-05, Vol.240 (1), p.251-270
issn 0254-5330
1572-9338
language eng
recordid cdi_proquest_miscellaneous_1816026091
source EBSCOhost Business Source Ultimate; ABI/INFORM Global; Springer Nature
subjects Algorithms
Business and Management
Combinatorics
Engineering research
Mathematical optimization
Operations research
Operations Research/Decision Theory
Optimization
Search theory
Searches
Searching
SI: 4OR Surveys
Strategy
Studies
Theory of Computation
title Global optimization based on local searches
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T22%3A07%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Global%20optimization%20based%20on%20local%20searches&rft.jtitle=Annals%20of%20operations%20research&rft.au=Locatelli,%20Marco&rft.date=2016-05-01&rft.volume=240&rft.issue=1&rft.spage=251&rft.epage=270&rft.pages=251-270&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-015-2014-2&rft_dat=%3Cgale_proqu%3EA456368106%3C/gale_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c453t-173c3253028077ca8072097e900d1e7c7a1650959399b6973f131d6cd1cf61e93%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1788697802&rft_id=info:pmid/&rft_galeid=A456368106&rfr_iscdi=true