[Back to Results | New Search]

Student Number 83342012 Author Ming-Der May(梅明德) Author's Email Address No Public. Statistics This thesis had been viewed 464 times. Download 0 times. Department Civil Engineering Year 1998 Semester 2 Degree Ph.D. Type of Document Doctoral Dissertation Language zh-TW.Big5 Chinese Title The Model and Solution Algorithms for On-line Vehicle Routing Problem with Time Windows Date of Defense Page Count 303 Keyword anytime algorithm empirical study and analysis heuristic algorithm on-line algorithm Vehicle routing problem with time windows Abstract In the large amount of literature about Vehicle Routing and Scheduling Problems (VRSP), most of them are focused on static and planning problems, and the on-line version of these problems still do not received enough attentions now. Therefore, the purpose of this study is to clarify the meanings of this on-line Vehicle Routing Problem with Time Windows (OVRPTW) and to design models and solution algorithms for it. This problem differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The data structure of new arrived request is designed as a linking list, and is noted as a dynamic queuing list (DQL). To achieve the requirement of on-line computing, this study develops route construction heuristics based on the concepts of on-line algorithms, and route improvement methods based on anytime algorithms. Three serving policies that have different kinds of last departure time are proposed to evaluate the relations between departure time and the quality of on-line solutions. All the proposed heuristic algorithms are evaluated in the empirical study. The on-line test problems are modified from the problems used in Solomon (1983). According to these comprehensive computational results, the proposed solution algorithms and frameworks are adequate in solving the OVRPTW. Furthermore, the different departure time policies have significant impact on the solution quality, and more temporal or spatial serving policies are encouraged to provide better on-line solutions. Finally, these analyses provide many detailed insights of the OVRPTW and could enhance the development of future study. Table of Content 封面

摘要

英文摘要

誌謝

目錄

圖目錄

表目錄

第一章 緒論

1.1 研究動機與目的

1.2 研究內容與範圍

1.3 論文架構

第二章 相關研究與文獻回顧

2.1 緒論

2.2 時窗限制車輛路線問題

2.3 動態車輛路線問題與模式

2.4 相關應用研究

2.5 先進科技應用

2.6 線上型演算法

2.7 隨時演算法

2.8 小結

第三章 問題界定與求解方式分析

3.1 動態模式與線上型模式探討

3.2 線上型時窗限制車輛路線問題

3.3 線上求解課題與策略

3.4 線上型VRPTW演算法設計

3.5 線上型測試問題集產生

3.6 小結

第四章 線上型路線建構演算法

4.1 緒論

4.2 先適型演算法

4.3 最適型演算法

4.4 線上型SOLOMON插入式啟發法

4.5 線上測試流程

4.6 實例測試

4.7 批次處理測試與分析

4.8 本章小結

第五章 線上型路線改善演算法

5.1 緒論

5.2 基本求解架構

5.3 線上改善之可用時間計算

5.4 時間限制式處理與時間變數更新

5.5 路線內與路線間交換方式設計

5.6 隨機性線上改善法

5.7 確定性線上改善法

5.8 小結

第六章 整合式線上求解流程與實例測試

6.1 整合式線上求解流程

6.2 線上型VRPTW求解測試與簡例示範

6.3 不同線上型求解演算法的比較

6.4 不同最晚發時間的比較

6.5 不同測試問題類型之間的比較

6.6 其他特性分析與比較

6.7 本章小結

第七章 結論與建議

7.1 結論

7.2 後續研究

參考文獻

一、中文部份

二、英文部份Reference 一、英文部份

Anderson, S., Verweij, C.A., and Jorna, R.A.M., 1996, Satellite communication in road freight operations: the METAFORA experience, International Journal of Physical Distribution & Logistics Management, Vol. 26, No. 1, pp. 49-61.

Aronson, J. E., 1989, A survey of dynamic network flows, Annals of Operations Research, Vol. 20, pp. 1-66.

Aspnes, J., Azar, Y., Fiat, A., Plotkin, S. and Waarts, O., 1997, On-line routing of virtual circuits with applications to load balancing and machine scheduling, Journal of the ACM, Vol. 44, No. 3, pp. 486-504.

