|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Less is more approach: basic variable neighborhood search for the obnoxious p-median problem||Journal:||International Transactions in Operational Research||Volume:||27||Issue:||1||First page:||480||Last page:||493||Issue Date:||1-Jan-2020||Rank:||M21||ISSN:||0969-6016||DOI:||10.1111/itor.12646||Abstract:||
The goal of the less is more 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 p-median problem (OpMP). More precisely, we developed a basic variable neighborhood search for solving the OpMP, where the single search ingredient, the interchange 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: first improvement and best improvement strategies. We call it facility best improvement local search. On the basis of experiments, it appeared to be more efficient and effective than both first and best improvement. 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.
|Keywords:||facility best improvement | heap data structure | heuristic | less is more | obnoxious location||Publisher:||Wiley||Project:||Mathematical Modelas and Optimization Methods on Large-Scale Systems
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education
"Development of information technologies and systems for stimulation of personality's sustainable development as one of the bases of development of digital Kazakhstan", Grant no. BR05236839
National Natural Science Foundation of China (Nos. 71871080, 71601065, 71690235, 71501058)
Innovative Research Groups of the National Natural Science Foundation of China (71521001)
Humanities and Social Sciences Foundation of the Chinese Ministry of Education (No. 15YJC630097)
"Development of information technologies and systems for stimulation of personality's sustainable development as one of the bases of development of digital Kazakhstan", grant number BR05236839
Show full item record
checked on Sep 27, 2021
checked on Sep 26, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.