.png){kind=icon}
Return
A novel grouping harmony search algorithm for the multiple-type access node location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.11.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Harmony search algorithm
Access node location problem
Grouping-based encoding
Grouping genetic algorithms
Hybrid algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
A new grouping genetic algorithm approach to the multiple traveling salesperson problem.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more