Two Hybrid Genetic Algorithms for Solving the Super-Peer Selection Problem

The problem that we will address here is the Super-Peer Selection Problem (SPSP). Two hybrid genetic algorithm (HGA) approaches are proposed for solving this NP-hard problem. The new encoding schemes are implemented with appropriate objective functions. Both approaches keep the feasibility of individuals by using specific representation and modified genetic operators. The numerical experiments were carried out on the standard data set known from the literature. The results of this test show that in 6 out of 12 cases HGAs outreached best known solutions so far, and that our methods are competitive with other heuristics.

[1]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[2]  S. Wolf.  On the Complexity of the Uncapacitated Single Allocation p-Hub Median Problem with Equal Weights , 2007 .

[3]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[4]  Vladimir Filipovic,et al.  Fine-grained Tournament Selection Operator in Genetic Algorithms , 2003, Comput. Artif. Intell..

[5]  Zorica Stanimirovic,et al.  A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem , 2012, Comput. Informatics.

[6]  Yi Pan,et al.  Grid and Cooperative Computing - GCC 2004 Workshops , 2004, Lecture Notes in Computer Science.

[7]  Jozef Kratica,et al.  Improving Performances of the Genetic Algorithm by Caching , 1999, Comput. Artif. Intell..

[8]  Jozef Kratica,et al.  Solving the uncapacitated Multiple Allocation P-Hub Center Problem by Genetic Algorithm , 2006, Asia Pac. J. Oper. Res..

[9]  Bernd Freisleben,et al.  Fitness landscapes and memetic algorithm design , 1999 .

[10]  Nong Xiao,et al.  Topology and Resource Discovery in Peer-to-Peer Overlay Networks , 2004, GCC Workshops.

[11]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[12]  Suman Banerjee,et al.  The Interdomain Connectivity of PlanetLab Nodes , 2004, PAM.

[13]  Steffen Wolf,et al.  Evolutionary Local Search for the Super-Peer Selection Problem and the p -Hub Median Problem , 2007, Hybrid Metaheuristics.

[14]  Peter Merz,et al.  Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies , 2006 .

[15]  M. Maric.  An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem , 2010, Comput. Informatics.

[16]  J. Kratica,et al.  Two genetic algorithms for solving the uncapacitated single allocation p , 2007, Eur. J. Oper. Res..