Azar, Y., Naor, J., and Rom, R., 1995, The competitiveness of online assignments, JOURNAL OF ALGORITHMS, Vol. 18, Iss. 2, pp. 221-237.

Baaj, M. H., Ashur, S.A., Chaparrofarina, M. and Pijawka, K. D., 1995, Design of routing networks using geographic information systems: applications to solid and hazardous waste transportation planning, Transportation Research Record 1497, pp. 140-144.

Badeau, P., Guertin F., Gendreau, M., and Potvin, J. V., 1997, A parallel tabu search heuristic for the vehicle routing problem with time windows, Transportation Research Part C, Vol. 5, No. 2, pp. 109-122.

Bagchi, P. K. and Nag, B. N., 1991, Dynamic vehicle scheduling: an expert systems approach, International Journal of Physical Distribution and Logistics Management, Vol. 21, No. 2, pp. 10-18.

Ball, M. O., Magnanti, T. L., Monma, C. L. and Nemhauser, G. L., 1995, Network Routing, Handbooks in Operations Research and Management Science, Vol. 8, Elsevier Science B. V., The Netherlands.

Ballou, R. H. and Agarwal, Y. K., 1988, A performance comparison of several popular algorithms for vehicle routing and scheduling, Journal of Business logistics, Vol. 9, No. 1, pp. 51-65.

Ballou, R. H., 1990, A continued comparison of several popular algorithm for vehicle routing and scheduling, Journal of Business logistics, Vol. 11, No. 1, pp. 111-126.

Baruah, S. K. and Hickey, M. E., 1996, Competitive on-line scheduling of imprecise computations, Proceedings of the 29th annual Hawaii international conference on system sciences, pp. 460-468.

Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D. and Wang, F., 1991, On the competitiveness of on-line real-time task scheduling, Proceedings of twelfth real-time system symposium, IEEE computer society press, San Antonio, TX, USA, pp. 106-115.

Bausch, D. O., Gerald G. B. and Ronen, D., 1995, Consolidating and dispatching truck shipments of Mobil heavy petroleum products, INTERFACES, Vol. 25, No. 2, pp. 1-17.

Beerens, J. A. J., 1993, Fleet monitoring with GPS and satellite communications, GPS World, April, pp. 42-46.

Bell, W. J., Dalberto, L. M., Fisher, M. L., Greenfield, A. J., Jaikumar, R., Kedia, P., Mack, R. G. and Prutzman, P. L., 1983, Improving the dispatching of industrial gases with an on-line computerized routing and scheduling optimizer, INTERFACES, Vol. 13, No. 6, pp. 4-23.

Beroggi, G. E. G., 1994, A real-time routing model for hazardous materials, European Journal of Operational Research, Vol. 75, Iss. 3, pp. 508-520.

Bertsimas, D.J. and van Ryzin G., 1993, Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles, Operations Research, Vol. 41, No. 1, pp. 60-76.

Bertsimas, D.J. and van Ryzin, G., 1991, A stochastic and dynamic vehicle routing problem in the Euclidean plane, Operations Research, Vol. 39, No. 4, pp. 601-615.

Bjorndal, M.H., Caprara, A., Cowling, P.I., Croce, F.D., Lourenco, H., Malucelli, F., Orman, A.J., Pisinger, D., Rego, C. and Salazar, J.J., 1995, Some thoughts on combinatorial optimisation, European Journal of Operational Research, Vol. 83, pp. 253-270.

Boddy, M. and Dean, T. L., 1989, Solving time-dependent planning problems. Proceedings of the Eleventh International Joint Conference on Artificial intelligence, Detroit, Michigan, pp. 979-984.

Bodin, L., Golden, B., Assad, A. and Ball, M., 1983, Routing and Scheduling of Vehicles and Crews, the state of the art, Computers & Operations Research, special issue, Vol. 10, No. 2.

Bodin, L.D., 1990, Twenty years of routing and scheduling, Operations Research, Vol. 38, No. 4, pp. 571-579.

