A genetic algorithm for solving a capacitated p-Median problem

Correa, ES ORCID: https://orcid.org/0000-0002-5122-4384, Steiner, MTA, Freitas, AA and Carnieri, C 2004, 'A genetic algorithm for solving a capacitated p-Median problem' , Numerical Algorithms, 35 (2-4) , pp. 373-388.

PDF - Published Version Restricted to Repository staff only Download (110kB) | Request a copy

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
Schools:	Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre
Journal or Publication Title:	Numerical Algorithms
Publisher:	Springer
ISSN:	1017-1398
Related URLs:	Publication
Depositing User:	Dr Elon Correa
Date Deposited:	10 Feb 2017 15:22
Last Modified:	15 Feb 2022 21:42
URI:	https://usir.salford.ac.uk/id/eprint/41386

Actions (login required)

Edit record (repository staff only)