A Genetic Algorithm for Solving a Capacitated p-Median Problem

A Genetic Algorithm for Solving a Capacitated p-Median Problem

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....

Full description

Saved in:
Bibliographic Details
Published in:Numerical algorithms Vol. 35; no. 2-4; pp. 373 - 388
Main Authors: Correa, Elon Santos, Steiner, Maria Teresinha A., Freitas, Alex A., Carnieri, Celso
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01-04-2004
Subjects:
Genetic algorithms
Search algorithms
Tabu search
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1017-1398
1572-9265
DOI:10.1023/B:NUMA.0000021767.42899.31