Genetic algorithms for solving bounded diameter minimum spanning tree problem
➤ Gửi thông báo lỗi ⚠️ Báo cáo tài liệu vi phạmNội dung chi tiết: Genetic algorithms for solving bounded diameter minimum spanning tree problem
Genetic algorithms for solving bounded diameter minimum spanning tree problem
MINISTRY OF EDI C ATION AND TRAININGHANOI I NIVERSITY OF SCIENCE AND TECHNOLOGYGENETIC ALGORITHMS FOR SOLVINGBOUNDED DIAMETER MINIMUMSPANNING TREE PRO Genetic algorithms for solving bounded diameter minimum spanning tree problem OBLEMByHuynh Thi Thanh Bill 11Supervisor: Associate Professor Nguyen Due NghiaA Dissertation submitted in partial fulfillment of the requirements for the Degree of Doctor of Philosophy in EngineeringHaNoi, 2011Table of ContentsTable of ContentsiAbstract1Acknowledgements41Introduction51.1Motivation.. Genetic algorithms for solving bounded diameter minimum spanning tree problem ..................................................... 71.2Methodologies.................................................... 81.3Scope of research.....Genetic algorithms for solving bounded diameter minimum spanning tree problem
.......................................... 141.4Contributions................................................... 141.5Outline.........................MINISTRY OF EDI C ATION AND TRAININGHANOI I NIVERSITY OF SCIENCE AND TECHNOLOGYGENETIC ALGORITHMS FOR SOLVINGBOUNDED DIAMETER MINIMUMSPANNING TREE PRO Genetic algorithms for solving bounded diameter minimum spanning tree problem ........... 182.2Related Optimization and Decision Problems...................... 202.3Related works................................................... 222.3.1Exact approaches......................................... 232.3.2Heuristic Methods ....................................... 232.3.2.1One Time Genetic algorithms for solving bounded diameter minimum spanning tree problem Tree Construction Algorithm............. 242.3.2.2Center-Based Tree ConstructionAlgorithm ........ 252.3.2.3Randomized Greedy Heuristic Algorithm.....Genetic algorithms for solving bounded diameter minimum spanning tree problem
....... 25ii2.3.2.4 Improved Greedy Heurisitics (RCỈH — Ỉ and CỈĨTC - Ỉ) . 272.3.2.5Hierarchical clusteringheuristicalgorithm - lien..... 2<82.3.2.G CMINISTRY OF EDI C ATION AND TRAININGHANOI I NIVERSITY OF SCIENCE AND TECHNOLOGYGENETIC ALGORITHMS FOR SOLVINGBOUNDED DIAMETER MINIMUMSPANNING TREE PRO Genetic algorithms for solving bounded diameter minimum spanning tree problem ................................................ 393Center-Based Recursive ClusteringHeuristicAlgorithm41MINISTRY OF EDI C ATION AND TRAININGHANOI I NIVERSITY OF SCIENCE AND TECHNOLOGYGENETIC ALGORITHMS FOR SOLVINGBOUNDED DIAMETER MINIMUMSPANNING TREE PROGọi ngay
Chat zalo
Facebook