參考文獻 |
乃啟育 (2006),「策略聯盟環境下城際客運排程規劃模式之研究」,碩士論文,國立中央大學土木工程學研究所。
何依栖 (1989),「都會區計程車共乘制度實施及管理之探討」,運輸計畫季刊,第十八卷,第四期,第507-518頁。
辛孟鑫 (2005),「撥召運輸系統路線規劃問題之研究-以台北市復康巴士為例」,碩士論文,國立成功大學交通管理科學研究所。
吳沛儒 (2004),「任務型共乘接駁計程車之規劃與設計」,碩士論文,私立逢甲大學交通工程與管理學研究所。
吳權哲 (2007),「都會區計程車共乘配對模式暨求解演算法之研究」,碩士論文,國立中央大學土木工程學研究所。
林士鈞 (2004),「定期貨櫃運輸船舶排程暨船期表建立之研究」,碩士論文,國立中央大學土木工程學研究所。
周文生、黃台生、黃慧娟、王裕民、詹彥倫、許采蘋 (2004),「九十三年度臺北地區計程車營運情形調查」,台北縣市政府交通局委託中華民國運輸學會辦理。
邱明琦、陳春益、林佐鼎 (2002),「海運貨櫃排程模式之研究」,運輸計劃季刊,第三十一卷,第三期,第495-522頁。
許采蘋 (2005),「計程車共乘與撥召計程車可行條件之研究」,碩士論文,國立交通大學交通運輸研究所。
陳春益、邱明琦 (2002),「貨櫃航線網路設計模式之研究」,運輸計劃季刊,第三十一卷,第二期,第267-298頁。
陳昱彰 (2006),「區位分析應用於任務型共乘接駁計程車之派遣規劃」,碩士論文,私立逢甲大學交通工程與管理學研究所。
陶治中 (2006),「智慧型運輸系統應用於高乘載計畫之示範與建置-都會區共乘系統之示範與建置(2/2)」,交通部科技顧問室。
郭瑜堅 (2003),「都市旅次成本之研究」,碩士論文,國立臺灣大學土木工程學研究所。
黃漢瑄 (2006),「撥召服務最佳化指派作業之研究」,碩士論文,私立淡江大學運輸管理學系運輸科學研究所。
詹達穎 (1994),「模擬鍛鍊法求解車輛排程之探討」,中華民國運輸學會第九屆論文研討會論文集,第185-192頁。
董又榮 (2005),「市場競爭下城際客運排程規劃模式暨求解演算法之研究」,碩士論文,國立中央大學土木工程學研究所。
楊淑芳 (2006),「以巨集啟發式演算法求解即時資訊下之中型車共乘問題」,碩士論文,私立淡江大學運輸管理學系運輸科學研究所。
韓復華、林修竹 (1999),「TA與GDA巨集啟發式法在VRPTW問題上之應用」,中華民國第四屆運輸網路研討會,第83-92頁。
韓復華、卓裕仁 (1996),「門檻接受法、成本擾動法與搜尋空間平滑法在車輛路線問題之應用研究與比較分析」,運輸學刊,第九卷,第三期,第103-129頁。
韓復華、陳國清、卓裕仁 (1997),「成本擾動法在TSP問題之應用」,中華民國第二屆運輸網路研討會論文集,第283-292頁。
韓復華、楊智凱 (1996),「門檻接受法在TSP問題上之應用」,運輸計劃季刊,第二十五卷,第二期,第163-188頁。
韓復華、楊智凱、卓裕仁 (1997),「應用門檻接受法求解車輛路線問題之研究」,運輸計畫季刊,第二十六卷,第二期,第253-280頁。
顏上堯、何淑萍 (1994),「飛航排程暨班次表之建立」,運輸計劃季刊,第二十三卷,第一期,第73-90頁。
顏上堯、周容昌、李其灃 (2002),「交通建設計畫評選模式及其解法之研究─以中小型交通建設計畫的評選為例」,運輸計畫季刊,第三十一卷,第一期,第1- 28頁。
顏上堯、翁綵穗 (2001),「季節轉換間緩衝期飛航排程之研究」,運輸計劃季刊,第三十卷,第四期,第891- 922頁。
顏上堯、陳建榮、湯慶輝 (2004),「含凹形節線成本最小成本轉運問題鄰近搜尋法之研究」,運輸計劃季刊,第三十三卷,第二期,第277-306頁。
Abara, J. (1989), “Applying integer linear programming to the fleet assignment problem,” Interfaces, Vol. 19, pp. 20-28.
Agin, N. and Cullen, D. (1975), “An algorithm for transportation routing and vehicle loading,” Logistics, pp. 1-20, North Holland, Amsterdam.
Aldaihani, M. and Dessouky, M. M. (2003), “Hybrid scheduling methods for paratransit operations,” Computers and Industrial Engineering, Vol. 45, pp. 75-96.
Alfa, A. S., Heragu, S. S. and Chen, M. (1991), “A 3-opt based simulated annealing algorithm for vehicle routing problem,” Computers and Industrial Engineering, Vol. 21, pp. 635-639
Bodin, L. D. and Sexton, T. (1986), “The multi-vehicle subscriber dial-a-ride problem,” TIMS Studies in Management Science, Vol. 2, pp. 73–86.
Borndörfer, R., Klostermeier, F., Grötschel, M. and Küttner, C. (1997), “Telebus Berlin: vehicle scheduling in a dial-a-ride system,” Technical report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.
Charon, I. and Hurdy, O. (1993), “The noising method: a new method for combinatorial optimization,” Operations Research Letters, Vol. 14, pp. 133-137.
Clarke, L. W., Hane, C. A., Johnson, E. L. and Nemhauser, G. L. (1996), “Maintenance and crew considerations in fleet assignment, ” Transportation Science, Vol.30, pp. 249-260.
Colorni, A. and Righini, G. (2001), “Modeling and optimizing dynamic dial-a-ride problems,” International Transactions in Operational Research, Vol. 8, pp. 155–166.
Cordeau, J.-F. (2006), “A Branch-and-cut algorithm for the dial-a-ride problem,” Operations Research, Vol. 54, pp. 573–586.
Cordeau, J.-F. and Laporte, G. (2003), “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research Part B, Vol. 37, pp. 579–594.
Coslovich, L., Pesenti, R. and Ukovich, W. (2006), “A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem”, European Journal of Operational Research, Vol. 175, pp. 1605–1615.
Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F. (1997), “Daily aircraft routing and scheduling,” Management Science, Vol. 43, pp. 841-855.
Desrosiers, J., Dumas, Y. and Soumis, F. (1986), “A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows,” American Journal of Mathematical and Management Sciences, Vol. 6, pp. 301–325.
Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S. and Villeneuve, D. (1991), “An algorithm for mini-clustering in handicapped transport,” Les Cahiers du GERAD, G-91-02, HEC Montréal.
Diana, M. and Dessouky, M.M. (2004), “A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows,” Transportation Research Part B, Vol. 38, pp. 539-557.
Dial, R. B. (1995), “Autonomous Dial-a-ride transit introductory overview,” Transportation Research Part C, Vol. 3, No. 5, pp. 261-275.
Dorigo, M., Maniezzo, V. and Colorni, A. (1996), “The ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics Part B, Vol. 26, No. 1, pp. 29-41.
Dueck, G. (1993), “New optimization heuristics: the great deluge algorithm and the record-to-record travel,” Journal of Computational Physics, Vol. 104, pp. 86-92.
Dueck, G. and Scheuer, T. (1990), “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing,” Journal of Computational Physics, Vol. 90, pp. 161-175.
Dumas, Y., Desrosiers, J. and Soumis, F. (1989), “Large scale multi-vehicle dial-a-ride problems,” Les Cahiers du GERAD, G-89-30, HEC Montréal.
Fu L. (2002a), “A simulation model for evaluating advanced dial-a-ride paratransit systems,” Transportation Research Part A, Vol. 36, pp. 291-307.
Fu, L. (2002b), “Scheduling dial-a-ride paratransit under time-varying, stochastic congestion,” Transportation Research Part B, Vol. 36, pp. 485-506.
Garey, M.R. and Johnson, D.S. (1979), Computers and intractability: a guide to the theory of NP-completeness, San Francisco, CA: Freeman.
Glover, F. and Laguna, M. (1997), Tabu search, Kluwer Academic Publishers, Boston, London, Dordrecht.
Glover, F. (1989), “Tabu search- part I,” ORSA Journal on Computing, Vol. 1, No. 3, pp. 190-206.
Glover, F. (1990), “Tabu search- part II,” ORSA Journal on Computing, Vol. 2, No. 1, pp. 4-32.
Goldberg, D. E. (1989), Genetic algorithms in search, optimization, and machine Learning, Addison-Wesley, Reading, MA.
Golden, B. L. and Skiscim, C. C. (1986), “Using stimulated annealing to solve routing and location problems,” Naval Research Logistic Quarterly, Vol. 33, pp. 261-279.
Gu, J. and Huang, X. (1994), “Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP),” IEEE Transaction on Systems, Man and Cybernetics, Vol. 24, pp. 728-739.
Hane, C. A., Barnhart, C., Johnson, E. L., Marsten, R., Nemhauser, G. L. and Sigismondi, G. (1995), “The fleet assignment problem: solving a large-scale integer program,” Mathematical Programming Study, Vol. 70, pp. 211-232.
Horn, M.E.T. (2002), “Fleet scheduling and dispatching for demand-responsive passenger services,” Transportation Research Part C, Vol. 10, pp. 35-63.
Hu, N. (1992), “Tabu search method with random moves for globally optimal design,” International Journal for Numerical Methods in Engineering, Vol. 35, pp. 1055-1070.
Hunsaker, B. and Savelsbergh, M. (2002), “Efficient feasibility testing for dial-a-ride problems,” Operations Research Letters, Vol. 30, pp. 169-173.
Ioachim, I., Desrosiers, J., Dumas, Y. and Solomon, M. M. (1995), “A request clustering algorithm for door-to-door handicapped transportation,” Transportation Science, Vol. 29, pp. 63–78.
Kirkpatrick, S., Gelatt, C. D. and Vecchi, M.P. (1983), “Optimization by simulated annealing,” Science, Vol. 220, pp. 671-680.
Jaw, J., Odoni, A. R., Psaraftis, H. N. andWilson, N. H. M. (1986), “A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows,” Transportation Research Part B, Vol. 20, pp. 243–257.
Jørgensen, R. M., Larsen, J. and Bergvinsdottir, K. B. (2007), “Solving the dial-a-ride problem using genetic algorithms,” Journal of the Operational Research Society, Vol. 58, Issue 10, pp. 1321-1331.
Lee, K.T., Wu, P.J. and Wang, S.H. (2004), “The planning and design of taxipooling on feeder system,” Networking, Sensing and Control, 2004 IEEE International Conference, Taipei, Taiwan.
Lee, B. C. (1986), “Routing problem with service choices, flight transportation laboratory,” Report R86-4, Massachusetts Institute of Technology, MA.
Levin, A. (1971), “Scheduling and fleet routing models for transportation systems,” Transportation Science, Vol. 5, pp. 232-255.
Levin, A. (1969), “Some fleet routing and scheduling problems for air transportation systems,” Flight Transportation Laboratory Report R68-5, Massachusetts Institute of Technology, MA.
Madsen, O. B. G., Ravn, H. F. and Rygaard, J. M. (1995), “A heuristic algorithm for the a dial-a-ride problem with time windows, multiple capacities, and multiple objectives,” Annals of Operations Research, Vol. 60, pp. 193–208.
Melachrinoudis, E., Ilhan, A. B. and Min, H. (2007), “A dial-a-ride problem for client transportation in a healthcare organization,” Computers and Operations Research, Vol. 34, pp. 742–759.
Osman, I. H. and Kelly, J. P. (1996), “Meta-heuristics: an overview,” Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Boston, London, Dordrecht, pp. 1-21.
Psaraftis, H. N. (1980), “A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem,” Transportation Science, Vol. 14, pp. 130–154.
Psaraftis, H. N. (1983), “An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows,” Transportation Science, Vol. 17, pp. 351–357.
Reeves, C. R. (1993), “Improving the efficiency of tabu search for machine sequencing problems,” Journal of the Operation Research Society, Vol. 44, No. 4, pp. 375-382.
Rekiek, B., Delchambre, A. and Saleh, H. A. (2006), “Handicapped person transportation: an application of the grouping genetic algorithm,” Engineering Application of Artificial Intelligence, Vol. 19, pp. 511–520.
Robuste, F., Daganzo, C. F. and Souleyrette, R. (1990), “Implementing vehicle routing models,” Transportation Research Part B, Vol. 24, No. 4, pp. 263-286.
Ropke, S., Cordeau, J.-F. and Laporte, G. (2007), “Models and branch-and-cut algorithms for pickup and delivery problems with time windows,” Networks, Vol. 49, pp. 258–272.
Lau, S. W. (1998), “Autonomous dial-a-ride transit benefit-Cost evaluation,” Volpe National Transportation Systems Center.
Sexton, T. (1979), The single vehicle many-to-many routing and scheduling problem, Ph.D. dissertation, SUNY at Stony Brook.
Sexton, T. and Bodin, L. D. (1985a), “Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling,” Transportation Science, Vol. 19, pp. 378–410.
Sexton, T. and Bodin, L. D. (1985b), “Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing,” Transportation Science, Vol. 19, pp. 411–435.
Simpson, R.W. (1969), A review of scheduling and routing model for airline scheduling, IX AGIFORS Symposium, Broadway, England.
Sinclair, M. (1993), “Comparison of the performance of modern heuristic for combinatorial optimization on real data, ” Computers and Operations Research, Vol. 20, No. 7, pp. 687-695.
Subramanian, R., Scheff, R. P., Quillinan, J. D., Wiper, D. S. and Marsten, R. E. (1994), “Coldstart: fleet assignment at delta air lines,” Interface, Vol. 24, pp. 104-120.
Teodorovic, D. (1988), Airline operations research, Gordon and Breach Science Publishers, New York.
Teodorovic, D. and Guberinic, S. (1984), “Optimal dispatching strategy on an airline network after a schedule perturbation,” European Journal of Operational Research, Vol. 15, pp. 178-182.
Teodorovic, D. and Radivojevic, G. (2000), “A fuzzy logic approach to dynamic dial-a-ride problem,” Fuzzy Sets and Systems, Vol. 116, pp. 23–33.
Toth, P. and Vigo, D. (1996), “Fast local search algorithms for the handicapped persons transportation problem,” In I. H. Osman and J. P. Kelly (Eds.), Meta-heuristics: theory and applications, pp. 677–690, Boston: Kluwer.
Toth, P. and Vigo, D. (1997), “Heuristic algorithms for the handicapped persons transportation problem,” Transportation Science, Vol. 31, pp. 60–71.
Wolfler Calvo, R. and Colorni, A. (2007), “An effective and fast heuristic for the dial-a-ride problem,” 4OR: A Quarterly Journal of Operations Research, Vol. 5, pp. 61–73.
Wong, K. I. and Bell, M. G. H. (2006), “Solution of the dial-a-ride problem with multi-dimensional capacity constraints,” International Transactions in Operational Research, Vol. 13, pp. 195–208.
Xiang, Z., Chu, C. and Chen, H. (2006), “A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints,” European Journal of Operational Research, Vol. 174, pp. 1117-1139.
Yan, S. and Chen, H.L. (2002), “A scheduling model and a solution algorithm for inter-city bus carriers,” Transportation Research Part A, Vol. 36, pp. 805-825.
Yan, S. and Chen, C.H. (2007), “Coordinated flight scheduling models for allied airlines,” Transportation Research Part C, Vol. 15, pp. 246-264.
Yan, S. and Luo, S.C. (1999), “Probabilistic local search algorithms for concave cost transportation network problems,” European Journal of Operational Research, Vol. 117, pp. 511-521.
Yan, S. and Tseng, C.H. (2002), “A passenger demand based model for airline flight scheduling and fleet routing,” Computers and Operations Research, Vol. 29, pp. 1559-1581.
Yan, S. and Shih, Y.L. (2006), “A time-space network model for work team scheduling after a major disaster”, Journal of the Chinese Institute of Engineers ,Vol. 30, No. 1, pp. 63-75.
Yan, S. and Young, H.F. (1996), “A decision support framework for multi-fleet routing and multi-stop flight scheduling,” Transportation Research Part A, Vol. 30, pp. 379-398.
Yan, S., Tang, C.H. and Shieh, C.N. (2005), “A simulation framework for evaluating airline temporary schedule adjustments following incidents,” Transportation Planning and Technology, Vol. 28, No. 3, pp. 189-211.
Yan, S., Chi, C.J. and Tang, C.H. (2006b), “Inter-city bus routing and timetable setting under stochastic demands,” Transportation Research Part A, Vol. 40, pp. 572-586.
Yan, S., Chen, S.C. and Chen, C.H. (2006a), “Air cargo fleet routing and timetable setting with multiple on-time demands,” Transportation Research Part E, Vol. 42, Issue 5, pp. 409-430. |