結合螞蟻演算法與插入法於車輛路線問題之研究

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Seminar Papers > Item 987654321/30013

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

Title:	結合螞蟻演算法與插入法於車輛路線問題之研究
Authors:	卓裕仁 Cho, Yuh-Jen
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	螞蟻演算法;最遠插入法;車輛路線問題 Ant Colony System (ACS);Farthest Insertion Method;Vehicle Routing Problem (VRP).
Date:	2005
Issue Date:	2014-06-27 00:46:42 (UTC+8)
Abstract:	螞蟻演算法（Ant Colony System, ACS）是近年來應用很廣的一種巨集啟發式方法（Meta-heuristics），是一種屬於廣度搜尋的方法。由文獻可知，螞蟻演算法的可行解建構方式是以鄰近點法（Neighbor Algorithm）為基礎，再配合費洛蒙函數來影響路徑選擇的機率。本研究保留螞蟻演算法記錄歷史資訊的精神，嘗試將最遠插入（Farthest Insertion）法導入到ACS的搜尋移動機制中，以取代原先的鄰近點法。此外，本研究也提出了起步隨機策略（First-step Randomi The Ant Colony System (ACS) is a meta-heuristic approach for solving complicated combinatorial optimization problem. Based on the behavior of real ants, the ACS transfers the ants’ pheromone to an efficient mechanism of information memory which is the cor
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_m620_0217.pdf		36Kb	Adobe PDF	67	View/Open