Parameter adjustment for genetic algorithm for two-level hierarchical covering location problem

Authors:
Miroslav Maric;Milan Tuba;Jozef Kratica
Affiliations:
Faculty of Mathematics, University of Belgrade, Belgrade, Serbia;Faculty of Mathematics, University of Belgrade, Belgrade, Serbia;Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
Venue:
WSEAS Transactions on Computers
Year:
2008

Citing 7
Cited 2

An introduction to genetic algorithms

An introduction to genetic algorithms
Dual-based heuristics for a hierarchical covering location problem

Computers and Operations Research
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Journal of Heuristics
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation
A detecting peak's number technique for multimodal function optimization

WSEAS Transactions on Information Science and Applications
Improving graph colouring algorithms and heuristics using a novel representation

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
The core concept for the multidimensional knapsack problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

A tool for comparing resource-constrained project scheduling problem algorithms

AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
A preprocessing procedure for fixing the binary variables in the capacitated facility location problem through pairing and surrogate constraint analysis

WSEAS Transactions on Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.