Resumo

ROSABAL ALFONSO, Yadira; PORRAS NODARSE, Cynthia  e  FAJARDO CALDERIN, Jenny. Heuristic Constructive Greedy for Dynamic Maximal Covering Location Problem. Rev cuba cienc informat [online]. 2019, vol.13, n.4, pp.81-97. ISSN 2227-1899.

The problems of localization of facilities are applied to a wide range of real situations winning a great interest in the environment of the investigation. The maximal covering location problem (MCLP) it is one of the classic models of the literature and their objective is to maximize the population's covering with limited resources. Of this problem the dynamic variant is known (DMCLP) that maximizes the covering in multiple periods contrary to the classic. The approximate methods have been very used in the resolution of the localization problems and their variants. The heuristic constructive classified inside the group of the heuristic ones they are very well-known for the speed and quality in finding solutions to the localization problems, used in occasions as initial solution in the algorithms metaheuristics, obtaining good results this combination. To give solution to the dynamic pattern they intend in this work four heuristic constructive greedy. they are carried out a first experiment to know which of the heuristic ones outlined it is the most appropriate in the proposed pattern. Finally, it is compared the best heuristic with the algorithm metaheuristics Hill Climbing used in the literature to solve the DMCLP.

Palavras-chave : Algorithms Metaheuristics; Heuristics Constructive; Algorithms Greedy; Dynamic Maximal Covering Location Problem.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )