變動鄰域搜尋法（Variable Neighborhood Search,VNS）乃是藉由循序更換不同規模的鄰域，以兼顧廣度搜尋與深度搜尋的一種巨集啟發式方法。本文之目的在於結合一般化插入法（Generalized Insertion,GENI）與多種鄰域搜尋法於VNS之解題架構中，以求解車輛路線問題(Vehicle Routing Problem,VRP)。為驗證VNS的解題績效，本研究選擇了35個VRP標竿例題進行測試，結果發現：平均誤差百分比可達2.86％，證實VNS法具有不錯的應用潛力。 The Variable Neighborhood Search (VNS), which sequentially changes neighborhoods with different size, is a depth-and-width oriented meta-heuristic approach. The purpose of this article is to combine the Generalized Insertion (GENI) with various neighborho
