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
A Bionomic Approach to the Capacitated p-Median Problem
Journal of Heuristics
Improving communication network topologies using tabu search
LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
A column generation approach to capacitated p-median problems
Computers and Operations Research
Constructive Genetic Algorithm for Clustering Problems
Evolutionary Computation
A new representation and operators for genetic algorithms applied to grouping problems
Evolutionary Computation
A hybrid grouping genetic algorithm for the multiple-type access node location problem
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Survey A survey on applications of the harmony search algorithm
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
This manuscript proposes a novel iterative approach for the so-called Switch Location Problem (SLP) based on the hybridization of a group-encoded Harmony Search combinatorial heuristic (GHS) with local search and repair methods. Our contribution over other avantgarde techniques lies on the dual application of the GHS operators over both the assignment and the grouping parts of the encoded solutions. Furthermore, the aforementioned local search and repair procedures account for the compliancy of the iteratively refined candidate solutions with respect to the capacity constraints imposed in the SLP problem. Extensive simulation results done for a wide range of network instances verify that statistically our proposed dual algorithm outperforms all existing evolutionary approaches in the literature for the specific SLP problem at hand. Furthermore, it is shown that by properly selecting different yet optimized values for the operational GHS parameters to the two parts comprising the group-encoded solutions, the algorithm can trade statistical stability (i.e. lower standard deviation of the metric) for accuracy (i.e. lower minimum value of the metric) in the set of performed simulations.