傳統的車輛路線問題(Vehicle Routing Problem)大多假設顧客資料已知且不會改變，如顧客位置、需求量、服務時間等，但在實務運作中，貨運業者在進行貨物撿收或配送作業時，常面對即時性的需求發生。本研究欲探討車輛出發前的初始解求解品質對於後續服務臨時出現顧客的現象與營業所人員在面對臨時出現的顧客撿貨需求時，如何應用適當之判斷法則與方法來快速回應時間承諾予該顧客，其中包括判斷是否該在成本與效率考量之下放棄服務某顧客。
　　在求解策略方面，本研究針對車輛出發前的已知配送點是分別利用其他學者所提出之路線建構啟發式解法與數學規劃法各求取初始路線；在面對後續臨時出現的撿貨需求時，則分別利用不同目標導向的路線調整法來進行路線的調整並回應一「時窗承諾」。
在測試結果方面，無論使用何種目標導向的路線調整法處理臨時出現顧客，在不同解法的初始路線中，均以「數學規劃法」表現最佳，次為「平行式插入法」，最差為「時間導向最近鄰點法」，這與初始路線求解品質呈正向關係。以「時間導向：路線調整法二」的路線調整法在時窗寬度緊密的時候，表現優於「成本導向：路線調整法一」，隨著時窗寬度增加，則轉為「成本導向：路線調整法一」表現較佳。在回應臨時出現顧客的「時窗承諾」寬度調整中，測試數據顯示對時窗上界做縮小調整的效果，均比對時窗下界做調整或同時調整時窗上下界來得佳。

none

