A new genetic algorithm for the optimal communication spanning tree problem

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

Volumn 1829, Issue , 2000, Pages 162-173

  Li, Yu ^a   Bouchebaba, Youcef ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; GENETIC ALGORITHMS; OPTIMIZATION; TREES (MATHEMATICS);

ENCODING AND DECODING; INITIAL POPULATION; LINEAR CHROMOSOME; NEW GENETIC ALGORITHMS; OPTIMAL COMMUNICATION; PRIM'S ALGORITHM; SPANNING TREE PROBLEMS; TRADITIONAL GENETIC ALGORITHMS;

ALGORITHMS;

EID: 23044521256     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/10721187_12     Document Type: Article

References (17)

1. Abuali F.N., Wainwright R.L., Schoenefeld D.A. 1995: Determinant factoriza- tion: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning trees problem. Proc. 6th Int. Conf. on Genetic Algorithms (ICGA'95), Uni-versity of Pittsburgh, USA, 470-477
2. Berry L., Mutagh B., Sugden S., McMahon G. 1995: Application of genetic-based algorithm for optimal design of tree-structured communication networks. In Proceedings of the Regional Teletra_c Engineering Conference of the International Teletra_c Congress, South Africa, 361-370
3. Crecenzi P., Kann V. 1998: A compendium of NP optimization problems. Avai-lable online at http://www.nada.kth.se/theory/compendium/, Aug. 1998
4. Esbensen H. 1995: Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm. Networks, vol. 26 (1995) 173-185
5. Gibbons A. 1985: Algorithmic graph theory. Cambridge University Press, New York
6. Goldberg D. E. 1989: Genetic algorithms in search, optimization and machine learning. Addison-Wesley (Reading, Mass)
7. Hu T. C. 1974: Optimum communication spanning trees. SIAM J. on Computing, 188-195
8. Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G. 1978: The complexity of the network design problem. Networks, vol. 8(1978) 279-285
9. Julstrom B.A. 1993: A genetic algorithm for the rectilinear steiner problem. Proc. 15th Int. Conf. on Genetic Algorithms, University of Illinois at Urbana-Champaign (S.Forrest, Ed.). Morgan Kaufmann, San Mateo, CA, (1993) 474-479
10. Kallel L., Schoenauer M. 1997: Alternative random initialization in genetic al-gorithms. in Proceedings of the Seventh International Conference on Genetic Algo-rithms, Morgan Kaufmann, 268-275
11. Palmer C. C. 1994: An approach to a problem in network design using gene-tic algorithms. PhD Thesis, Polytechnic University, Computer Science Department, Brookly, NewYork
12. Palmer C. C., Kershenbaum A. 1995: An approach to a problem in network design using genetic algorithms. Networks, vol. 26 (1995) 151-163
13. Peleg D., Reshef E. Deterministic polylog approximation for minimum commu-nication spanning trees. Proc. 25th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1443, Springer-Verlag, 670-679
14. Radcliffe N.J., Surry P. D. 1995: Fundamental limitation on search algorithms: Evolutionary computing in perspective. In “Computing Science Today: Recent Trends and Developments", Lecture Notes in Computer Science, Volume 1000, page 275-291, (Ed: Jan van Leeuwen, Springer-Verlag)
15. Sinclair M.C. 1998: Minimum cost routing and wave-length allocation using a genetic-algorithm/heuristic hybrid approach. Proc. 6th IEE Conf. on Telecommuni-cations, Edinburgh, UK, 66-71
16. Surry P. D., Radcliffe N.J. 1996: Inoculation to initialise evolutionary search. In “Evolutionary Computing: AISB Workshop", (Ed: T. Fogarty, Springer-Verlag)
17. Wolpert D. H., Macready W. G. 1995: No free lunch theorems for search. Tech-nical Report SFI-TR-95-02-010, Santa Fe Institute