Skip to main content
Kent Academic Repository

A genetic algorithm for solving a capacitated p-median problem

Correa, Elon S., Steiner, Maria Teresinha A., Freitas, Alex A., Carnieri, Celso (2004) A genetic algorithm for solving a capacitated p-median problem. Numerical Algorithms, 35 (2-4). pp. 373-388. ISSN 1017-1398. (doi:10.1023/B:NUMA.0000021767.42899.31) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:14192)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.1023/B:NUMA.0000021767.42899....

Abstract

Facility-location problems have several applications, such as telecommunications, industrial transportation and distribution. 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 p-median problem. The proposed GA uses not only conventional genetic operators, but also a new heuristic "hypermutation" operator suggested in this work. The proposed GA is compared with a tabu search algorithm.

Item Type: Article
DOI/Identification number: 10.1023/B:NUMA.0000021767.42899.31
Uncontrolled keywords: genetic algorithms, combinatorial optimisation, p-median problem
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 18:02 UTC
Last Modified: 05 Nov 2024 09:48 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14192 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.