Skip to Main content Skip to Navigation
Journal articles

Less is more approach: basic variable neighborhood search for the obnoxious p -median problem

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.
Document type :
Journal articles
Complete list of metadata
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 8:34:52 AM
Last modification on : Thursday, June 16, 2022 - 10:38:40 AM

Links full text




Nenad Mladenovic, Abdulaziz Alkandari, Jun Pei, Raca Todosijević, Panos M. Pardalos. Less is more approach: basic variable neighborhood search for the obnoxious p -median problem. International Transactions in Operational Research, Wiley, 2020, 27 (1), pp.480-493. ⟨10.1111/itor.12646⟩. ⟨hal-03400344⟩



Record views