Analysis on the less flexibility first (LFF) algorithm and its application to the container loading problem.

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.1Chapter 1.1 --- Background --- p.1Chapter 1.2 --- Research Objective --- p.4Chapter 1.3 --- Contribution --- p.5Chapter 1.4 --- Structure of this thesis --- p.6Chapter 2. --- Literature Review --- p.7Chapter 2.1 --- Genetic Algorithms --- p.7Chapter 2.1.1 --- Pre-processing step --- p.8Chapter 2.1.2 --- Generation of initial population --- p.10Chapter 2.1.3 --- Crossover --- p.11Chapter 2.1.4 --- Mutation --- p.12Chapter 2.1.5 --- Selection --- p.12Chapter 2.1.6 --- Results of GA on Container Loading Algorithm --- p.13Chapter 2.2 --- Layering Approach --- p.13Chapter 2.3 --- Mixed Integer Programming --- p.14Chapter 2.4 --- Tabu Search Algorithm --- p.15Chapter 2.5 --- Other approaches --- p.16Chapter 2.5.1 --- Block arrangement --- p.17Chapter 2.5.2 --- Multi-Directional Building Growing algorithm --- p.17Chapter 2.6 --- Comparisons of different container loading algorithms --- p.18Chapter 3. --- Principle of LFF Algorithm --- p.8Chapter 3.1 --- Definition of Flexibility --- p.8Chapter 3.2 --- The Less Flexibility First Principle (LFFP) --- p.23Chapter 3.3 --- The 2D LFF Algorithm --- p.25Chapter 3.3.1 --- Generation of Corner-Occupying Packing Move (COPM) --- p.26Chapter 3.3.2 --- Pseudo-packing and the Greedy Approach --- p.27Chapter 3.3.3 --- Real-packing --- p.30Chapter 3.4 --- Achievement of 2D LFF --- p.31Chapter 4. --- Error Bound Analysis on 2D LFF --- p.21Chapter 4.1 --- Definition of Error Bound --- p.21Chapter 4.2 --- Cause and Analysis on Unsatisfactory Results by LFF --- p.33Chapter 4.3 --- Formal Proof on Error Bound --- p.39Chapter 5. --- LFF for Container Loading Problem --- p.33Chapter 5.1 --- Problem Formulation and Term Definitions --- p.48Chapter 5.2 --- Possible Problems to be solved --- p.53Chapter 5.3 --- Implementation in Container Loading --- p.54Chapter 5.3.1 --- The Basic Algorithm --- p.56Chapter 5.4 --- A Sample Packing Scenario --- p.62Chapter 5.4.1 --- Generation of COPM list --- p.63Chapter 5.4.2 --- Pseudo-packing and the greedy approach --- p.66Chapter 5.4.3 --- Update of corner list --- p.69Chapter 5.4.4 --- Real-Packing --- p.70Chapter 5.5 --- Ratio Approach: A Modification to LFF --- p.70Chapter 5.6 --- LFF with Tightness Measure: CPU time Cut-down --- p.75Chapter 5.7 --- Experimental Results --- p.77Chapter 5.7.1 --- Comparison between LFF and LFFR --- p.77Chapter 5.7.2 --- "Comparison between LFFR, LFFT and other algorithms" --- p.78Chapter 5.7.3 --- Computational Time for different algorithms --- p.81Chapter 5.7.4 --- Conclusion of the experimental results --- p.83Chapter 6. --- Conclusion --- p.85Bibiography --- p.8