Back to Search
Start Over
ALGORITMO BASADO EN DISCRIMINACION POR DISTANCIAS CON BUSQUEDA GLOBAL APLICADO AL PROBLEMA DE LA P-MEDIANA.
- Source :
-
Revista Ingeniería Industrial . 2010, Vol. 9 Issue 1, p87-94. 8p. 1 Diagram, 2 Charts, 3 Graphs. - Publication Year :
- 2010
-
Abstract
- This paper presents an heuristics for solving p-median problems. The main idea is the execution of a preprocess routine whose goal is to reduce the number of variables facilitating its computacional resolution. This preprocessing is essentially based in the determination of a maximum distance that enables you to discriminate if two any nodes are served for the same facility. If the distance between these nodes is greater than the maximum distance, then these nodes will not be served for the same facility. As a consequence, variables need to be fixed to zero in order to reduce the size of the problem. [ABSTRACT FROM AUTHOR]
Details
- Language :
- Spanish
- ISSN :
- 07179103
- Volume :
- 9
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Revista Ingeniería Industrial
- Publication Type :
- Academic Journal
- Accession number :
- 54282094