Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management
One of the critical warehousing processes is the order-picking process. This activity consists of retrieving items from their storage locations to fulfill the demand specified in the pick lists. Therefore, the storage location assignment affects the picking time and, consequently, reduces the operat...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-07-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/12/7/711 |
| _version_ | 1827733948045721600 |
|---|---|
| author | Johanna Bolaños-Zuñiga M. Angélica Salazar-Aguilar Jania Astrid Saucedo-Martínez |
| author_facet | Johanna Bolaños-Zuñiga M. Angélica Salazar-Aguilar Jania Astrid Saucedo-Martínez |
| author_sort | Johanna Bolaños-Zuñiga |
| collection | DOAJ |
| description | One of the critical warehousing processes is the order-picking process. This activity consists of retrieving items from their storage locations to fulfill the demand specified in the pick lists. Therefore, the storage location assignment affects the picking time and, consequently, reduces the operating costs of the warehouse. This work presents two alternative mixed-integer linear models and an adaptive multi-start heuristic (AMH) for solving the integrated storage location and picker-routing problem. The problem considers a warehouse with a general layout and precedence constraints for picking according to the products weight. Experimental work confirms the efficiency of the proposed reformulations since we found out a total of 334 tested instances and optimal solutions for 51 new cases and 62 new feasible solutions. The proposed AMH improved more than 29% of the best-known solutions and required an average execution time of 117 s. Consequently, our proposed algorithm is an attractive decision-making tool to achieve efficiency when solving practical situations in a warehouse. |
| first_indexed | 2024-03-11T01:18:41Z |
| format | Article |
| id | doaj.art-7b7deb2935db486e9c0f75dbad239619 |
| institution | Directory Open Access Journal |
| issn | 2075-1680 |
| language | English |
| last_indexed | 2024-03-11T01:18:41Z |
| publishDate | 2023-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Axioms |
| spelling | doaj.art-7b7deb2935db486e9c0f75dbad2396192023-11-18T18:18:24ZengMDPI AGAxioms2075-16802023-07-0112771110.3390/axioms12070711Solving Location Assignment and Order Picker-Routing Problems in Warehouse ManagementJohanna Bolaños-Zuñiga0M. Angélica Salazar-Aguilar1Jania Astrid Saucedo-Martínez2Facultad de Ingeniería Mecánica Eléctrica, Universidad Autónoma de Nuevo León, Av. Universidad S/N, Ciudad Universitaria, San Nicolás de los Garza 66455, Nuevo León, MexicoFacultad de Ingeniería Mecánica Eléctrica, Universidad Autónoma de Nuevo León, Av. Universidad S/N, Ciudad Universitaria, San Nicolás de los Garza 66455, Nuevo León, MexicoFacultad de Ingeniería Mecánica Eléctrica, Universidad Autónoma de Nuevo León, Av. Universidad S/N, Ciudad Universitaria, San Nicolás de los Garza 66455, Nuevo León, MexicoOne of the critical warehousing processes is the order-picking process. This activity consists of retrieving items from their storage locations to fulfill the demand specified in the pick lists. Therefore, the storage location assignment affects the picking time and, consequently, reduces the operating costs of the warehouse. This work presents two alternative mixed-integer linear models and an adaptive multi-start heuristic (AMH) for solving the integrated storage location and picker-routing problem. The problem considers a warehouse with a general layout and precedence constraints for picking according to the products weight. Experimental work confirms the efficiency of the proposed reformulations since we found out a total of 334 tested instances and optimal solutions for 51 new cases and 62 new feasible solutions. The proposed AMH improved more than 29% of the best-known solutions and required an average execution time of 117 s. Consequently, our proposed algorithm is an attractive decision-making tool to achieve efficiency when solving practical situations in a warehouse.https://www.mdpi.com/2075-1680/12/7/711warehousingpicker-routing problemstorage locationmixed-integer linear programmingheuristicprecedence constraints |
| spellingShingle | Johanna Bolaños-Zuñiga M. Angélica Salazar-Aguilar Jania Astrid Saucedo-Martínez Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management Axioms warehousing picker-routing problem storage location mixed-integer linear programming heuristic precedence constraints |
| title | Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management |
| title_full | Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management |
| title_fullStr | Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management |
| title_full_unstemmed | Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management |
| title_short | Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management |
| title_sort | solving location assignment and order picker routing problems in warehouse management |
| topic | warehousing picker-routing problem storage location mixed-integer linear programming heuristic precedence constraints |
| url | https://www.mdpi.com/2075-1680/12/7/711 |
| work_keys_str_mv | AT johannabolanoszuniga solvinglocationassignmentandorderpickerroutingproblemsinwarehousemanagement AT mangelicasalazaraguilar solvinglocationassignmentandorderpickerroutingproblemsinwarehousemanagement AT janiaastridsaucedomartinez solvinglocationassignmentandorderpickerroutingproblemsinwarehousemanagement |