Storage location assignment and order picking optimization in the automotive industry

International Journal of Advanced Manufacturing Technology

Volumn 60, Issue 5-8, 2012, Pages 787-797

  Ene, Seval ^a   Öztürk, Nursel ^a  

^a ULUDAG UNIVERSITY   (Turkey)

Author keywords

Class based storage; Genetic algorithms; Order picking systems; Routing

Indexed keywords

CLASS-BASED; COMPUTATIONAL TIME; EVOLUTIONARY OPTIMIZATIONS; INTEGER PROGRAMMING MODELS; INTEGER PROGRAMMING PROBLEMS; OPTIMAL ROUTES; OPTIMUM SOLUTION; ORDER PICKERS; ORDER PICKING; PRODUCTION ORDER; QUICK RESPONSE; REAL-TIME APPLICATION; ROUTING; ROUTING PROBLEMS; STORAGE ASSIGNMENT; STORAGE LOCATION; STORAGE POLICIES; TRAVEL COSTS; WAREHOUSE LAYOUT; WAREHOUSE OPERATION;

AUTOMOTIVE INDUSTRY; COMPUTER PROGRAMMING; GENETIC ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION;

WAREHOUSES;

EID: 84861668126     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3593-y     Document Type: Conference Paper

References (21)

1. Roodbergen KJ, De Koster R (2001) Routing Methods for Warehouses with Multiple Cross Aisle. Int J Prod Res 39 (9):1865-1883 (Pubitemid 35165596)
2. ELA/AT Kearney (2004) Excellence in logistics. ELA, Brussels
3. Hwang H, Baek W, Lee M (1988) Cluster Algorithms for Order Picking in an Automated Storage and Retrieval System. Int J Prod Res 26:189-204
4. Rana K (1991) Order-Picking in Narrow-Aisle Warehouse. Int J Phys Distrib Logist Manage 20(9):9-15
5. Tompkins JA, White JA, Bozer YA, Frazelle EH, Tanchoco JMA, Trevino J (1996) Facilities Planning. Wiley, New York
6. GAMS Software GmbH Eupener Str. 135-137. 50933 Cologne, Germany
7. Berg JP, Zijm WHM (1999) Models for Warehouse Management: Classification and Examples. Int J Prod Econ 59:519-528
8. Petersen CG, Aase G (2004) A Comparison of Picking, Storage and Routing Policies in Manual Order Picking. Int J Prod Econ 92:11-19
9. Chen Y, He F (2008) Research on particle swarm optimization in location assignment optimization. Proceedings of the 7th World Congress on Intelligent Control and Automation
10. Muppani VR, Adil GK (2008a) Efficient Formation of Storage Classes for Warehouse Storage Location Assignment: A Simulated Annealing Approach. Int J Manag Sci 36:609-618
11. Muppani VR, Adil GK (2008b) A Branch and Bound Algorithm for Class-Based Storage-Location Assignment. Eur J Oper Res 189:492-507 (Pubitemid 351288501)
12. Le-Duc T, De Koster R (2005) Travel Distance Estimation and Storage Zone Optimisation in a 2-Block Class-Based Storage Strategy Warehouse. Int J Prod Res 43(17):3561-3581 (Pubitemid 41648297)
13. Hsu CM, Chen KY, ChenMY(2005) Batching OrdersinWarehouses by Minimizing Travel Distance with Genetic Algorithms. Comput Ind 56:169-178
14. Tsai CY, Liou JJH, Huang TM (2008) Using a Multiple-GA Method to Solve the Batch Picking Problem: Considering Travel Distance and Order Due Time. Int J Prod Res 46 (22):6533-6555
15. Ho YC, Tseng YY (2006) A Study on Order-Batching Methods of Order-Picking in a Distribution Centre with Two Cross-Aisles. Int J Prod Res 44(17):3391-3417
16. Ho YC, Su TS, Shi ZB (2008) Order Batching Methods for an Order-Picking Warehouse with Two Cross Aisles. Comput Ind Eng 55:31-347
17. Hwang H, Kim DG (2005) Order-Batching Heuristics Based on Cluster Analysis in a Low-Level Picker-to-Part Warehousing System. Int J Prod Res 43(17):3657-3670 (Pubitemid 41648302)
18. Caron F, Marchet G, Perego A (1998) Routing Policies and COI Based Storage Policies in Picker-to Part Systems. Int J Prod Res 36(3):713-732 (Pubitemid 128554497)
19. Hwang H, Oh YH, Lee YK (2004) An Evaluation of Routing Policies for Order-Picking Operations in Low-level Picker-to Part System. Int J Prod Res 42(18):3873-3889
20. Won J, Olafsson S (2005) Joint Order Batching and Order Picking in Warehouse Operations. Int J Prod Res 43(7):1427-1442 (Pubitemid 41633064)
21. Goldberg DE (1989) Genetic algorithm in search. Optimization and Machine Learning. Addison-Wesley, New York