Download (.pdf)
Problem of Assignment Cells to Switches in a Cellular Mobile Network via Beam Search Method
Cassilda Maria Ribeiro, Anibal Tavares Azevedo, Rodolfo Florence Teixeira Jr., WSEAS TRANSACTIONS on COMMUNICATIONS, Volume 9, ISSN: 1109-2742, 2010
The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real... more The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.
An Overview of the Theory of Instances Computational Complexity
An Overview of the Theory of Instances Computational Complexity
by: Jorge A. Ruiz-Vanoye, Ocotlán Díaz-Parra
International Journal of Combinatorial Optimization Problems and Informatics, Vol. 2, No. 2. (2011) pp. 37-43.
The theory of the computational complexity is a subject of international interest of scientific, technological and... more The theory of the computational complexity is a subject of international interest of scientific, technological and enterprise organizations. The computational complexity contains diverse elements such as the classes of problems complexity (P, NP, NP-hard and NP-complete, and others), complexity of algorithms (it is a way to classify how efficient is an algorithm by means the execution time to solve a problem with the worst-case input), complexity of instances (it is computational complexity measures to determine the complex of the problems instances), and others elements. This work is focused on presenting a review of the theory of instances computational complexity.
Similarities between Meta-heuristics Algorithms and the Science of Life
In this paper, we show the functional similarities between Meta-heuristics and the aspects of the science of life... more In this paper, we show the functional similarities between Meta-heuristics and the aspects of the science of life (biology): (a) Meta-heuristics based on gene transfer: Genetic algorithms (natural evolution of genes in an organic population), Transgenic Algorithm (transfers of genetic material to another cell that is not descending); (b) Meta-heuristics based on interactions among individual insects: Ant Colony Optimization (on interactions among individuals insects, Ant Colonies), Firefly algorithm (fireflies of the family Lampyridze), Marriage in honey bees Optimization algorithm (the process of reproduction of Honey Bees), Artificial Bee Colony algorithm (the process of recollection of Honey Bees); and (c) Meta-heuristics based on biological aspects of alive beings: Tabu Search Algorithm (Classical Conditioning on alive beings), Simulated Annealing algorithm (temperature control of spiders), Particle Swarm Optimization algorithm (social behavior and movement dynamics of birds and fish) and Artificial Immune System (immunological mechanism of the vertebrates).