Evolutionary local search for the super-peer selection problem and the p-Hub Median Problem

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

Volumn 4771 LNCS, Issue , 2007, Pages 1-15

  Wolf, Steffen ^a   Merz, Peter ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; TELECOMMUNICATION LINKS;

COMMUNICATION COST; UNCAPACITATED SINGLE ASSIGNMENT P-HUB MEDIAN PROBLEM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38149120430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (22)

1. Merz, P., Freisleben, B.: Fitness Landscapes and Memetic Algorithm Design. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 245-260. McGraw-Hill, London (1999)
2. Merz, P.: Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany (2000)
3. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, San Francisco (2004)
4. Merz, P., Fischer, T.: A Memetic Algorithm for Large Traveling Salesman Problem Instances. In: MIC 2007. 7th Metaheuristics International Conference (2007)
5. Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering, pp. 49-62 (2003)
6. Li, D., Xiao, N., Lu, X.: Topology and resource discovery in Peer-to-Peer overlay networks. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds.) GCC 2004. LNCS, vol. 3252, pp. 221-228. Springer, Heidelberg (2004)
7. O'Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 32, 393-404 (1987)
8. O'Kelly, M.E., Skorin-Kapov, D., Skorin-Kapov, J.: Lower bounds for the hub location problem. Management Science 41(4), 713-721 (1995)
9. Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 4(3), 139-154 (1996)
10. Ebery, J.: Solving large single allocation p-hub problems with two or three hubs. European Journal of Operational Research 128(2), 447-458 (2001)
11. Skorin-Kapov, D., Skorin-Kapov, J.: On tabu search for the location of interacting hub facilities. European Journal of Operational Research 73, 502-509 (1994)
12. Domínguez, E., Muñoz, J., Mérida, E.: A recurrent neural network model for the p-hub problem. In: Mira, J.M., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2687, pp. 734-741. Springer, Heidelberg (2003)
13. Pérez, M.P., Rodríguez, F.A., Moreno-Vega, J.M.: A hybrid VNS-path relinking for the p-hub median problem. IMA Journal of Management Mathematics, Oxford University Press (2007)
14. Pérez, M.P., Rodríguez, F.A., Moreno-Vega, J.M.: On the use of path relinking for the p-hub median problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 155-164. Springer, Heidelberg (2004)
15. Kratica, J., Stanimirović, Z., Tošić, D., Filipović, V.: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research 182(1), 15-28 (2007)
16. Wolf, S.: On the complexity of the uncapacitated single allocation p-hub median problem with equal weights. Internal Report 363/07, University of Kaiserslautern, Kaiserslautern, Germany (2007), available at http://dag.informatik.uni-kl.de/papers/Wolf2007SPSP-NP.pdf
17. Ernst, A.T., Krishnamoorthy, M.: An exact solution approach based on shortest-paths for p-hub median problems. INFORMS Journal on Computing 10(2), 149-162 (1998)
18. Lourenço, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321-353 (2002)
19. Bentley, J.L.: Experiments on traveling salesman heuristics. In: SODA 1990. Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 91-99. ACM Press, New York (1990)
20. Banerjee, S., Griffin, T.G., Pias, M.: The Interdomain Connectivity of PlanetLab Nodes. In: Barakat, C., Pratt, I. (eds.) Proc. of the 5th International Workshop on Passive and Active Network Measurement (2004)
21. O'Kelly, M.E., Bryan, D.L., Skorin-Kapov, D., Skorin-Kapov, J.: Hub network design with single and multiple allocation: A computational study. Location Science 4(3), 125-138 (1996)
22. ILOG S.A.: ILOG CPLEX User's Manual, Gentilly, France, and Mountain View, California (2006), http://www.cplex.com/