參考文獻
王志清(2000)，物流中心機動派遣與路徑規劃之研究，國立雲林科技大學工業工程與管理研究所碩士論文。王湮筑(2000)，市區公車之既有路線調整與新闢路線規劃程序之研究，國立交通大學交通運輸研究所碩士論文。台北市民政局網站 (2000 , 9) http://www.ca.taipei.gov.tw/main.htm。
台北市政府都市發展局 (2000 , 9) http://www.planning.taipei.gov.tw。
民視新聞網 (2000 , 9) 新聞影音資料庫 , http://search.ftvn.com.tw/index.htm。
朱秋蓉(1999)，模糊多目標路線問題決策方法及其在程規劃應用，華梵大學工業管理學系碩士班碩士論文。洪政煌(1992)，低放射性廢料陸運路線選擇與運送管制方式之研究，國立交通大學交通運輸研究所碩士論文。陳瑞雄(2000)，品質檢驗排程規劃之層級式決策支援系統研究，私立天主教輔仁大學資訊管理學系碩士論文。曾國雄、李穗玲(1995)「路線方案評選多目標決策之應用－以桃園都會區捷運路網選線為例」，運輸計劃季刊 24(3)，299-322。鄭光哲(1998)，營建廢棄土供需管理及運輸指派系統規劃－模糊理論應用，國立成功大學資源工程研究所碩士論文。鄧振源(1990)，「多評準決策規劃方法之概念性分析」，交通運輸 12，131-164。鄧振源(1998)，「運輸路線選擇之模糊多目標決策方法」，中華民國第三屆運輸網路研討會論文集，221-230，中央大學，中壢。
鄧振源(2000)，「模糊多目標路網最短路徑決定之研究」，中華民國第五屆運輸路網研討會論文集，107-116，逢甲大學，台中。
鄧振源，黃文吉(1999)，「危險物品運送路線選擇之模糊多目標決策分析:以低放射性核廢料運送為例」，中華民國第四屆運輸網路研討會論文集，183-192，成功大學，台南。
鄧振源、朱秋蓉(1999)，「模糊多目標路線問題決策及其在製程規劃之應用」，中國工業工程學會論文集，清華大學，新竹。
Baker, E.（1983）, “An exact algorithm for the time constrained traveling salesman problem”, Operations Research 31, 938-945.
Bodin, L. and B. Golden, (1981) , “Classification in vehicle routing and scheduling,” Networks 11, 97-108.
Bodin, L.,B. Golden,A. Assed, and M. Ball （1983）, “Routing and seheduling of vehicles and crews: The seate of the art,” Computers and Operations Research 10(2), 63-211.
Chen, S.J. and Hwang, C.L(1992), Fuzzy Multiple Attribute Decision Making: Methods and Applications, Springer-Verlag, New York.
Christofides, N., A. Mingozzi and P. Toth （1981） , “State-space relaxation procedures for the computation of bounds to routing Problems,” Networks 11, 145-164
Christofides, N., and Eilton, S.（1972）, “Algorithms for largescale travelling salesman problems, ” Operational Research 31, 938-945.
Duhamel, C., Potvin Jean-Yves and Rousseau, J.M., (1997) , “A tabu search heuristic for the vehicle routing problem with backhauls and time windows,” Transportation Science 31, 49-59.
Esogbue A. O. and Bellman (1984), “Fuzzy dynamic programming and its extensions,” ITMS/Studies in the Management Sciences 20 ,147-167.
Fisher,M.L.,R.Jaikumar,（1981）, “A generalized assignment heuristic for vehicle routing problems, ” Networks 11 , 109-124.
Ginzberg, M.J., (1981) , “Key recurrent issues in the MIS implementation process,” MIS Quarterly 5(2), 47-60.
Keen, P.G.W. (1987) , “ Decision support system: The next decades,” Decision Support Systems 3, 260-264.
Klein, C.M. (1991), “A model for the transportation of hazardous wastes,” Decision Sciences 22,1091-1108.
Kolen, A. W. J., (1987), “Vehicle routing with time windows,” Operations Research 35, 256-273.
Laporte, G.（1992）, “The vehicle routing problem: An overview of exact and approximate algorithms, ” European Journal of Operational Research 59, 345-358.
Lawler,E.L., Lenstra, J.K., Rinnooy Kan, A. H. G., and Shmoys, D.B.,（1985）, The Traveling Salesman Problem, A Guilded tour of Combinatorial Optimization, Wiley, Chichester.
Psaraftis, H. N.（1980）, “A dynamic programming solution to the single vehicle many-to-many dial-a-ride problem with time windows”, Tramsportation Science 17, 351-357.
Savelsbergh, M. W. P., and M. Sol,（1995）, The general pickup and delivery problem, Transportation Science 29(1) , 17-28.
Shinn-Ying H. , L. SunShu, and C. Hung-Ming (1999) , “Intelligent genetic algorithm with a new intelligent crossover using orthogonal arrays,” GECCO- 99: Proceeding of the Genetic and Evolutionary Computation Conference, July 13- 17, Orlando, Florida, USA.
Sprague, R.H., (1980) , “ A framework for the development of decision support systems,”MIS Quarterly 4(4), 1-26.
Toth, P. and Vigo, D., (1997) , “An exact algorithm for the vehicle routing problem with backhauls,” Transportation Science 31, 372-385.