隨著世界經濟的高度發展，供應鏈中除了致力於降低成本以及提升服務品質，能否迅速應對顧客需求亦是衡量供應鏈表現的重要指標。人工揀貨作業勞力密集，花費的成本佔供應鏈成本的一半以上，被視為供應鏈中之瓶頸環節，因此減少揀貨時間為管理上重要之課題。本研究對揀貨過程加以控制優化，規劃揀貨員之揀貨順序及路徑，以減少揀貨時間為目的，有助於輔助管理者的決策。
本研究考慮現實中一封箱廠實際作業情況，將揀貨問題轉化為多趟車輛排程問題，加以容量、單趟時間上限、揀貨員技能、機具數量以及合併訂單之限制，並考慮同一時間不能使用相同機具，以減少總揀貨時間為目標，使用禁忌搜尋法求解。測試問題規模58到324個儲位的8個例子，與原本揀貨時間相比減少 50.52% 揀貨時間；將限制式調整為與邱芷涵 (2018) 相同，並比較求解結果，改善率為9.65%。研究成果使管理者能夠有效率地分派訂單，達到減少揀貨作業時間之目的。

Along with the development in global trade, supply chain management faces the challenge of not only reducing the cost and ensuring the service performance. Responding customers’ requirement rapidly is also an important task. Manual order picking is a labor intensive progress which takes more than half of the supply chain cost, and is regarded as the bottle neck in supply chain management.
With the purpose of reducing picking time, this research presents a tabu search algorithm to solve the order picking problem, which takes into consideration the feature in a real-life assembly factory’s warehouse operation. Transform this order picking problem into a multi-trip vehicle routing problem, including capacity constraint, time limit in single route, skill constraint, limited machine number and combining the demand order. Takes into account that the pickers should not operate the same machine at the same time. Computational experiments are performed on 8 realistic instances. Compares to the original picking way, the total picking time saves 50.52% on average. Modify the constraints to the same with Chiu (2018)’ s research, the improvement rate in total picking time is 9.65%. The results achieve the main object of this research, which reduces the total picking time, and enables manager to deliver order more efficient.

