Uma aproximação da fronteira eficiente para um problema de localização hierárquico de máxima cobertura

Abstract

Este artigo considera uma extensão de um problema hierárquico de localização de máxima cobertura, na qual as coberturas para os dois níveis de serviço oferecidos são maximizadas independentemente. Apresentamos o modelo matemático e buscamos obter uma aproximação para a fronteira eficiente do problema bi-objetivo correspondente. O modelo bi-objetivo é resolvido através do método das ponderações, utilizando-se uma heurística lagrangeana. Os resultados mostram que as soluções geradas pela mesma fornecem uma aproximação da fronteira eficiente, incluindo soluções eficientes "suportadas" e "não-suportadas".<br>This paper addresses an extension of an hierarchical covering location problem, in which the covers for the two levels of service are maximized independently. We present the mathematical model and seek an approximation for the efficient frontier of the corresponding bi-objective problem. The bi-objective model is solved by the weighting method, through a lagrangean heuristic. The computational results show that the solutions generated by this heuristic provide an approximation of the efficient frontier, including supported and non-supported efficient solutions

Searching the efficient frontier for the coherent covering location problem

“…Step 3: Validation of solutions Fisher & Rushton [15] suggests to apply analytical techniques in order to validate the localizations proposed in the multiple-objective models. The Data Envelopment Analysis (DEA) is a frequent methodology (see [10]- [12], [1]) and it is used in order to validate the relative efficiency of the units, generally called DMUs (Decision Making Units) (see reference [9]).…”

Designing and evaluating sustainable logistics networks

“…It implies that every (Espejo and Galvao [2004] citing Bitran [1977]). It implies that the efficient solutions will map efficient DMUs in a DEA problem, once they belong to the convex hull, and therefore can not be outside the efficient frontier.…”

“…For multi-objective combinatorial problems, Ehrgott [2000] and Ehrgott and Gandibleux [2000] present a detailed review. A survey on multi-objective meta-heuristics is available in Jones et al [2002], Hansen [1998] and Espejo and Galvao [2004].…”