藉由粒子群演算法求解旅行銷售員問題於最佳化後勤補給規劃;Optimizing the Logistic Route Planning by Solving the Traveling Salesman Problem using Particle Swarm Algorithm

NCUIR > College of Electrical Engineering & Computer Science > Executive Master of Electrical Engineering > Electronic Thesis & Dissertation > Item 987654321/58619

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/58619

Title:	藉由粒子群演算法求解旅行銷售員問題於最佳化後勤補給規劃;Optimizing the Logistic Route Planning by Solving the Traveling Salesman Problem using Particle Swarm Algorithm
Authors:	陳承杰;Chen,Cheng-Chieh
Contributors:	電機工程學系在職專班
Keywords:	旅行推銷員問題;最短路徑;粒子群演算法;Particle Swarm Optimization Algorithm;shortest path;Traveling Salesman Problem
Date:	2012-12-22
Issue Date:	2013-01-29 14:44:37 (UTC+8)
Publisher:	國立中央大學
Abstract:	本論文以粒子群最佳化演算法(Particle Swarm Optimization Algorithm，以下簡稱PSO)為基礎，研究如何透過PSO來有效率的搜尋且有系統地求解「旅行推銷員問題(Traveling Salesman Problem，以下簡稱TSP)」，以獲得最佳解(optimal solution)，完成最短路徑規劃結果。藉由MATLAB軟體模擬，探討在給定目標點情況下，透過PSO運算結果，完成TSP路徑規劃。本論文的研究成果，可以對補給運輸提供良好的路徑規劃，提高運輸配送效率，有效的節省支出成本。This thesis intends to find the optimal solution for Traveling Salesman Problem (TSP) using Particle Swarm Optimization Algorithm (PSO).The processing of PSO was achieved using MATLAB on a personal computer, and the calculated solutions were treated as optimized route planning for further applications. The study results of this thesis have proved the PSO can increase transportation efficiency by optimizing the route planning which might be a potential approach to save transportation cost expense in future applications.
Appears in Collections:	[Executive Master of Electrical Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	1056	View/Open

社群 sharing

Loading...