Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/3024| Title: | One genetic algorithm for hierarchical covering location problem | Authors: | Marić, Miroslav Tuba, Milan Kratica, Jozef |
Affiliations: | Informatics and Computer Science | Keywords: | Evolutionary computation;Hierarchical location;Covering models | Issue Date: | 2008 | Rank: | M33 | Publisher: | Athens : World Scientific and Engineering Academy and Society | Related Publication(s): | Advanced Topics in Evolutionary Computing : Proceedings of 9th WSEAS International Conference on Evolutionary Computing | Conference: | WSEAS International Conference on Evolutionary Computing (9 ; 2008 ; Sofia) | Abstract: | 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/3024 | DOI: | 10.5555/1415975.1416000 |
| Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.