A Genetic Algorithm for the P-median Problem

Correa, E.S. and Steiner, M.T.A. and Freitas, A.A. and Carnieri, C. (2001) A Genetic Algorithm for the P-median Problem. In: Proc. 2001 Genetic and Evolutionary Computation Conference (GECCO-2001). (Full text available)

PDF
Download (83kB)
[img]
Preview

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: Conference or workshop item (Paper)
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 17:59
Last Modified: 28 May 2012 15:01
Resource URI: http://kar.kent.ac.uk/id/eprint/13594 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year