第四章 結論與建議
4.2 建議
雖然本研究已將公共設施配置與區分路段種類納入SLM模式中處 理，但二者仍存在後續研究課題值得進一步深入探討：
1. 部份設施在配置時所須考量的因素或有不同，而無法一體適用 MCLP 之目標式或限制式；例如：緊急性設施可能較注重使最遠服 務對象距設施的距離最小化，鄰避性設施可能希望在其影響範圍內 儘量避免存在敏感受體；因此在應用模式時，必須注意所配置設施 是否與模式中的考量因素契合。很幸運地，SLM 模式本身具有修改 的彈性，易於與其它種類配置模式結合，此項結合之需求性、可行 性以及分析效果值得研究工作繼續探索。
2. 純粹由旅運需求決定路段種類的作法，尚存在兩項課題值得進一步 改善：一是路網的結構性要求被模式所忽略，致產生不同種類路段 斷續出現的不合理現象。二是路段種類與沿線土地使用間的和諧性 要求未被考量，例如講求寧適的住宅區與交通量較大的主要道路之 間在環境協調性上可能會有衝突，此種和諧性的考量並未在模式中 處理。為使 SLM 能納入更多配置作業上須考量的因素，以提供規劃 人員更多且更需要的協助，前述兩項課題應是模式在運輸路網方面 相當重要的後續研究方向。
參考文獻
1. 李其風，民86，「電動機車電瓶交換站配置方式之研究」，交通大學 交通運輸研究所碩士論文。
2. 林佳宜，民85，「大眾運輸補貼分配制度之研究」，交通大學交通運 輸研究所碩士論文。
3. 林楨家，民88，「都市計畫草圖替選方案分析模式」，交通大學交通 運輸研究所博士論文。
4. 曹勝雄，民82年，「路網設計問題啟發式解法與其多目標決策之研 究」，交通大學交通運輸研究所博士論文。
5. 曾國雄、林楨家，民 86，「淡海新市鎮消防隊佈設區位之研究─
TOPSIS 多目標規劃法之應用」，都市與計劃，第 24 卷，第 1 期，
第 81-98 頁。
6. 馮正民，民87，「都市計畫草圖配置模式」，國科會專題研究報告，
NSC87-2415-H-009-005。
7. 馮正民、林楨家，民86，「都市計畫草圖替選方案之分析模式」，都 市與計畫，第二十四卷，第二期，第153~169頁。
8. 馮正民、林楨家，民89，「都市計畫草圖替選方案分析模式之改進：
納入公共設施配置」，都市與計畫，已接受刊登。
9. 樓邦儒，民 84，「台北市消防隊多目標區位模式之研究」，中國文 化大學地學研究所地理組碩士論文。
10. Bammi, D. and Bammi, D., 1979, “Development of comprehensive land use plan by means of a multiple objective mathematical programming model,”INTERFACES, Vol. 9, No. 2, pp. 50-63.
11. Bammi, D., Bammi, D. and Paton, R, 1976, “Urban planning to
minimize environmental impact,”Environment and Planning A, Vol. 8, pp. 245-359.
12. Barber, G. M., 1976, “Land-use plan design via interactive multiple-objective programming,”Environment and Planning A, Vol. 8, pp. 625-636.
13. Bard, J. F., 1983, “ An efficient point algorithm for a linear two-stage optimization problem,” Operations Research, Vol.31, No.4, pp.670-684.
14. Batta R., Dolan, J. M. and Krishnamurthy, N. N., 1989,” The maximal expected covering location problem: Revisited,” Transportation Science, Vol. 23, No. 4, pp. 277-287.
15. Batta, R. and Mannur, N. R., 1990,” Covering- location models for emergency situations that require multiple response units,”
Management Science, Vol. 36, No. 1, pp. 16-23.
16. Ben-Ayed, O., Boyce, D. E., Blair, C. E. III, 1988, “ A general bilevel linear programming formulation of the network design problem,”
Transportation Research B, Vol. 22B, No.4, pp.311-318.
17. Boyce, D. E., 1984,” Urban transportation network-equilibrium and design models: recent achievements and future prospects,”
Environment and Planning A, Vol.16, pp.1445-1474.
18. Boyce, D. E., Janson, B. N., 1980,” A discrete transportation network design problem with combined trip distribution and assignment,”
Transportation Research B, Vol.14B, pp.147-154.
19. Brotchie, J. F., 1978, “A new approach to urban modelling,”
MANAGEMENT SCIENCE, Vol. 24, No. 16, pp. 1753-1758.
20. Brotchie, J. F., Dickey, J. W. and Sharpe, R., 1980, TOPAZ－General planning technique and its applications at the regional, urban, and facility planning levels.
21. Calvete, H. I., Gale, C, 1999,” The bilevel linear/linear fractional programming problem,” European Journal of Operational Research, 114, pp.188-197.
22. Chen, H.-K., Chen, Y.-C., 1999,” Comparisons of the Frank-Wolfe and Evans methods for the doubly constrained entropy distribution/assignment problem,” Journal of the Eastern Asia Society for Transportation Studies, Vol.3, No.5, pp.261-275.
23. Church, R. L. and ReVelle, C., 1974, “The maximal covering location problem,” Papers of the Regional Science Association, Vol. 32, No.
101, pp. 101-118.
24. Church, R. L., 1980,” Developing solid waste planning regions for Tennessee Valley authority,” Modelling and Simulation, 11, pp. 1611-1618.
25. Church, R. L., 1984,” The planar maximal covering location problem,”
Journal of Regional Science, Vol. 24, No. 2, pp. 185-201.
26. Courtney, B. M., 1978,” Raingage network design,” research paper for M.E. degree, Department of Industrial Engineering, University of Tennessee, Knoxville, Tennessee.
27. Current, J. R. and Storbeck, J. E., 1988,” Capacitated covering models,”Environment and Planning B: Planning and Design, Vol. 15, pp. 153-163.
28. Daskin M. S., 1983,” A maximum expected covering location model:
Formulation, properties and heuristic solution,”Transportation Science,
Vol. 17, No. 1, pp. 48-70.
29. Dokmeci, V. F., 1993,“Multiobjective land-use planning model,”
Journal of Urban Planning and Development, Vol. 119, No. 1, pp. 15-22.
30. Dwyer, F. R. and Evans, J. R., 1981,” A branch and bound algorithm for the list selection problem in direct mail advertising,” Management Science, 27, pp. 658-667.
31. Eaton, D. and Daskin, M., 1980,” Analysis of emergency medical services in Austin, Texas; Volume I: Results,” LBJ School of Public Affairs, University of Texas, Austin, Texas.
32. Eaton, D., Church, R. L., Bennett, V. L., Hamon, B. L. and Lopez, L.
V., 1981,” Ubicacion de recursos de salud en las zones rurales del cauca, Colombia,” Institute for Latin American Studies, Techinal Paper Series No. 32, University of Texas, Austin, Texas.
33. Evans, S. P., 1976,” Derivation and analysis of some models for combining trip distribution and assignment,”Transportation Research, Vol.10, pp.37-57.
34. Feng, C. –M. and Lin, J. –J., 1999a, “Using a genetic algorithm to generate alternative sketch maps for urban planning,” Computers, Environment and Urban Systems, Vol. 23, No.2, pp. 91-108.
35. Feng, C. -M. and Lin, J. –J., 1999b, ”A land use-network design model to generate alternative sketch maps for urban planning,”Journal of the Eastern Asia Society for Transportation Studies, Vol, 3, No.4, pp. 71-86.
36. Florian, M., Nguyen, S., Ferland, J., 1975,” On the combined distribution-assignment of traffic,”Transportation Science, Vol.9, No.1,
pp.43-53.
37. Goldberg， D. E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison-Wesley.
38. Gorden, P. and MacReynolds, W. K., 1974, “Optimal urban forms,”
JOURNAL OF REGIONAL SCIENCE, Vol. 14, No. 2, pp. 217-231.
39. Haghani, A., 1996,” Capacitated maximum covering location models:
Formulations and solution procedures,” Journal of Advanced Transportation, Vol. 30, No. 3, pp. 101-136.
40. Hamon, B. L., Eaton, D. J. and Church, R. L., 1979,” Development of a multi-purpose ambulance system,”Modelling and Simulation, 10, pp.
1437-1445.
41. Hogan, K. and ReVelle, C., 1986, “Concepts and applications of backup coverage,” Management Science, Vol. 32, No. 11, pp. 1434-1444.
42. Hougland, E. S. and Stephens, N. T., 1976,” Air pollution monitor siting by analytical techniques,” Journal of the Air Pollution Control Association, 26, pp. 51-53.
43. Janson, B. N. and Husaini, A., 1987, “Heuristic ranking and selection procedures for network design problems,” Journal of Advanced Transportation, Vol. 21, pp.17-46.
44. Jornsten, K. O., 1980,” A maximum entropy combined distribution and assignment model solved by benders decomposition,” Transportation Science, Vol.12, No.3, pp.262-276.
45. Kim, T. J., Suh, S., 1988,” Toward developing a national transportation planning model: a bilevel programming approach for Korea,” Annal of
Regional Science, XXSPED, pp.65-80.
46. LeBlanc, L. J. and Boyce, D. E., 1986, “ A bilevel programming problem with user-optimal flows,” Transportation Research B, Vol.
20B, No.3, pp.259-265.
47. Leblanc, L. J., 1975, “An algorithm for the discrete network design problem,”Transportation Science, 9, pp. 183-199.
48. Liu, Y.-H., Hart, S. M., 1994,” Characterizing an optimal solution to the linear bilevel programming problem,” European Journal of Operational Research, 79, pp.164-166.
49. Los, M., 1978, “Simultaneous optimization of land use and transportation － a synthesis of the quadratic assignment problem and the optimal network problem,” Regional Science and Urban Economics 8, pp. 21-42.
50. Los, M., 1979, “A discrete-convex programming approach to the simultaneous optimization of land use and transportation,”
Transportation Research B, Vol. 13B, pp. 33-48.
51. Lundqvist, L., 1973, “Integrated location-transportation analysis; a decomposition approach,” REGIONAL AND URBAN ECONOMICS, Vol. 3, No. 3, pp. 233-262.
52. MacKinnon, R. D. and Hodgson, M. J., 1970, “Optimal transportation networks: a case study of highway systems,” Environment and Planning, Vol. 2, pp. 267-284.
53. Magnanti, T. L. and Wong, R. T., 1984, “Network design and transportation planning: models and algorithms,” Transportation Science, Vol. 18, No. 1, pp. 1-55.
54. Marcotte, P., 1988, “ A note on a bilevel programming algorithm by LeBlanc and Boyce,” Transportation Research B, Vol.22b, No.3, pp.233-237.
55. Mehrez, A. and Stulman, A., 1982,” The maximal covering location problem with facility placement on the entire plane,” Journal of Regional Science, Vol. 22, No. 3, pp. 361-365.
56. Mehrez, A., 1983,” A note on the linear integer formulation of the maximal covering location problem with facility placement on the entire plane,”Journal of Regional Science, Vol. 23, No. 4, pp. 553-555.
57. Meng, Q., Yang, H., Wong, S.-C., 2000,” A combined land-use and transportation model for work trip,” Environment and Planning B:
Planning and Design, Vol.27, pp.93-103.
58. Migereko, D., 1983, A location analysis of the coffee cooperative system of Uganda, Master’s Thesis, Department of Geography, University of California, Santa Barbara, California.
59. Min, H., 1988,” The dynamic expansion and relocation of capacitated public facilities: A multi-objective approach,” Computers and Operations Research, Vol. 15, No. 3, pp. 243-252.
60. Moore, G. C. and ReVelle, C., 1982,” The hierarchical service location problem,”Management Science, Vol. 28, No. 7, pp. 775-780.
61. Owen, S. H. and Daskin, M. S., 1998, “Strategic facility location: a review,”European Journal of Operational Research, No, 111, pp. 423-447.
62. Pirkul, H. and Schilling D. A., 1991,” The maximal covering location problem with capacitated on total workload,” Management Science, Vol. 37, No. 2, pp. 233-248.
63. Poorzahedy, H. and Turnquist, M. A., 1982, “Approximate algorithms for the discrete network design problem,”Transportation Research B, Vol. 16B, No. 1, pp. 45-55.
64. Ridgley, M. A. and Giambelluca, T. W., 1992, “Linking water-balance simulation and multiobjective programming: land use plan design in Hawaii,”Environment and Planning B: Planning and Design, Vol. 19, pp. 317-336.
65. Ruefli, T. W. and Storbeck, J. E., 1982,” Behaviorally linked location hiererchies,” Environment and Planning B: Planning and Design, Vol.
9, pp. 257-268.
66. Sakawa, M., Nishizaki, I., Hitaka, M., 1999,” Interactive fuzzy programming for multi-level 0-1 programming problems through genetic algorithms,” European Journal of Operational Research, 114, pp.580-588.
67. Schilling, D. A., Jayaraman, V. and Barkhi, R., 1993,” A review of covering problems in facility location,”Location Science, Vol. 1, No.1, pp. 25-55.
68. Schilling, D., 1976, Multi-objective and temporal considerations in public facility location, Ph.D. Dissertation, Johns Hopkins University, Baltimore, Maryland.
69. Sheffi, Y., 1985, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall, INC., Englewood Cliffs, New Jersey.
70. Shih, H.-S., Lai, Y.-J., Lee, E. S., 1996,” Fuzzy approach for multi-level programming problems,” Computers, and Operations Research, Vol.23, No.1, pp.73-91.
71. Soismaa, M., 1999,“ A note on efficient solutions for the linear bilevel programming problem,” European Journal of Operational Research, 112, pp.427-431.
72. Suh, S., Kim, T. J., 1992,” Solving nonlinear bilevel programming models of the equilibrium network design problem: a comparative review,”Annals of Operations Research, 34, pp.203-218.
73. Tomlin, J.A., 1971,” A mathematical programming model for the combined distribution-assignment of traffic,”Transportation Science, 5, pp.120-140.
74. Wen, U.-P., Hsu, S.-T., 1991,” Linear bi-level programming problems-a review,” Journal of Operational Research Society, Vol.42, No.2, pp.125-131.
75. Xiong, Y. and Schneider, J. B., 1995, “Transportation network design using a cumulative genetic algorithm and neural network,”
TRANSPORTATION RESEARCH RECORD 1364, pp. 37-44.
76. Yang, H., Bell, M. G. H., 1998,” Models and algorithms for road network design: a review and some new development,” Transport Reviews, Vol.18, No.3, pp.257-278.