Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pierre, S., Elgibaoui, A.: Improving Communications Networks’ Topologies using Tabu Search. In: 22nd Annual Conference on Local Computer Networks (LCN), pp. 44–53 (1997)
Calegari, P., Guidec, F., Kuonen, P., Wagner, D.: Genetic Approach to Radio Network Optimization for Mobile Systems. In: IEEE Vehicular Technology Conference, vol. (2), pp. 755–759 (1997)
Alonso-Garrido, O., Salcedo-Sanz, S., Agustin-Blas, L.E., Ortiz-Garcia, E.G., Perez-Bellido, A.M., Portilla-Figueras, J.A.: A Hybrid Grouping Genetic Algorithm for the Multiple-Type Access Node Location Problem. In: Corchado, E., Yin, H. (eds.) IDEAL 2009. LNCS, vol. 5788, pp. 376–383. Springer, Heidelberg (2009)
Ceselli, A.: Two Exact Algorithms for the Capacitated P-Median Problem. 4OR: A Quarterly Journal of Operations Research 1(4), 319–340 (2003)
Ceselli, A., Righini, G.: A Branch-and-Price Algorithm for the Capacitated P-Median Problem. Networks 45(3), 125–142 (2005)
Ceselli, A., Liberatore, F., Righini, G.: A Computational Evaluation of a General Branch-and-Price Framework for Capacitated Network Location Problems. Annals of Operations Research 167, 209–251 (2009)
Osman, I., Christofides, N.: Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search. International Transactions on Operational Research 1(3), 317–336 (1994)
Maniezzo, V., Mingozzi, A., Baldacci, R.: A Bionomic Approach to the Capacitated P-Median Problem. Journal of Heuristics 4, 263–280 (1998)
Baldacci, R., Hadjiconstantinou, E., Maniezzo, V., Mingozzi, A.: A New Method for Solving Capacitated Location Problems based on a Set Partitioning Approach. Computers & Operations Research 29(4), 365–386 (2002)
Lorena, L.A.N., Furtado, J.C.: Constructive Genetic Algorithm for Clustering Problems. Evolutionary Computation 9(3), 309–327 (2001)
Lorena, L.A.N., Senne, E.: A Column Generation Approach to Capacitated P-Median Problems. Computers & Operations Research 31(6), 863–876 (2004)
Scheuerer, S., Wendolsky, R.: A Scatter Search Heuristic for the Capacitated Clustering Problem. European Journal of Operational Research 169(2), 533–547 (2006)
Diaz, J.A., Fernandez, E.: Hybrid Scatter Search and Path Relinking for the Capacitated P-Median Problem. European Journal of Operational Research 169(2), 570–585 (2006)
Osman, I., Ahmadi, S.: Guided Construction Search Metaheuristics for the Capacitated P-Median Problem with Single Source Constraint. Journal of the Operational Research Society 18, 339–348 (2006)
Santos-Correa, E., Steiner, M.T., Freitas, A.A., Carnieri, C.: A Genetic Algorithm for Solving a Capacitated P-Median Problem. Numerical Algorithms 35(4), 373–388 (2004)
Salcedo-Sanz, S., Yao, X.: A Hybrid Hopfield Network-Genetic Algorithm Approach for the Terminal Assignment Problem. IEEE Transactions on Systems, Man, and Cybernetics, PartB: Cybernetics 34(6), 2343–2353 (2004)
Gil-Lopez, S., Del Ser, J., Landa-Torres, I., Garcia-Padrones, L., Salcedo-Sanz, S., Portilla-Figueras, J.A.: On the Application of a Novel Grouping Harmony Search Algorithm to the Switch Location Problem. In: Chatzimisios, P., Verikoukis, C., SantamarÃa, I., Laddomada, M., Hoffmann, O. (eds.) MOBILIGHT 2010. LNICS, vol. 45, pp. 662–672. Springer, Heidelberg (2010)
Revelle, C., Swain, R.: Central Facilities Location. Geographical Analysis 2, 30–42 (1970)
Falkernauer, E.: The Grouping Genetic Algorithms-Widening the Scope of the GAs. Belgian Journal of Operations Research, Statistics and Computer Science 33, 79–102 (1993)
Falkenauer, E.: A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems. Evolutionary Computation, 123–144 (1994)
Abuali, F.N., Schoenefeld, D.A., Wainwrigght, R.L.: Terminal Assignment in a Communications Network using Genetic Algorithm. In: 22nd Annual ACM Computer Science Conference, pp. 74–81 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gil-Lopez, S., Landa-Torres, I., Del Ser, J., Salcedo-Sanz, S., Manjarres, D., Portilla-Figueras, J.A. (2011). A Novel Grouping Heuristic Algorithm for the Switch Location Problem Based on a Hybrid Dual Harmony Search Technique. In: Cabestany, J., Rojas, I., Joya, G. (eds) Advances in Computational Intelligence. IWANN 2011. Lecture Notes in Computer Science, vol 6691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21501-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-21501-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21500-1
Online ISBN: 978-3-642-21501-8
eBook Packages: Computer ScienceComputer Science (R0)