Abstract
Evolutionary computation techniques have received a great deal of attention regarding their potential as optimization techniques for complex functions. In this paper, we consider three of them: multiple restart hill-climbing, population-based incremental learning and genetic algorithms. Their binary version and a real-coded variant of each of these techniques are experimented on a real problem: traffic supervision in telephone networks. Indeed, this task need to determine streams responsible for call losses in a network by comparing their traffic values to nominal values. However, stream traffic values are not directly available from the on-line data acquisition system and, hence, have to be computed by inverting a computational model of stream propagation in circuit-switched networks only based on the Erlang’s formula plus qualitative knowledge about the network. Then, our stream propagation model inversion has been computed thanks to the previous techniques and using several fitness measures to show how their choice can impact on the final results.
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
S. Baluja. Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, 1994.
S. Baluja. An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical Report CMU-CS-95-193, 1995.
D. Beasley, D.R. Bull, and D.R. Martin. An overview of genetic algorithms: Parti, fundamentals. University computing, 15(2):58–69, 1993.
D. Beasley, D.R. Bull, and D.R. Martin. An overview of genetic algorithms: Part 2, research topics. University computing, 15(4):170–181, 1993.
L.J. Eshelman and J.D. Schaffer. Real-coded genetic algorithms and interval-schemata, volume 2. 1992.
J. Heitkokker and D. Beasley. The hitch-hiker’s guide to evolutionary computation: A list of frequently asked questions, available by anonymous ftp at rtfm.mit.edu., 1994.
F. Le Gall, J. Bernussou, and J.M. Garcia. A one-moment model for telephone networks with dependance on link blocking probabilities, pages 449–458. 1984.
A. Passeron. Notions élémentaires sur le trafic téléphonique. Technical Report DE/ATR/57.84, CNET, Issy-les-Moulineaux, 1984.
I. Servet, L. Travé-Massuyès, and D. Stern. Traffic supervision based on a one-moment model of telephone networks built from qualitative knowledge. In Proc. IMACS/IEEE CESA’96. Villeneuve d’Asq (France), 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Servet, I., Travé-Massuyès, L., Stern, D. (1998). Evolutionary Computation Techniques for Telephone Networks Traffic Supervision Based on a Qualitative Stream Propagation Model. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_64
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_64
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive