門檻接受法(Threshold Accepting, TA)是一種確定性接受劣解的巨集啟發式方法，可深化區域搜尋的強度並跳脫局部最佳解的束縛。螞蟻演算法(Ant Colony Optimization, ACO)則是將隨機搜尋過程中獲得解的資訊，以費洛蒙(Pheromone)的方式記憶在節線中，屬於一種廣度搜尋的巨集啟發式方法。本研究嘗試將ACO的費洛蒙記憶機制導入到TA法的解題架構中，以期提升TA法的解題績效。本文應用32個車輛路線問題(Vehicle Routing Problem, VRP)的標竿例 The Threshold Accepting (TA) is a deterministic meta-heuristic method, which is capable of escaping from the fetter of local optimum by accepting a poor solution. On the other hand, the Ant Colony Optimization (ACO), which transfers the objective value of
