Heuristic location-allocation for facilities location problems / Heurística de localizacão-alocacão para problemas de localizacão de facilidades

AUTOR(ES)
DATA DE PUBLICAÇÃO

2002

RESUMO

New location-allocation heuristic (LAH) algorithms applied in facility location problems are presented in this thesis. Such algorithms approach is based on clustering and its main objective is to find out a facility (object) in a space by minimizing a function. The LAH developed throughout this work was employed in two problems: the first problem is the Maximal Covering Location Problem (MCLP) and the second one is the Capacitated p-Median Problems (CPMP) with the purpose of a possible integration to Geographic Information Systems (GIS). A set of test problems was chosen to validate this LAH. Good results were obtained for small and large-scale problems in MCLP cases. Good results were also obtained for small-scale problems in CPMP cases. The LAH were also applied as a mutation process in Constructive Genetic Algorithms for the same problems. The good results demonstrate that LAH, being quick and fast, may be usefully applicable to GIS.

ASSUNTO(S)

otimização sistemas de informações geográficas (sig) programação linear pesquisa operacional algoritmo genético localização

ACESSO AO ARTIGO

Documentos Relacionados