Brown, G. G. and Graves, G. W., 1981, Real-time dispatch of petroleum tank trucks, Management science, Vol. 27, No. 1, pp. 19-32.

Brown, G. G., Ellis, C. J., Graves, G. W. and Ronen, D., 1987, Real-time, wide area dispatch of Mobil tank trucks, INTERFACES, Vol. 17, No. 1, pp. 107-120.

Camm, J.D., Chorman, T.E., Dill, F. A., Evans, J. R., Sweeney, D. J. and Wegryn, G. W., 1997, Blending OR/MS, judgement, and GIS: restructuring P&G's supply chain, INTERFACES, Vol. 27, No. 1, pp. 128-142.

Chen, B., van Vliet, A. and Woeginger, G. J., 1994, New lower and upper-bounds for online scheduling, OPERATIONS RESEARCH LETTERS, Vol. 16, Iss. 4, pp. 221-230.

Cheung, R. K., Chen, C.-Y., 1998, A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem, Transportation Science, Vol. 32, No. 2, pp. 142-162.

Cheung, R. K.-M. and Powell, W. B., 1996a, An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management, Operations Research, Vol. 44, No. 6, pp. 951-963.

Cheung, R. K.-M. and Powell, W. B., 1996b, Models and algorithms for distribution problems with uncertain demands, Transportation Science, Vol. 30, Iss. 1, pp. 43-59.

Crainic, T. G. and Laporte, G., 1997, Planning models for freight transportation, European Journal of Operational Research, Vol. 97, No. 3, pp. 409-438.

Daganzo, C. F., 1987a, Modeling distribution problems with time windows: part I, Transportation Science, Vol. 21, No. 3, pp. 171-179.

Daganzo, C. F., 1987b, Modeling distribution problems with time windows: part II: two customer types, Transportation Science, Vol. 21, No. 3, pp. 180-187.

Dean, T. L. and Boddy, M., 1988, An analysis of time-dependent planning. Proceedings of the Seventh National Conference on Artificial intelligence, pp. 49-54, Minneapolis, Minnesota.

Desrochers, M., Desrosiers, J. and Solomon, M., 1992, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, Vol. 40, pp. 342-354.

Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.P. and Soumis, F., 1988, Vehicle routing with time windows: optimization and approximation, In Golden B. L. and Assad, A. A., Eds. Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam, pp. 65-84.

Desrosiers, J., Dumas, Y., Solomon, M. M. and Soumis, F., 1995, Time constrained routing and scheduling, In M. O. Ball et al., Eds. Handbooks in OR & MS, Vol. 8, pp. 141-296.

Duhamel, C., Potvin, J. Y. and Rousseau, J. M., 1997, A tabu search heuristics for the vehicle routing problem with backhauls and time windows, Transportation Science, Vol. 31, No. 1, pp. 49-59.

Elkan, C., 1990, Incremental, approximate planning: adductive default reasoning. Proceedings of the AAAI Spring Symposium on Planning in Uncertain Environments, Palo Alto, Carlifronia.

Fisher M. L., Jornsten, K. O. and Madsen, O. B. G., 1997, Vehicle routing with time windows: two optimization algorithms, Operations Research, Vol. 45, No. 3, pp. 488-492.

Frantzeskakis, L.F. and Powell, W. B., 1990, A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems, Transportation Science, Vol. 24, No. 1, pp. 40-57.

Garey M. R. and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.

Gavish, B., 1981, A decision support system for managing the transportation needs of a large corporation, AIIE Transactions, Vol. 13, pp. 61-85.

Goetschalckx, M., 1988, A decision support system for dynamic truck dispatching, International Journal of Physical Distribution and Materials Management, special edition: Application of new technologies, methods and approaches to logistics, pp. 34-42.

Golden, B. L. and Assad, A. A., 1988, Vehicle Routing: Methods and Studies, Elsevier Science Publishers, North-Holland.

Grass, J. and Zilberstein, S., 1996, Anytime algorithm development tools, SIGART Bulletin, Vol. 7, No. 2, pp. 20-27.

Guo, B. and Poling, A. D., 1995, Geographic information system/global positioning systems design for network travel time study, Transportation Research Record 1497, pp. 135-139.

