ASPARAGOS an asynchronous parallel genetic optimization strategy
Proceedings of the third international conference on Genetic algorithms
Distributed genetic algorithms
Proceedings of the third international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Annals of Operations Research - Special issue on Tabu search
A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Machine Learning - Special issue on genetic algorithms
Economic aspects of configuring cellular networks
Wireless Networks
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Assignment of cells to switches in PCS networks
IEEE/ACM Transactions on Networking (TON)
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Modeling PCS networks under general call holding time and cell residence time distributions
IEEE/ACM Transactions on Networking (TON)
Efficient and Accurate Parallel Genetic Algorithms
Efficient and Accurate Parallel Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
The impact of mobility on cellular network configuration
Wireless Networks
Hybrid Genetic Algorithms for Telecommunications Network Back-Up Routeing
BT Technology Journal
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
An Efficient Migration Scheme for Subpopulation-Based Asynchronously Parallel Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
A Study of Genetic Algorithm Hybrids for Facility Layout Problems
Proceedings of the 6th International Conference on Genetic Algorithms
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Explicit Parallelism of Genetic Algorithms through Population Structures
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
On Solving Travelling Salesman Problems by Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Selected Papers from AISB Workshop on Evolutionary Computing
Evolutionary Computation
Journal of Artificial Intelligence Research
A parallel genetic algorithm for performance-driven VLSI routing
IEEE Transactions on Evolutionary Computation
Hybrid genetic algorithms for constrained placement problems
IEEE Transactions on Evolutionary Computation
Evolutionary algorithms and gradient search: similarities anddifferences
IEEE Transactions on Evolutionary Computation
An evolutionary strategy for global minimization and its Markovchain analysis
IEEE Transactions on Evolutionary Computation
Integrating fuzzy knowledge by genetic algorithms
IEEE Transactions on Evolutionary Computation
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Knowledge-based function optimization using fuzzy culturalalgorithms with evolutionary programming
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A tabu search approach for assigning cells to switches in cellular mobile networks
Computer Communications
Evolutionary algorithms for location area management
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
| Hi-index | 0.00 |
The design of mobile networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems. Assigning cells to switches in cellular mobile networks is an NP-hard problem, which can not be practically solved using exact methods. In this context, heuristic approaches like memetic algorithms (MAs) are recommended. This paper proposes different MAs to solve this problem. The implementation of these algorithms has been subject to extensive tests. The results obtained confirm the efficiency and the effectiveness of MA to provide good solutions for moderate- and large-sized cellular mobile networks, in comparison with standard genetic algorithm and with other heuristic methods well known in the literature.