Abstract
We introduce a genetic algorithm incorporating unexpressed genes to solve large-scaled maximal covering problems (MCPs) efficiently. Our genetic algorithm employs new crossover and mutation operators specially designed to work for the chromosomes of set-oriented representation. The unexpressed genes are the genes which are not reflected in the evaluation of the individuals. These genes play the role of preserving information susceptible to be lost by the application of genetic operators but potentially useful in later generations. By incorporating unexpressed genes, the algorithm enjoys the advantage of being able to maintain diversity of the population preventing premature convergence. Experiments with large-scaled real MCP data have shown that our genetic algorithm outperforms simulated annealing and tabu search which are popularly used local neighborhood search algorithms for optimization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Downs, B.T., Camm, J.D.: An Exact Algorithm for the Maximal Covering Problem. Naval Research Logistics 43, 435–461 (1996)
Galvao, R.D., ReVelle, C.: A Lagrangean Heuristic for the Maximal Covering Location Problem. European Journal of Operational Research 88, 114–123 (1996)
Beasley, J.E., Chu, P.C.: A Genetic Algorithm for the Set Covering Problem. European Journal of Operational Research 94, 392–404 (1996)
Lorena, L.A.N., Lopes, L.S.: Computational Experiments with Genetic Algorithms Applied to Set Covering Problems. Pesquisa Operacional, 41-53 (1996)
Hwang, J., Kang, C.S., Ryu, K.R., Han, Y., Choi, H.R.: A Hybrid of Tabu Search and Integer Programming for Subway Crew Scheduling Optimization. In: IASTED-ASC, pp. 72–77 (2002)
Kido, T., Kitano, H., Nakanishi, M.: A Hybrid Search for Genetic Algorithms: Combining Genetic Algorithms, TABU Search, and Simulated Annealing. In: Proceedings of the Fifth International Conference on Genetic Algorithms, p. 641 (1993)
Levine, D.: Application of a hybrid genetic algorithm to airline crew scheduling. Computers & Operations Research 23(6), 547–558 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, T., Ryu, K.R. (2004). Exploiting Unexpressed Genes for Solving Large-Scaled Maximal Covering Problems. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-28633-2_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22817-2
Online ISBN: 978-3-540-28633-2
eBook Packages: Springer Book Archive