A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 30, Issue 3, 2000, Pages 461-470

  Lo, Chi Chun ^a,b   Chang, Wei Hsin ^a,b  

^a IEEE   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithms; Minimal spanning tree; Multiobjective function; Nondominated solution; Subpopulation

Indexed keywords

CAPACITATED MULTIPOINT NETWORK DESIGN PROBLEM; MINIMAL SPANNING TREE; MULTIOBJECTIVE FUNCTION; NONDOMINATED SOLUTION; SUBPOPULATION;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; OPTIMIZATION; POPULATION STATISTICS; RANDOM PROCESSES; SAMPLING; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS); VECTORS;

GENETIC ALGORITHMS;

EID: 0033707511     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.846234     Document Type: Article

References (36)

1. F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld, "Determinant factorization: A new encoding scheme for spanning tree applied to the probability minimum spanning tree problem," in Proc. 6th ICGA, 1995, pp. 470-477.
2. J. Baker, "Adaptive selection methods for genetic algorithms," in Proc. 2nd ICGA, 1987, pp. 100-111.
3. R. R. Boorstyn and H. Frank, "Large scale network topological optimization," IEEE Trans. Commun., vol. COM-25, pp. 29-47, Jan. 1977.
4. A. Cayley, "A theorem on tree," Quart. J. Math., vol. 23, pp. 376-378, 1889.
5. L. W. Clarke and G. Anandalingam, "An integrated system for designing minimum cost survivable telecommunications networks," IEEE Trans. Syst., Man, Cybern. A, vol. 26, pp. 856-862, Nov. 1996.
6. Handbook of Genetic Algorithms, L. Davis, Ed., Van Reinhold, New York, 1991, pp. 124-143.
7. L. Davis, Genetic Algorithms and Simulated Annealing. Los Altos, CA: Morgan Kaufmann, 1987. Research Notes in Artificial Intelligence.
8. _, "A genetic algorithm for survivable network design," in Proc. 5th ICGA, 1993, pp. 408-415.
9. K. A. De Jong, "An Analysis of the Behavior of a Class of Genetic Adaptive Systems," Ph.D. dissertation, Univ. Michigan, Ann Arbor, 1975.
10. R. Elbaum and M. Sidi, "Topological design of local-area networks using genetic algorithms," IEEE/ACM Trans. Networking, vol. 4, no. 5, pp. 766-778, Oct. 1996.
11. C. Ersoy and S. S. Panwar, "Topological design of interconnected LAN/WAN networks," IEEE J. Select. Areas Commun., vol. 11, pp. 1172-1182, Oct. 1993.
12. C. M. Fonseca and P. J. Fleming, "Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization," in Proc. 5th ICGA, 1993, pp. 416-423.
13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
14. B. Gavish, "Topological design of telecommunication networks-local access design methods," Ann. Oper. Res., vol. 33, pp. 17-71, 1991.
15. M. Gen and R. Cheng, Genetic Algorithms & Engineering Design. New York: Wiley, 1997.
16. M. Gerla and L. Kleinrock, "On the topological design of distributed computer networks," IEEE Trans. Commun., vol. COM-25, pp. 48-60, Jan. 1977.
17. A. Gibbons, Algorithmic Graph Theory. Cambridge, U.K.: Cambridge Univ., 1985.
18. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
19. J. J. Grenfenstette, "Optimized control of parameters for genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. SMC-16, pp. 122-128, 1986.
20. _, "Incorporation problem specific knowledge into genetic algorithms," in Genetic Algorithms and Simulated Annealing, L. Davis, Ed. Los Altos, CA: Morgan Kaufmann, 1987.
21. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Michgan Press, 1992. Reprint by MIT Press, Cambridge, MA.
22. J. Horn, N. Nafpliotis, and D. E. Goldberg, "A niched pareto genetic algorithm for multiobjective optimization," in Proc. 1st ICEC, 1994, pp. 82-87.
23. T. C. Hu, "Optimum communication spanning trees," SIAM J. Comput., no. 3, pp. 188-195, 1994.
24. H. Ishibuchi and T. Murata, "Multi-objective genetic local search algorithm," in Proc. 3rd ICEC, 1996, pp. 119-124.
25. B. A. Julstrom, "A genetic algorithm for rectilinear Steiner problem," in Proc. 5th ICGA, 1993, pp. 474-479.
26. A. Kershenbaum, Telecommunication Network Design Algorithms. New York: McGraw-Hill, 1993, pp. 225-236.
27. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Programs. New York: Springer-Verlag, 1996.
28. B. M. E. Moret and H. D. Shapiro, Algorithms from P to NP: Design and Efficiency. San Francisco, CA: Benjamin/Cummings, 1991, vol. I, pp. 254-292.
29. T. Murata and H. Ishibuchi, "MOGA: Multi-objective genetic algorithms," in Proc. 2nd ICEC, 1995, pp. 289-294.
30. C. C. Palmer and A. Kershenbaum, "An approach to a problem in network design using genetic algorithms," Networks, vol. 26, pp. 151-163, 1995.
31. R. C. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, 1957.
32. H. Prüfer, "Neuer bewis eines Satzes über Permutationnen," Arch. Math. Phys., vol. 27, pp. 742-744, 1918.
33. J. D. Schaffer, "Multiple objective optimization with vector evaluated genetic algorithms," in Proc. 1st ICGA, 1985, pp. 93-100.
34. J. D. Schaffer, R. A. Carunam, L. J. Eshelman, and R. Das, "A study of control parameters affecting online performance of genetic algorithms for function optimization," in Proc. 3rd ICGA, J. D. Schaffer, Ed., 1989, pp. 51-60.
35. H. Tamaki, H. Kita, and S. Kobayahi, "Multi-objective optimization by genetic algoritms: A review," in Proc. 3rd ICEC, 1996, pp. 517-522.
36. J. J. Buckly and Y. Hayashi, "Fuzzy genetic algorithm and applications," Fuzzy Sets and Systems, vol. 61, pp. 129-136, 1994.