Benchmarking a Wide Spectrum of Metaheuristic Techniques for the Radio Network Design Problem

The radio network design (RND) is an NP-hard optimization problem which consists of the maximization of the coverage of a given area while minimizing the base station deployment. Solving RND problems efficiently is relevant to many fields of application and has a direct impact in the engineering, telecommunication, scientific, and industrial areas. Numerous works can be found in the literature dealing with the RND problem, although they all suffer from the same shortfall: a noncomparable efficiency. Therefore, the aim of this paper is twofold: first, to offer a reliable RND comparison base reference in order to cover a wide algorithmic spectrum, and, second, to offer a comprehensible insight into accurate comparisons of efficiency, reliability, and swiftness of the different techniques applied to solve the RND problem. In order to achieve the first aim we propose a canonical RND problem formulation driven by two main directives: technology independence and a normalized comparison criterion. Following this, we have included an exhaustive behavior comparison between 14 different techniques. Finally, this paper indicates algorithmic trends and different patterns that can be observed through this analysis.

[1]  Matthijs den Besten,et al.  Design of Iterated Local Search Algorithms , 2001, EvoWorkshops.

[2]  Jin-Kao Hao,et al.  A Heuristic Approach for Antenna Positioning in Cellular Networks , 2001, J. Heuristics.

[3]  Majid Nili Ahmadabadi,et al.  A New Approach for Training of Artificial Neural Networks using Population Based Incremental Learning (PBIL) , 2004, International Conference on Computational Intelligence.

[4]  Pedro Isasi Viñuela,et al.  Interactive Evolutionary Computation algorithms applied to solve Rastrigin test functions , 2005, WSTST.

[5]  C. D. Perttunen,et al.  Lipschitzian optimization without the Lipschitz constant , 1993 .

[6]  Tapan K. Sarkar,et al.  Methods for optimizing the location of base stations for indoor wireless communications , 2002 .

[7]  Hanif D. Sherali,et al.  Optimal location of transmitters for micro-cellular radio communication system design , 1996, IEEE J. Sel. Areas Commun..

[8]  E. Alba,et al.  Evolutionary algorithms for optimal placement of antennae in radio network design , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[9]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[10]  Celso C. Ribeiro,et al.  Hybrid Local Search for the Steiner Problem in Graphs , 2001 .

[11]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[12]  H.M. Elkamchouchi,et al.  Cellular Radio Network Planning using Particle Swarm Optimization , 2007, 2007 National Radio Science Conference.

[13]  Christian Blum.  Iterated local search and constructive heuristics for error correcting code design , 2007 .

[14]  T. Fritsch,et al.  An integrated approach to cellular mobile communication planning using traffic data prestructured by a self-organizing feature map , 1993, IEEE International Conference on Neural Networks.

[15]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[16]  Ian Witten,et al.  Data Mining , 2000 .

[17]  Yuchou Chang,et al.  Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm , 2008, Pattern Recognit..

[18]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[19]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Miguel A. Vega-Rodríguez,et al.  Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem , 2007, EUROCAST.

[22]  Pedro Isasi Viñuela,et al.  A Study of the Effects of Clustering and Local Search on Radio Network Design: Evolutionary Computation Approaches , 2008, 2008 Eighth International Conference on Hybrid Intelligent Systems.

[23]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[24]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[25]  C. R. Anderson,et al.  Global Optimization of Transmitter Placement in Wireless Communication Systems , 2002 .

[26]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[27]  William Joshua Brown,et al.  An iterated local search with adaptive memory applied to the snake in the box problem , 2005 .

[28]  Celso C. Ribeiro,et al.  A GRASP for graph planarization , 1997, Networks.

[29]  Leo Liberti,et al.  Variable Neighbourhood Search for the Global Optimization of Constrained NLPs , 2006 .

[30]  Steven Chamberland,et al.  On the wireless local area network design problem with performance guarantees , 2005, Comput. Networks.

[31]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[32]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[33]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem , 1998, J. Comb. Optim..

[34]  Clifford A. Shaffer,et al.  GLOBAL OPTIMIZATION OF TRANSMITTER PLACEMENT FOR INDOOR WIRELESS COMMUNICATION SYSTEMS , 2002 .

