Geodesic
Metaheuristic Approaches to Solving Large-Scale Bilevel Uncapacitated Facility Location Problem With Clients’ Preferences
Yugoslav journal of operations research, Tome 25 (2015) no. 3, p. 361 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Abstract: 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 strat- egy 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 ap- proaches, 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.
Classification : 68T20, 90B80, 90B06.
Keywords: Keywords: Location problems, Discrete optimization, Particle Swarm Optimization, Simulated Annealing, Variable Neighborhood Search. 
@article{YJOR_2015_25_3_a2,
     author = {Miroslav Maric and Zorica Stanimirovic and Nikola Milenkovic and Aleksandar Djenic},
     title = {Metaheuristic {Approaches} to {Solving} {Large-Scale} {Bilevel} {Uncapacitated} {Facility} {Location} {Problem} {With} {Clients{\textquoteright}}  {Preferences}},
     journal = {Yugoslav journal of operations research},
     pages = {361 },
     publisher = {mathdoc},
     volume = {25},
     number = {3},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2015_25_3_a2/}
}
TY  - JOUR
AU  - Miroslav Maric
AU  - Zorica Stanimirovic
AU  - Nikola Milenkovic
AU  - Aleksandar Djenic
TI  - Metaheuristic Approaches to Solving Large-Scale Bilevel Uncapacitated Facility Location Problem With Clients’  Preferences
JO  - Yugoslav journal of operations research
PY  - 2015
SP  - 361 
VL  - 25
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2015_25_3_a2/
LA  - en
ID  - YJOR_2015_25_3_a2
ER  - 
%0 Journal Article
%A Miroslav Maric
%A Zorica Stanimirovic
%A Nikola Milenkovic
%A Aleksandar Djenic
%T Metaheuristic Approaches to Solving Large-Scale Bilevel Uncapacitated Facility Location Problem With Clients’  Preferences
%J Yugoslav journal of operations research
%D 2015
%P 361 
%V 25
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2015_25_3_a2/
%G en
%F YJOR_2015_25_3_a2
Miroslav Maric; Zorica Stanimirovic; Nikola Milenkovic; Aleksandar Djenic. Metaheuristic Approaches to Solving Large-Scale Bilevel Uncapacitated Facility Location Problem With Clients’  Preferences. Yugoslav journal of operations research, Tome 25 (2015) no. 3, p. 361 . http://geodesic.mathdoc.fr/item/YJOR_2015_25_3_a2/