Contents
1.Introduction
1.1 The Motivation
1.2 Problems Formulation
1.3 Related Works
1.4 Feature of the Study
1.5 Organization of The Thesis
2.The Concept of The Genetic Approach
2.1 Genetic Algorithms
2.2 The Graph-based Search Model for Annealing-Genetic Approach
2.3 The Formulation of The Genetic Approach
3.The Annealing-Genetic Algorithm
3.1 The Design of The Annealing Schedule
3.2 The Design of The Algorithm
3.3 The Efficiency of The Algorithm
4.The Global Convergence of The Annealing-Genetic Algorithm
4.1 The Global Convergence of The Search Paths
4.2 The Global Convergence of The Genetic Operations
5.The Task Assignment Problem in Distributed Computing System
5.1 Problem Definitions
5.2 Literatures Review
5.3 Empirical Results
5.4 Discussions
6.The One-Dimensional Bin-Packing Problem
6.1 Fundamental Problems
6.2 Literatures Review
6.3 Empirical Results
6.4 Discussions
7.The Multiconstraint Zero-One Knapsack and The Set Partitioning Problems
7.1 Terminology and The Problem Definition
7.2 Literatures Review
7.3 Empirical Results
7.4 Discussions
8.The Traveling Salesman problem
8.1 The History of The TSP
8.2 The Variants of The TSP
8.3 Literatures Review
8.4 Empirical Results
8.5 Discussions
9.Conclusions
9.1 Summary of Results
9.2 Directions of Future Research
Bibliography
圖目錄
表目錄
中文摘要
英文摘要