[35]  Pierre Kuonen,et al.  Parallel Island-Based Genetic Algorithm for Radio Network Design , 1997, J. Parallel Distributed Comput..

[36]  Rudolf Mathar,et al.  Optimisation models for GSM radio , 2005 .

[37]  M. Dorigo,et al.  Design of Iterated Local Search Algorithms An Example Application to the Single Machine Total Weighted Tardiness Problem , 2001 .

[38]  El-Ghazali Talbi,et al.  Hierarchical parallel approach for GSM mobile network design , 2006, J. Parallel Distributed Comput..

[39]  Pierre Hansen,et al.  A Tutorial on Variable Neighborhood Search , 2003 .

[40]  Thom W. Frühwirth,et al.  Planning Cordless Business Communication Systems , 1996, IEEE Expert.

[41]  K. Srinivasa Raju,et al.  OPTIMAL RESERVOIR OPERATION USING DIFFERENTIAL EVOLUTION , 2004 .

[42]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[43]  Enrique Alba,et al.  Efficient parallel LAN/WAN algorithms for optimization. The mallba project , 2006, Parallel Comput..

[44]  Hussein A. Abbass,et al.  The Pareto Differential Evolution Algorithm , 2002, Int. J. Artif. Intell. Tools.

[45]  Joe Bater,et al.  Applying Iterated Local Search to Reduce the Costs of Backhaul in Telecommunications Network Design , 2006 .

[46]  Mauricio Solar,et al.  Solution for the constrained guillotine cutting problem by simulated annealing , 1998, Comput. Oper. Res..

[47]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures , 2000, Discret. Math..

[48]  Miguel A. Lejeune,et al.  Production , Manufacturing and Logistics A variable neighborhood decomposition search method for supply chain management planning problems , 2006 .

[49]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[50]  Rainer Storn,et al.  Differential Evolution-A simple evolution strategy for fast optimization , 1997 .

[51]  Chun-Jen Tsai,et al.  Analysis of an SOC Architecture for MPEG Reconfigurable Video Coding Framework , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[52]  Isaac E. Lagaris,et al.  GenAnneal: Genetically modified Simulated Annealing , 2006, Comput. Phys. Commun..

[53]  S.L. Ho,et al.  A New Implementation of Population Based Incremental Learning Method for Optimizations in Electromagnetics , 2007, IEEE Transactions on Magnetics.

[54]  Mohammad S. Obaidat,et al.  On the use of population-based incremental learning in the medium access control of broadcast communication systems , 2003, 10th IEEE International Conference on Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003.

[55]  M.A. Vega-Rodriguez,et al.  Fast Wide Area Network Design Optimisation Using Differential Evolution , 2007, International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP'07).

[56]  Panos M. Pardalos,et al.  A GRASP for the biquadratic assignment problem , 1998, Eur. J. Oper. Res..

[57]  Robin Braun,et al.  Towards a Management Paradigm with a Constrained Benchmark for Autonomic Communications , 2006, 2006 International Conference on Computational Intelligence and Security.

[58]  Sujin Bureerat,et al.  Population-Based Incremental Learning for Multiobjective Optimisation , 2007 .

[59]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[60]  Bikas K. Chakrabarti,et al.  Quantum Annealing and Other Optimization Methods , 2005 .

[61]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[62]  Douglas Thain,et al.  Distributed computing in practice: the Condor experience , 2005, Concurr. Pract. Exp..

[63]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[64]  Arthur C. Sanderson,et al.  Minimal representation multisensor fusion using differential evolution , 1997, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'.

[65]  Celso C. Ribeiro,et al.  A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..

[66]  Celso C. Ribeiro,et al.  New benchmark instances for the Steiner problem in graphs , 2004 .

[67]  Pierre Hansen,et al.  Variable neighborhood search for the maximum clique , 2001, Discret. Appl. Math..

[68]  Miron Livny,et al.  Distributed computing in practice: the Condor experience: Research Articles , 2005 .

[69]  Miguel A. Vega-Rodríguez,et al.  Guest editors' introduction - Special issue on FPGAs: applications and designs , 2004, Microprocess. Microsystems.

