Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204) · 2002 · 14 citations · 8 references
Natural SciencesComputer ScienceOperations ManagementFacilities PlanningFacility LocationOptimizationCombinatorial OptimizationGenetic AlgorithmsHeuristic OptimizationHeuristic SearchMetaheuristic OptimizationP-median ProblemHeuristic Methods For P-medianHybrid Genetic AlgorithmsLocation-allocationLocation-allocation HeuristicsMetaheuristics For P-medianNp-complete ProblemsP-hub Location ProblemTabu Search
The location-allocation problem consists of finding the best selection of points to open facilities (location) and the way for serving the users (allocation). In most cases these problems result in being NP hard. For this reason, heuristic approaches constitute suitable tools to solve the problems. Two well known heuristic techniques are genetic algorithms and multistart search. We consider a hybrid algorithm and compare it with other classical techniques such as the tabu search. The technique could easily be applied to other NP hard problems.
8