旅行推銷員問題(traveling salesman problem, TSP)是組合最佳化問題的典型代表，其應用範圍雖廣，解題複雜度卻屬於NP-Complete，因此實務應用上多以啟發式解法(heuristic)來求得近似解。本研究以新近發展的巢狀分割法(nested partitions, NP)為基礎，導入廣度搜尋(diversification search)及深度搜尋(intensification search)的概念，輔以傳統鄰域搜尋法來強化NP法之深度搜尋工具，並配合多種回溯機制的應用，提 This paper presents an implementation of the Modified Nested Partitions (MNP) meta-heuristics for solving the Traveling Salesman Problem (TSP). The NP method systematically partitions the feasible region and concentrates the search in regions that are the