Hall, R. W., 1996, Pickup and delivery systems for overnight carriers, Transportation Research, Part A, Vol. 30, No. 3, pp. 173-187.

Hemminki, J., Leipala, T. and Nevalainen, O., 1998, On-line packing with boxes of different sizes, International Journal of Production Research, Vol. 36, No. 8, pp. 2225-2245.

Horvitz, E. J., 1987, Reasoning about beliefs and actions under computational resource constraints. Proceedings of the 1987 Workshop on Uncertainty in Artificial intelligence, Seattle, Washington.

Kohl, N. and Madsen, O. B.G., 1997, An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation, Operations Research, Vol. 45, No. 3, pp. 395-406.

Kolen, A.W.J., Rinnooy Kan, A. H. G. and Trienekens, H. W. J. M., 1987, Vehicle routing with time windows, Operations research, Vol. 35, No. 2, pp. 266-273.

Kontoravdis, G. and Bard, J. F., 1995, A GRASP for the vehicle routing problem with time windows", ORSA(Inform) journal on computing, Vol. 7, No. 1, pp. 10-23.

Korf, R. E., 1998, A complete anytime algorithm for number partitioning, Artificial Intelligence, Vol. 106, No. 2, pp. 181-204.

Langevin, A., Mbaraga, P. and Campbell, J. F., 1996, Continuous approximation models in freight distribution: an overview, Transportation Research Part B, Vol. 30, No. 3, pp. 163-188.

Laporte, G. 1992, The vehicle routing problem: an overview of exact and approximate algorithms, European Journal of Operational Research, Vol. 59, pp. 345-358.

Laporte, G. and Osman, I. H., (Eds.) 1996, Metaheuristics in Combinatorial Optimization, Annals of Operations Research, Vol. 63, Baltzer Science Publications, The Netherlands.

Laporte, G. and Osman, I. H., 1995, Routing problems: A bibliography, Annals of Operations Research, Vol. 61, pp. 227-262.

Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., (Eds.) 1985, Traveling Salesman Problem-A Guide Tour of Combinatorial Optimization, John Wiley & Sons Ltd.

Leung, J.Y.T., Tam, T.W. and Young, G.H., 1996, Online routing of real-time messages, Journal of Parallel and Distributed Computing, Vol. 34, Iss. 2, pp. 211-217.

Li, R. and Shi, L, 1998, An on-line algorithm for some uniform processor scheduling, SIAM Journal on Computing, Vol. 27, No. 2, pp. 414-422.

Lin, S. and Kernighan, B., 1973, An effective heuristics algorithm for the traveling salesman problem, Operations Research, Vol. 21, pp. 498-516.

Lin, S., 1965, Computer solutions of the traveling salesman problem, Bell System Technical Journal, Vol. 44, pp. 2245-2269.

Lysgaard, J., 1992, Dynamic transportation networks in vehicle routing and scheduling, INTERFACES, Vol. 22, No. 3, pp. 45-55.

Marchettispaccamela, A. and Vercellis, C., 1995, Stochastic online knapsack-problems, Mathematical Programming, Vol. 68, Iss. 1, pp. 73-104.

McLellan, J. F., Krakiwsky, E. J., and Schleppe, J. B., 1993, Application of GPS positioning to management of mobile operation, Journal of Surveying engineering, ASCE, Vol. 119, No. 2, pp. 71-83.

Or, I., 1976, Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking. Ph.D. Thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.

Papastavrou, J.D., 1996, A stochastic and dynamic routing policy using branching-processes with state-dependent immigration, European Journal of Operational Research, Vol. 95, Iss. 1, pp. 167-177.

Potvin J.Y. and Bengio, S., 1996, The vehicle routing problem with time windows, part II: genetic search", INFORMS Journal on Computing, Vol. 8, No. 2, pp. 165-172.

Potvin J.Y., Kervahut, T., Garcia, B.L., and Rousseau, J.M., 1996, The vehicle routing problem with time windows, part I: tabu search, INFORMS Journal on Computing, Vol. 8, No. 2, pp. 158-164.

