Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Optimum positioning of base stations for cellular radio networks
Wireless Networks
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms
Journal of Heuristics
A Heuristic Approach for Antenna Positioning in Cellular Networks
Journal of Heuristics
A Taxonomy of Hybrid Metaheuristics
Journal of Heuristics
WISE Design of Indoor Wireless Systems: Practical Computation and Optimization
IEEE Computational Science & Engineering
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
An enabling framework for parallel optimization on the computational grid
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Optimal location of transmitters for micro-cellular radio communication system design
IEEE Journal on Selected Areas in Communications
Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem
IEEE Transactions on Evolutionary Computation
Expert Systems with Applications: An International Journal
Hi-index | 0.25 |
Cellular network design is a major issue in mobile telecommunication systems. In this paper, a model of the problem in its full practical complexity, based on multiobjective constrained combinatorial optimization, has been investigated. We adopted the Pareto approach at resolution in order to compute a set of diversified non-dominated networks, thus removing the need for the designer to rank or weight objectives a priori. We designed and implemented a ''ready-to-use'' platform for radio network optimization that is flexible regarding both the modeling of the problem (adding, removing, updating new antagonist objectives and constraints) and the solution methods. It extends the ''white-box'' ParadisEO framework for metaheuristics applied to the resolution of mono/multi-objective Combinatorial Optimization Problems requiring both the use of advanced optimization methods and the exploitation of large-scale parallel and distributed environments. Specific coding scheme and genetic and neighborhood operators have been designed and embedded. On the other side, we make use of many generic features related to advanced intensification and diversification search techniques, hybridization of metaheuristics and grid computing for the distribution of the computations. They aim at improving the quality of networks and their robustness. They also allow, to speed-up the search and obtain results in a tractable time, and so efficiently solving large instances of the problem. Using three realistic benchmarks, the computed networks and speed-ups on different parallel and/or distributed architectures show the efficiency and the scalability of hierarchical parallel hybrid models.