A machine learning-based two-stage approach for the location of undesirable facilities in the biomass-to-bioenergy supply chain
Biomass-to-bioenergy supply chain management is an integral part of the sustainable
industrialization of energy conversion through biomass to bioenergy by managing …
industrialization of energy conversion through biomass to bioenergy by managing …
Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
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 …
The maximin HAZMAT routing problem
The hazardous material routing problem from an origin to a destination in an urban area is
addressed. We maximise the distance between the route and its closest vulnerable centre …
addressed. We maximise the distance between the route and its closest vulnerable centre …
Closest assignment constraints in discrete location problems
The objective of this paper is to identify the most promising sets of closest assignment
constraints in the literature of Discrete Location Theory, hel** the authors in the field to …
constraints in the literature of Discrete Location Theory, hel** the authors in the field to …
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 …
Sustainable urban facility location: Minimising noise pollution and network congestion
This paper addresses a multi-objective facility location problem, concerning the location of
noise-sensitive and noise-generating facilities in urban environments. To promote …
noise-sensitive and noise-generating facilities in urban environments. To promote …
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 …
GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering
In this study, a maximal covering location problem is investigated. In this problem, we want
to maximize the demand of a set of customers covered by a set of p facilities located among …
to maximize the demand of a set of customers covered by a set of p facilities located among …
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 …
Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from
a given set of possible locations, in such a way that the sum of the distances between each …
a given set of possible locations, in such a way that the sum of the distances between each …