by Lo Wai On. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 96-98). / Abstract / Acknowledgements / Table of Contents / List of Tables / List of Figures / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Transportation Arrangement Problem --- p.2 / Chapter 1.3 --- Site Planning Problem --- p.4 / Chapter 1.4 --- Organisation of the Thesis --- p.4 / Chapter Chapter 2 --- Literature Review --- p.6 / Chapter 2.1 --- Overview --- p.6 / Chapter 2.2 --- Transportation Arrangement --- p.7 / Chapter 2.2.1 --- A* algorithm --- p.8 / Chapter 2.2.2 --- A*V algorithm --- p.9 / Chapter 2.2.3 --- Knowledge-based approach --- p.11 / Chapter 2.2.4 --- ANESTA's approach --- p.13 / Chapter 2.3 --- Site Planning --- p.14 / Chapter 2.3.1 --- CICERO'S approach --- p.15 / Chapter 2.3.2 --- ANESTA's approach --- p.17 / Chapter 2.4 --- Summary --- p.19 / Chapter Chapter 3 --- Transportation Arrangement --- p.20 / Chapter 3.1 --- Overview --- p.20 / Chapter 3.2 --- Problem Description --- p.21 / Chapter 3.2.1 --- Shortest path problem --- p.21 / Chapter 3.2.2 --- Existing solution algorithms --- p.21 / Chapter 3.2.3 --- Preference consideration --- p.22 / Chapter 3.3 --- Zoning --- p.22 / Chapter 3.3.1 --- Grid-type zoning --- p.23 / Chapter 3.3.2 --- Density-type zoning --- p.23 / Chapter 3.4 --- Solution Methodology --- p.24 / Chapter 3.4.1 --- Data representation in the system --- p.24 / Chapter 3.4.2 --- Heuristic algorithm --- p.26 / Chapter 3.5 --- Illustrative Examples --- p.34 / Chapter 3.5.1 --- Example 1 - Direct Connection --- p.34 / Chapter 3.5.2 --- Example 2 - Three-node Path --- p.35 / Chapter 3.5.3 --- Example 3 - Four-node Path --- p.37 / Chapter 3.6 --- Computation Results --- p.38 / Chapter 3.6.1 --- Zoning vs. No-zoning --- p.39 / Chapter 3.6.2 --- Grid-type zoning vs. Density-type zoning --- p.40 / Chapter 3.6.3 --- Comparison between the new heuristic and the other algorithms --- p.42 / Chapter 3.7 --- Summary --- p.43 / Chapter Chapter 4 --- Site Planning --- p.45 / Chapter 4.1 --- Overview --- p.45 / Chapter 4.2 --- Problem Description --- p.46 / Chapter 4.2.1 --- Preference constraint --- p.46 / Chapter 4.2.2 --- Accessibility constraint --- p.46 / Chapter 4.2.3 --- Time constraint --- p.47 / Chapter 4.2.4 --- Problems with the ANESTA's approach --- p.47 / Chapter 4.3 --- Solution Methodology --- p.49 / Chapter 4.3.1 --- Preference handling --- p.50 / Chapter 4.3.2 --- Time window constraints --- p.51 / Chapter 4.3.3 --- Connectivity constraint --- p.57 / Chapter 4.3.4 --- Fitness constraint --- p.57 / Chapter 4.3.5 --- Travelling distance constraint --- p.58 / Chapter 4.3.6 --- Heuristic algorithm --- p.59 / Chapter 4.3.7 --- Flexibility consideration --- p.63 / Chapter 4.4 --- An Illustrative Example --- p.66 / Chapter 4.5 --- Computation Results --- p.74 / Chapter 4.5.1 --- Comparison of the solution quality with and without the second phase heuristic --- p.74 / Chapter 4.5.2 --- Investigation of the effect with the circular boundary --- p.76 / Chapter 4.5.3 --- Comparison with ANESTA --- p.77 / Chapter 4.6 --- Summary --- p.86 / Chapter Chapter 5 --- Conclusions --- p.88 / Appendix A --- p.91 / References --- p.96
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_321984 |
| Date | January 1997 |
| Contributors | Lo, Wai On., Chinese University of Hong Kong Graduate School. Division of Systems Engineering and Engineering Management. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, ix, 98 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.0019 seconds