诺丁汉大学计算机科学与信息技术专业博士学位论文运用元启发式算法的嵌套问题（不适合多边形）ApplyingMeta-HeuristicAlgorithmstotheNestingProblemUtilisingtheNoFitPolygon.doc

Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygon A Thesis submitted to the University of Nottingham for the Degree of Doctor of Philosophy by Graham Kendall, BSc (Hons) University of Nottingham, Nottingham School of Computer Science and Information Technology October 2000 Contents Contents 2 Figures 4 Tables 6 Abstract 7 Acknowledgements 8 1. Introduction 9 1.1 Aim and Objectives of this Thesis 10 1.2 What is the problem called? 11 1.3 Problem Dimensions 13 1.4 Types of Cutting 14 1.5 Placement versus Cutting 16 1.6 Classification 17 1.7 NP-Completeness 19 1.8 Motivation for this work 21 1.9 Outline of the Thesis 22 2. Related Work 24 2.1 Cutting and Packing 24 2.2 Computational Geometry 53 2.3 Search Methods 62 3. A Simplified Problem 84 3.1 Introduction 84 3.2 The Problem 88 3.3 Representation of the Problem 89 3.4 Comparison of Algorithms 91 3.5 Conclusions 94 4. Evaluation of the Two Dimensional Bin Packing Problem using the No Fit Polygon 95 4.1 Introduction 95 4.2 No Fit Polygon 97 4.3. Evaluation 98 4.4 Testing, Results and Comparisons 103 4.5 Conclusions 106 5. Comparing Meta-Heuristics and Evolutionary Algorithms when Applied to the Convex Nesting Problem 107 5.1 Introduction 107 5.2 Evaluation Method 108 5.3 Test Data 110 5.4 Parameter Selection for Search Methods 113 5.5 Testing, Results and Comparisons 121 5.6 Conclusions 123 6. Applying Ant and Memetic Algorithms with the No Fit Polygon to the Nesting Problem 125 6.1 Introduction 125 6.2 Ant Algorithms and the Nesting Problem 125 6.3 Memetic Algorithms 127 6.4 Testing and Results 128 6.5 Conclusions and Discussion 134 7. Determining the No Fit Polygon for Non-Convex Polygons and Combining Non-Convex Polygons 136 7.1 Introduction 136 7.2 The No Fit Polygon – In Outline 137 7.3 D-Functions 139 7.4 Checking for Intersection 147 7.5 The No Fit Polygon – Modified Algorithm 151 7.6 Combining Polygons 166 7.7 Summary 175 8. Comparing Meta-Heuristics and Evolutionary Algo