A novel grouping heuristic algorithm for the switch location problem based on a hybrid dual harmony search technique

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6691 LNCS, Issue PART 1, 2011, Pages 17-24

  Gil Lopez, Sergio ^a   Landa Torres, Itziar ^a   Del Ser, Javier ^a   Salcedo Sanz, Sancho ^b   Manjarres, Diana ^a   Portilla Figueras, Jose A ^b  

^a TECNALIA RESEARCH AND INNOVATION   (Spain)

^b UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

Genetic Algorithm; grouping encoding; Harmony Search; Switch Location Problem

Indexed keywords

CANDIDATE SOLUTION; CAPACITY CONSTRAINTS; DUAL ALGORITHM; EVOLUTIONARY APPROACH; EXTENSIVE SIMULATIONS; GROUPING ENCODING; HARMONY SEARCH; ITERATIVE APPROACH; LOCAL SEARCH; MINIMUM VALUE; REPAIR METHODS; STANDARD DEVIATION; STATISTICAL STABILITY; SWITCH LOCATION PROBLEM;

COMPUTER SIMULATION; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; NEURAL NETWORKS; GENETIC ALGORITHMS; HEURISTIC METHODS; LOCAL SEARCH (OPTIMIZATION); LOCATION; REPAIR;

HEURISTIC METHODS; ITERATIVE METHODS;

EID: 79957931984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21501-8_3     Document Type: Conference Paper

References (21)

1. Pierre, S., Elgibaoui, A.: Improving Communications Networks' Topologies using Tabu Search. In: 22nd Annual Conference on Local Computer Networks (LCN), pp. 44-53 (1997)
2. 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)
3. 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)
4. Ceselli, A.: Two Exact Algorithms for the Capacitated P-Median Problem. 4OR: A Quarterly Journal of Operations Research 1(4), 319-340 (2003)
5. Ceselli, A., Righini, G.: A Branch-and-Price Algorithm for the Capacitated P-Median Problem. Networks 45(3), 125-142 (2005)
6. 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)
7. Osman, I., Christofides, N.: Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search. International Transactions on Operational Research 1(3), 317-336 (1994)
8. Maniezzo, V., Mingozzi, A., Baldacci, R.: A Bionomic Approach to the Capacitated P-Median Problem. Journal of Heuristics 4, 263-280 (1998)
9. 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)
10. Lorena, L.A.N., Furtado, J.C.: Constructive Genetic Algorithm for Clustering Problems. Evolutionary Computation 9(3), 309-327 (2001)
11. Lorena, L.A.N., Senne, E.: A Column Generation Approach to Capacitated P-Median Problems. Computers & Operations Research 31(6), 863-876 (2004)
12. Scheuerer, S., Wendolsky, R.: A Scatter Search Heuristic for the Capacitated Clustering Problem. European Journal of Operational Research 169(2), 533-547 (2006)
13. 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)
14. 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)
15. 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)
16. 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)
17. 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)
18. Revelle, C., Swain, R.: Central Facilities Location. Geographical Analysis 2, 30-42 (1970)
19. 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)
20. Falkenauer, E.: A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems. Evolutionary Computation, 123-144 (1994)
21. 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)