Powell, W. B, 1996, A stochastic formulation of the dynamic assignment problem with an application to truckload motor carriers, Transportation Science, Vol. 30, Iss. 3, pp. 195-219.

Powell, W. B., 1988, A comparative review of alternative algorithms for the dynamic vehicle allocation problem with uncertain demands, In B.L. Golden and A.A. Assad, Eds. Vehicle Routing: Methods and Studies, Elsevier Science Publishers, North-Holland, pp. 249-292.

Powell, W. B., Carvalho, T. A., Godfrey, G. A., and Simao, H. P., 1995, Dynamic fleet management as a logistics queuing network, Annals of Operations Research, 1995, Vol. 61, pp. 165-188.

Powell, W. B., Jaillet, P. and Odoni, A., 1995, Stochastic and dynamic networks and routing, In Ball, M. O., Magnanti, T. L., Monma, C. L. and Nemhauser, G. L., Eds. Handbooks in OR & MS, Vol. 8, Network Routing, Elsevier Science B. V., The Netherlands, pp. 141-295.

Powell, W.B., Cheung, R. K.-M., 1994b, Stochastic program over trees with random arc capacities, Networks, Vol. 24, pp. 161-175.

Powell, W.B., Cheung, R.K-M., 1994a, A network recourse decomposition method for dynamic networks with random arc capacities, Networks, Vol. 24, pp. 369-384.

Prastacos, P., 1991, Integrating GIS technology in urban transportation planning and modeling", Transportation Research Record 1305, pp. 123-130.

Psaraftis, H. N., 1980, A dynamic programming solution 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, No. 3, pp. 351-357.

Psaraftis, H. N., 1988, Dynamic vehicle routing problems, In B.L. Golden and A.A. Assad, Eds. Vehicle Routing: Methods and Studies, Elsevier Science Publishers, North-Holland, pp. 223-248.

Psaraftis, H. N., 1995, Dynamic vehicle routing - status and prospects. Annals of Operations Research, Vol. 61, 1995, pp. 143-164.

Psaraftis, H. N., Orlin, J. B., Bienstock, D. and Thompson, P. M., 1985, Analysis and solution algorithms of sealift routing and scheduling problems: final report, Working Paper, No. 1700-85, Sloan School of Management, MIT.

Reeves, C. R., (Eds.) 1993, Modern Heuristic Techniques for Combinatorial Problems, John Wiley & Sons, Inc., New York.

Regan, A. C., Mahmassani, H. S. and Jaillet, P., 1998, Evaluation of dynamic fleet management systems: a simulation framework, Transportation Research Record 1645, pp. 176-184.

Regan, A.C., Mahmassani, H. S. and Jaillet P., 1995, Improving efficiency of commercial vehicle operations using real-time information: potential uses and assignment strategies", Transportation Research Record 1493, pp. 188-198.

Regan, A.C., Mahmassani, H. S. and Jaillet, P., 1996, Dynamic decision making for commercial fleet operations using real-time information, Transportation Research Record 1537, pp. 91-97.

Rochat, Y. and Taillard, E., 1995, Probabilistic Diversification and Intensification in Local Search for Vehicle Routing, Journal of Heuristics, Vol. 1, No. 1, pp. 147-167, 1995.

Russell, S. J. and Zilberstein, S., 1991, Composing real-time systems, Proceedings of the Twelfth International Joint Conference on Artificial intelligence, Sydney, Austria, pp. 212-217.

Savelsbergh, M. and Sol, M., 1998, Drive: dynamic routing of independent vehicles, Operations Research, Vol. 46, No. 4, pp. 474-490.

Savelsbergh, M. W. P., 1985, Local search in routing problems with time windows, Annual of Operations Research, Vol. 4, pp. 285-305.

Schrijver, P.R. and Sol, H.G., 1992, Planning support for real-time fleet management of road transportation, In Jelassi, T., Klein, M. R. and Mayon-White, W. M. Eds. Decision Support Systems: Experiences and Expectations, Elsevier Science Pub., pp. 115-132.

Sedgewick, R., 1988, Algorithms, second ed., Addison-Wesley Publishing Company, Inc., New York.

