A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem

This work presents a hybrid transgenetic algorithm to solve the Prize Collecting Steiner Tree Problem, an NP-hard combinatorial optimization problem. The proposed approach is based upon endosymbiosis and other transformations of the biological intracellular flow. It is an evolutionary algorithm hybridized with a path-relinking procedure. The algorithm is described and its results are compared with the results of two other approaches proposed previously. The computational experiment shows that the proposed approach is very effective for this problem.

[1]  Rafael Lahoz-Beltra,et al.  An AM Radio Receiver Designed With a Genetic Algorithm Based on a Bacterial Conjugation Genetic Operator , 2008, IEEE Transactions on Evolutionary Computation.

[2]  Steven E Massey,et al.  Horizontal Transfer of Functional Nuclear Genes Between Multicellular Organisms , 2003, The Biological Bulletin.

[3]  Yeongho Kim,et al.  An Endosymbiotic Evolutionary Algorithm for Optimization , 2004, Applied Intelligence.

[4]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[5]  Alexandre Salles da Cunha,et al.  A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs , 2009, Discret. Appl. Math..

[6]  Petra Mutzel,et al.  Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.

[7]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[8]  Carlos Eduardo Ferreira,et al.  Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem , 2007, Inf. Process. Lett..

[9]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[10]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[11]  Yeongho Kim,et al.  An endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed-model U-lines , 2006, Eur. J. Oper. Res..

[12]  Kenneth Sörensen,et al.  Distance measures based on the edit distance for permutation-type representations , 2007, J. Heuristics.

[13]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[14]  W. Martin,et al.  Endosymbiotic gene transfer: organelle genomes forge eukaryotic chromosomes , 2004, Nature Reviews Genetics.

[15]  James A. Shapiro,et al.  Transposable elements as the key to a 21st century view of evolution , 2004, Genetica.

[16]  Marco César Goldbarg,et al.  Transgenética computacional: uma aplicação ao problema quadrático de alocação , 2002 .

[17]  Marco César Goldbarg,et al.  Transgenetic algorithm: a new evolutionary perspective for heuristics design , 2007, GECCO '07.

[18]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[19]  Hanif D. Sherali,et al.  The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches , 2008, Comput. Optim. Appl..

[20]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[21]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[22]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[23]  Lynn Margulis,et al.  Serial Endosymbiotic Theory (SET) and Composite Individuality , 2004 .

[24]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

[25]  Lynn Margulis,et al.  Symbiosis as a source of evolutionary innovation : speciation and morphogenesis , 1991 .

[26]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[27]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[28]  B. Bassler,et al.  Quorum sensing: cell-to-cell communication in bacteria. , 2005, Annual review of cell and developmental biology.

[29]  Matteo Fischetti,et al.  Solving the Prize-Collecting Steiner Tree Problem to Optimality , 2005, ALENEX/ANALCO.

[30]  Kim Fung Man,et al.  Multi-criteria design methodology of a dielectric resonator antenna with jumping genes evolutionary algorithm , 2008 .