Abstract
Location-Allocation problem consists of finding the best selection of points to open facilities at them (location) and the way for serving the users (allocatio). In most cases these problems result to be NP-hard problems. For this reason, the heuristic approaches constitutes suitable tools to solve the problems. Two well known heuristic techniques are the Genetic Algorithms and the MultiStart Search. In this paper we consider a hybrid algorithm that comparing it with other classical techniques as the Tabu Search. The technique could be easily applied to other NP-hard problems.