New Genetic Algorithms Based Approaches to Continuous p-Median Problem

We proposed new genetic algorithms (GAs) to address well-known p-median problem in continuous space. Two GA approaches with different replacement procedures are developed to solve this problem. To make the approaches more efficient in finding near-optimal solution two hybrid algorithms are developed combining the new GAs and a traditional local search heuristic. The performance of the newly developed models is compared to that of the traditional alternating location-allocation heuristics by numerical simulation and it is found that the models are effective in finding optimum facility locations.