Wong, Mei Ting. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (p. 115-120). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Our Contributions --- p.4 / Chapter 1.3 --- Framework of Shelf Space Allocation Problem --- p.4 / Chapter 1.4 --- Organization --- p.6 / Chapter 2. --- Literature Review --- p.7 / Chapter 2.1 --- Introduction --- p.7 / Chapter 2.2 --- Commercial Approaches --- p.7 / Chapter 2.3 --- Experimental Approaches --- p.8 / Chapter 2.4 --- Optimization Approaches --- p.11 / Chapter 2.4.1 --- Exact Approaches --- p.11 / Chapter 2.4.2 --- Heuristics Approaches --- p.16 / Chapter 2.5 --- Summary --- p.19 / Chapter 3. --- Overview of Shelf Space Allocation Problem --- p.21 / Chapter 3.1 --- Introduction --- p.21 / Chapter 3.2 --- Problem description --- p.22 / Chapter 3.2.1 --- Mathematical Model --- p.24 / Chapter 3.2.1.1 --- Notations --- p.25 / Chapter 3.2.1.2 --- Model --- p.25 / Chapter 3.2.1.3 --- Assumption --- p.26 / Chapter 3.2.1.4 --- Notations of final model --- p.27 / Chapter 3.2.1.5 --- Final model --- p.27 / Chapter 3.3 --- Original Heuristic --- p.28 / Chapter 3.3.1 --- Yang (2001) Method --- p.28 / Chapter 3.3.2 --- Remarks on Original Heuristic --- p.29 / Chapter 3.4 --- Original Heuristic with Yang's Adjustment --- p.30 / Chapter 3.4.1 --- Remarks on Yang's Adjustment --- p.32 / Chapter 3.5 --- New Neighborhood Movements --- p.33 / Chapter 3.5.1 --- New Adjustment Phase --- p.33 / Chapter 3.6 --- Network Flow Model --- p.35 / Chapter 3.6.1 --- ULSSAP --- p.35 / Chapter 3.6.2 --- Transforming shelf space allocation problem (SSAP) --- p.38 / Chapter 3.7 --- Tabu Search --- p.41 / Chapter 3.7.1 --- Tabu Search Algorithm --- p.42 / Chapter 3.7.1.1 --- Neighborhood search moves --- p.42 / Chapter 3.7.1.2 --- Candidate list strategy --- p.45 / Chapter 3.7.1.3 --- Tabu list --- p.46 / Chapter 3.7.1.4 --- Aspiration criteria.........................................: --- p.47 / Chapter 3.7.1.5 --- Intensification and Diversification --- p.48 / Chapter 3.7.1.6 --- Stopping criterion --- p.49 / Chapter 3.7.1.7 --- Probabilistic choice --- p.50 / Chapter 3.7.2 --- General Process of Tabu Search --- p.51 / Chapter 3.7.3 --- Application of Tabu Search to SSAP --- p.54 / Chapter 3.7.4 --- Analysis of Tabu Search --- p.58 / Chapter 4. --- Tabu Search with Path Relinking --- p.60 / Chapter 4.1 --- Introduction --- p.60 / Chapter 4.2 --- Foundations of path relinking --- p.62 / Chapter 4.3 --- Path Relinking Template --- p.65 / Chapter 4.4 --- Identification of Reference set --- p.69 / Chapter 4.5 --- Choosing initial and guiding solution --- p.73 / Chapter 4.6 --- Neighborhood structure --- p.74 / Chapter 4.7 --- Moving along paths --- p.81 / Chapter 4.8 --- Application of Tabu Search with Path Relinking --- p.87 / Chapter 4.9 --- Conclusion --- p.90 / Chapter 5. --- Computational Studies --- p.92 / Chapter 5.1 --- Introduction --- p.92 / Chapter 5.2 --- General Parameter Setting --- p.92 / Chapter 5.3 --- Parameter values for Tabu search --- p.94 / Chapter 5.4 --- Sensitivity test for Tabu search with Path Relinking --- p.95 / Chapter 5.4.1 --- Reference Set Strategies and Initial and Guiding Solution Criteria --- p.96 / Chapter 5.4.2 --- Frequency of Path Relinking --- p.99 / Chapter 5.4.3 --- Size of reference set --- p.101 / Chapter 5.4.4 --- Comparison with Tabu Search --- p.102 / Chapter 5.5 --- Comparison with other heuristics --- p.105 / Chapter 5.6 --- Conclusion --- p.109 / Chapter 6. --- Conclusion --- p.111 / Chapter 6.1 --- Summary of achievements --- p.112 / Chapter 6.2 --- Future Works --- p.113 / Bibliography --- p.115