Skip to Content
You are currently on the new version of our website. Access the old version .
Applied SciencesApplied Sciences
  • Article
  • Open Access

10 January 2020

15 Pages

Optimization of the Storage Location Assignment and the Picker-Routing Problem by Using Mathematical Programming

,
,
and
1
Facultad de Ingeniería Mecánica Eléctrica, Universidad Autónoma de Nuevo León, Pedro de Alba S/N, Ciudad Universitaria, San Nicolás de los Garza 66451, Mexico
2
Facultad de Ingeniería, Universidad Panamericana, Augusto Rodin No. 498, Ciudad de México 03920, Mexico
*
Authors to whom correspondence should be addressed.

Abstract

The order picking process involves a series of activities in response to customer needs, such as the selection or programming of orders (batches), and the selection of different items from their storage location to shipment. These activities are accomplished by a routing policy that determines the picker sequence for retrieving the items from the storage location. Therefore, the order picking problem has been plenty investigated; however, in previous research, the proposed models were based on demand fulfilling, putting aside factors such as the product weight—which is an important criterion—at the time of establishing routes. In this article, a mathematical model is proposed; it takes into account the product’s weight derived from a case study. This model is relevant, as no similar work was found in the literature that improves the order picking by making simultaneous decisions on the storage location assignment and the picker-routing problem, considering precedence constraints based on the product weight and the characteristics of the case study, as the only location for each product in a warehouse with a general layout.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.