A methodology to solve the Order Batching Problem

Zúñiga, Catya; Olivares-Benítez, Elìas; Tenahua, Angélica; Mujica, Miguel

doi:10.1016/j.ifacol.2015.06.279

Cited by 7 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main limitation of the proposed algorithm is related to the assumptions that were made in its design process. Some warehouses have a large volume or a high quality of goods, so one AGV may not carry a lot during the actual warehousing process [29]. Once capacity constraints are taken into account, the number of AGVs in and out of storage increases, and the resolution of conflicts becomes more complex.…”

Section: Discussionmentioning

confidence: 99%

A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

Xing

Liu

et al. 2020

Mathematics

View full text Add to dashboard Cite

In this paper, we propose a novel tabu search (NTS) algorithm that improves the efficiencies of picking goods of automated guided vehicles (AGVs) in an automatic warehouse by solving the conflicts that happen when multiple AGVs work at the same time. Relocation and exchanging operations are designed for the neighborhood searching process based on each pickup-point’s location in the warehouse, along with the initial solution generation and the termination condition in the proposed algorithm. The experimental results show that the tabu search algorithm can effectively optimize the order of pickup points, which could further reduce the total travel distance and improve the efficiencies of AGVs in automatic warehouses.

show abstract

Section: Discussionmentioning

confidence: 99%

A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

Xing

Liu

et al. 2020

Mathematics

View full text Add to dashboard Cite

show abstract

“…They also note that the resulting model can be conveniently implemented during the order picking systems design and selection process [94]. With optimization and simulation, Zuniga et al (2015) build a hybrid algorithm for the OBP in their research. The optimization algorithm generates the initial solution of certain deterministic parameters that feed the model of simulation [95].…”

Section: Simulationmentioning

confidence: 99%

“…With optimization and simulation, Zuniga et al (2015) build a hybrid algorithm for the OBP in their research. The optimization algorithm generates the initial solution of certain deterministic parameters that feed the model of simulation [95].…”

Section: Simulationmentioning

confidence: 99%

The order batching problem: A state-of-the-art review

Boz¹

2022

Sigma J Eng Nat Sci - Sigma Müh Fen Bil Derg

View full text Add to dashboard Cite

The Order Batching Problem (OBP) has received a lot of attention from researchers in recent years. Until now, this problem has been considered as a whole with different problems or it has been studied on its own, with different solution methods, in different warehouse layouts, with different data structures. The aim of this study is to provide the researchers with a general analysis for studies using the OBP. In accordance with this purpose; the OBP is analyzed by an extensive literature review that includes all relevant studies to date. This literature review is based on a specific method and the studies are grouped into specific classes. Accordingly, the most studied problem with the OBP is the Picker Routing Problem (PRP) with 17% and 51% of the studies were solved by metaheuristic algorithms. The most widely used metaheuristic algorithms are Neighborhood Search and Genetic Algorithms.

show abstract

“…Studies carried out by [2,3], show that the order picking is one of the most critical processes at an operational level within a warehouse, because it represents 55-60% of costs; therefore, companies are forced to perform this activity in the best possible way. Zuniga [4] mentions that in warehouses, especially for distribution centers (DC); the order picking process for distribution centers (DC), has become more important and complex, because of its flexibility, which provides many advantages, such as the ability to handle products of different sizes, forms, weights and volumes with the same resources to react to market fluctuations. However, it also increases the number of decision variables and the complexity of the system, which complications decision-making activities.…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2020

View full text Add to dashboard Cite

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.

show abstract

A methodology to solve the Order Batching Problem

Cited by 7 publications

References 15 publications

A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

The order batching problem: A state-of-the-art review

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

Contact Info

Product

Resources

About