Seguin, R., Potvin, J. Y., Gendreau, M., Crainic, T.G. and Marcotte, P., 1997, Real-time decision problems: an operational research perspective, Journal of the Operational Research Society, Vol. 48, pp. 162-174.

Sgall, J, 1996, Randomized online scheduling of parallel jobs, Journal of Algorithms, Vol. 21, No. 1, pp. 149-175.

Sgall, J, 1997, A lower bound for randomized on-line multiprocessor scheduling, Information Processing Letters, Vol. 63, No. 2, pp. 51-55.

Sleator, D. D. and Tarjan, R. E., 1985, Amortized efficiency of list update and paging rules, Communications of the ACM, Vol. 28, No. 2, pp. 202-208.

Smith, K. P. and Liu, J. W. S., 1989, Monotonically improving approximate answer to relational algebra queries, COMPSAC-89, Orlando, Florida.

Solomon, M. M., 1983, Vehicle routing and scheduling with time window constraints: models and algorithms, Ph.D. Dissertation, Department of Decision Sciences, University of Pennsylvania.

Solomon, M. M., 1986, On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints, Networks, Vol. 16, pp. 161-174.

Solomon, M. M., 1987, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, Vol. 35, No. 2, pp. 254-265.

Solomon, M. M., Baker, E. K. and Schaffer, J. R., 1988, Vehicle routing and scheduling problems with time window constraints: efficient implementations of solution improvement procedures, In Golden B.L. and Assad, A.A., Eds, Vehicle Routing: Methods and Studies, Elsevier Science Publishers, Amsterdam, pp. 85-105.

Stein, D. M., 1978a, An asymptotic probabilistic analysis of a route problem, Mathematics of Operations Research, Vol. 3, No. 2, pp. 89-101.

Stein, D. M., 1978b, Scheduling dial-a-ride transportation systems, Transportation Science, Vol. 12, No. 3, pp. 232-249.

Strosnider, J. K. and Paul, C. J., 1993, A structured view of real-time problem solving, AI Magazine, Vol. 15, No. 2, pp.45-66.

Thangiah, S. R. and Gubbi, A. V., 1993, Effect of genetic sectoring on vehicle routing problems with time windows, IEEE International Conference on Developing and Managing Intelligent System Projects, pp. 146-153.

Thangiah, S. R. Osman, I. H. and Sun, T., 1994, Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows, working paper UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury.

Tsai, Y.T., Tang, C.Y. and Chen, Y.Y., 1996, An average-case analysis of a greedy algorithm for the online Steiner tree problem, Computers and Mathematics with Applications, Vol. 31, No. 11, pp. 121-131.

Tzeng, G.-H. and Tu, S.-W., 1992, Multiobjective and fuzzy time-window heuristic method in vehicle routing problems, Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Taipei, R.O.C.

Tzeng, G.-H., Huang, W.-C. and Teodorovic, D., 1997, Spatial and temporal bi-criteria parallel-savings-based heuristic algorithm for solving vehicle routing problems with time windows, Transportation Planning and Technology, Vol. 20, No. 2, pp. 163-181.

van Vliet, A., 1992, An improved lower bound for on-line bin packing algorithms, Information Processing Letters, Vol. 43, pp. 277-284.

Westbrook, J., Yan, D.C.K., 1995, The performance of greedy algorithms for the online Steiner tree and related problems, Mathematical Systems Theory, Vol. 28, No. 5, pp. 451-468.

Wilson, N. H. M., Sussman, J. M., Hwang, H. K., and Higonett, B. T., 1971, Scheduling algorithms for dial-a-ride systems, Urban Systems Laboratory, Report USL TR-70-13, MIT.

Zhang, G., 1996, Worst-case analysis of the FFH algorithm for online variable-sized bin packing, Computing, Vol. 56, No. 2, pp. 65-172.

Zilberstein, S. and Russell, S. J., 1993, Anytime sensing, planning and action: A practical model for robot control. Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp. 1402-1407, Chambery, France.

