改良型巢狀分割法應用於旅行推銷員問題之研究

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Journal Articles > Item 987654321/35897

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

Title:	改良型巢狀分割法應用於旅行推銷員問題之研究
Authors:	卓裕仁 Cho, Yuh-Jen
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	旅行推銷員問題;巨集啟發式演算法;巢狀分割法 Traveling salesman problem (TSP);Meta-heuristics;Nested partitions
Date:	2005
Issue Date:	2014-06-27 10:54:44 (UTC+8)
Abstract:	旅行推銷員問題(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
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Journal Articles

Files in This Item:

File	Description	Size	Format
p_m620_0057.pdf		36Kb	Adobe PDF	33	View/Open