Authors: Marić, Miroslav
Tuba, Milan
Kratica, Jozef 
Title: Parameter adjustment for genetic algorithm for two-level Hierarchical Covering Location Problem
Journal: WSEAS Transactions on Computers
Volume: 7
Issue: 6
First page: 746
Last page: 755
Issue Date: 1-Jun-2008
ISSN: 1109-2750
In this paper the two-level Hierarchical Covering Location Problem - HCLP is considered. A new genetic algorithm for that problem is developed, including specific binary encoding with the new crossover and mutation operators that keep the feasibility of individuals. Modification that resolves the problem of frozen bits in genetic code is proposed and tested. Version of fine-grained tournament [5] was used as well as the caching GA technique [12] in order to improve computational performance. Genetic algorithm was tested and its parameters were adjusted on number of test examples and it performed well and proved robust in all cases. Results were verified by CPLEX.
Keywords: Covering models | Evolutionary computing | Genetic algorithms | Hierarchical location | Location problem
Publisher: WSEAS
Project: Serbian Ministry of Science, project 144007

Show full item record


checked on Jun 13, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.