Zilberstein, S. and Russell, S. J., 1996, Optimal composition of real-time systems, Artificial Intelligence, Vol. 82, No. 1-2, pp. 181-213.

Zilberstein, S., 1996, Using anytime algorithms in intelligent systems, AI Magazine, Vol. 17, No. 3, pp. 73-86.

二、中文部份

申生元(1998)，時窗限制車輛途程問題，國立交通大學工業工程與管理研究所博士論文。

交通部運輸研究所(1997)，建立台北市示範性公車動態資訊顯示系統，委託國立中央大學及立皓科技公司執行。

杜世文(1992)，多目標與模糊時窗貨物配送啟發式解法之研究， 交通大學交通運輸研究所碩士論文。

卓訓榮，史習平(1997)，全球定位系統、運輸地理資訊系統與無線電通訊之系統整合製作方法，運輸計劃季刊，第26卷，2期，頁379-398。

周建新(1995)，以隨時演算法解決及時性路徑規劃問題，國立臺灣大學資訊工程學研究所碩士論文。

易德華(1997)，軟時窗車輛巡迴問題之研究，國立中央大學土木工程研究所碩士論文。

林宗智(1989)，多目標不同需求的多車巡迴問題之決策支援系統，國立清華大學工業工程研究所碩士論文。

林書銘(1997)，塔布搜尋法於含時窗與裝載限制車輛途程問題解算之研究，元智大學工業工程研究所碩士論文。

林崑隆(1995)，交通擁塞與時間窗口限制下車輛派送問題之啟發式解法，國立中央大學工業管理研究所碩士論文。

翁慧真(1992)，用遺傳演算法解有界整數規劃問題，國立臺灣大學資訊工程研究所碩士論文。

張學孔(1994)，先進大眾運輸使用者即時資訊系統技術評估之研究，國立台灣大學土木工程研究所執行

梅明德(1994)，地理資訊系統輔助物流中心即時配送系統之研究， 中央大學土木工程研究所運工組碩士論文。

陳正元(1992)，節省法與路線間交換改善法在車輛路線問題上之應用，國立交通大學土木工程研究所運輸工程管理組碩士論文。

陳春益(1993)，兩階式分解演算法應用於隨機動態多型式運具調度模式之研究，運輸計劃季刊，第22卷，第1期，頁1-33。

陳春益(1996)，國內物流中心配送系統之探討，運輸學刊，第九卷，第一期，頁65-80。

陳煌儒(1996)，企業運輸配送問題暨模式探討，黎明學報，第10卷，第1期，頁117-123。

黃文昌(1992)，時窗限制下貨物配送問題求解方法之研究-時空雙準則平行節省法之研擬，交通大學交通運輸研究所碩士論文。

廖亮富(1997)，含時窗限制多部車車輛途程問題解算之研究，元智大學工業工程研究所碩士論文。

趙孝蜀 (1992)，三個計算幾何學問題的即時演算法，國立清華大學資訊科學學系碩士論文。

蔡英德 (1993)，隨機線上演算法之研究，國立清華大學資訊科學學系博士論文。

錢炳全 (1992)，多堆疊問題之線上演算法的研究，國立交通大學資訊工程研究所博士論文。

謝浩明、梅明德(1996)，整合性貨物配送管理系統之發展，1996國際商業物流管理研討會論文集，頁363-375。

韓復華(1995)，現代化科技於物流配送上之應用，商業現代化雙月刊，第12期，頁28-34。

韓復華、卓裕仁(1996)，門檻接受法、噪音擾動法與搜尋空間平滑法在車輛路線問題之應用研究與比較分析，運輸學刊，第9卷，第3期，頁113-143。

韓復華、楊智凱、卓裕仁(1997)，應用門檻接受法求解車輛路線問題之研究，運輸計劃季刊，第26卷，第2期，頁253-280。

蘇雄義、張學孔(1993)，網枝途程問題之設定與求解，運輸計劃季刊，第22卷，第2期，頁139-166。Advisor How-Ming Shieh(謝浩明)

Files No Any Full Text File. Date of Submission

Our service phone is (03)422-7151 Ext. 57407,E-mail is also welcomed.