英文文獻
Akbar, M. D., & Aurachmana, R. (2020). Hybrid genetic–tabu search algorithm to optimize the route for capacitated vehicle routing problem with time window. International Journal of Industrial Optimization, 1(1), 15-28.
Avci, M., & Topaloglu, S. (2016). A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications, 53, 160-171.
Bacchetta, M., Milet, E., & Monteiro, J.-A. (2019). Making Globalization More Inclusive.
Baldacci, R., Mingozzi, A., & Roberti, R. (2011). New route relaxation and pricing strategies for the vehicle routing problem. Operations research, 59(5), 1269-1283.
Baldacci, R., Mingozzi, A., & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1-6.
Battini, D., Calzavara, M., Persona, A., & Sgarbossa, F. (2018). A method to choose between carton from rack picking or carton from pallet picking. Computers & Industrial Engineering, 126, 88-98.
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016). The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering, 99, 300-313.
Brandao, J., & Mercer, A. (1997). A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research, 100(1), 180-191.
Calzavara, M., Sgarbossa, F., & Persona, A. (2019). Vertical Lift Modules for small items order picking: an economic evaluation. International Journal of Production Economics, 210, 199-210.
Cergibozan, Ç., & Tasan, A. S. (2019). Order batching operations: an overview of classification, solution techniques, and future research. Journal of Intelligent Manufacturing, 30(1), 335-349.
Cheng, C.-Y., Chen, Y.-Y., Chen, T.-L., & Yoo, J. J.-W. (2015). Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem. International Journal of Production Economics, 170, 805-814.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., & Vogel, U. (2011). Vehicle routing with compartments: applications, modelling and heuristics. OR spectrum, 33(4), 885-914.
Desaulniers, G., Lessard, F., & Hadjar, A. (2008). Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Science, 42(3), 387-404.
Fleischmann, B. (1990). The vehicle routing problem with multiple use of vehicles. Forschungsbericht Fachbereich Wirtschaftswissenschaften, Universität Hamburg.
Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management science, 40(10), 1276-1290.
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2020). Tabu Search for the Time-Dependent Vehicle Routing Problem with Time Windows on a Road Network. European Journal of Operational Research.
Groër, C., Golden, B., & Wasil, E. (2009). The consistent vehicle routing problem. Manufacturing & service operations management, 11(4), 630-643.
Ho, S. C., & Haugland, D. (2004). A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research, 31(12), 1947-1964.
Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008). Subset-row inequalities applied to the vehicle-routing problem with time windows. Operations research, 56(2), 497-511.
Kovacs, A. A., Golden, B. L., Hartl, R. F., & Parragh, S. N. (2015). The generalized consistent vehicle routing problem. Transportation Science, 49(4), 796-816.
Lee, H.-Y., & Murray, C. C. (2019). Robotics in order picking: evaluating warehouse layouts for pick, place, and transport vehicle routing systems. International Journal of Production Research, 57(18), 5821-5841.
Lenstra, J. K., & Kan, A. R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221-227.
Lin, C.-C., Kang, J.-R., Hou, C.-C., & Cheng, C.-Y. (2016). Joint order batching and picker Manhattan routing problem. Computers & Industrial Engineering, 95, 164-174.
Muyldermans, L., & Pang, G. (2010). On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research, 206(1), 93-103.
Nguyen, P. K., Crainic, T. G., & Toulouse, M. (2017). Multi-trip pickup and delivery problem with time windows and synchronization. Annals of Operations Research, 253(2), 899-934.
Niu, Y., Yang, Z., Chen, P., & Xiao, J. (2018). Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost. Journal of cleaner production, 171, 962-971.
Pansart, L., Catusse, N., & Cambazard, H. (2018). Exact algorithms for the order picking problem. Computers & Operations Research, 100, 117-127.
Scholz, A., Henn, S., Stuhlmann, M., & Wäscher, G. (2016). A new mathematical programming formulation for the single-picker routing problem. European Journal of Operational Research, 253(1), 68-84.
Scholz, A., Schubert, D., & Wäscher, G. (2017). Order picking with multiple pickers and due dates–Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. European Journal of Operational Research, 263(2), 461-478.
Sicilia, J. A., Quemada, C., Royo, B., & Escuín, D. (2016). An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristics. Journal of Computational and Applied Mathematics, 291, 468-477.
Silvestrin, P. V., & Ritt, M. (2017). An iterated tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, 81, 192-202.
Sinha, S., Nagda, M. K., & Poovammal, E. (2020). Order Picking: A Survey of Methods and Problems. International Journal of Psychosocial Rehabilitation, 24(1).
Stavropoulou, F., Repoussis, P. P., & Tarantilis, C. D. (2019). The vehicle routing problem with profits and consistency constraints. European Journal of Operational Research, 274(1), 340-356.
Ticha, H. B. (2017). Vehicle Routing Problems with road-network information.
Tompkins, J. A., White, J. A., Bozer, Y. A., & Tanchoco, J. M. A. (2010). Facilities planning: John Wiley & Sons.
Valle, C. A., Beasley, J. E., & da Cunha, A. S. (2016). Modelling and solving the joint order batching and picker routing problem in inventories. Paper presented at the International symposium on combinatorial optimization.
Yao, B., Hu, P., Zhang, M., & Wang, S. (2013). Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem. Simulation, 89(6), 762-770.
Zhang, D., Cai, S., Ye, F., Si, Y.-W., & Nguyen, T. T. (2017). A hybrid algorithm for a vehicle routing problem with realistic constraints. Information Sciences, 394, 167-182.
Zhang, T., Chaovalitwongse, W. A., & Zhang, Y. (2012). Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Computers & Operations Research, 39(10), 2277-2290.
Zhang, Z., Che, O., Cheang, B., Lim, A., & Qin, H. (2013). A memetic algorithm for the multiperiod vehicle routing problem with profit. European Journal of Operational Research, 229(3), 573-584.
中文文獻
邱芷涵. (2018). 封裝廠材料揀貨策略之研究. 成功大學交通管理科學系碩士在職專班學位論文.