Variable Neighborhood Search strategies for the Order Batching Problem

Menéndez, Borja; Pardo, Eduardo G.; Alonso‐Ayuso, Antonio; Molina, Elisenda

doi:10.1016/j.cor.2016.01.020

Cited by 67 publications

(36 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The dierent batching strategies can be evaluated by xing a routing algorithm that calculates the total travelled distance or time (de Koster et al, 1999). This is usually performed with the so-called S-shape algorithm or the Largest-gap strategy (de Koster et al, 1999;Henn et al, 2010), or a combination of these two algorithms (Roodbergen & de Koster, 2001a;Menéndez et al, 2017). The main dierence between the two strategies is that in the former the picker that enters one aisle goes across the entire aisle, while in the latter it gets in and out from the same side of the aisle.…”

Section: Literature Reviewmentioning

confidence: 99%

An efficient and general approach for the joint order batching and picker routing problem

Briant

Cambazard

Cattaruzza

et al. 2020

European Journal of Operational Research

View full text Add to dashboard Cite

Picking is the process of retrieving products from inventory. It is mostly done manually by dedicated employees called pickers and is considered the most expensive of warehouse operations. To reduce the picking cost, customer orders can be grouped into batches that are then collected by traveling the shortest possible distance.This work presents an exponential linear programming formulation to tackle the joint order batching and picker routing problem. Variables, or columns, are related to the picking routes in the warehouse. Computing such routes is generally an intractable routing problem and relates to the well known traveling salesman problem (TSP). Nonetheless, the rectangular warehouse's layouts can be used to eciently solve the corresponding TSP and take into account in the development of an ecient subroutine, called oracle. We therefore investigate whether such an oracle allows for an eective exponential formulation.Experimented on a publicly available benchmark, the algorithm proves to be very eective. It improves many of the best known solutions and provides very strong lower bounds. Finally, this approach is applied to another industrial case to demonstrate its interest for this eld of application.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An efficient and general approach for the joint order batching and picker routing problem

Briant

Cambazard

Cattaruzza

et al. 2020

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Computational results were presented for a large number of test problems. Menendez et al [2017b] presented a two-stage variable neighbourhood search heuristic for order batching where picker routing was done using an approach based on a modification of the combined strategy given by Roodbergen and de Koster [2001a]. Computational results were presented for a large number of test problems.…”

Section: Early Workmentioning

confidence: 99%

Order batching using an approximation for the distance travelled by pickers

Valle

Beasley

2020

European Journal of Operational Research

View full text Add to dashboard Cite

In this paper we investigate the problem of order batching for picker routing. Our approach is applicable to warehouses (storage areas) arranged in the standard rectangular grid layout, so with parallel aisles and two or more cross-aisles. The motivation underlying our work is online grocery shopping in which orders may be composed of dozens of items. The approach presented directly addresses order batching, but uses a distance approximation to influence the batching of orders without directly addressing the routing problem.We present a basic formulation based on deciding the orders to be batched together so as to optimise an objective that approximates the picker routing distance travelled. We extend our formulation by improving the approximation for cases where we have more than one block in the warehouse. We present constraints to remove symmetry in order to lessen the computational effort required, as well as constraints that significantly improve the value of the linear programming relaxation of our formulation. A heuristic algorithm based on partial integer optimisation of our mathematical formulation is also presented. Once order batching has been decided we optimally route each individual picker using a previous approach presented in the literature.Extensive computational results for publicly available test problems involving up to 75 orders are given for both single and multiple block warehouse configurations.

show abstract

“…Choe e Sharp (1991) levantam dois critérios principais: a proximidade das posições de separação; e a janela de tempo de chegada dos pedidos. Baseando-se nesses critérios, diferentes métodos heurísticos e ótimos são apresentados em Menéndez et al (2017), Henn (2012), Henn et al (2012), Yu e De Koster (2009); Gademann e Van de Velde (2005), De Koster et al (2007), De Koster et al (1999) e Choe e Sharp (1991). O problema de agrupamento de ordens é classificado como NP-difícil (Gademann e Van de Velde, 2005), o que indica a dificuldade em se obter soluções ótimas, principalmente para um número elevado de ordens.…”

Section: Métodos De Agrupamento De Ordensunclassified

Otimização Do Agrupamento De Ordens E Roteirização De Coleta: Um Estudo De Caso Em Um Armazém De E-Commerce

Santos

Munari

2017

PODes

View full text Add to dashboard Cite

RESUMOA separação de ordens é uma atividade que possui impacto importante no desempenho geral de uma cadeia logística. A eficiência dessa atividade está diretamente ligada à forma como se agrupam as ordens a serem coletadas, bem como ao tempo das rotas utilizadas para a coleta dos itens. Neste trabalho, são propostos métodos de solução para o problema de agrupamento de ordens e roteirização de coleta, baseando-se em um estudo de caso realizado em um ecommerce de móveis localizado no interior de São Paulo. Os métodos propostos contemplam as características específicas do caso em estudo e foram integrados a uma planilha automatizada de modo a apoiar a tomada de decisão na empresa. Os resultados de experimentos computacionais realizados com dados reais apontam que a implantação dos métodos de agrupamentos de ordens e roteirização de coleta propostos pode levar a rotas 35% mais curtas que as atuais, em média. Os resultados são ainda mais promissores ao se considerar a alteração do layout do armazém, podendo reduzir a distância total das rotas em até 40%, em média. Palavras-chave: Logística, Armazém, Separação de ordens, Agrupamento, Roteirização. ABSTRACTOrder picking has an important contribution to the overall performance of a logistic chain. The efficiency of this activity is totally related to the way that one creates batches of orders that have to be collected, as well as to the duration of routes used to collect items. In this paper, we propose solution methods for the order batching and routing problems, based on a case study carried out on a furniture e-commerce company, located in the state of São Paulo. The proposed methods cover the specific characteristics of the case and they were integrated to an automatized spreadsheet that allows the decision making support to the company. The results of computational experiments using real-life data indicate that the order batching and routing methods may lead to routes that are 35% shorter than the currently adopted by the company, on average. The results are more promising if we allow a layout adjustment of the warehouse, which may reduce the total distance up to 40%, on average.

show abstract

Variable Neighborhood Search strategies for the Order Batching Problem

Cited by 67 publications

References 27 publications

An efficient and general approach for the joint order batching and picker routing problem

An efficient and general approach for the joint order batching and picker routing problem

Order batching using an approximation for the distance travelled by pickers

Otimização Do Agrupamento De Ordens E Roteirização De Coleta: Um Estudo De Caso Em Um Armazém De E-Commerce

Contact Info

Product

Resources

About