[70]  M. Unbehaun,et al.  Coverage planning for outdoor wireless LAN systems , 2002, 2002 International Zurich Seminar on Broadband Communications Access - Transmission - Networking (Cat. No.02TH8599).

[71]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[72]  El-Ghazali Talbi,et al.  A multiobjective genetic algorithm for radio network optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[73]  Amaia Lusa,et al.  A variable neighbourhood search algorithm for the constrained task allocation problem , 2008, J. Oper. Res. Soc..

[74]  Pierre Kuonen,et al.  Radio Network Planning with Combinatorial Optimization Algorithms , 1996 .

[75]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[76]  Tarek A. El-Ghazawi,et al.  Guest Editors' Introduction: High-Performance Reconfigurable Computing , 2007, Computer.

[77]  Sujata Banerjee,et al.  Optimization of indoor wireless communication network layouts , 2002 .

[78]  David Tipper,et al.  Next generation wireless LAN system design , 2002, MILCOM 2002. Proceedings.

[79]  Rich Caruana,et al.  Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.

[80]  P. Kuonen,et al.  Genetic approach to radio network optimization for mobile systems , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[81]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[82]  Enrique Alba,et al.  On the behavior of parallel genetic algorithms for optimal placement of antennae in telecommunications , 2005, Int. J. Found. Comput. Sci..

[83]  G. Celli,et al.  Genetic algorithms for telecommunication network optimization , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[84]  Miguel A. Vega-Rodríguez,et al.  A Differential Evolution Based Algorithm to Optimize the Radio Network Design Problem , 2006, e-Science.

[85]  Gilbert Laporte,et al.  An iterated local search heuristic for the logistics network design problem with single assignment , 2008 .

[86]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[87]  Thomas Stützle,et al.  An application of Iterated Local Search to Graph Coloring , 2002 .

[88]  José M. Chaves-González,et al.  Parallelizing PBIL for Solving a Real-World Frequency Assignment Problem in GSM Networks , 2008, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008).

[89]  Kurt Tutschku,et al.  Demand-based radio network planning of cellular mobile communication systems , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[90]  Mauricio G. C. Resende,et al.  Computing Approximate Solutions of the Maximum Covering Problem with GRASP , 1998, J. Heuristics.

[91]  Dietmar Kunz,et al.  Channel assignment for cellular radio using simulated annealing , 1993 .

[92]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[93]  El-Ghazali Talbi,et al.  Designing cellular networks using a parallel hybrid metaheuristic on the computational grid , 2007, Comput. Commun..

[94]  Pedro Isasi Viñuela,et al.  Reference chromosome to overcome user fatigue in IEC , 2009, New Generation Computing.

[95]  B. Chakrabarti,et al.  Quantum Annealing and Related Optimization Methods , 2008 .

[96]  L. J. Ibbetson,et al.  An automatic base site placement algorithm , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[97]  Ivica Kostanic,et al.  Automatic radio planning of GSM cellular networks , 2005 .

[98]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[99]  Dirk Reichelt,et al.  A Study of an Iterated Local Search on the Reliable Communication Networks Design Problem , 2005, EvoWorkshops.

[100]  Arno Formella,et al.  Optimization methods for optimal transmitter locations in a mobile wireless system , 2002, IEEE Trans. Veh. Technol..

[101]  R. Lewontin.  ‘The Selfish Gene’ , 1977, Nature.

[102]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[103]  J.C.S. Cheung,et al.  Network planning for third-generation mobile radio systems , 1994, IEEE Communications Magazine.

[104]  Frank Nielsen,et al.  Combinatorial optimization algorithms for radio network planning , 2001, Theor. Comput. Sci..

[105]  Inmaculada Rodríguez Martín,et al.  Variable neighborhood tabu search and its application to the median cycle problem , 2003, Eur. J. Oper. Res..

[106]  D. Wagner,et al.  Radio network optimization with maximum independent set search , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[107]  E. Burke,et al.  Variable neighborhood search for nurse rostering problems , 2004 .

[108]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[109]  Brian W. Kernighan,et al.  WISE design of indoor wireless systems: practical computation and optimization , 1995 .

[110]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..