Skip to main content
SpringerLink
Log in

A continuous estimation of distribution algorithm for the online order-batching problem

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

Abstract

In manual order-picking systems such as picker-to-parts, order pickers walk through a warehouse in order to pick up articles required by customers. Order batching consists of combining these customer orders into picking orders. In online batching, customer orders arrive throughout the scheduling. This paper considers an online order-batching problem in which the turnover time of all customer orders has to be minimized, i.e., the time period between the arrival time of the customer order and its completion time. A continuous estimation of distribution algorithm-based approach is proposed and developed to solve the problem and implement the solution. Using this approach, the warehouse performance can be noticeably improved with a substantial reduction in the average turnover time of a set of customer orders.

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. Bean J, Norman B (1993) Random keys for job shop scheduling problem. The University of Michigan, Ann Arbor

  2. Chen S-H, Chen M-C, Chang P-C, Zhang Q, Chen Y-M (2010) Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems. Expert Syst Appl 37:6441–6451

    Article  Google Scholar 

  3. Chew E, Tang L (1999) Travel time analysis for general item location assignment in a rectangular warehouse. Eur J Oper Res 112(3):582–597

    Article  MATH  Google Scholar 

  4. De Bonet J, Isbell C, Viola P (1997) MIMIC: finding optima by estimation probability densities. Advances in Neural Information Processing Systems 9

  5. de Koster M, Le-Duc T, Roodbergen K (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182(2):481–501

    Article  MATH  Google Scholar 

  6. Gademann N, van de Velde S (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans 37(1):63–75

    Article  Google Scholar 

  7. Ganesan T, Elamvazuthi I, Shaari KK, Vasant P (2013) Swarm intelligence and gravitational search algorithm for multi-objective optimization of synthesis gas production. Appl Energy 103:368–374

    Article  Google Scholar 

  8. Goldberg D, Korb B, Deb K (1989) Messy genetic algorithms: motivation, analysis and first results. Compl Syst 3:493–530

    MathSciNet  MATH  Google Scholar 

  9. Greenwood A, Vanguri S, Eksioglu B, Jain P, Hill T, Miller J (2005) Simulation optimization decision support system for ship panel shop operations. In Kuhl ME, Steiger NM, Armstrong F, Joines J (eds) Proceedings of the 2005 Winter Simulation Conference, (pp. 2078–2086)

  10. G Harik (1997) Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD. Thesis

  11. Henn S (2009) Metaheuristics for the order batching problem in manual order picking systems. Ottovon-Guericke-University Magdeburg. Faculty of Economics and Management

  12. Henn, S. (2010). Algorithms for on-line order batching in an order-picking warehouse. Proceedings of the 3rd International Conference on Information Systems, Logistics and Supply Chain ILS 2010. Casablanca: Business Process Consulting

  13. Kamin N (1998) On-line optimization of order picking in an automated warehouse. Shaker, Aachen

    Google Scholar 

  14. H Kargupta (1996) The gene expression messy genetic algorithm. Proceedings of the 1996 I.E. International Conference on Evolutionary Computation (pp. 631–636)

  15. Larrañaga P, Exteberria R, Lozano J, Peña J (2000) Optimization in continuous domains by learning and simulation of Gaussian networks. Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program

  16. Larrañaga P, Lozano J (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Academic Publishers, Boston/Dordrecht/London

    Book  Google Scholar 

  17. Le Dinh L, Vo Ngoc D, Vasant P (2013) Artificial bee colony algorithm for solving optimal power flow problem. Sci World J 2013

  18. Le-Duc T, de Koster R (2007) Travel time estimation and order batching in a 2-block warehouse. Eur J Oper Res 176(1):374–388

    Article  MATH  Google Scholar 

  19. Liu H, Gao L, Pan Q (2011) A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Expert Syst Appl 38:4348–4360

    Article  Google Scholar 

  20. Mühlenbein H, Paaß G (1996) From recombination of genes to the estimation of distributions: I. binary parameters. In: Voigt H, Ebeling W, Rechenberg I, Schwefel H (eds) Parallel problem solving from nature PPSN IV. Springer, Berlin, pp 178–187

    Chapter  Google Scholar 

  21. Öncan T (2013) A Genetic Algorithm for the order batching problem in low-level picker-to-part warehouse systems. Proceedings of the International MultiConference of Engineers and Computer Scientists 2013 Vol I, IMECS 2013. Hong Kong

  22. Pan Q-K, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40:166–180

    Article  Google Scholar 

  23. Pérez R, Jöns S, Hernández A, Ochoa C (2014) Simulation optimization for a flexible jobshop scheduling problem using an estimation of distribution algorithm. Int J Adv Manuf Technol 73(1–4):3–21

    Article  Google Scholar 

  24. Rudolph G (1991) Global optimization by means of distributed evolution strategies. Parallel problem solving from nature PPSN I. Lectures Notes in Computer Science

  25. van Nieuwenhuyse I, de Koster R (2009) Evaluating order throughput time in 2-block warehouses with time window batching. Int J Prod Econ 121:654–664

    Article  Google Scholar 

  26. Wang L, Wang S, Xu Y, Zhou G, Liu M (2012) A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput Ind Eng 62:917–926

    Article  Google Scholar 

  27. Wäscher G (2004) Order picking: a survey of planning problems and methods. In: Dyckhoff H, Lackes R, Reese J (eds) Supply Chain Management and Reverse Logistics. Springer, Berlin, pp 323–347

    Chapter  Google Scholar 

  28. Whitley D, Starweather T, Shaner D (1990) The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination. In: Davis L (ed) Handbook of genetic algorithms. Van Nostrand Reinhold, New York, pp 350–372

    Google Scholar 

  29. Yu M, de Koster R (2009) The impact of order batching and picking area zoning on order picking system performance. Eur J Oper Res 198(2):480–490

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIMAT, A. C., Callejón de Jalisco s/n, Mineral de Valenciana, C.P. 36240, Guanajuato, Guanajuato, México

    Ricardo Pérez-Rodríguez & Arturo Hernández-Aguirre

  2. CONACYT, Av. Insurgentes Sur 1582, Crédito Constructor, C.P. 03940, Benito Juárez, Distrito Federal, México

    S. Jöns

Authors
  1. Ricardo Pérez-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arturo Hernández-Aguirre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Jöns
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ricardo Pérez-Rodríguez.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pérez-Rodríguez, R., Hernández-Aguirre, A. & Jöns, S. A continuous estimation of distribution algorithm for the online order-batching problem. Int J Adv Manuf Technol 79, 569–588 (2015). https://doi.org/10.1007/s00170-015-6835-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-015-6835-6

Keywords

Search

Navigation