A genetic algorithm for the multiple destination routing problems

IEEE Transactions on Evolutionary Computation

Volumn 2, Issue 4, 1998, Pages 150-161

  Leung, Yee ^a   Li, Guo ^b   Xu, Zong Ben ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Genetic algorithms; Minimal spanning tree; Multiple destination routing problem; NP hard problem; Steiner tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

MINIMAL SPANNING TREES; MULTIPLE DESTINATION ROUTING PROBLEMS; STEINER TREE;

GENETIC ALGORITHMS;

EID: 0032208708     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.738982     Document Type: Article

References (30)

1. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-103.
2. V. Priwan, H. Aida, and T. Saito, "The multicast tree based routing for the complete broadcast multipoint-to-multipoint communications," 1E1CE Trans. Commun., vol. E78-B, no. 5, pp. 720-728, 1995.
3. Y. Tanaka and P. C. Huang, "Multiple destination routing algorithms," 1E1CE Trans. Commun., vol. E76-B, no. 5, pp. 544-552, 1993.
4. K. J. Lee, A. Gersht, and A. Friedman, "Multiple connection routing," Int. J. Digital Analog Commun. Syst., vol. 3, pp. 177-186, 1990.
5. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286-292, 1993.
6. X. F. Jiang, "Routing broadband multicast streams," Comput. Commun., vol. 15, no. 1, pp. 45-51, 1992.
7. D. C. Verma and P. M. Gopal, "Routing reserved bandwidth multi-point connections," Comput. Commun. Rev., vol. 23, no. 4, pp. 96-105, 1993.
8. X. L. Lin and L. M. Ni, "Multicast communication in multicomputer networks," IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 1105-1117, Nov. 1993.
9. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1617-1622, 1988.
10. M. Imase and B. M. Waxman, "Dynamic Steiner tree problem," SIAM J. Discr. Math., vol. 4, no. 3, pp. 369-384, 1991.
11. C. Schiemangk, "Thermodynamically motivated simulation for solving the Steiner tree problem and the optimization of interacting path systems," in Optimization of Connection Structures in Graphs, CICIP, A. Iwainsky, Ed. East Berlin, Germany: GRD, pp. 74-90, 1985.
12. K. A. Downsland, "Hill-climbing, simulated annealing and the Steiner problem in graphs," Eng. Optim., vol. 17, pp. 91-107, 1991.
13. A. Kapsalis, V. J. Rayward-Smith, and G. D. Smith, "Solving the graphical Steiner tree problem using genetic algorithms," J. Opl. Res. Soc.. vol. 44, no. 4, pp. 39706, 1993.
14. H. Esbensen, "Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm," Networks, vol. 26, pp. 173-185, 1995.
15. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, pp. 129-167, 1987.
16. S. Vo/J, "Steiner's problem in graphs: Heuristic methods," Discr. Applied Math., vol. 40, pp. 45-72, 1992.
17. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem. Amsterdam, the Netherlands: North-Holland, 1992.
18. V. J. Rayward-Smith and A. Clare, "On finding Steiner vertices," Networks, vol. 16, pp. 283-294, 1986.
19. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner tree," Acta Informatica, vol. 15, pp. 141-145, 1981.
20. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Michigan Press, 1975
21. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Ma-chine learning. Reading. MA: Addison Wesley, 1989.
22. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. New York: Springer-Verlag, 1996.
23. K. A. De Jong and W. M. Spears, "Using genetic algorithms to solve NP-complete problems," in Proc. 3rd Int. Conf. on Genetic Algorithms and Their Application, J. D. Schaffer, Ed. San Mateo, CA: Morgan Kaufmann, 1989, pp. 124-132.
24. H. Mühlenbein, "Parallel genetic algorithms, population genetics and combinatorial optimization," in Proc. 3rd Int. Conf. Genetic Algorithms and Their Application, J. D. Schaffer, Ed. San Mateo, CA: Morgan Kaufmann, 1989, pp. 416-421
25. S. H. Hou, A. Nirwan, and R. Hong, "A genetic algorithm for multi-processor scheduling," IEEE Trans. Parallel Distrib. Syst., vol. 5, pp. 113-120, Feb. 1994.
26. G. Rudolph, "Convergence properties of canonical genetic algorithms," IEEE Trans. Neural Networks, vol. 5, pp. 96-101, Jan. 1994.
27. R. E. Tarjan, Data Structures and Network Algorithms. Philadelphia, PA, 1988.
28. A. E. Eiben, E. H. L. Aarts, and K. M. Van Hee, "Global convergence of genetic algorithms: A Markov chain analysis," in Parallel Problem Solving from Nature, H.-P. Schwefel and R. Männer, Eds. Berlin and Heidelberg, Germany: Springer, 1991, pp. 4-12.
29. H.-P. Schwefel, Evolution and Optimum Seeking. New York: Wiley, 1995.
30. J. E. Beasley, "OR-library: Distributing test problems by electronic mail," J. Opl. Res. Soc., vol. 41, no. 11, pp. 1069-1072, 1990.