Exploring Genetic Algorithms and Simulated Annealing for Immobile Location-Allocation Problem

In this paper we introduce a new kind of immobile Location-Allocation problem that consists in determining the service each facility has to offer in order to maximize the covered demand given the positions of the customers and their service requirements and the positions of the immobile facilities. First, we provide a formalization of the problem and then we tackle the problem using two heuristic methods, genetic algorithms and simulated annealing, comparing the performance of both algorithms ​
​Tots els drets reservats