巨集啟發式解法於多場站多車種車輛路線問題之研究

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Seminar Papers > Item 987654321/30077

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

Title:	巨集啟發式解法於多場站多車種車輛路線問題之研究
Authors:	卓裕仁 Cho, Yuh-Jen
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	多場站多車種車輛路線問題;門檻接受法;最遠起點之鄰近點法 Multi-Depot and Heterogeneous Fleet Vehicle Routing Problem (MDHVRP);Threshold Accepting (TA);Farthest-start Nearest Neighbor (FNN)
Date:	2006
Issue Date:	2014-06-27 00:49:04 (UTC+8)
Abstract:	本研究針對多場站多車種車輛路線問題(Multi-Depot and Heterogeneous Fleet Vehicle Routing Problem, MDHVRP)之巨集啟發式解法進行探討。本研究應用門檻接受法(Threshold Accepting, TA)來構建MDHVRP的巨集啟發式求解方法，共分成三個模組：起始解構建模組、鄰域搜尋模組，以及門檻接受模組。其中，起始解建構模組係採用「先分群再排程」的概念來設計：首先，依據各顧客點與各場站之相對位置，將顧客指派給距其最近的場站；然後，再以最大容 The Multi-Depot and Heterogeneous Fleet Vehicle Routing Problem (MDHVRP) is an extent of the classical Vehicle Routing Problem. In this paper, we develop a Threshold Accepting (TA) meta-heuristic, named as TA_MDHVRP, to solve the MDHVRP. TA_MDHVRP is base
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_m620_0228.pdf		37Kb	Adobe PDF	111	View/Open