2018
DOI: 10.1111/itor.12510
|View full text |Cite
|
Sign up to set email alerts
|

A parallel variable neighborhood search approach for the obnoxious p‐median problem

Abstract: The obnoxious p‐median problem consists of selecting p locations, considered facilities, in a way that the sum of the distances from each nonfacility location, called customers, to its nearest facility is maximized. This is an scriptNP‐hard problem that can be formulated as an integer linear program. In this paper, we propose the application of a variable neighborhood search (VNS) method to effectively tackle this problem. First, we develop new and fast local search procedures to be integrated into the basic V… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(26 citation statements)
references
References 30 publications
0
13
0
Order By: Relevance
“…The obtained results are compared with those reported in Herrán et al. (). Those results were obtained executing TS algorithm and B&C algorithm from Belotti et al.…”
Section: Computational Resultsmentioning
confidence: 50%
See 4 more Smart Citations
“…The obtained results are compared with those reported in Herrán et al. (). Those results were obtained executing TS algorithm and B&C algorithm from Belotti et al.…”
Section: Computational Resultsmentioning
confidence: 50%
“…Recently, Herrán et al. () extended the benchmark set introducing 72 new test instances generated in the same manner.…”
Section: Computational Resultsmentioning
confidence: 99%
See 3 more Smart Citations