Genetic algorithm approach on multi-criteria minimum spanning tree problem

European Journal of Operational Research

Volumn 114, Issue 1, 1999, Pages 141-152

  Zhou, Gengui ^a   Gen, Mitsuo ^a  

^a ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Genetic algorithms; Minimum spanning tree; Multiple criteria decision making

Indexed keywords

DECISION MAKING; EFFICIENCY; NEURAL NETWORKS; NUMERICAL ANALYSIS; OPTIMIZATION;

MINIMUM SPANNING TREE; MULTIPLE CRITERIA DECISION MAKING;

GENETIC ALGORITHMS;

EID: 0033114897     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00016-2     Document Type: Article

References (26)

1. F.N. Abuali, R.L. Wainwright, D.A. Schoenefeld, Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem, in: L.J. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 1995, pp. 470-475.
2. T. Bäck, Selective pressure in evolutionary algorithms: A characterization of selection mechanisms, in: D. Fogel (Ed.), Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE Press, Florida, 1994, pp. 57-62.
3. Bertsimas D.J. The probabilistic minimum spanning tree problem. Networks. 20:1990;245-275.
4. Cayley A. A theorem on trees. Quarterly Journal of Mathematics. 23:1889;376-378.
5. V. Chankong, Y.Y. Haimes, Multiobjective Decision Making Theory and Methodology, North-Holland, New York, 1983.
6. Dijkstra E.W. A note on two problems in connection with graphs. Numerische Mathematik. 1:1959;269-271.
7. D. Fogel, Evolution Computation: Toward a New Philosophy of Machine Intelligence, IEEE Press, Piscataway, NJ, 1995.
8. C.M. Fonesca, P.J. Fleming, Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In: S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1993, pp. 42-50.
9. M. Gen, R. Cheng, Genetic Algorithms and Engineering Design, Wiley, New York, 1997.
10. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
11. C. Hwang, K. Yoon, Multiple Attribute Decision Making: Methods and Applications, Springer, Berlin, 1981.
12. Ishii H., Shiode H., Nishida T. Stochastic spanning tree problem. Discrete Applied Mathematics. 3:1981;263-273.
13. Kruskal J.B. Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. ACM. 7/1:1956;48-50.
14. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Program, 2nd ed. Springer, Berlin, 1994.
15. Narula S.C., Ho C.A. Degree-constrained minimum spanning tree. Computer & Operations Research. 7:1980;239-249.
16. Prim R.C. Shortest connection networks and some generalizations. Bell System Technical Journal. 36:1957;1389-1401.
17. Prüfer H. Neuer beweis eines satzes über permutationen. Arch. Math. Phys. 27:1918;742-744.
18. R. Reynolds, A. Nazzal, Using cultural algorithm with evolutionary computing to extract site location decisions from spatio-temporal databases, in: P.J. Angeline (Ed.), Lecture Notes in Computer Science: Evolutionary Programming VI, Springer, Berlin, 1997, pp. 443-456.
19. J.D. Schaffer, Some experiments in machine learning suing vector evaluated genetic algorithms, Ph.D. Dissertation (TCGA file No. 00314), Vanderbilt University, Nashville, TN (1984).
20. M. Sollin, Le trace de canalisation, in: C. Berge, A. Ghouilla-Houri (Eds.), Programming, Games, and Transportation Networks, Wiley, New York, 1965.
21. Srinivas N., Deb K. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation. 2/3:1995;221-248.
22. G. Syswerda, Uniform crossover in genetic algorithms, in: J. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1989, pp. 2-9.
23. W. Xu, On the quadratic minimum spanning tree problem, in: M. Gen, W. Xu (Eds.), Proceedings of 1995 Japan-China International Workshops on Information Systems, Ashikaga, Japan, 1995, pp. 141-148.
24. Zhou G., Gen M. Approach to the degree-constrained minimum spanning tree problem using genetic algorithms. Engineering Design and Automation. 3/2:1997;156-165.
25. Zhou G., Gen M. A note on genetic algorithm approach to the degree-constrained spanning tree problems. Networks. 30:1997;91-95.
26. Zhou G., Gen M. An effective genetic algorithm approach to the quadratic minimum spanning tree problem. Computer & Operations Research. 25/3:1998;229-237.