A genetic algorithm for the P-median problem

Correa, ES ORCID: https://orcid.org/0000-0002-5122-4384, Steiner, MTA, Freitas, AA and Carnieri, C 2001, 'A genetic algorithm for the P-median problem' , in: GECCO-2001: Proceedings of the Genetic and Evolutionary Computation Conference , Proceedings of the Genetic and Evolutionary Computation Conference , Morgan Kaufmann Publishers, San Francisco, CA, USA.

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

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 p-median 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
Editors:	Spector, L
Schools:	Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre
Publisher:	Morgan Kaufmann Publishers
Series Name:	Proceedings of the Genetic and Evolutionary Computation Conference
ISBN:	1558607749
Depositing User:	Dr Elon Correa
Date Deposited:	10 Feb 2017 15:27
Last Modified:	15 Feb 2022 21:43
URI:	https://usir.salford.ac.uk/id/eprint/41389

Actions (login required)

Edit record (repository staff only)