Skip to main content

Advertisement

SpringerLink
Log in

Storage location assignment and order picking optimization in the automotive industry

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The objective of this study is to design storage assignment and order picking system using a developed mathematical model and stochastic evolutionary optimization approach in the automotive industry. It is performed in two stages. At the first stage, storage location assignment problem is solved with a class-based storage policy with the aim of minimizing warehouse transmissions by using integer programming. At the second stage, batching and routing problems are considered together to minimize travel cost in warehouse operations. A warehouse in the automotive industry is analyzed, and an optimum solution is obtained from an integer programming model. Due to the computational time required for solving the integer programming problem, a faster genetic algorithm is also developed to form optimal batches and optimal routes for the order picker. The main advantage of the algorithm is the quick response to production orders in real-time applications. The solutions showed that the proposed approach based on genetic algorithms can be applied and integrated to any kind of warehouse layout in automotive industry.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Roodbergen KJ, De Koster R (2001) Routing Methods for Warehouses with Multiple Cross Aisle. Int J Prod Res 39(9):1865–1883

    Article  MATH  Google Scholar 

  2. ELA/AT Kearney (2004) Excellence in logistics. ELA, Brussels

    Google Scholar 

  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

    Article  Google Scholar 

  4. Rana K (1991) Order-Picking in Narrow-Aisle Warehouse. Int J Phys Distrib Logist Manage 20(9):9–15

    Google Scholar 

  5. Tompkins JA, White JA, Bozer YA, Frazelle EH, Tanchoco JMA, Trevino J (1996) Facilities Planning. Wiley, New York

    Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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

    Google Scholar 

  11. Muppani VR, Adil GK (2008b) A Branch and Bound Algorithm for Class-Based Storage-Location Assignment. Eur J Oper Res 189:492–507

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  13. Hsu CM, Chen KY, Chen MY (2005) Batching Orders in Warehouses by Minimizing Travel Distance with Genetic Algorithms. Comput Ind 56:169–178

    Article  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  20. Won J, Olafsson S (2005) Joint Order Batching and Order Picking in Warehouse Operations. Int J Prod Res 43(7):1427–1442

    Article  MATH  Google Scholar 

  21. Goldberg DE (1989) Genetic algorithm in search. Optimization and Machine Learning. Addison-Wesley, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Faculty of Engineering and Architecture, Gorukle Campus, Uludag University, 16059, Bursa, Turkey

    Seval Ene & Nursel Öztürk

Authors
  1. Seval Ene
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nursel Öztürk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seval Ene.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ene, S., Öztürk, N. Storage location assignment and order picking optimization in the automotive industry. Int J Adv Manuf Technol 60, 787–797 (2012). https://doi.org/10.1007/s00170-011-3593-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3593-y

Keywords

Search

Navigation