Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30172
Simulated Annealing and Genetic Algorithm in Telecommunications Network Planning

Authors: Aleksandar Tsenov

Abstract:

The main goal of this work is to propose a way for combined use of two nontraditional algorithms by solving topological problems on telecommunications concentrator networks. The algorithms suggested are the Simulated Annealing algorithm and the Genetic Algorithm. The Algorithm of Simulated Annealing unifies the well known local search algorithms. In addition - Simulated Annealing allows acceptation of moves in the search space witch lead to decisions with higher cost in order to attempt to overcome any local minima obtained. The Genetic Algorithm is a heuristic approach witch is being used in wide areas of optimization works. In the last years this approach is also widely implemented in Telecommunications Networks Planning. In order to solve less or more complex planning problem it is important to find the most appropriate parameters for initializing the function of the algorithm.

Keywords: Concentrator network, genetic algorithm, simulated annealing, UCPL.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1055034

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1318

References:


[1] Aarts E. & J. Korst, "Simulated Annealing and Boltzmann Machines", Wiley & Sons Ltd., 1989.
[2] Aarts E. & J. Lenstra (Eds.), "Local Search in Combinatorial Optimization", Wiley & Sons Inc., 1997.
[3] Chardaire P., A. Kapsalis, J.W. Mann, V.J. Rayward-Smith and G.D. Smith, "Applications of Genetic Algorithms in Telecommunications", Proceedings of the 2nd International Workshop on Applications of Neural Networks to Telecommunications, pp. 290-299, 1995.
[4] Elsersy M., M. Abdelmagid, M. Marie, S. Gamal "Optical Network Design Optimization using Genetic Algorithms", presented at ICENCO 2004, pp 11-16, Cairo University, Giza, Egypt, 2004.
[5] Girard A., "Routing in dimensioning in circuit - switched networks", Addison - Wesley Publishing Company, ISBN - 0-201-12792-X, 1990.
[6] Hoang, H.H. "A Computational Approach to the selection of an Optimal Network", Management Science, vol. 19, pp. 488 - 498, 1973.
[7] Jorgensen, N. M., "Simulated annealing in FWA-network", Master thesis on Informatics and Mathematical Modeling, TU-Denmark, September, 2001.
[8] Kirkpatrick S., C.D. Gelatt Jr., M.P. Vecchi, "Optimization by Simulated Annealing" Science, 220, pp. 671-680,1993.
[9] Kratica J., V. Filipovitch, V. Ljeljum, D. Toljijg, "Solving of the Uncapacitated Warehouse Location Problem using a Simple Genetic Algorithm", Proceedings of the XIV International Conference on Material handling and warehousing, 3.33-3.37, Belgrade, 1996.
[10] Kratica J., "Improvement of Simple Genetic Algorithm for Solving the Uncapacitated Warehouse Location Problem", Proceedings of the 3rd On-line World Conference on Soft Computing (WSC3), 1998.
[11] Minoux, M.: Network "Synthesis and Optimum Network Design Problems: Models, Solutions Methods and Applications", Networks, vol. 19, pp. 313 - 360, 1989.
[12] Mirtchev S.T., "Teletraffic engineering", TU-Sofia, ISBN 954-438-235- 6, 1999.
[13] Nikolov T., Al. Tsenov, "An Approach for Reconfiguration and Function recovery of Networks with Defined Connectivity", presented at ICENCO 2004, pp 553-557, Cairo University, Giza, Egypt, 2004.
[14] Nurmela K. J., "Constructing Combinatorial Design in local Search", Series A: Research Reports, Helsinki University of Technology - Digital System Laboratory, ISSN 0783-5396, ISBN 951-22-1857-7, 1993.
[15] Orljansky I.W. "Contemporary approaches and methods of global optimization", Electronic Journal "Studied in Russia", pp. 2097-2108, 2002.
[16] Pjataev O.W, A.W. Semashko, "Formalization of optimization problem for campus networks", Electronic Journal "Studied in Russia", pp. 950- 952, 2001.
[17] Radcliffe N.J., "The Algebra of Genetic Algorithms", Annals of Mathematics and Artificial Intelligence, 10, pp. 339-384, 1994.
[18] Routen T., "Genetic Algorithms and Neural Network Approaches to Local Access Network Design", Proceedings of the 2nd International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 1994.
[19] Spears W. M., "Simulated Annealing for Hard Satisfiability Problems", AI Center - Naval Research Laboratory, Washington, D.C. 20375-5320, 1998.
[20] Tsenov A., "Presentation of location problems", presented at the XXXVII-th International Scientific Conference ICEST 2002, pp. 299- 302, Nish, Yugoslavia, 2- 4 October 2002.
[21] Tsenov A., "Application of Genetic Algorithms in Access Network Planning", presented at the XXXVIII-th International Scientific Conference ICEST 2003, pp. 158-161, Sofia, Bulgaria, 2003.
[22] Tsenov A., "Concentrator location using Simulated Annealing", Electronics & Electrotechniques, ISSN 0861-4717, issue 5 -6, pp. 10 - 15, 2003.
[23] Tsenov A., "Study of the Genetic Algorithm - Parameters in Telecommunications Network Planning Process", presented at the XXXIX-th International Scientific Conference ICEST 2004, pp. 627- 630, Bitola, Macedonia, 2004.
[24] Tsenov A., "Study of the Simulated Annealing - Parameters in Telecommunications Network Planning Process", presented at the XXXIX-th International Scientific Conference ICEST 2004, pp. 631- 634, Bitola, Macedonia, 2004.