Review of obnoxious facilities location problems
In this paper we review research on the location of facilities that have a negative impact on
surrounding communities which are defined in the literature, for example, as obnoxious …
surrounding communities which are defined in the literature, for example, as obnoxious …
Enhancing and extending the classical GRASP framework with biased randomisation and simulation
Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
The planar multiple obnoxious facilities location problem: A Voronoi based heuristic
Consider a situation where a given number of facilities must be located in a convex polygon
with the objective of maximizing the minimum distance between facilities and a given set of …
with the objective of maximizing the minimum distance between facilities and a given set of …
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
N Mladenović, A Alkandari, J Pei… - International …, 2020 - Wiley Online Library
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 …
recently been proposed in Mladenović et al.(2016) is to find the minimum number of search …
Performance-cost trade-off in auto-scaling mechanisms for cloud computing
Cloud computing has been widely adopted over the years by practitioners and companies
with a variety of requirements. With a strong economic appeal, cloud computing makes …
with a variety of requirements. With a strong economic appeal, cloud computing makes …
A hybrid binary particle swarm optimization for the obnoxious p-median problem
G Lin, J Guan - Information Sciences, 2018 - Elsevier
The obnoxious p-median problem can be formulated as a constrained binary linear
program. It is NP-hard, and has a lot of real world applications. In this paper, a hybrid binary …
program. It is NP-hard, and has a lot of real world applications. In this paper, a hybrid binary …
An iterated greedy algorithm for the obnoxious p-median problem
O Gokalp - Engineering Applications of Artificial Intelligence, 2020 - Elsevier
The obnoxious p-median problem (OpM) is one of the NP-hard combinatorial optimization
problems, in which the goal is to find optimal places to facilities that are undesirable (eg …
problems, in which the goal is to find optimal places to facilities that are undesirable (eg …
The Weber obnoxious facility location model: A big arc small arc approach
In this paper we propose the Weber obnoxious facility location problem. As in the classic
Weber location problem, the objective is to minimize the weighted sum of distances between …
Weber location problem, the objective is to minimize the weighted sum of distances between …
Parallel iterative solution-based tabu search for the obnoxious p-median problem
The obnoxious p-median problem (OpM) is to determine a set of opened facilities such that
the sum of distances between each client and the opened facilities is maximized. OpM is a …
the sum of distances between each client and the opened facilities is maximized. OpM is a …
Multiple obnoxious facilities location: A cooperative model
T Drezner, Z Drezner, P Kalczynski - IISE Transactions, 2020 - Taylor & Francis
A given number of communities exist in an area. Several obnoxious facilities, such as
polluting factories, garbage dumps, need to be located in the area. The nuisance emitted by …
polluting factories, garbage dumps, need to be located in the area. The nuisance emitted by …