Path-relinking intensification methods for stochastic local search algorithms
Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ribeiro, Celso C. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of heuristics - Springer US, 1995, 18(2011), 2 vom: 03. Mai, Seite 193-214 |
|---|---|
| Übergeordnetes Werk: |
volume:18 ; year:2011 ; number:2 ; day:03 ; month:05 ; pages:193-214 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10732-011-9167-1 |
|---|
| Katalog-ID: |
OLC203938782X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC203938782X | ||
| 003 | DE-627 | ||
| 005 | 20230503070055.0 | ||
| 007 | tu | ||
| 008 | 200819s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10732-011-9167-1 |2 doi | |
| 035 | |a (DE-627)OLC203938782X | ||
| 035 | |a (DE-He213)s10732-011-9167-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 3,2 |a 24 |2 ssgn | ||
| 100 | 1 | |a Ribeiro, Celso C. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Path-relinking intensification methods for stochastic local search algorithms |
| 264 | 1 | |c 2011 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2011 | ||
| 520 | |a Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. | ||
| 650 | 4 | |a Path-relinking | |
| 650 | 4 | |a Metaheuristics | |
| 650 | 4 | |a Hybrid metaheuristics | |
| 650 | 4 | |a Stochastic local search | |
| 700 | 1 | |a Resende, Mauricio G. C. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of heuristics |d Springer US, 1995 |g 18(2011), 2 vom: 03. Mai, Seite 193-214 |w (DE-627)215140281 |w (DE-600)1333974-6 |w (DE-576)063244721 |x 1381-1231 |7 nnns |
| 773 | 1 | 8 | |g volume:18 |g year:2011 |g number:2 |g day:03 |g month:05 |g pages:193-214 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10732-011-9167-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2108 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4029 | ||
| 951 | |a AR | ||
| 952 | |d 18 |j 2011 |e 2 |b 03 |c 05 |h 193-214 | ||
| author_variant |
c c r cc ccr m g c r mgc mgcr |
|---|---|
| matchkey_str |
article:13811231:2011----::aheiknitniiainehdfrtcatco |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s10732-011-9167-1 doi (DE-627)OLC203938782X (DE-He213)s10732-011-9167-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 24 ssgn Ribeiro, Celso C. verfasserin aut Path-relinking intensification methods for stochastic local search algorithms 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search Resende, Mauricio G. C. aut Enthalten in Journal of heuristics Springer US, 1995 18(2011), 2 vom: 03. Mai, Seite 193-214 (DE-627)215140281 (DE-600)1333974-6 (DE-576)063244721 1381-1231 nnns volume:18 year:2011 number:2 day:03 month:05 pages:193-214 https://doi.org/10.1007/s10732-011-9167-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 GBV_ILN_4012 GBV_ILN_4029 AR 18 2011 2 03 05 193-214 |
| spelling |
10.1007/s10732-011-9167-1 doi (DE-627)OLC203938782X (DE-He213)s10732-011-9167-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 24 ssgn Ribeiro, Celso C. verfasserin aut Path-relinking intensification methods for stochastic local search algorithms 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search Resende, Mauricio G. C. aut Enthalten in Journal of heuristics Springer US, 1995 18(2011), 2 vom: 03. Mai, Seite 193-214 (DE-627)215140281 (DE-600)1333974-6 (DE-576)063244721 1381-1231 nnns volume:18 year:2011 number:2 day:03 month:05 pages:193-214 https://doi.org/10.1007/s10732-011-9167-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 GBV_ILN_4012 GBV_ILN_4029 AR 18 2011 2 03 05 193-214 |
| allfields_unstemmed |
10.1007/s10732-011-9167-1 doi (DE-627)OLC203938782X (DE-He213)s10732-011-9167-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 24 ssgn Ribeiro, Celso C. verfasserin aut Path-relinking intensification methods for stochastic local search algorithms 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search Resende, Mauricio G. C. aut Enthalten in Journal of heuristics Springer US, 1995 18(2011), 2 vom: 03. Mai, Seite 193-214 (DE-627)215140281 (DE-600)1333974-6 (DE-576)063244721 1381-1231 nnns volume:18 year:2011 number:2 day:03 month:05 pages:193-214 https://doi.org/10.1007/s10732-011-9167-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 GBV_ILN_4012 GBV_ILN_4029 AR 18 2011 2 03 05 193-214 |
| allfieldsGer |
10.1007/s10732-011-9167-1 doi (DE-627)OLC203938782X (DE-He213)s10732-011-9167-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 24 ssgn Ribeiro, Celso C. verfasserin aut Path-relinking intensification methods for stochastic local search algorithms 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search Resende, Mauricio G. C. aut Enthalten in Journal of heuristics Springer US, 1995 18(2011), 2 vom: 03. Mai, Seite 193-214 (DE-627)215140281 (DE-600)1333974-6 (DE-576)063244721 1381-1231 nnns volume:18 year:2011 number:2 day:03 month:05 pages:193-214 https://doi.org/10.1007/s10732-011-9167-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 GBV_ILN_4012 GBV_ILN_4029 AR 18 2011 2 03 05 193-214 |
| allfieldsSound |
10.1007/s10732-011-9167-1 doi (DE-627)OLC203938782X (DE-He213)s10732-011-9167-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 24 ssgn Ribeiro, Celso C. verfasserin aut Path-relinking intensification methods for stochastic local search algorithms 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search Resende, Mauricio G. C. aut Enthalten in Journal of heuristics Springer US, 1995 18(2011), 2 vom: 03. Mai, Seite 193-214 (DE-627)215140281 (DE-600)1333974-6 (DE-576)063244721 1381-1231 nnns volume:18 year:2011 number:2 day:03 month:05 pages:193-214 https://doi.org/10.1007/s10732-011-9167-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 GBV_ILN_4012 GBV_ILN_4029 AR 18 2011 2 03 05 193-214 |
| language |
English |
| source |
Enthalten in Journal of heuristics 18(2011), 2 vom: 03. Mai, Seite 193-214 volume:18 year:2011 number:2 day:03 month:05 pages:193-214 |
| sourceStr |
Enthalten in Journal of heuristics 18(2011), 2 vom: 03. Mai, Seite 193-214 volume:18 year:2011 number:2 day:03 month:05 pages:193-214 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Journal of heuristics |
| authorswithroles_txt_mv |
Ribeiro, Celso C. @@aut@@ Resende, Mauricio G. C. @@aut@@ |
| publishDateDaySort_date |
2011-05-03T00:00:00Z |
| hierarchy_top_id |
215140281 |
| dewey-sort |
3510 |
| id |
OLC203938782X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203938782X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503070055.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10732-011-9167-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203938782X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10732-011-9167-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="a">24</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ribeiro, Celso C.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Path-relinking intensification methods for stochastic local search algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Path-relinking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Metaheuristics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hybrid metaheuristics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic local search</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Resende, Mauricio G. C.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of heuristics</subfield><subfield code="d">Springer US, 1995</subfield><subfield code="g">18(2011), 2 vom: 03. Mai, Seite 193-214</subfield><subfield code="w">(DE-627)215140281</subfield><subfield code="w">(DE-600)1333974-6</subfield><subfield code="w">(DE-576)063244721</subfield><subfield code="x">1381-1231</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:18</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:2</subfield><subfield code="g">day:03</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:193-214</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10732-011-9167-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">18</subfield><subfield code="j">2011</subfield><subfield code="e">2</subfield><subfield code="b">03</subfield><subfield code="c">05</subfield><subfield code="h">193-214</subfield></datafield></record></collection>
|
| author |
Ribeiro, Celso C. |
| spellingShingle |
Ribeiro, Celso C. ddc 510 ssgn 3,2 misc Path-relinking misc Metaheuristics misc Hybrid metaheuristics misc Stochastic local search Path-relinking intensification methods for stochastic local search algorithms |
| authorStr |
Ribeiro, Celso C. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)215140281 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1381-1231 |
| topic_title |
510 VZ 3,2 24 ssgn Path-relinking intensification methods for stochastic local search algorithms Path-relinking Metaheuristics Hybrid metaheuristics Stochastic local search |
| topic |
ddc 510 ssgn 3,2 misc Path-relinking misc Metaheuristics misc Hybrid metaheuristics misc Stochastic local search |
| topic_unstemmed |
ddc 510 ssgn 3,2 misc Path-relinking misc Metaheuristics misc Hybrid metaheuristics misc Stochastic local search |
| topic_browse |
ddc 510 ssgn 3,2 misc Path-relinking misc Metaheuristics misc Hybrid metaheuristics misc Stochastic local search |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of heuristics |
| hierarchy_parent_id |
215140281 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Journal of heuristics |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)215140281 (DE-600)1333974-6 (DE-576)063244721 |
| title |
Path-relinking intensification methods for stochastic local search algorithms |
| ctrlnum |
(DE-627)OLC203938782X (DE-He213)s10732-011-9167-1-p |
| title_full |
Path-relinking intensification methods for stochastic local search algorithms |
| author_sort |
Ribeiro, Celso C. |
| journal |
Journal of heuristics |
| journalStr |
Journal of heuristics |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
193 |
| author_browse |
Ribeiro, Celso C. Resende, Mauricio G. C. |
| container_volume |
18 |
| class |
510 VZ 3,2 24 ssgn |
| format_se |
Aufsätze |
| author-letter |
Ribeiro, Celso C. |
| doi_str_mv |
10.1007/s10732-011-9167-1 |
| dewey-full |
510 |
| title_sort |
path-relinking intensification methods for stochastic local search algorithms |
| title_auth |
Path-relinking intensification methods for stochastic local search algorithms |
| abstract |
Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. © Springer Science+Business Media, LLC 2011 |
| abstractGer |
Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. © Springer Science+Business Media, LLC 2011 |
| abstract_unstemmed |
Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions. © Springer Science+Business Media, LLC 2011 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 GBV_ILN_4012 GBV_ILN_4029 |
| container_issue |
2 |
| title_short |
Path-relinking intensification methods for stochastic local search algorithms |
| url |
https://doi.org/10.1007/s10732-011-9167-1 |
| remote_bool |
false |
| author2 |
Resende, Mauricio G. C. |
| author2Str |
Resende, Mauricio G. C. |
| ppnlink |
215140281 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10732-011-9167-1 |
| up_date |
2024-07-03T22:38:33.186Z |
| _version_ |
1803599282896371712 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC203938782X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503070055.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10732-011-9167-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC203938782X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10732-011-9167-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="a">24</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ribeiro, Celso C.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Path-relinking intensification methods for stochastic local search algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as tabu search, GRASP, genetic algorithms and scatter search. Numerical examples are discussed and algorithms compared based on their run time distributions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Path-relinking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Metaheuristics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hybrid metaheuristics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic local search</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Resende, Mauricio G. C.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of heuristics</subfield><subfield code="d">Springer US, 1995</subfield><subfield code="g">18(2011), 2 vom: 03. Mai, Seite 193-214</subfield><subfield code="w">(DE-627)215140281</subfield><subfield code="w">(DE-600)1333974-6</subfield><subfield code="w">(DE-576)063244721</subfield><subfield code="x">1381-1231</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:18</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:2</subfield><subfield code="g">day:03</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:193-214</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10732-011-9167-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">18</subfield><subfield code="j">2011</subfield><subfield code="e">2</subfield><subfield code="b">03</subfield><subfield code="c">05</subfield><subfield code="h">193-214</subfield></datafield></record></collection>
|
| score |
7.401202 |