申生元，「時窗限制途程問題」，國立交通大學工業工程與管理研究所博士論文，1998。
胡大瀛、呂英志、陳仲強、陳佳貝，「動態車輛路線問題之研究」，中華民國運輸學會第十六屆學術論文研究會論文集，133-142頁，2001。
梅明德、謝浩明，「時窗限制動態車輛路線問題之線上型路線建立啟發式解法」，運輸學刊，第十三卷第二期，73-111頁，2001。
張美香、陳祥瑞，「含時窗限制與撿收之動態車輛途程規劃之研究」，中華民國第七屆網路運輸研討會，2002。
陳惠國、薛哲夫，「含依時性旅行時間之即時車輛途程規劃問題」，第十屆校際運輸學術聯誼研討會論文集，139-160頁，2002。
歐陽恬恬，「宅配經營特性分析與郵局面對宅配之挑戰與因應」，台灣大學土木工程研究所碩士論文，2000。
Bartholdi, J. J., Platzman, L. K., “Heuristics Based on Space-filling Cruves for Combinational Problems in Euclidean Space,” Management Science, Vol.34, pp.291-305, 1988.
Benton, W. C., Rossetti, M. D., “The Vehicle Scheduling Problem with Intermittent Customer Demands,” Computers and Operations Research, Vol.19, pp.521-531, 1992.
Bertsimas, D. J., “Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles,” Operations Research, Vol.41, pp.60-76, 1993.
Bertsimas, D. J., Ryzin, G. V., “A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane,” Operations Research, Vol.39, pp.601-615, 1991.
Blum, C., Roli, A., “Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison,” ACM Computing Surveys, Vol.35, No.3, pp.268-308, 2003.
Bodin, L., Golden, B., Assad, A., Ball, M., “Routing and Scheduling of Vehicles and Crews: the state of the art,” Computers and Operations Research, Vol.10, pp.63-211, 1983.
Casco, D. O., Golden, B. L., Wasil, E. A., “Vehicle Routing with Backhauls: Methods, Algorithm and Case Studies,” Vehicle Routing and Studies, pp.127-147, 1988.
Chiang, W. C., Russell, R. A., “Simulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows,” Annals of Operations Research, Vol.63, 1996.
Clark, G., Wright, J. W., “Scheduling of Vehicles from A Central Depot to A Number of Delivery Points,” Operations Research, Vol.12, pp.568-581, 1964.
Deif, I., Bodin, L., “Extension of the Clarke and Wright Algorithm for Solving the Vehicle Routing Problem with Backhauling,” Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Management, pp.75-96, 1984.
Duhamel, C., Potvin, J. Y., Rousseau, J. M., “A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows,” Transportation Science, Vol.31, No.1, pp.49-59, 1997.
Gendreau, M., Guertin, F., Potvin, J. Y., Taillard, E. “Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching,” Transportation Science, Vol.33, No.4, pp.381-390, 1999.
Gillett, E. B., Miller, L. R., “A Heuristic Algorithm for The Vehicle Dispatch Problem,” Operations Research, Vol.22, pp.340-349, 1974.
Glover, F., “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operations Research, pp.533-549, 1986.
Ichoua, S., Gendreau, M., Potvin, J. Y., “Diversion Issues in Real-Time Vehicle Dispatching,” Transportation Science, Vol.34, No.4, pp.426-438, 2000.
Kolen, A. W. J., Kan A. H. G. R., Trienekens, H. W. J. M., “Vehicle Routing with Time Windows,” Operations Research, Vol.35, pp.266-273, 1987.
Krolak, P., Felts, W., Nelson, J., “A Man-Machine Approach toward Solving The Generalized Truck Dispatching Problem,” Transportation Science, Vol.6, pp.149-170, 1972.
Lenstra, J., Rinnooy, K. A., “Complexity of Vehicle Routing and Scheduling Problem,” Networks, Vol.11, pp.221-227, 1981.
Lin, S., “Computer Solutions of The Traveling Salesman Problem,” Bell System Technical Journal, Vol.44, pp.2245-2269, 1965.
Madsen, B. G., Ravn, H. F., Rygaard, J. M., “A Heuristic Algorithm for a Dial-a-Ride Problem with Time Windows, Multiple Capacities and Multiple Objectives,” Annals of Operations Research, Vol.60, pp.193-208, 1995.
Potvin, J. Y., Duhamel, C., Guertin, F., “A Genetic Algorithm for Vehicle Routing with Backhauling,” Applied Intelligence, Vol.6, pp.345-355, 1996.
Potvin, J. Y., Rousseau, J. M., “A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows,” European Journal of Operational Research, Vol.66, pp.331-341, 1993.
Powell, W., Sheffi, Y., Nickerson, K. S., Butterbaugh, K., Atherton, S., “Maximizing Profits for north American van Lines Truckload Division: A New Framework for Pricing and Operations,” Interfaces, Vol.18, pp.21-41, 1988.
Powell, W. B., Jaillet, P., Odoni, A., “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, 1995.
Psaraftis, H. N., “Dynamic Vehicle Routing Problems,” Vehicle Routing: Methods and Studies, North Holland: Amsterdam, 1988.
Psaraftis, H. N., “Dynamic Vehicle Routing: Status and Prospects,” Annals of Operations Research, Vol.61, pp.143-164, 1995.
Regan, A. C., Mahmassani, H. S., Jailiet, P., “Improving Efficiency of Commercial Vehicle Operations using Real-Time Information: Potential uses and Assignment Strategies,” Transportation Research Record, Vol.1493, pp.188-198, 1994.
Russell, R. A., “Hybrid Heuristics for the Vehicle Routing Problem with Time Windows,” Transportation Science, Vol.29, No.21, pp.156-166, 1995.
Shen, Y., Potvin, J. Y., Rousseau, J. M., Roy, S., “A Computer Assistant for Vehicle Dispatching with Learning Capabilities,” Annals of Operations Research, Vol.61, pp.189-211, 1995.
Solomon, M. M., “Algorithm for the Vehicle Routing and Scheduling Problems with Time Windows Constraints: Models and Algorithms,” Ph.D. Dissertation, Department of Decision Science, University of Pennsylvania, 1983.
Solomon, M. M., “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,” Operations Research, Vol.35, pp. 254-265, 1987.
Solomon, M. M., Baker, E. K., Schaffer, J. R., “Vehicle Routing and Scheduling Problems with Time Windows Constraints: Efficient Implementations of Solution Improvement Procedures,” Vehicle Routing: Methods and Studies, Elservier Science Publishers, 1988.
Toth, P., Vigo, D., “An Exact Algorithm for the Vehicle Routing Problem with Backhauls,” Transportation Science, Vol.31, pp.372-385, 1997.
Wade, A. C., Salhi, S., “An Investigation into a new class of Vehicle Routing Problem with Backhauls,” Omega, Vol.30, pp.479-487, 2002.
Waters, C. D. J., “Vehicle Scheduling Problems With Uncertainty and Omitted Customers,” Journal of the Operational Research Society, Vol.40, pp.1099-1108, 1989.
Yano, T., Chan, L., Richter, K. M., “Vehicle Routing at Quality Stores,” Interfaces, Vol.17, No.2, pp.52-63, 1987.