本研究利用時窗分割 (Partitioning)與整數化(Discretization) 策略將時窗收卸貨問題(Pickup and Delivery Problem with Time Windows , PDPTW) 轉換為無時窗的近似PDP(Similar Pickup and Delivery Problem, SPDP)，即得以求解PDPTW時不用考慮時窗。在轉換過程中進一步提出問題規模精簡策略與關連式旅行網路結構表，大量減少轉換過程中所衍生出來的新的限制式與決策變數的數量。研究中利用Lau與L The main goal of this paper is to provide a new concept to solve a Pick up and Delivery Problem with Time Window (PDPTW) efficiently and accurately. In order to achieve this goal, a PDPTW is transferred to be a new similar PDP (SPDP) without time window b
