Terminal assignment in a communications network using genetic algorithms
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Applications of genetic algorithms to optimal multilevel design of MPLS-based networks
Computer Communications
A hybrid grouping genetic algorithm for the registration area planning problem
Computer Communications
Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network
Expert Systems with Applications: An International Journal
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
A new grouping genetic algorithm approach to the multiple traveling salesperson problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Optimal switch location in mobile communication networks using hybrid genetic algorithms
Applied Soft Computing
A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups
Expert Systems with Applications: An International Journal
A grouping genetic algorithm for the microcell sectorization problem
Engineering Applications of Artificial Intelligence
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
One-way urban traffic reconfiguration using a multi-objective harmony search approach
Expert Systems with Applications: An International Journal
Survey A survey on applications of the harmony search algorithm
Engineering Applications of Artificial Intelligence
| Hi-index | 12.05 |
In 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.