Skip to main content

A Genetic Algorithm for the P-median Problem

Santos Correa, Elon and Steiner, Maria Teresinha A. and Freitas, Alex A. and Carnieri, Celso (2001) A Genetic Algorithm for the P-median Problem. In: Spector, Lee E. and Goodman, Erik D., eds. Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann, San Francisco, California, USA, pp. 1268-1275. ISBN 1-55860-774-9. (KAR id:13594)

PDF
Language: English
Download (163kB) Preview
[thumbnail of a_genetic_algorithm_correa.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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.

Item Type: Book section
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13594 (The current URI for this page, for reference purposes)
Freitas, Alex A.: https://orcid.org/0000-0001-9825-4700
  • Depositors only (login required):

Downloads

Downloads per month over past year