Multiobjective EA approach for improved quality of solutions for spanning tree problem

Lecture Notes in Computer Science

Volumn 3410, Issue , 2005, Pages 811-825

  Kumar, Rajeev ^a   Singh, P K ^a   Chakrabarti, P P ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; PARETO PRINCIPLE;

MULTI-OBJECTIVE SPANNING TREE (MOST); PARETO-FRONT; RANDOMIZED GREEDY HEURISTICS (RGH);

TREES (MATHEMATICS);

EID: 24344508902     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31880-4_56     Document Type: Conference Paper

References (32)

1. Garey, M.R., Johnson, D.S.: Computers and Interactability: A Guide to the Theory of NP-Completeness. San Francisco, LA: Freeman (1979)
2. Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS (1997)
3. Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Bicriteria Network Design Problems. J. Algorithms 28 (1998) 142-171
4. Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Approximation Algorithms for Degree-Constrained Minimum-Cost Network Design Problems. Algorithmica 31 (2001) 58-78
5. Boldon, N., Deo, N., Kumar, N.: Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine. Parallel Computing 22 (1996) 369-382
6. Deo, N., Kumar, N.: Constrained Spanning Tree Problems: Approximate Methods and Parallel Computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Math Society 40 (1998) 191-217
7. Deo, N., Abdalla, A.: Computing a Diameter-ConstrainedMinimum Spanning Tree in Parallel. In: Proc. 4th Italian Conference on Algorithms and Complexity (CIAC 2000), LNCS 1767. (2000) 17-31
8. Deo, N., Micikevicius, P.: Comparison of Prüfer-like Codes for Labeled Trees. In: Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory and Computing. (2001)
9. Raidi, G.R., Julstrom, B.A.: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. In: Proc. 18th ACM Symposium on Applied Computing (SAC 2003). (2003) 747-752
10. Julstrom, B.A., Raidi, G.R.: Edge Sets: An Effective Evolutionary Coding of Spanning Trees. IEEE Trans. Evolutionary Computation 7 (2003) 225-239
11. Knowles, J.D., Corne, D.W.: A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem. IEEE Trans. Evolutionary Computation 4 (2000) 125-133
12. Knowles, J.D., Corne, D.W.: A Comparison of Encodings and Algorithms for Multiobjective Minimum Spanning Tree Problems. In: Proc. 2001 Congress on Evolutionary Computation (CEC-01). Volume 1. (2001) 544-551
13. Coello, C.A.C., Veldhuizen, D.A.V., Lamont, G.B.: Evolutionary Algorithms for Solving Multiojective Problems. Boston, MA: Kluwer (2002)
14. Deb, K.: Multiobjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley (2001)
15. Coello, C.A.C., Lament, G.B.: Applications of Multiojective Evolutionary Algorithms. World Scientific (2004)
16. Kumar, R., Rockett, P.I.: Improved Sampling of the Pareto-front in Multiobjective Genetic Optimization by Steady-State Evolution: A Pareto Converging Genetic Algorithm. Evolutionary Computation 10 (2002) 283-314
17. Kumar, R., Rockett, P.I.: Assessing the Convergence of Rank-based Multiobjective Genetic Algorithms. In: Proc. 2nd IEE/IEEE Int. Conf. Genetic Algorithms in Engineering Systems: Innovations and Applications (Galesia 97). Volume 1446., IEE, London, UK (1997) 19-23
18. Kumar, R., Singh, P.K., Chakrabarti, P.P.: Multiobjective Genetic Search for Spanning Tree Problem. In: Proc. 11th Int. Conf. Neural Information Processing (IcoNIP), LNCS 3316, Kolkata, India, Springer-Verlag (2004) 218-223
19. Kumar, R., Singh, P.K., Chakrabarti, P.P.: Improved Quality of Solutions for Multiobjective Spanning Tree Problem Using EA. In: Proc. 11th Int. Conf. High Performance Computing (HiPC), LNCS 3296, Bangalore, India, Springer-Verlag (2004) 494-503
20. Purshouse, R.C., Fleming, P.J.: Elitism, Sharing and Ranking Choices in Evolutionary Multicriterion Optimization. Research Report No. 815, Dept. Automatic Control & Systems Engineering, University of Sheffield (2002)
21. Deb, K.: A Fast Non-Dominated Sorting Genetic Algorithm for Multiobjective Optimization: NSGA-II. In: Proc. Parallel Problem Solving from Nature, PPSN-VI. (2000) 849-858
22. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In: Proc. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems (EUROGEN). (2001)
23. Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining Convergence and Diversity in Evolutionary Multiobjective Optimization. Evolutionary Computation 10 (2002) 263-282
24. Hansen, M.P., Jaszkiewicz, A.: Evaluating the Quality of Approximations to the Non-dominated Set. Tech. Rep. IMM-REP-1998-7, Tech. Univ. Denmark (1998)
25. Zitzler, E.: Evoluationary Algorithms for Multiobjective Optimization: Methods and Applications. Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, Switzerland (1999)
26. van Veldhuizen, D.A.: Multiobjective Evolutionary Algorithms: Classifications, Analysis, and New Innovations. Ph.D. Thesis, Technical Report No. AFIT/DS/ENG/99-01, Air Force Institute of Technology, Dayton, OH (1999)
27. Schott, J.R.: Fault Tolerant Design Using Single and Multicriteria Genetic Algorithms. Masters Thesis, Department of Aeronautics and Astronautics, MIT, Massachusetts (1995)
28. Deb, K., Jain, S.: Running Performance Metrics for Evolutionary Multiobjective Optimization. In: Proc. 4th Asia-Pacific Conf. Simulated Evoluation and Learning (SEAL 02), Singapore (2002) 13-20
29. Knowles, J., Corne, D.: On Metrics for Comparing Nondominated Sets. In: Proc. Congress Evolutionary Computation (CEC '02). Volume I., Piscataway, NJ, IEEE (2002) 711-716
30. Zohu, G., Gen, M.: Genetic Algorithm Approach on Multi-Criteria Minimum Spanning Tree Problem. European J. Operations Research 114 (1999) 141-152
31. Soak, S.M., Corne, D., Ahn, B.H.: A powerful new encoding for tree-based combinatorial optimisation problems. In: Parallel Problem Solving from Nature - PPSN VIII. Volume 3242 of LNCS., Birmingham, UK, Springer-Verlag (2004) 430-439
32. Cantu-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Boston, MA: Kluwer (2000)