Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


2021 | 31 | 2 | 147-160

Article title

Defining a storage-assignment strategy for precedence-constrained order picking

Content

Title variants

Languages of publication

EN

Abstracts

EN
A zero-one quadratic assignment model has been proposed for dealing with the storage location assignment problem when there are weight constraints. Our analysis shows that operations can be improved using our model. When comparing the strategy currently used in a real-life company with the designed model, we found that the new placement of products allowed a reduction of up to 22% on the picking distance. This saving is higher than that achieved with the creation of density zones, a procedure commonly used to deal with weight constraints, according to the literature.

Year

Volume

31

Issue

2

Pages

147-160

Physical description

Contributors

  • Faculty of Economics, University of Porto, Porto, Portugal
  • Católica Porto Business School, Católica University, Porto, Portugal
  • Faculty of Economics, University of Porto, Porto, Portugal
  • Faculty of Economics, University of Porto, Porto, Portugal
  • INESC TEC – Science and Technology, Computers and Systems Engineering Institute, Porto, Portugal

References

  • AKIN BAS S., AHLATCIOGLU OZKOK B., A fuzzy approach to multi-objective mixed-integer linear programming model for multi-echelon closed-loop supply chain with multi-product multi-time period, Oper. Res. Dec., 2020, 30 (1), 25–46.
  • BINDI F., MANZINI R., PARESCHI A., REGATTIERI A., Similarity coefficients, clustering techniques for the correlated assignment problem in warehousing systems, Proc. 19th International Conference on Production Research, 2007.
  • BINDI F., MANZINI R., PARESCHI A., REGATTIERI A., Similarity-based storage allocation rules in an order picking system: An application to the food service industry, Int. J. Log. Res., Appl., 2009, 12 (4), 233–247.
  • BRYNZÉR H., JOHANSSON M.I., Storage location assignment. Using the product structure to reduce order picking times, Int. J. Prod. Econ., 1996, 46–47 (1996), 595–603.
  • CHABOT T., LAHYANI R., COELHO L.C., RENAUD J., Order picking problems under weight, fragility, category constraints, Int. J. Prod. Res., 2017, 55 (21), 6361–6379.
  • DE KOSTER R., LE-DUC T., ROODBERGEN K.J., Design, control of warehouse order picking. A literature review, Eur. J. Oper. Res., 2007, 182 (2), 481–501.
  • DHL, Robotics in Logistics, Retrieved from: https://www.logistics.dhl/global-en/home/insights-and-innovation/thought-leadership/trend-reports/robotics-in-logistics.html, 2018.
  • DIAZ R., Using dynamic demand information, zoning for the storage of non-uniform density stock-keeping units, Int. J. Prod. Res., 2016, 54 (8), 2487–2498.
  • EUROCOMMERCE, Retail, Wholesale in Europe, Retrieved from: https://www.eurocommerce.eu /retail-and-wholesale-in-europe.aspx, 2019.
  • FRAZELLE E., World-class warehousing, material handling, McGraw-Hill, New York 2002.
  • FRAZELLE E., SHARP G., Correlated assignment strategy can improve order-picking operation, Ind. Eng., 1989, 21, 33–37
  • GLOCK C.H., GROSSE E.H., Storage policies, order picking strategies in U-shaped order-picking systems with a movable base, Int. J. Prod. Res., 2012, 50 (16), 4344–4357.
  • GROSSE E.H., GLOCK C.H., BALLESTER-RIPOLL R., A simulated annealing approach for the joint order batching, order picker routing problem with weight restrictions, Int. J. Oper., Quant. Manage., 2014, 20 (2), 65–83.
  • KOSIŃSKI W., MUNIAK R., KOSIŃSKI W.K., A model for optimizing enterprise’s inventory costs. A fuzzy approach, Oper. Res. Dec., 2013, 23 (4), 39–54.
  • LIU C.M., Optimal storage layout, order picking for warehousing, Int. J. Oper. Res., 2004, 1 (1), 37–46.
  • MANZINI R., BINDI F., FERRARI E., PARESCHI A., Correlated storage assignment, Iso-time mapping adopting tri-later stackers. A case study from tile industry, [In:] R. Manzini (Ed.), Warehousing in the Global Supply Chain, Springer, London 2012, 373–396.
  • MARKETER. Global Ecommerce 2019, Retrieved from: https://www.emarketer.com/content/global-ecommerce-2019, 2019.
  • PETERSEN C.G., An evaluation of order picking routeing policies, Int. J. Oper. Prod. Manage., 1997, 17 (11), 1098–1111.
  • PETERSEN C.G., SCHMENNER R.W., An evaluation of routing, volume-based storage policies in an order picking operation, Dec. Sci., 1999, 30 (2), 481–501.
  • REYES J.J.R., SOLANO-CHARRIS E.L., MONTOYA-TORRES J.R., The storage location assignment problem. A literature review, Int. J. Ind. Eng. Comp., 2019, 10, 199–224.
  • ROSENWEIN M.B., An application of cluster analysis to the problem of locating items within a warehouse, IIE Trans., 1994, 26 (1), 101–103.
  • SHAH N.H., NAIK M., Coordinated production, ordering, shipment, pricing model for supplier-retailer inventory system under trade credit, Oper. Res. Dec., 2019, 29 (2), 55–76.
  • TARCZYŃSKI G., Analysis of the impact of storage parameters, the size of orders on the choice of the method for routing order picking, Oper. Res. Dec., 2012, 22 (4), 105–120.
  • TOMPKINS J.A., WHITE J.A., BOZER Y.A., TANCHOCO J.M.A., Facilities planning, 3rd Ed., Wiley, 2010.
  • VAN GILS T., RAMAEKERS K., CARIS A., DE KOSTER R.B., Designing efficient order picking systems by combining planning problems. State-of-the-art classification, review, Eur. J. Oper. Res., 2018, 267 (1), 1–15.
  • WUTTHISIRISART P., NOBLE J.S., CHANG C.A., A two-phase heuristic for relation-based item location, Comp. Ind. Eng., 2015, 82 (2015), 94–102.
  • XIAO J., ZHENG L., Correlated storage assignment to minimize zone visits for BOM picking, Int. J. Adv. Manuf. Techn., 2012, 61 (5–8), 797–807.
  • ZÛLJ I., GLOCK C.H., GROSSE E.H., SCHNEIDER M., Picker routing, storage assignment strategies for precedence-constrained order picking, Comp. Ind. Eng., 2018, 123 (2018), 338–347.

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.desklight-324df716-4e1d-403a-87d6-72dcdc08b5c0
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.