A Robust Approach for Improving Computational Efficiency of Order-Picking Problems

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 orderpicking 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 op...

• Type: Conference
• Year: 2005
• Where: KES
• Authors: Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
• Keywords: Branch-and-bound Algorithm, Daily Operation, KES 2005, Tabu Search