Browsing by Keyword "Harmony search algorithm"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Efficient citywide planning of open WiFi access networks using novel grouping harmony searchheuristics(2013-03) Landa-Torres, I.; Gil-Lopez, S.; Del Ser, J.; Salcedo-Sanz, S.; Manjarres, D.; Portilla-Figueras, J. A.; Tecnalia Research & Innovation; IAThis paper proposes the application of a novel meta-heuristic algorithm to the metropolitan wireless local area network deployment problem. In this problem, the coverage level of the deployed network must be maximized while meeting an assigned maximum budget, set beforehand. Specifically, we propose an approach based on the Harmony Search (HS) algorithm, with three main technical contributions: (1)the adaptation of the HS algorithm to a grouping scheme; (2)the adaptation of the improvisation operators driving the algorithm to the specific characteristics of the optimization problem to be tackled; and (3)its performance assessment via a simulated experiment inspired by real statistics in the city of Bilbao (Basque Country, northern Spain). Moreover, a comparison study of the proposed algorithm with a previous published grouping genetic algorithm is carried out, to further validate its performance. In light of the simulation results obtained from extensive experiments and several complexity considerations, we conclude that the proposed algorithm outperforms its genetically inspired counterpart, not only in terms of computation time, but also in the coverage level of the solution obtained.Item A novel grouping harmony search algorithm for the multiple-type access node location problem(2012-04) Landa-Torres, I.; Gil-Lopez, S.; Salcedo-Sanz, S.; Ser, J. Del; Portilla-Figueras, J. A.; Tecnalia Research & Innovation; IAIn this paper we present a novel grouping harmony search algorithm for the Access Node Location Problem (ANLP) with different types of concentrators. The ANLP is a NP-hard problem where a set of distributed terminals, with distinct rate demands, must be assigned to a variable number of concentrators subject to capacity constraints. We consider the possibility of choosing between different concentrator models is given in order to provide service demand at different cost. The ANLP is relevant in communication networks design, and has been considered before within the design of MPLS networks, for example. The approach we propose to tackle the ANLP problem consists of a hybrid Grouping Harmony Search (GHS) algorithm with a local search method and a technique for repairing unfeasible solutions. Moreover, the presented scheme also includes the adaptation of the GHS to a differential scheme, where each proposed harmony is obtained from the same harmony in the previous iteration. This differential scheme is perfectly adapted to the specifications of the ANLP problem, as it utilizes the grouping concept based on the proximity between nodes, instead of being only based on the grouping concept. This allows for a higher efficiency on the searching process of the algorithm. Extensive Monte Carlo simulations in synthetic instances show that this proposal provides faster convergence rate, less computational complexity and better statistical performance than alternative algorithms for the ANLP, such as grouping genetic algorithms, specially when the size of the scenario increases. We also include practical results for the application of GHS to a real wireless network deployment problem in Bizkaia, northern Spain.Item A survey on applications of the harmony search algorithm(2013-09) Manjarres, D.; Landa-Torres, I.; Gil-Lopez, S.; Del Ser, J.; Bilbao, M. N.; Salcedo-Sanz, S.; Geem, Z. W.; IA; Tecnalia Research & InnovationThis paper thoroughly reviews and analyzes the main characteristics and application portfolio of the so-called Harmony Search algorithm, a meta-heuristic approach that has been shown to achieve excellent results in a wide range of optimization problems. As evidenced by a number of studies, this algorithm features several innovative aspects in its operational procedure that foster its utilization in diverse fields such as construction, engineering, robotics, telecommunications, health and energy. This manuscript will go through the most recent literature on the application of Harmony Search to the aforementioned disciplines towards a three-fold goal: (1) to underline the good behavior of this modern meta-heuristic based on the upsurge of related contributions reported to date; (2) to set a bibliographic basis for future research trends focused on its applicability to other areas; (3) to provide an insightful analysis of future research lines gravitating on this meta-heuristic solver.