Eintrag weiter verarbeiten
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
Gespeichert in:
| Zeitschriftentitel: | International Transactions in Operational Research |
|---|---|
| Personen und Körperschaften: | , , , , |
| In: | International Transactions in Operational Research, 27, 2020, 1, S. 480-493 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Wiley
|
| Schlagwörter: |
| author_facet |
Mladenović, Nenad Alkandari, Abdulaziz Pei, Jun Todosijević, Raca Pardalos, Panos M. Mladenović, Nenad Alkandari, Abdulaziz Pei, Jun Todosijević, Raca Pardalos, Panos M. |
|---|---|
| author |
Mladenović, Nenad Alkandari, Abdulaziz Pei, Jun Todosijević, Raca Pardalos, Panos M. |
| spellingShingle |
Mladenović, Nenad Alkandari, Abdulaziz Pei, Jun Todosijević, Raca Pardalos, Panos M. International Transactions in Operational Research Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem Management of Technology and Innovation Management Science and Operations Research Strategy and Management Computer Science Applications Business and International Management |
| author_sort |
mladenović, nenad |
| spelling |
Mladenović, Nenad Alkandari, Abdulaziz Pei, Jun Todosijević, Raca Pardalos, Panos M. 0969-6016 1475-3995 Wiley Management of Technology and Innovation Management Science and Operations Research Strategy and Management Computer Science Applications Business and International Management http://dx.doi.org/10.1111/itor.12646 <jats:title>Abstract</jats:title><jats:p>The goal of the <jats:italic>less is more</jats:italic> approach (LIMA) for solving optimization problems that has recently been proposed in Mladenović et al. (2016) is to find the minimum number of search ingredients that make a heuristic more efficient than the currently best. In this paper, LIMA is successfully applied to solve the obnoxious <jats:italic>p</jats:italic>‐median problem (OpMP). More precisely, we developed a basic variable neighborhood search for solving the OpMP, where the single search ingredient, the <jats:italic>interchange</jats:italic> neighborhood structure, is used. We also propose a new simple local search strategy for solving facility location problems, within the interchange neighborhood structure, which is in between the usual ones: <jats:italic>first improvement</jats:italic> and <jats:italic>best improvement</jats:italic> strategies. We call it <jats:italic>facility best improvement</jats:italic> local search. On the basis of experiments, it appeared to be more efficient and effective than both <jats:italic>first</jats:italic> and <jats:italic>best improvement</jats:italic>. According to the results obtained on the benchmark instances, our heuristic turns out to be highly competitive with the existing ones, establishing new state‐of‐the‐art results. For example, four new best‐known solutions and 133 ties are claimed in testing the set with 144 instances.</jats:p> Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem International Transactions in Operational Research |
| doi_str_mv |
10.1111/itor.12646 |
| facet_avail |
Online |
| finc_class_facet |
Wirtschaftswissenschaften Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9pdG9yLjEyNjQ2 |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9pdG9yLjEyNjQ2 |
| institution |
DE-D275 DE-Bn3 DE-Brt1 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 DE-L229 |
| imprint |
Wiley, 2020 |
| imprint_str_mv |
Wiley, 2020 |
| issn |
1475-3995 0969-6016 |
| issn_str_mv |
1475-3995 0969-6016 |
| language |
English |
| mega_collection |
Wiley (CrossRef) |
| match_str |
mladenovic2020lessismoreapproachbasicvariableneighborhoodsearchfortheobnoxiouspmedianproblem |
| publishDateSort |
2020 |
| publisher |
Wiley |
| recordtype |
ai |
| record_format |
ai |
| series |
International Transactions in Operational Research |
| source_id |
49 |
| title |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_unstemmed |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_full |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_fullStr |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_full_unstemmed |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_short |
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_sort |
less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem |
| topic |
Management of Technology and Innovation Management Science and Operations Research Strategy and Management Computer Science Applications Business and International Management |
| url |
http://dx.doi.org/10.1111/itor.12646 |
| publishDate |
2020 |
| physical |
480-493 |
| description |
<jats:title>Abstract</jats:title><jats:p>The goal of the <jats:italic>less is more</jats:italic> approach (LIMA) for solving optimization problems that has recently been proposed in Mladenović et al. (2016) is to find the minimum number of search ingredients that make a heuristic more efficient than the currently best. In this paper, LIMA is successfully applied to solve the obnoxious <jats:italic>p</jats:italic>‐median problem (OpMP). More precisely, we developed a basic variable neighborhood search for solving the OpMP, where the single search ingredient, the <jats:italic>interchange</jats:italic> neighborhood structure, is used. We also propose a new simple local search strategy for solving facility location problems, within the interchange neighborhood structure, which is in between the usual ones: <jats:italic>first improvement</jats:italic> and <jats:italic>best improvement</jats:italic> strategies. We call it <jats:italic>facility best improvement</jats:italic> local search. On the basis of experiments, it appeared to be more efficient and effective than both <jats:italic>first</jats:italic> and <jats:italic>best improvement</jats:italic>. According to the results obtained on the benchmark instances, our heuristic turns out to be highly competitive with the existing ones, establishing new state‐of‐the‐art results. For example, four new best‐known solutions and 133 ties are claimed in testing the set with 144 instances.</jats:p> |
| container_issue |
1 |
| container_start_page |
480 |
| container_title |
International Transactions in Operational Research |
| container_volume |
27 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792346251010768899 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T17:36:25.108Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Less+is+more+approach%3A+basic+variable+neighborhood+search+for+the+obnoxious+p%E2%80%90median+problem&rft.date=2020-01-01&genre=article&issn=1475-3995&volume=27&issue=1&spage=480&epage=493&pages=480-493&jtitle=International+Transactions+in+Operational+Research&atitle=Less+is+more+approach%3A+basic+variable+neighborhood+search+for+the+obnoxious+%3Ci%3Ep%3C%2Fi%3E%E2%80%90median+problem&aulast=Pardalos&aufirst=Panos+M.&rft_id=info%3Adoi%2F10.1111%2Fitor.12646&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792346251010768899 |
| author | Mladenović, Nenad, Alkandari, Abdulaziz, Pei, Jun, Todosijević, Raca, Pardalos, Panos M. |
| author_facet | Mladenović, Nenad, Alkandari, Abdulaziz, Pei, Jun, Todosijević, Raca, Pardalos, Panos M., Mladenović, Nenad, Alkandari, Abdulaziz, Pei, Jun, Todosijević, Raca, Pardalos, Panos M. |
| author_sort | mladenović, nenad |
| container_issue | 1 |
| container_start_page | 480 |
| container_title | International Transactions in Operational Research |
| container_volume | 27 |
| description | <jats:title>Abstract</jats:title><jats:p>The goal of the <jats:italic>less is more</jats:italic> approach (LIMA) for solving optimization problems that has recently been proposed in Mladenović et al. (2016) is to find the minimum number of search ingredients that make a heuristic more efficient than the currently best. In this paper, LIMA is successfully applied to solve the obnoxious <jats:italic>p</jats:italic>‐median problem (OpMP). More precisely, we developed a basic variable neighborhood search for solving the OpMP, where the single search ingredient, the <jats:italic>interchange</jats:italic> neighborhood structure, is used. We also propose a new simple local search strategy for solving facility location problems, within the interchange neighborhood structure, which is in between the usual ones: <jats:italic>first improvement</jats:italic> and <jats:italic>best improvement</jats:italic> strategies. We call it <jats:italic>facility best improvement</jats:italic> local search. On the basis of experiments, it appeared to be more efficient and effective than both <jats:italic>first</jats:italic> and <jats:italic>best improvement</jats:italic>. According to the results obtained on the benchmark instances, our heuristic turns out to be highly competitive with the existing ones, establishing new state‐of‐the‐art results. For example, four new best‐known solutions and 133 ties are claimed in testing the set with 144 instances.</jats:p> |
| doi_str_mv | 10.1111/itor.12646 |
| facet_avail | Online |
| finc_class_facet | Wirtschaftswissenschaften, Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9pdG9yLjEyNjQ2 |
| imprint | Wiley, 2020 |
| imprint_str_mv | Wiley, 2020 |
| institution | DE-D275, DE-Bn3, DE-Brt1, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229 |
| issn | 1475-3995, 0969-6016 |
| issn_str_mv | 1475-3995, 0969-6016 |
| language | English |
| last_indexed | 2024-03-01T17:36:25.108Z |
| match_str | mladenovic2020lessismoreapproachbasicvariableneighborhoodsearchfortheobnoxiouspmedianproblem |
| mega_collection | Wiley (CrossRef) |
| physical | 480-493 |
| publishDate | 2020 |
| publishDateSort | 2020 |
| publisher | Wiley |
| record_format | ai |
| recordtype | ai |
| series | International Transactions in Operational Research |
| source_id | 49 |
| spelling | Mladenović, Nenad Alkandari, Abdulaziz Pei, Jun Todosijević, Raca Pardalos, Panos M. 0969-6016 1475-3995 Wiley Management of Technology and Innovation Management Science and Operations Research Strategy and Management Computer Science Applications Business and International Management http://dx.doi.org/10.1111/itor.12646 <jats:title>Abstract</jats:title><jats:p>The goal of the <jats:italic>less is more</jats:italic> approach (LIMA) for solving optimization problems that has recently been proposed in Mladenović et al. (2016) is to find the minimum number of search ingredients that make a heuristic more efficient than the currently best. In this paper, LIMA is successfully applied to solve the obnoxious <jats:italic>p</jats:italic>‐median problem (OpMP). More precisely, we developed a basic variable neighborhood search for solving the OpMP, where the single search ingredient, the <jats:italic>interchange</jats:italic> neighborhood structure, is used. We also propose a new simple local search strategy for solving facility location problems, within the interchange neighborhood structure, which is in between the usual ones: <jats:italic>first improvement</jats:italic> and <jats:italic>best improvement</jats:italic> strategies. We call it <jats:italic>facility best improvement</jats:italic> local search. On the basis of experiments, it appeared to be more efficient and effective than both <jats:italic>first</jats:italic> and <jats:italic>best improvement</jats:italic>. According to the results obtained on the benchmark instances, our heuristic turns out to be highly competitive with the existing ones, establishing new state‐of‐the‐art results. For example, four new best‐known solutions and 133 ties are claimed in testing the set with 144 instances.</jats:p> Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem International Transactions in Operational Research |
| spellingShingle | Mladenović, Nenad, Alkandari, Abdulaziz, Pei, Jun, Todosijević, Raca, Pardalos, Panos M., International Transactions in Operational Research, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, Management of Technology and Innovation, Management Science and Operations Research, Strategy and Management, Computer Science Applications, Business and International Management |
| title | Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_full | Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_fullStr | Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_full_unstemmed | Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_short | Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| title_sort | less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem |
| title_unstemmed | Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
| topic | Management of Technology and Innovation, Management Science and Operations Research, Strategy and Management, Computer Science Applications, Business and International Management |
| url | http://dx.doi.org/10.1111/itor.12646 |