ISSUES of THE TIME DEPENDENT SINGLE VEHICLE ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS

• Main Authors: Liu Chin-Wei, 劉金維
• Other Authors: Shieh How-Ming
• Format: Others
• Language: zh-TW
• Published: 2000
• Online Access: http://ndltd.ncl.edu.tw/handle/63855989935903902122

博士 === 國立中央大學 === 土木工程研究所 === 88 === 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. Keyword：time dependent, time window, dynamic programming, vehicle routing