By Topic

A population based hybrid metaheuristic for the p-median problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wayne Pullan ; School of Information and Communication Technology, Griffith University, Gold Coast, QLD, Australia

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.

Published in:

2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)

Date of Conference:

1-6 June 2008