物流中心之粒子群最佳化演算法應用效率之提昇

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

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

Title:	物流中心之粒子群最佳化演算法應用效率之提昇
Authors:	謝玲芬 Hsieh, Ling-Feng
Contributors:	科技管理學系 Technology Management
Keywords:	揀貨系統;揀貨路經規劃;粒子群最佳化演算法;最大迴圈插入法 Order Picking System;Picking Routing Planning;Particle Swarm Optimization;Maximum Loop Insertion
Date:	2006
Issue Date:	2014-06-27 00:16:24 (UTC+8)
Abstract:	物流中心的內部作業中，揀貨法則為影響揀貨路徑之根本，而良好的揀貨路經規劃能有效且立即地改善揀貨效率，進而降低物流中心營運成本，提昇企業競爭力。而揀貨路徑規劃似於銷售員旅行問題(TSP)與車輛途程問題(VRP)，皆為NP-Hard問題，因此在進行揀貨路徑規劃時將會相當耗時，故本研究利用最近幾年才提出的粒子群最佳化演算法(Particle Swarm Optimization，簡稱PSO)求解此問題，且提出一啟發式演算法，首先求得一不錯的解，將此解作為做為代入粒子群最佳化演算法的一初始解，期望能有效提昇PSO The picking policy is the important factor for order picking routing planning in distribution centers. Good routing planning will improve the efficiency of order picking systems effectively and immediately. It does not only decrease operating cost but als
Appears in Collections:	[Department of Technology Management] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_m530_0257.pdf		34Kb	Adobe PDF	62	View/Open