An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network

2015 ◽  
Vol 47 ◽  
pp. 261-268 ◽  
Author(s):  
Stefan Mišković ◽  
Zorica Stanimirović ◽  
Igor Grujičić
Keyword(s):  
Facility Location ◽  
Variable Neighborhood Search ◽  
Emergency Service ◽  
Location Problem ◽  
Facility Location Problem ◽  
Neighborhood Search ◽  
Service Network

scholarly journals Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences

2015 ◽  
Vol 25 (3) ◽  
pp. 361-378 ◽  
Author(s):  
Miroslav Maric ◽  
Zorica Stanimirovic ◽  
Nikola Milenkovic ◽  
Aleksandar Djenic
Keyword(s):  
Facility Location ◽  
Large Scale ◽  
Location Problem ◽  
Facility Location Problem ◽  
Neighborhood Search ◽  
Scale Problem ◽  
Uncapacitated Facility Location Problem ◽  
Large Scale Problem ◽  
Representation Of Solutions ◽  
Problem Instances

In this study, we consider a variant of the Bilevel Uncapacitated Facility Location Problem (BLUFLP), in which the clients choose suppliers based on their own preferences. We propose and compare three metaheuristic approaches for solving this problem: Particle Swarm Optimization (PSO), Simulated Annealing (SA), and a combination of Reduced and Basic Variable Neighborhood Search Method (VNS). We used the representation of solutions and objective function calculation that are adequate for all three proposed methods. Additional strategy is implemented in order to provide significant time savings when evaluating small changes of solution's code in improvement parts. Constructive elements of each of the proposed algorithms are adapted to the problem under consideration. The results of broad computational tests on modified problem instances from the literature show good performance of all three proposed methods, even on large problem dimensions. However, the obtained results indicate that the proposed VNS-based has significantly better performance compared to SA and PSO approaches, especially when solving large-scale problem instances. Computational experiments on large scale benchmarks demonstrate that the VNS-based method is fast, competitive, and able to find high-quality solutions, even for large-scale problem instances with up to 2000 clients and 2000 potential facilities within reasonable CPU times.

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.

Sign in / Sign up

Export Citation Format

Share Document