Skip to Main Content
The p-median problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients such that the overall cost is minimised. In this paper, PBS, a population based hybrid search algorithm for the p-median problem is introduced. The PBS algorithm uses a genetic algorithm based meta-heuristic, primarily based on cut and paste crossover operators, to generate new starting points for a hybrid local search. For larger p-median instances, PBS is able to effectively utilise a number of computer processors. It is shown empirically that PBS is able to effectively solve p-median problems for a large range of the commonly used p-median benchmark instances.
Date of Conference: 1-6 June 2008