2016
DOI: 10.4236/ajor.2016.64033
|View full text |Cite
|
Sign up to set email alerts
|

A Genetic Algorithm for Overall Designing and Planning of a Long Term Evolution Advanced Network

Abstract: In the mobile radio industry, planning is a fundamental step for the deployment and commissioning of a Telecom network. The proposed models are based on the technology and the focussed architecture. In this context, we introduce a comprehensive single-lens model for a fourth generation mobile network, Long Term Evolution Advanced Network (4G/LTE-A) technology which includes three sub assignments: cells in the core network. In the resolution, we propose an adaptation of the Genetic Evolutionary Algorithm for a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 40 publications
0
2
0
Order By: Relevance
“…The genetic algorithm continuously searches for a space of solutions by applying natural selection and the law of inheritance to the solutions of a generation [8]. The genetic algorithm can solve optimization or decision-making problems because its concepts and theory are simple, and it has demonstrated excellent performance when searching for numerous random solutions set by researchers [19,20]. In particular, the genetic algorithm is appropriate for solving problems with many variables and constraints because of its excellent search function in a complex solution space [8].…”
Section: Metaheuristic Methodsmentioning
confidence: 99%
“…The genetic algorithm continuously searches for a space of solutions by applying natural selection and the law of inheritance to the solutions of a generation [8]. The genetic algorithm can solve optimization or decision-making problems because its concepts and theory are simple, and it has demonstrated excellent performance when searching for numerous random solutions set by researchers [19,20]. In particular, the genetic algorithm is appropriate for solving problems with many variables and constraints because of its excellent search function in a complex solution space [8].…”
Section: Metaheuristic Methodsmentioning
confidence: 99%
“…When this probability is reached, two gene loci are randomly selected from the optimal individual after selection and crossover operation to achieve the mutation operation [33], as shown in Figure 1. In the operation process, if g G  , the operation will continue from step (3) until the individual with the maximum fitness and the optimal solution are output after the operation is terminated algebra [37].…”
Section: ) Cross Operationmentioning
confidence: 99%