應用粒子族群最佳化演算法規劃物流中心之揀貨路徑

CHUR > College of Management > Department of Technology Management > Seminar Papers > Item 987654321/29076

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

Title:	應用粒子族群最佳化演算法規劃物流中心之揀貨路徑
Authors:	謝玲芬 Hsieh, Ling-Feng
Contributors:	科技管理學系 Technology Management
Keywords:	揀貨路徑規劃;粒子族群最佳化 picking routing;particle swarm optimization
Date:	2006
Issue Date:	2014-06-27 00:17:29 (UTC+8)
Abstract:	物流中心中，揀貨作業時間約佔整個物流中心作業時間比的30%~40%，要有效率執行倉儲系統的揀貨作業，需仰賴物流中心儲存策略、訂單的處理以及揀貨路徑之間有效的配合，否則將產生過多或不必要的作業時間。然這類問題具有複雜且不易求解的特性，故本研究利用粒子族群最佳化(Particle Swarm Optimization，簡稱PSO)演算法求解問題。PSO是最近幾年才提出的啟發式群體智慧(Swarm Intelligence)演算法，相較於一些發展較早已趨成熟的演算法，例如基因演算法、模擬退火法…等，PSO的性質 The performance of a distribution center is typically judged on throughput-based criteria. The order picking operations almost consumed 30% to 40% time in a typical distribution center. However, it is a nonlinear programming problem. So, it is not easy to
Appears in Collections:	[Department of Technology Management] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_m530_0263.pdf		36Kb	Adobe PDF	40	View/Open