本研究針對多場站多車種車輛路線問題(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
