Correa, ES and Steiner, MTA and Freitas, A.A. and Carnieri, C. (2004) A genetic algorithm for solving a capacitated p-median problem. Numerical Algorithms, 35 (2-4). pp. 373-388. ISSN 1017-1398.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|Uncontrolled keywords:||genetic algorithms, combinatorial optimisation, p-median problem|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:02|
|Last Modified:||16 Jul 2009 19:10|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14192 (The current URI for this page, for reference purposes)|
- Depositors only (login required):