應用時窗分割與整數化策略簡化時窗收卸貨問題之研究

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Journal Articles > Item 987654321/35766

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/35766

Title:	應用時窗分割與整數化策略簡化時窗收卸貨問題之研究
Authors:	張靖 Chang, Ching
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	時窗收卸貨問題;收卸貨問題;時窗分割策略;巨集啟發式演算法 Pick up and Delivery Problem,Window Partitioning and Discretization Strategy,Meta-Heuristic algorithm
Date:	2008
Issue Date:	2014-06-27 10:49:00 (UTC+8)
Abstract:	本研究利用時窗分割 (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
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Journal Articles

Files in This Item:

File	Description	Size	Format
p_m620_0014.pdf		37Kb	Adobe PDF	162	View/Open