Abstract
In this paper, we present the constraint handling techniques developed to tackle a real world optimization application: the frequency assignment problem (FAP) in cellular radio networks. The main goal of this application consists in finding assignments which minimize electromagnetic interference due to frequency reuse and minimize the number of frequencies used. An acceptable assignment of the FAP must satisfy a set of multiple constraints such as traffic constraints and interference constraints. We present how each type of constraint can play a different role in EAs. In particular, we show how co-station constraints can be used to reduce the search space efficiently. The effectiveness of the constraint handling techniques combined with a regeneration technique is tested on big and hard FAP instances. Results show that limiting the degree of unfeasible solutions is beneficial for this application.
Supported by the CNET (French National Research Center for Telecommunications) under the grant No.940B006-01.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.E. Baker. Reducing bias and inefficiency in the selection algorithm. In Proc. of Intl. Conf. on Genetic Algorithms (ICGA'87), pages 14–21, 1987.
L. Davis and D. Orvosh. Shall we repair? genetic algorithms, combinatorial optimization and feasibility constraints. In Proc. of Intl. Conf. on Genetic Algorithms (ICGA '93), page 650, 1993.
R. Dorne and J.K Hao. An evolutionary approach for frequency assignment in cellular radio networks. In IEEE International Conference on Evolutionary Computation (ICEC'95), pages 539–544, Perth, Australia, 1995.
C. M. Fonseca and P. J. Fleming. Multi-objective optimisation and multiple constraint handling with evolutionary algorithms 1: a unified formulation. Technical Report 564, University of Sheffield, UK, 1995.
J.K Hao and R. Dorne. Study of genetic search for the frequency assignment problem. In Lecture Notes in Computer Science vol. 1063, Artificial Evolution (AE'95), pages 333–344, Brest, France, 1995.
Z. Michalewicz. Genetic Algorithms + Data Structures=Evolution Programs. Springer Verlag, Berlin, 1992.
J. T. Richardson and M. R. Palmer. Some guidelines for genetic algorithms with penalty functions. In Proc. of Intl. Conf. on Genetic Algorithms (ICGA '89), pages 191–197, 1989.
P. D. Surry, N. J. Radcliffe, and I. D. Boyd. A multi-objective approach to constrained optimisation of gas supplay networks: the comoga method. Lecture Notes in Computer Science vol. 9,AISB Workshop on Evolutionary Computing, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dorne, R., Hao, JK. (1996). Constraint handling in evolutionary search: A case study of the frequency assignment. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1043
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_1043
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive