A hybrid grouping genetic algorithm for citywide ubiquitous WiFi access deployment

Authors:
E. Agustín-Blas;S. Salcedo-Sanz;P. Vidales;G. Urueta;A. Portilla-Figueras;M. Solarski
Affiliations:
Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain;Deutsche Telekom Laboratories, Berlin, Germany;Deutsche Telekom Laboratories, Berlin, Germany;Department of Signal Theory and Communications, Universidad de Alcalá, Madrid, Spain;Deutsche Telekom Laboratories, Berlin, Germany
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 10
Cited 4

The budgeted maximum coverage problem

Information Processing Letters
Grouping genetic algorithms: an efficient method to solve the cell formation problem

Mathematics and Computers in Simulation - Special issue from the IMACS/IFAC international symposium on soft computing methods and applications: “SOFTCOM '99” (held in Athens, Greece)
Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
CPGEA: a grouping genetic algorithm for material cutting plan generation

Computers and Industrial Engineering
Modular product design with grouping genetic algorithm: a case study

Computers and Industrial Engineering
A hybrid grouping genetic algorithm for the cell formation problem

Computers and Operations Research
A hybrid grouping genetic algorithm for the registration area planning problem

Computer Communications
PISA: P2P Wi-Fi Internet Sharing Architecture

P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
A grouping genetic algorithm for the microcell sectorization problem

Engineering Applications of Artificial Intelligence
Evaluating performance advantages of grouping genetic algorithms

Engineering Applications of Artificial Intelligence

MetroSim: a planning tool for metropolitan WiFi networks

Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Near optimal citywide WiFi network deployment using a hybrid grouping genetic algorithm

Expert Systems with Applications: An International Journal
Survey: A survey of repair methods used as constraint handling techniques in evolutionary algorithms

Computer Science Review
Efficient citywide planning of open WiFi access networks using novel grouping harmony searchheuristics

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe the application of a Hybrid Grouping Genetic Algorithm (HGGA) to the recent challenge of deploying metropolitan wireless networks, exploiting existing broadband infrastructure, by opening WiFi-enabled customers' DSL routers to third parties, or WiFi network Design Problem or WiFiDP. The application of a HGGA to this problem aims to produce the layout of a cost effective network deployment plan, considering real life aspects such as budget and DSL router characteristics (coverage, DSL capacity at a specific location, unit price, etc.) The total cost of deployment (i.e. the cost of opening all selected DSL routers for public use) should not exceed the allocated budget. The hybrid groping genetic algorithm proposed includes a specific encoding to tackle the WiFiDP, in which the group part also includes the type of router to be installed. Moreover, a repairing and local search procedures are included in the algorithm to obtain better performance and always finding feasible solutions. The performance and effectiveness of the proposed HGGA is evaluated using two randomly generated WiFiDP instances (considering 1000 and 2000 users) that were used to perform several experiments. From theses datasets, we compare the results of the proposed HGGA with that of a greedy optimization algorithm previously proposed to solve the WiFiDP challenge.