A Grid Enabled Parallel Hybrid Genetic Algorithm for SPN

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

Volumn 3036, Issue , 2004, Pages 156-163

  Presti, Giuseppe Lo ^a,b   Re, Giuseppe Lo ^a,b   Storniolo, Pietro ^a,b   Urso, Alfonso ^a,b  

^a UNIVERSITY OF PALERMO   (Italy)

^b ICAR CNR   (Italy)

Author keywords

Grid computing; Parallel genetic algorithm; Steiner problem

Indexed keywords

ALGORITHMS; GRID COMPUTING; HEURISTIC METHODS; LOCAL SEARCH (OPTIMIZATION);

GENETICALLY MODIFIED ORGANISMS; GLOBAL SEARCH CAPABILITY; MULTICAST TRANSMISSIONS; PARALLEL GENETIC ALGORITHMS; PARALLEL HYBRID-GENETIC ALGORITHMS; PARALLEL IMPLEMENTATIONS; PRACTICAL ENGINEERING APPLICATIONS; STEINER PROBLEMS;

GENETIC ALGORITHMS;

EID: 35048829309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24685-5_20     Document Type: Article

References (19)

1. J. Kruskal, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Amer. Math. Soc., Vol. 7, pp. 48-50, 1956.
2. R. M. Karp, Reducibility among Combinatorial Problems, in R. E. Miller, J. W. Thatcher, Complexity of Computer Computations, Plenum Press, New York, pp.85-103, 1972.
3. H. Takahashi, A Matsuyama, An approximate solution for the Steiner problem in graphs,Math. Japan, 1980, pp. 573-577.
4. V. J. Rayward-Smith, The computation of nearly minimal Steiner trees in graphs, Int. Math. Ed. Sci. Tech. 14, 1983, pp. 15-23.
5. P. Winter, Steiner problem in networks: a survey, Networks, 17, 1987, pp. 129-167.
6. D.E. Goldberg, Genetic algorithm in Search, Optimization, and Machine Learning, Reading Ma: Addison Wesley 1989.
7. K. A. Dowsland, Hill-climbing, Simulated Annealing and the Steiner Problem in Graphs, Engineering Optimisation, 17, 1991, pp. 91-107.
8. E. Cantu-Paz, A summary of research on parallel genetic algorithms, Illinois GALab, Univ. Illinois Urbana-Champaign, Urbana, IL, Tech. Rep. 950076, July 1995.
9. H. Esbensen Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm,Networks: An International Journal 26, 1995.
10. M. Gendreau, J. F. Larochelle, B. Sanso A Tabu Search Heuristic for the Steiner Tree Problem Networks 34: 1627172, 1999 1999 John Wiley & Sons, Inc.
11. G. Di Fatta, G. Lo Re, Efficient tree construction for the multicast problem, Special issue of the Journal of the Brazilian Telecommunications Society, 1999.
12. R. Govindan, H. Tangmunarunkit, Heuristics for Internet Map Discovery, Proc IEEE Infocom 2000, Tel Aviv, Israel, www.isi.edu/scan/mercator/mercator. html.
13. S. Voss, A. Martin, T. Koch, SteinLib Testdata Library, February 2001, elib.zib.de/steinlib/steinlib.php.
14. A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE Topology Generator, April 2001 cs-pub.bu.edu/brite.
15. G.Folino, C. Pizzuti, G. Spezzano, Parallel Hybrid Method for SAT That Couples Genetic Algorithms and Local Search, IEEE Transactions on Evolutionary Computation, Vol. 5, No. 4, pp. 323-334, August 2001.
16. N. Karonis, B. Toonen, I. Foster, MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface, Journal of Parallel and Distributed Computing (JPDC), Vol. 63, No. 5, pp. 551-563, May 2003.
17. G. Di Fatta, G. Lo Presti, G. Lo Re, A Parallel Genetic Algorithm for the Steiner Problem in Networks, Proc. of the 15th IASTED Int. Conference on Parallel and Distributed Computing and Systems,Marina del Rey (CA), USA, November 2003.
18. GAlib: a C++ Library of Genetic Algorithm Components, http://lancet.mit.edu/ga/.
19. T. Sandholm, J. Gawor, Globus Toolkit 3 Core - A Grid Service Container Framework, http://www-unix.globus.org/toolkit/3.0/ogsa/docs/gt3core.pdf.