One Genetic Algorithm for Hierarchical Covering Location Problem

摘要

In this paper we present a new heuristic approach to solve the Hierarchical Covering Location Problem - HCLP. The binary encoding with the new genetic operators that keep the feasibility of individuals is proposed. The caching GA technique was used, in order to improve computational performance. Results were obtained for test problems available in the literature with 100 and 150 vertices. GA results were compared with exact results obtained using CPLEX. In all cases the computing times were reasonable.