School of Computing

A Genetic Algorithm for the P-median Problem

ES Correa, MTA Steiner, AA Freitas, and C Carnieri

In LE Spector, E Goodman, and et al, editors, Proc. 2001 Genetic and Evolutionary Computation Conference (GECCO-2001), pages 182-196, San Fracisco, USA, July 2001. Morgan Kaufmann.

Abstract

Facility-location problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated pmedian problem. The proposed GA uses not only conventional genetic operators but also a new heuristic "hypermutation" operator proposed in this work. The proposed GA is compared with a tabu search algorithm.

Download publication 81 kbytes (PDF)

Bibtex Record

@inproceedings{1417,
author = {ES Correa and MTA Steiner and AA Freitas and C Carnieri},
title = {{A Genetic Algorithm for the P-median Problem}},
month = {July},
year = {2001},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2001/1417},
    publication_type = {inproceedings},
    submission_id = {17763_1028112817},
    ISBN = {1-55860-774-9},
    booktitle = {Proc. 2001 Genetic and Evolutionary Computation Conference (GECCO-2001)},
    address = {San Fracisco, USA},
    publisher = {Morgan Kaufmann},
    editor = {LE Spector and E Goodman and et al},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014