Advance Search

Combination of a heuristic and simulation approach for route evaluation in order picking in a distribution center

Jhon Alexander Segura Dorado
Corporación Universitaria Comfacauca, Colombia
Helmer Paz Orozco
Corporación Universitaria Comfacauca, Colombia
Oscar Rubiano Ovalle
Universidad del Valle, Colombia
Keywords:
Copyright and Licensing:

Copyright (c) 2024 Investigación e Innovación en Ingenierías

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Share:

Abstract

Objective: This study focuses on the optimization of order picking in distribution centers (DC), a task that involves significant time, labor, and costs.  Methodology: A mathematical model based on mixed integer linear programming (MILP) was used to minimize the total distance traveled during order picking. This model was applied to a Colombian case and complemented with a simulation model to evaluate improvement scenarios. Results: The mathematical model generated four optimal routes for order picking. Two of the routes used S-shaped routing, one used return routing, and another combined both policies, thus reducing the total distance by 5% to complete the order-picking process. Subsequently, the simulation model was used to evaluate three improvement scenarios: i) increasing the capacity of the picking carts, ii) increasing the number of picking carts, and iii) increasing both parameters simultaneously. Conclusions: The best result was obtained by increasing the capacity of the picking carts by 33%, which reduced the distance traveled by 49.5% and had a positive impact on other defined operational indicators. This innovative combined approach to the routing problem can be used to explore further improvements.

PDF (Español (España))
PDF (Español (España))

References

  1. R. De Santis, R. Montanari, G. Vignali, and E. Bottani, “An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses,” Eur. J. Oper. Res., vol. 267, no. 1, pp. 120–137, 2018, doi: 10.1016/j.ejor.2017.11.017.
  2. M. Mauleón Torres, “Preparación de Pedidos: Teoría.” 2013. [Online]. Available: https://elibro.net/es/ereader/unicomfacauca/62791?page=5.
  3. E. E. Aleisa and Li Lin, “For Effective Facilities Planning: Layout Optimization Then Simulation, or Vice Versa?,” Proc. Winter Simul. Conf. 2005., pp. 1381–1385, 2005, doi: 10.1109/WSC.2005.1574401.
  4. F. Hossein Nia Shavaki and F. Jolai, “A rule-based heuristic algorithm for joint order batching and delivery planning of online retailers with multiple order pickers,” Appl. Intell., 2020, doi: 10.1007/s10489-020-01843-9.
  5. G. G. Ortiz, H. C. Vargas, and M. C. Hernández, “Analysis of formal techniques in order operations in a CEDIS 3PL of finished products,” Investig. Operacional, vol. 41, no. 3, pp. 326–343, 2020, doi: 10.35429/h.2020.1.27.50.
  6. R. de Koster, T. Le-Duc, and K. J. Roodbergen, “Design and control of warehouse order picking: A literature review,” Eur. J. Oper. Res., vol. 182, no. 2, pp. 481–501, 2018, doi: 10.1016/j.ejor.2006.07.009.
  7. H. Davarzani and A. Norrman, “Toward a relevant agenda for warehousing research: literature review and practitioners’ input,” Logist. Res., vol. 8, no. 1, 2018, doi: 10.1007/s12159-014-0120-1.
  8. O. Kulak, Y. Sahin, and M. E. Taner, “Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms,” Flex. Serv. Manuf. J., vol. 24, no. 1, pp. 52–80, 2012, doi: 10.1007/s10696-011-9101-8.
  9. G. Dukic and C. Oluic, “Order-picking methods : improving order-picking efficiency Goran Dukic * and Cedomir Oluic,” Dukic, vol. 3, no. 4, 2007.
  10. C. H. Mowrey and P. J. Parikh, “Mixed-width aisle configurations for order picking in distribution centers,” Eur. J. Oper. Res., vol. 232, no. 1, pp. 87–97, 2014, doi: 10.1016/j.ejor.2013.07.002.
  11. N. Pillay and R. Qu, “Vehicle routing problems,” Nat. Comput. Ser., pp. 51–60, 2018, doi: 10.1007/978-3-319-96514-7_7.
  12. E. Bottani, A. Volpi, and R. Montanari, “Design and optimization of order picking systems: An integrated procedure and two case studies,” Comput. Ind. Eng., vol. 137, no. September, p. 106035, 2019, doi: 10.1016/j.cie.2019.106035.
  13. N. Shetty, B. Sah, and S. H. Chung, “Route optimization for warehouse order picking operations via vehicle routing and simulation,” SN Appl. Sci., vol. 2, no. 2, 2020, doi: 10.1007/s42452-020-2076-x.
  14. T. Wang, M. Singh, and G. Süer, “Evaluation of alternative labor levels to minimize average flowtime at distribution centers,” Procedia Manuf., vol. 39, no. 2019, pp. 1482–1492, 2019, doi: 10.1016/j.promfg.2020.01.300.
  15. C. M. Mohr, “Optimization of warehouse order-picking routes using vehicle routing model and genetic algorithm,” 2014.
  16. N. Shetty, B. Sah, and S. H. Chung, “Route optimization for warehouse order picking operations via vehicle routing and simulation,” SN Appl. Sci., vol. 2, no. 2, pp. 1–18, 2020, doi: 10.1007/s42452-020-2076-x.
  17. P. Toth and D. Vigo, Vehicle Routing Problems. Philadelphia: Mathematical Optimization Society, 2002. [Online]. Available: http://library1.nida.ac.th/termpaper6/sd/2554/19755.pdf
  18. E. R. Zúñiga, M. U. Moris, A. Syberfeldt, M. Fathi, and J. C. Rubio-Romero, “A simulation-based optimization methodology for facility layout design in manufacturing,” IEEE Access, vol. 8, pp. 163818–163828, 2020, doi: 10.1109/ACCESS.2020.3021753.
  19. J. C. H. Pan and M. H. Wu, “Throughput analysis for order picking system with multiple pickers and aisle congestion considerations,” Comput. Oper. Res., vol. 39, no. 7, pp. 1661–1672, 2012, doi: 10.1016/j.cor.2011.09.022.
  20. K. J. Roodbergen and R. De Koster, “Routing methods for warehouses with multiple cross aisles,” Int. J. Prod. Res., vol. 39, no. 9, pp. 1865–1883, 2001, doi: 10.1080/00207540110028128.
  21. E. Bottani, G. Casella, and T. Murino, “A hybrid metaheuristic routing algorithm for low-level picker-to-part systems,” Comput. Ind. Eng., vol. 160, no. June, p. 107540, 2021, doi: 10.1016/j.cie.2021.107540.
  22. M. Masae, C. H. Glock, and P. Vichitkunakorn, “A method for efficiently routing order pickers in the leaf warehouse,” Int. J. Prod. Econ., vol. 234, no. February, p. 108069, 2021, doi: 10.1016/j.ijpe.2021.108069.
  23. J. B. Zuñiga, J. A. S. Martínez, T. E. S. Fierro, and J. A. M. Saucedo, “Optimization of the storage location assignment and the picker-routing problem by using mathematical programming,” Appl. Sci., vol. 10, no. 2, 2020, doi: 10.3390/app10020534.
How to Cite
[1]
J. A. Segura Dorado, H. Paz Orozco, and O. Rubiano Ovalle, “Combination of a heuristic and simulation approach for route evaluation in order picking in a distribution center”, Investigación e Innovación en Ingenierías, vol. 12, no. 2, pp. 1–20, Jul. 2024.

Send mail to Author

Send Cancel

Custom technologies based on your needs

  • MongoDB
  • ElasticSearch
  • Redis
  • Solr
  • Memcached