A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
學年 94
學期 1
出版（發表）日期 2005-09-01
作品名稱 A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
作品名稱（其他語言）
著者 Yu-Min Chiang; Shih-Hsin Chen; Kuo-Chang Wu
單位
出版者
著錄名稱、卷期、頁數 Lecture Notes in Computer Science 3682, p.1007-1014
摘要 The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This paper focuses on the order-picking operation, which is the core operation of DCs, to improve the material-handling process and enhance the competitiveness. The study applied an integrated framework that combined two algorithms, branch-and-bound and tabu search, to the order-picking problem and developed a neighborhood selection criterion based on constraint propagation and the prune-and-search algorithm to improve computational efficiency. The proposed method forbids bad node when searching a solution by branch-and-bound algorithm or tabu search. Besides, in order to make the algorithm more robust and reasonable, the fuzzy modeling was employed. The empirical result shows the approach decreases the computational effort effectively on the both algorithms. The study may be of interest for the researchers in the optimization of DCs’ operations and the DCs’ managers.
關鍵字 Tabu Search;Fuzzy Modeling;Fuzzy Inference System;Distribution Center;Order Picking
語言 en
ISSN 0302-9743; 1611-3349
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度 是
國別 DEU
公開徵稿
出版型式 ,電子版,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/121464 )