Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem

In the p-Median Problem, it is assumed that, once the facilities are opened, they may not fail. In practice some of the facilities may become unavailable due to several factors. In the Reliability p-Median Problem some of the facilities may not be operative during certain periods. The objective now is to find facility locations that are both inexpensive and also reliable. We present different configurations of two hybrid metaheuristics to solve the problem, a genetic algorithm and a scatter search approach. We have carried out an extensive computational experiment to study the performance of the algorithms and compare its efficiency solving well-known benchmark instances.

► We present different configurations of two metaheuristics to solve the problem.
► We have carried out an extensive computational experiment.
► We analyze the performance of the algorithms.
► We compare the metaheuristics with exact methods.