Wu Yuen-Ting. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 88-90). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Research Objective --- p.4 / Chapter 1.3 --- Contribution --- p.5 / Chapter 1.4 --- Structure of this thesis --- p.6 / Chapter 2. --- Literature Review --- p.7 / Chapter 2.1 --- Genetic Algorithms --- p.7 / Chapter 2.1.1 --- Pre-processing step --- p.8 / Chapter 2.1.2 --- Generation of initial population --- p.10 / Chapter 2.1.3 --- Crossover --- p.11 / Chapter 2.1.4 --- Mutation --- p.12 / Chapter 2.1.5 --- Selection --- p.12 / Chapter 2.1.6 --- Results of GA on Container Loading Algorithm --- p.13 / Chapter 2.2 --- Layering Approach --- p.13 / Chapter 2.3 --- Mixed Integer Programming --- p.14 / Chapter 2.4 --- Tabu Search Algorithm --- p.15 / Chapter 2.5 --- Other approaches --- p.16 / Chapter 2.5.1 --- Block arrangement --- p.17 / Chapter 2.5.2 --- Multi-Directional Building Growing algorithm --- p.17 / Chapter 2.6 --- Comparisons of different container loading algorithms --- p.18 / Chapter 3. --- Principle of LFF Algorithm --- p.8 / Chapter 3.1 --- Definition of Flexibility --- p.8 / Chapter 3.2 --- The Less Flexibility First Principle (LFFP) --- p.23 / Chapter 3.3 --- The 2D LFF Algorithm --- p.25 / Chapter 3.3.1 --- Generation of Corner-Occupying Packing Move (COPM) --- p.26 / Chapter 3.3.2 --- Pseudo-packing and the Greedy Approach --- p.27 / Chapter 3.3.3 --- Real-packing --- p.30 / Chapter 3.4 --- Achievement of 2D LFF --- p.31 / Chapter 4. --- Error Bound Analysis on 2D LFF --- p.21 / Chapter 4.1 --- Definition of Error Bound --- p.21 / Chapter 4.2 --- Cause and Analysis on Unsatisfactory Results by LFF --- p.33 / Chapter 4.3 --- Formal Proof on Error Bound --- p.39 / Chapter 5. --- LFF for Container Loading Problem --- p.33 / Chapter 5.1 --- Problem Formulation and Term Definitions --- p.48 / Chapter 5.2 --- Possible Problems to be solved --- p.53 / Chapter 5.3 --- Implementation in Container Loading --- p.54 / Chapter 5.3.1 --- The Basic Algorithm --- p.56 / Chapter 5.4 --- A Sample Packing Scenario --- p.62 / Chapter 5.4.1 --- Generation of COPM list --- p.63 / Chapter 5.4.2 --- Pseudo-packing and the greedy approach --- p.66 / Chapter 5.4.3 --- Update of corner list --- p.69 / Chapter 5.4.4 --- Real-Packing --- p.70 / Chapter 5.5 --- Ratio Approach: A Modification to LFF --- p.70 / Chapter 5.6 --- LFF with Tightness Measure: CPU time Cut-down --- p.75 / Chapter 5.7 --- Experimental Results --- p.77 / Chapter 5.7.1 --- Comparison between LFF and LFFR --- p.77 / Chapter 5.7.2 --- "Comparison between LFFR, LFFT and other algorithms" --- p.78 / Chapter 5.7.3 --- Computational Time for different algorithms --- p.81 / Chapter 5.7.4 --- Conclusion of the experimental results --- p.83 / Chapter 6. --- Conclusion --- p.85 / Bibiography --- p.88
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_325141 |
| Date | January 2005 |
| Contributors | Wu, Yuen-Ting., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English, Chinese |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, x, 90 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0017 seconds