Abstract
The goal of packing optimization is to provide a foundation for decisions related to inventory allocation as merchandise is brought to warehouses and then dispatched. Major retail chains must fulfill requests from hundreds of stores by dispatching items stored in their warehouses. The demand for clothing items may vary to a considerable extent from one store to the next. To take this into account, the warehouse must pack “boxes” containing different mixes of clothing items. The number of distinct box types has a major impact on the operating costs. Thus, the PrePack problem consists in determining the number and contents of the box types, as well as the allocation of boxes to stores. This paper introduces the PrePack problem and proposes CP and MIP models and a metaheuristic approach to address it.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Erie, C.W., Lee, J.S., Paske, R.T., Wilson, J.P.: Dynamic bulk packing and casing. International Business Machines Corporation, US20100049537 A1 (2010)
Vakhutinsky, A., Subramanian, S., Popkov, Y., Kushkuley, A.: Retail pre-pack optimizer. Oracle International Corporation, US20120284079 A1 (2012)
Pratt, R.W.: Computer-implemented systems and methods for pack optimization. SAS Institute, US20090271241 A1 (2009)
Chandra, A.K., Hirschberg, D.S., Wong, C.K.: Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science 3(3), 293–304 (1976)
Mendoza, J.E., Medaglia, A.L., Velasco, N.: An evolutionary-based decision support system for vehicle routing: The case of a public utility. Decision Support Systems 46, 730–742 (2009)
Medaglia, A.L., Gutérrez, E.J.: An object-oriented framework for rapid development of genetic algorithms. Handbook of Research on Nature Inspired Computing for Economics and Management. Idea Publishing Group (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hoskins, M., Masson, R., Gauthier Melançon, G., Mendoza, J.E., Meyer, C., Rousseau, LM. (2014). The PrePack Optimization Problem. In: Simonis, H. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2014. Lecture Notes in Computer Science, vol 8451. Springer, Cham. https://doi.org/10.1007/978-3-319-07046-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-07046-9_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07045-2
Online ISBN: 978-3-319-07046-9
eBook Packages: Computer ScienceComputer Science (R0)