A Population Based Hybrid Metaheuristic for the ρ-median Problem
MetadataShow full item record
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 pmedian 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.
IEEE Congress on Evolutionary Computation
© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Neural, Evolutionary and Fuzzy Computation