A genetic algorithm for solving a capacitated p-median problem

被引：59

作者：

Correa, ES

Steiner, MTA

Freitas, AA

Carnieri, C

机构：

[1] Univ Manchester, Dept Comp Sci, Manchester M13 9PL, Lancs, England

[2] Univ Fed Parana, Dept Matemat, Ctr Politecn, BR-80060000 Curitiba, Parana, Brazil

[3] Pontificia Univ, Dept Informat, BR-1155 Curitiba, Parana, Brazil

来源：

NUMERICAL ALGORITHMS | 2004年 / 35卷 / 2-4期

关键词：

facility-location; p-median problem; genetic algorithms; tabu search;

D O I：

10.1023/B:NUMA.0000021767.42899.31

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：373 / 388

页数：16