Cited By
View all- Gil-Borrás SPardo EAlonso-Ayuso ADuarte A(2020)Basic VNS for a Variant of the Online Order Batching ProblemVariable Neighborhood Search10.1007/978-3-030-44932-2_2(17-36)Online publication date: 8-Apr-2020
Finding Interactions or Relationships between Customer Orders for Building Better Batches by Means of an Estimation of Distribution Algorithm-based Approach for the Online Order Batching Problem
Pages 989 - 996
Abstract
Order-picking systems are very common in industry. In this warehouse environment an order batching consists of combining customer orders into picking orders. Order batching is a combinatorial issue because many customer orders arrive throughout the scheduling in real-world situations, therefore to find interactions or relationships between orders for building better batches is a difficult task. This paper introduces an estimation of distribution algorithm-based approach for the online order batching problem to guide the overall search process. The results show how the warehouse performance is improved by estimating relationships between orders. This approach is compared with others published in the literature.
References
[1]
Choy, K.L., Ho, G.T.S., and Lee, C.K.H. 2014. A RFID-based storage assignment system for enhancing the efficiency of order picking. Journal of Intelligent Manufacturing. 1--19. DOI= http://link.springer.com/article/10.1007%2Fs10845-014-0965--9#page-1
[2]
Henn, S. 2009. Metaheuristics for the order batching problem in manual order picking systems. Ottovon-Guericke-University Magdeburg. Faculty of Economics and Management. Verband der Hochschullehrer für Betriebswirtschaft e.V., 3, 1, 82--105.
[3]
de Koster, M., Le-Duc, T., and Roodbergen, K. 2007. Design and Control of Warehouse Order Picking: A Literature Review. European Journal of Operational Research, 182, 2, 481--501.
[4]
Chen, F., Wang, H., Xie, Y., and Chao, Qi. 2014. An ACO-based online routing method for multiple order pickers with congestion consideration in warehouse. Journal of Intelligent Manufacturing. 1--20. DOI= http://link.springer.com/article/10.1007%2Fs10845-014-0871--1
[5]
Wäscher, G. 2004. Order Picking: A survey of planning problems and methods. In Supply Chain Management and Reverse Logistics, H. Dyckhoff, R. Lackes, and J. Reese Eds. Springer, Berlin, 323--347.
[6]
Battini, D., Calzavara, M., Persona, A., and Sgarbossa, F. 2015. Order picking system design: the storage assignment and travel distance estimation (SA&TDE) joint method. International Journal of Production Research, 53, 4, 1077--1093.
[7]
Grosse, E.H., Glock, C.H., Jaber, M.Y., and Neumann, W.P. 2015. Incorporating human factors in order picking planning models: framework and research opportunities. International Journal of Production Research, 53, 3, 695--717.
[8]
Roodbergen, K.J., and Vis, I.F.A. 2006. A model of warehouse layout. IIE Transactions, 38, 10, 799--811.
[9]
Gu, J., Goetschalckx, M., and McGinnis, L. 2007. Research on warehouse operation: A comprehensive review. European Journal of Operations Research, 177, 1, 1--21.
[10]
de Koster, M., To, L., and Zaerpour, N. 2012. Determining of number of zones in a pick-and-sort order picking system. International Journal of Production Research, 50, 3, 757--771.
[11]
Kulak, O., Sahin, Y., and Taner, M.E. 2012. Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms. Flexible Services and Manufacturing Journal, 24, 1, 52--80.
[12]
Henn, S. 2010. Algorithms for on-line order batching in an order-picking warehouse. In Proceedings of the 3rd International Conference on Information Systems, Logistics and Supply Chain ILS 2010 (Casablanca, Morocco, April 13--17, 2010). Business Process Consulting.
[13]
Yu, M., and de Koster, R. 2009. The impact of order batching and picking area zoning on order picking system performance. European Journal of Operational Research, 198, 2, 480--490.
[14]
Tetemke, M. 2013. Improving order-picking efficiency via storage assignments strategies. Master Thesis. Enschede: University of Louisville - Universiteit Twente.
[15]
Le-Duc, T., and de Koster, R. 2004. Travel distance estimation in single-block ABC-storage strategy warehouses. In Distribution logistics: Advanced solutions to practical problems, B. Fleiscmann, and A. Klose Eds. Springer, 184--200.
[16]
Le-Duc, T., and de Koster, R. 2005. Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse. International Journal of Production Research, 43, 17, 3561--3581.
[17]
Roodbergen, K., Gunter, P., and Iris, F. 2008. Designing the layout structure of manual order picking areas in warehouses. IIE Transactions, 40, 1032--1045.
[18]
Berglung, P., and Batta, R. 2012. Optimal placement of warehouse cross-aisles in a picker-to-part warehouse with class-based storage. IIE Transactions, 44, 2, 107--120.
[19]
Petersen, C. 2002. Considerations in order picking zone configuration. International Journal of Operations & Production Management, 27, 7, 793--805.
[20]
Gue, K., and Meller, R. 2009. Aisle configurations for unit-load warehouses. IIE Transactions, 41, 3, 171--182.
[21]
Gue, K., Ivanović, G., and Meller, R. 2012. A unit-load warehouse with multiple pickup and deposit points and non-traditional aisles. Transportation Research Part E: Logistics and Transportation Review, 48, 4, 795--806.
[22]
Eisenstein, D. 2008. Analysis and optimal design of discrete order picking technologies along a line. Naval Research Logistics (NRL), 55, 4, 350--362.
[23]
de Koster, M., Le-Duc, T., and Roodbergen, K. 2007. Design and Control of Warehouse Order Picking: A Literature Review. European Journal of Operational Research, 182, 2, 481--501.
[24]
Tompkins, J. 2003. Facilities Planning (3 ed.). Hoboken., NJ: Wiley.
[25]
Arnold, D., and Furmans, K. 2009. Materialfluss in Logistiksystemen 6 ed. Berlin: Springer.
[26]
Roodbergen, K.J., and Vis, I.F.A. 2006. A model of warehouse layout. IIE Transactions, 38, 10, 799--811.
[27]
Petersen, C. 1997. An evaluation of order picking routeing policies. International Journal of Operations & Production Management, 17, 11, 1098--1111.
[28]
Grosse, E., Glock, C., and Ballester-Ripoll, R. 2014. A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions. International Journal of Operations and Quantitative Management, 20, 2, 65--83.
[29]
Matusiak, M., de Koster, R., Kroon, L., and Saarinen, J. 2014. A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse. European Journal of Operational Research, 236, 3, 968--977.
[30]
Henn, S., and Schmid, V. 2013. Metaheuristics for order batching and sequencing in manual order picking systems. Computers & Industrial Engineering, 66, 2, 338--351.
[31]
Hong, S., Johnson, A.L., and Peters, B.A. 2012. Batch picking in narrow-aisle order picking systems with consideration for picker blocking. European Journal of Operational Research, 221, 3, 557--570.
[32]
Schleyer, M., and Gue, K. 2012. Throughput time distribution analysis for a one-block warehouse. Transportation Research Part E: Logistics and Transportation Review, 48, 3, 652--666.
[33]
Hong, S., Johnson, A.L., and Peters, B.A. 2012. Large-scale order batching in parallel-aisle picking systems. IIE Transactions, 44, 2, 88--106.
[34]
Gong, Y.M., and de Koster, R. 2008. A polling-based dynamic order picking system for online retailers. IIE Transactions, 40, 11, 1070--1082.
[35]
Rubrico, J.I.U., Higashi, T., Tamura, H., and Ota, J. 2011. Online rescheduling of multiple picking agents for warehouse management. Robotics and Computer-Integrated Manufacturing, 27, 1, 62--71.
[36]
Bukchin, Y., Khmelnitsky, E., and Yakuel, P. 2012. Optimizing a dynamic order-picking process. European Journal of Operational Research, 219, 2, 335--346.
[37]
Öncan, T. 2013. A Genetic Algorithm for the order batching problem in low-level picker-to-part warehouse systems. In Proceedings of the International MultiConference of Engineers and Computer Scientists 2013 Vol I, IMECS 2013 (Hong Kong, March 13--15, 2013).
[38]
Hsu, C., Chen, K., and Chen, M. 2005. Batching orders in warehouses by minimizing travel distance with genetic algorithms. Computers in Industry, 56, 169--178.
[39]
Mühlenbein, H., and Paaß, G. 1996. From recombination of genes to the estimation of distributions: I. binary parameters. In Parallel Problem Solving from Nature PPSN IV, H. Voigt, W. Ebeling, I. Rechenberg, and H. Schwefel Eds. Springer, Berlin, 178--187.
[40]
Chen, S.-H., Chen, M.-C., Chang, P.-C., Zhang, Q., and Chen, Y.-M. 2010. Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems. Expert Systems with Applications, 37, 6441--6451.
[41]
Liu, H., Gao, L., and Pan, Q. 2011. A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Experts Systems with Applications, 38, 4348--4360.
[42]
Pan, Q.-K., and Ruiz, R. 2012. An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega, 40, 166--180.
[43]
Pérez, R., Hernández, A. and S, Jöns. 2015. A continuous estimation of distribution algorithm for the online order-batching problem. International Journal of Advanced Manufacturing Technology, 79, 1--4, 569--588.
[44]
Greenwood, A., Vanguri, S., Eksioglu, B., Jain, P., Hill, T., and Miller, J. 2005. Simulation Optimization Decision Support System for Ship Panel Shop Operations. In Proceedings of the 2005 Winter Simulation Conference, M. E. Kuhl, N. M. Steiger, F. Armstrong, and J. Joines Eds. 2078--2086.
[45]
Larrañaga, P., and Lozano, J. 2002. Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer Academic Publishers.
Index Terms
- Finding Interactions or Relationships between Customer Orders for Building Better Batches by Means of an Estimation of Distribution Algorithm-based Approach for the Online Order Batching Problem
Recommendations
Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center
AbstractThe order batching problem is a combinatorial optimization problem that arises in the warehouse order picking process. In the order batching problem, the aim is to find groups of orders and picking routes of these groups to minimize distance ...
GRASP with Variable Neighborhood Descent for the online order batching problem
AbstractThe Online Order Batching Problem (OOBP) is a variant of the well-known Order Batching Problem (OBP). As in the OBP, the goal of this problem is to collect all the orders that arrive at a warehouse, following an order batching picking policy, ...
A heuristic approach for the online order batching problem with multiple pickers
AbstractThe Online Order Batching Problem with Multiple Pickers (OOBPMP) consists of optimizing the operations related to the picking process of orders in a warehouse, when the picking policy follows an order batching strategy. In this case, ...
Highlights- Literature review of the Online Order Batching Problem with multiple pickers (OOBPMP).
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2016
1196 pages
ISBN:9781450342063
DOI:10.1145/2908812
- Editor:
- Tobias Friedrich,
- General Chair:
- Frank Neumann,
- Program Chair:
- Andrew M. Sutton
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 July 2016
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '16
Sponsor:
Acceptance Rates
GECCO '16 Paper Acceptance Rate 137 of 381 submissions, 36%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 117Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
Cited By
View all- Gil-Borrás SPardo EAlonso-Ayuso ADuarte A(2020)Basic VNS for a Variant of the Online Order Batching ProblemVariable Neighborhood Search10.1007/978-3-030-44932-2_2(17-36)Online publication date: 8-Apr-2020
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in