Paper Info
Title
Solving the p-median bilevel problem with order through a hybrid heuristic.
Abstract
•A variant of the p-median in which customer preferences are taken into account, named the p-median bilevel problem with order, is studied.•A comparison among two single-level reformulations herein proposed and an adaptation of an existing reformulation for the SPLPO is made.•A hybrid heuristic algorithm based on Scatter Search and GRASP that obtains high-quality solutions in reasonable time is proposed.•A fair comparison with regards to other heuristic procedures (Scatter search, GRASP and Genetic algorithm) is performed.•A large set of instances in which the proposed heuristic obtains the best results when solving large-size instances is tested.
Year
DOI
Venue
2017
10.1016/j.asoc.2017.06.026
Applied Soft Computing
Keywords
Field
DocType
Bilevel programming,p-Median,Customers preferences,Hybrid heuristics,Scatter search
Mathematical optimization,Parameterized complexity,Heuristic,GRASP,Bilevel optimization,Heuristic (computer science),Algorithm,Artificial intelligence,Optimization problem,Genetic algorithm,Mathematics,Machine learning
Journal
Volume
ISSN
Citations 
60
1568-4946
5
PageRank 
References 
Authors
0.40
14
2
Name
Order
Citations
PageRank
Martha-Selene Casas-Ramírez1102.17
José Fernando Camacho Vallejo250.40