A fast swap-based local search procedure for location problems
Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Resende, Mauricio G. C. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2007 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2006 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Kluwer Academic Publishers-Plenum Publishers, 1984, 150(2007), 1 vom: 09. Jan., Seite 205-230 |
|---|---|
| Übergeordnetes Werk: |
volume:150 ; year:2007 ; number:1 ; day:09 ; month:01 ; pages:205-230 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10479-006-0154-0 |
|---|
| Katalog-ID: |
OLC2111137685 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2111137685 | ||
| 003 | DE-627 | ||
| 005 | 20230502202621.0 | ||
| 007 | tu | ||
| 008 | 230502s2007 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10479-006-0154-0 |2 doi | |
| 035 | |a (DE-627)OLC2111137685 | ||
| 035 | |a (DE-He213)s10479-006-0154-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Resende, Mauricio G. C. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A fast swap-based local search procedure for location problems |
| 264 | 1 | |c 2007 | |
| 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 2006 | ||
| 520 | |a Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. | ||
| 650 | 4 | |a Local search | |
| 650 | 4 | |a -Median | |
| 650 | 4 | |a Facility location | |
| 650 | 4 | |a Experimental analysis | |
| 650 | 4 | |a Reordering problem | |
| 700 | 1 | |a Werneck, Renato F. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Kluwer Academic Publishers-Plenum Publishers, 1984 |g 150(2007), 1 vom: 09. Jan., Seite 205-230 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:150 |g year:2007 |g number:1 |g day:09 |g month:01 |g pages:205-230 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10479-006-0154-0 |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 GBV_ILN_4029 | ||
| 912 | |a GBV_ILN_4317 | ||
| 951 | |a AR | ||
| 952 | |d 150 |j 2007 |e 1 |b 09 |c 01 |h 205-230 | ||
| author_variant |
m g c r mgc mgcr r f w rf rfw |
|---|---|
| matchkey_str |
article:02545330:2007----::fssabsdoasacpoeueol |
| hierarchy_sort_str |
2007 |
| publishDate |
2007 |
| allfields |
10.1007/s10479-006-0154-0 doi (DE-627)OLC2111137685 (DE-He213)s10479-006-0154-0-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Resende, Mauricio G. C. verfasserin aut A fast swap-based local search procedure for location problems 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2006 Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. Local search -Median Facility location Experimental analysis Reordering problem Werneck, Renato F. aut Enthalten in Annals of operations research Kluwer Academic Publishers-Plenum Publishers, 1984 150(2007), 1 vom: 09. Jan., Seite 205-230 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 https://doi.org/10.1007/s10479-006-0154-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 150 2007 1 09 01 205-230 |
| spelling |
10.1007/s10479-006-0154-0 doi (DE-627)OLC2111137685 (DE-He213)s10479-006-0154-0-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Resende, Mauricio G. C. verfasserin aut A fast swap-based local search procedure for location problems 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2006 Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. Local search -Median Facility location Experimental analysis Reordering problem Werneck, Renato F. aut Enthalten in Annals of operations research Kluwer Academic Publishers-Plenum Publishers, 1984 150(2007), 1 vom: 09. Jan., Seite 205-230 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 https://doi.org/10.1007/s10479-006-0154-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 150 2007 1 09 01 205-230 |
| allfields_unstemmed |
10.1007/s10479-006-0154-0 doi (DE-627)OLC2111137685 (DE-He213)s10479-006-0154-0-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Resende, Mauricio G. C. verfasserin aut A fast swap-based local search procedure for location problems 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2006 Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. Local search -Median Facility location Experimental analysis Reordering problem Werneck, Renato F. aut Enthalten in Annals of operations research Kluwer Academic Publishers-Plenum Publishers, 1984 150(2007), 1 vom: 09. Jan., Seite 205-230 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 https://doi.org/10.1007/s10479-006-0154-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 150 2007 1 09 01 205-230 |
| allfieldsGer |
10.1007/s10479-006-0154-0 doi (DE-627)OLC2111137685 (DE-He213)s10479-006-0154-0-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Resende, Mauricio G. C. verfasserin aut A fast swap-based local search procedure for location problems 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2006 Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. Local search -Median Facility location Experimental analysis Reordering problem Werneck, Renato F. aut Enthalten in Annals of operations research Kluwer Academic Publishers-Plenum Publishers, 1984 150(2007), 1 vom: 09. Jan., Seite 205-230 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 https://doi.org/10.1007/s10479-006-0154-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 150 2007 1 09 01 205-230 |
| allfieldsSound |
10.1007/s10479-006-0154-0 doi (DE-627)OLC2111137685 (DE-He213)s10479-006-0154-0-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Resende, Mauricio G. C. verfasserin aut A fast swap-based local search procedure for location problems 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2006 Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. Local search -Median Facility location Experimental analysis Reordering problem Werneck, Renato F. aut Enthalten in Annals of operations research Kluwer Academic Publishers-Plenum Publishers, 1984 150(2007), 1 vom: 09. Jan., Seite 205-230 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 https://doi.org/10.1007/s10479-006-0154-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 150 2007 1 09 01 205-230 |
| language |
English |
| source |
Enthalten in Annals of operations research 150(2007), 1 vom: 09. Jan., Seite 205-230 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 |
| sourceStr |
Enthalten in Annals of operations research 150(2007), 1 vom: 09. Jan., Seite 205-230 volume:150 year:2007 number:1 day:09 month:01 pages:205-230 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Local search -Median Facility location Experimental analysis Reordering problem |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Resende, Mauricio G. C. @@aut@@ Werneck, Renato F. @@aut@@ |
| publishDateDaySort_date |
2007-01-09T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC2111137685 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111137685</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202621.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-006-0154-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111137685</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-006-0154-0-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">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Resende, Mauricio G. C.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A fast swap-based local search procedure for location problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</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 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Local search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-Median</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Facility location</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Experimental analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reordering problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Werneck, Renato F.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Kluwer Academic Publishers-Plenum Publishers, 1984</subfield><subfield code="g">150(2007), 1 vom: 09. Jan., Seite 205-230</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:150</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:1</subfield><subfield code="g">day:09</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:205-230</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-006-0154-0</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">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">150</subfield><subfield code="j">2007</subfield><subfield code="e">1</subfield><subfield code="b">09</subfield><subfield code="c">01</subfield><subfield code="h">205-230</subfield></datafield></record></collection>
|
| author |
Resende, Mauricio G. C. |
| spellingShingle |
Resende, Mauricio G. C. ddc 004 ssgn 3,2 misc Local search misc -Median misc Facility location misc Experimental analysis misc Reordering problem A fast swap-based local search procedure for location problems |
| authorStr |
Resende, Mauricio G. C. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 VZ 3,2 ssgn A fast swap-based local search procedure for location problems Local search -Median Facility location Experimental analysis Reordering problem |
| topic |
ddc 004 ssgn 3,2 misc Local search misc -Median misc Facility location misc Experimental analysis misc Reordering problem |
| topic_unstemmed |
ddc 004 ssgn 3,2 misc Local search misc -Median misc Facility location misc Experimental analysis misc Reordering problem |
| topic_browse |
ddc 004 ssgn 3,2 misc Local search misc -Median misc Facility location misc Experimental analysis misc Reordering problem |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
A fast swap-based local search procedure for location problems |
| ctrlnum |
(DE-627)OLC2111137685 (DE-He213)s10479-006-0154-0-p |
| title_full |
A fast swap-based local search procedure for location problems |
| author_sort |
Resende, Mauricio G. C. |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2007 |
| contenttype_str_mv |
txt |
| container_start_page |
205 |
| author_browse |
Resende, Mauricio G. C. Werneck, Renato F. |
| container_volume |
150 |
| class |
004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Resende, Mauricio G. C. |
| doi_str_mv |
10.1007/s10479-006-0154-0 |
| dewey-full |
004 |
| title_sort |
a fast swap-based local search procedure for location problems |
| title_auth |
A fast swap-based local search procedure for location problems |
| abstract |
Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. © Springer Science+Business Media, LLC 2006 |
| abstractGer |
Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. © Springer Science+Business Media, LLC 2006 |
| abstract_unstemmed |
Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search. © Springer Science+Business Media, LLC 2006 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 |
| container_issue |
1 |
| title_short |
A fast swap-based local search procedure for location problems |
| url |
https://doi.org/10.1007/s10479-006-0154-0 |
| remote_bool |
false |
| author2 |
Werneck, Renato F. |
| author2Str |
Werneck, Renato F. |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10479-006-0154-0 |
| up_date |
2024-07-04T08:49:08.148Z |
| _version_ |
1803637697440382976 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111137685</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202621.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-006-0154-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111137685</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-006-0154-0-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">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Resende, Mauricio G. C.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A fast swap-based local search procedure for location problems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</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 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same output as the best alternatives described in the literature and, even though its worst-case complexity is similar, it can be significantly faster in practice: speedups of up to three orders of magnitude were observed. We also show that our method can be easily adapted to handle the facility location problem and to implement related procedures, such as path-relinking and tabu search.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Local search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">-Median</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Facility location</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Experimental analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reordering problem</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Werneck, Renato F.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Kluwer Academic Publishers-Plenum Publishers, 1984</subfield><subfield code="g">150(2007), 1 vom: 09. Jan., Seite 205-230</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:150</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:1</subfield><subfield code="g">day:09</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:205-230</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-006-0154-0</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">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">150</subfield><subfield code="j">2007</subfield><subfield code="e">1</subfield><subfield code="b">09</subfield><subfield code="c">01</subfield><subfield code="h">205-230</subfield></datafield></record></collection>
|
| score |
7.401478 |