A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Analyzing the Performance of a Hybrid Heuristic for Solving a Bilevel Location Problem under Different Approaches to Tackle the Lower Level
2016
Mathematical Problems in Engineering
The problem addressed here is a combinatorial bilevel programming problem called the uncapacitated facility location problem with customer's preferences. A hybrid algorithm is developed for solving a battery of benchmark instances. The algorithm hybridizes an evolutionary algorithm with path relinking; the latter procedure is added into the crossover phase for exploring the trajectory between both parents. The proposed algorithm outperforms the evolutionary algorithm already existing in the
doi:10.1155/2016/9109824
fatcat:tqssf6gsizfdhey4welmegodby