本論文係以宅配運輸（或稱快遞配送）之車輛路線規劃問題為研究主題，分別探討在時依性路網（time dependent network）下，含時窗限制（time window）之靜態與動態單一車輛路線規劃兩課題。本研究所探討之靜態問題可視為一含路段阻抗暨時窗限制下旅行推銷員問題（Time Dependent Traveling Salesman Problem with Time Windows, TDTSPTW），由於此問題路段成本具時依性，因此，無論在問題複雜度（complexity）或網圖性質（graphic property）上，都與一般旅行推銷員問題有所不同。此外，本論文另一個研究課題為動態單一車輛路線規劃問題（Single Vehicle Routing and Scheduling Problem, SVRSP），此問題除具前述靜態研究課題所有限制外，其顧客資訊係非一次到達。因此，車輛巡行路線的規劃將隨著所掌握的顧客資訊持續地進行更新。有關上述研究課題之問題性質、數學模式、求解方法及相關數值例分析結果，已於本論文第三章（靜態問題）及第四章（動態問題）內，進行詳細之描述。 The thesis is focused on the static and dynamic single vehicle routing and scheduling problems for the express carriers. The static one is as the Time Dependent Traveling Salesman Problem with Time Windows（TDTSPTW）. The time dependent link cost makes a lot of difference in computational complexity and graphic property, between TDTSPTW and TSP. The other topic is the Dynamic Single Vehicle Routing and Scheduling Problem（SVRSP）. The problem not only contains all the characteristics of the TDTSPTW, but the demand pattern is not deterministic. Therefore, the routing plan must be updated when any new request is accepted. All the issues mentioned above are supplied with some numerical tests to demonstrate proposed dynamic programming based algorithms.
