Iterated Local Search for the Facility Location Problem with Limited Choice Rule

Facility location problems cover a great variety of different real-life scenarios. Among them, it is usual to consider distances between facilities and/or distances with clients in order to determine the best location for them. However, a different problem arises when the distribution of clients among the open facilities is considered and the cost of opening the facilities is also taken into account. In this paper, we study a problem with these features, the Facility Location problem with Limited Choice rule. We propose a first metaheuristic approach to this problem by means of an Iterated Local Search, which is able to obtain similar results than the state of the art spending shorter execution times.