Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best- known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …
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 …
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 …
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 …
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 …
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 …
T Drezner, Z Drezner, A Schöbel - Computers & Operations Research, 2018 - Elsevier
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 …
J Chang, L Wang, JK Hao, Y Wang - Computers & Operations Research, 2021 - Elsevier
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 …
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 …