The PrePack Optimization Problem
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.
KeywordsAssignment Problem Constraint Programming Memetic Algorithm Large Neighborhood Search Metaheuristic Approach
Unable to display preview. Download preview PDF.
- 1.Erie, C.W., Lee, J.S., Paske, R.T., Wilson, J.P.: Dynamic bulk packing and casing. International Business Machines Corporation, US20100049537 A1 (2010)Google Scholar
- 2.Vakhutinsky, A., Subramanian, S., Popkov, Y., Kushkuley, A.: Retail pre-pack optimizer. Oracle International Corporation, US20120284079 A1 (2012)Google Scholar
- 3.Pratt, R.W.: Computer-implemented systems and methods for pack optimization. SAS Institute, US20090271241 A1 (2009)Google Scholar
- 6.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)Google Scholar