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

by Tam Chi-Fai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 87-88). / abstract --- p.I / table of content --- p.II / list of figures --- p.V / acknowledgments --- p.VII / Chapter chapter 1 --- introduction --- p.1 / Chapter 1.1 --- Two Stage Operations Planning --- p.1 / Chapter 1.2 --- Iterative Activities in the Two Stage Planning Approach --- p.3 / Chapter 1.3 --- Expert Decision Support System for Two Stage Planning --- p.4 / Chapter 1.4 --- Scope of the Study --- p.5 / Chapter 1.5 --- Organization of the Thesis --- p.6 / Chapter chapter 2 --- literature review --- p.7 / Chapter 2.1 --- Network Design for Air Express Service --- p.7 / Chapter 2.2 --- Integrative Use of Optimization and Simulation Model --- p.8 / Chapter 2.3 --- Expert System & Decision Support System --- p.11 / Chapter 2.3.1 --- Expert System --- p.11 / Chapter 2.3.2 --- Decision Support System --- p.13 / Chapter 2.3.3 --- ES / DSS Integration --- p.14 / Chapter chapter 3 --- research methodology --- p.19 / Chapter 3.1 --- Review on DSS / ES Integration --- p.19 / Chapter 3.2 --- System Design --- p.20 / Chapter 3.3 --- Prototyping --- p.22 / Chapter 3.4 --- Analysis and Evaluation --- p.23 / Chapter chapter 4 --- system architecture and knowledge modeling --- p.24 / Chapter 4.1 --- Architecture Overview --- p.24 / Chapter 4.1.1 --- System Architecture and Interactions --- p.26 / Chapter 4.1.2 --- Decision Support System --- p.27 / Chapter 4.1.3 --- Expert System --- p.32 / Chapter 4.2 --- System Operations --- p.35 / Chapter 4.2.1 --- Operations Flow --- p.35 / Chapter chapter 5 --- case study and prototyping --- p.38 / Chapter 5.1 --- Case Background --- p.38 / Chapter 5.1.1 --- The Service Network --- p.38 / Chapter 5.1.2 --- Objectives of the Project --- p.40 / Chapter 5.1.3 --- Network Design Methodology --- p.41 / Chapter 5.2 --- Iterative Network Planning --- p.49 / Chapter 5.2.1 --- Multi-period Network Planning Feedback --- p.50 / Chapter 5.2.2 --- Feedback in Validation and Evaluation --- p.51 / Chapter 5.3 --- The System Prototype --- p.57 / Chapter 5.3.1 --- Data Management and Model Manipulation --- p.57 / Chapter 5.3.2 --- Intelligent Guidance for the Iterations --- p.65 / Chapter chapter 6 --- evaluation and analysis --- p.75 / Chapter 6.1 --- Test Scenario for Network Planning --- p.75 / Chapter 6.1.1 --- Consultation Process --- p.75 / Chapter 6.1.2 --- Consultation Results --- p.78 / Chapter 6.2 --- Effectiveness of EDSS in Network Planning --- p.81 / Chapter 6.3 --- Generalized Advancement and Limitation --- p.82 / Chapter chapter 7 --- conclusion --- p.85 / bibliography --- p.87 / appendices --- p.89

Bin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted sub-problem of the general Container Packing problem. Since the Bin Packing problem is NP-complete, it is customary to apply a heuristic measure in order to approximate solutions in a reasonable amount of computation time rather than to attempt to produce optimal results by applying some exact algorithm. Several heuristics are examined for the problems under consideration, and the results produced by each are shown and compared where relevant. / Thesis (M.Sc.)-University of Natal, Durban, 1991.

Bibliography : leaves 196-200. / Thesis (Ph. D.)--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science, 1977. / Microfiche copy available in the Institute Archives and Barker Engineering Library. / by Loren Kerry Platzman. / Ph.D.