GA-based optimal network design: A state-of-the-art survey

Intelligent Engineering Systems Through Artificial Neural Networks

Volumn 1998, Issue , 1998, Pages 247-252

  Gen, Mitsuo ^a   Kim, Jongryul ^a  

^a ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER NETWORKS; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

COMBINATORIAL OPTIMIZATION; MULTIOBJECTIVE OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 0032291746     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Review

References (24)

1. Gen, M. and R. Cheng, (1997) Genetic Algorithms and Engineering Design, John & Wiley Sons, New York.
2. Zhou, G. and M. Gen, (1997). Evolutionary Computation on Multicriteria Production Process Planning Problem, Proc. of 1997 IEEE Inter. Conf. on Evol. Comp., pp.419-424.
3. Zhou, G. and M. Gen, (1998). A Genetic Algorithm Approach on Multi-stage Process Planning Problems, in H.R. Parsaei and J. M. Usher eds., Computer-Aided Process and Assembly Planning: Methods, Tools, and Technology, Chapter 5, Gordon & Breach Pub.
4. Zhou, G. and M. Gen, (1997). Approach to Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm, Engineering Design and Automation, Vol.3, No.2, pp.157-165.
5. Zhou, G. and M. Gen, (1997). A Note on Genetic Algorithm Approach to the Degree-Constrained Spanning Tree Problems, Networks, Vol.30, pp.105-109.
6. Zhou, G. and M. Gen, (1998). Genetic Algorithm Approach on Multicriteria Minimum Spanning Tree Problem, European Journal of Operational Research, in the forthcoming issue.
7. Gen, M., G. Zhou, and M. Takayama, (1998). A Comparative Study on Tree Encodings on Spanning Tree Problems, Proc. of 1998 IEEE Inter. Conf. on Evoi Comp., pp.33-38.
8. Zhou, G. and M. Gen, (1997). A Centralized Network Design Problem with Genetic Algorithm Approach, in X. Yao, M. Gen, Y. Tujimura, and R. J. Mckey eds., Proc. of the Australia-Japan Joint Workshop on Intelligent and Evolutionary Systems, pp.35-45.
9. Zhou, G. and M. Gen, (1998). A New Tree Encoding for the Degree-Constrained Minimum Spanning Tree Problem, Soft Computing, in the forthcoming issue.
10. Li, Y. and M. Gen, (1998). Spanning Tree-based Genetic Algorithm for Solving Bicriteria Transportation Problem, J. of Japan Society for Fuzzy Theory and Systems, Vol.10, No.5 (to be published).
11. Gen, M. and Y. Li, (1998). Hybrid Genetic Algorithm for Transportation Problems in Logistics, Inter. J. of Logistics: Research & Applications, in forthcoming issue (invited paper).
12. Li, Y. and M. Gen, (1997). Spanning Tree-based Genetic Algorithm for Bicriteria Transportation Problem with Fuzzy Coefficients, Australian J. of Intelligent Inform. Processing Systems, Vol.4, No.3/4, pp.220-229.
13. Gen, M. and Y. Li, (1998). Solving Multiobjective Transportation Problem by Spanning Tree-based Genetic Algorithm, in I. Parmee ed., Adaptive Computing in Design and Manufacture, pp.98-108, Springer-Verlag.
14. Kim, J. R., M. Gen, and K. Ida, (1998). Bicriteria Network Design using Spanning Tree-based Genetic Algorithm, Artificial Life and Robotics, Vol.3 (to be published).
15. Gen, M., K. Ida, and J. R. Kim, (1998). A Spanning Tree-based Genetic Algorithm for Bicriteria Topological Network Design, Proc. of 1998 IEEE Inter. Conf. on Evol. Camp., pp.15-20.
16. Kim, J. R., M. Gen, and K. Ida, (1998). A GA for Bicriteria LAN Topology Design Problem, Proc of 2nd Inter. Conf. on Engineering Design and Automation, Aug. 9-12, Maui, Hawaii.
17. Awadh, B., N. Sepehri, and O. Hawaleshka, (1995). A Computer-aided Process Planning Model based on Genetic Algorithms, Computers & Operations Research, Vol.22, No.8, pp.841-856.
18. Narula, S. C. and Ho, C. A., (1980). Degree-constrained Minimum Spanning Tree, Computers & Operations Research, Vol.7, pp.239-249.
19. Papadimitriou, C. H., (1978). The Complexity of the Capacitated Tree Problem, Networks, Vol.8, pp.217-230.
20. Gavish, B., (1982). Topological Design of Centralized Computer Networks-Formulation and Algorithms, Networks, Vol.12, pp.355-377.
21. Gouveia, L., (1995). A 2n Constraint Formulation for the Capacitated Spanning Tree Problem, Operations Research, Vol.43, No.1, pp.130-141.
22. Hall, L., (1996). Experience with a Cutting Plane Algorithm for the Capacitated Minimal Spanning Tree Problem, INFORMS Journal on Computing, Vol.8, No.3, pp.219-234.
23. Malik, K. and G. Yu, (1993). A Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem, Nétworks, Vol.23, pp.525-532.
24. Bertsekas. D. and R. Gallager, (1992)., Data Networks, 2nd ed., Prentice-Hall, New Jersey.