A review of algorithms for order batching problem in distribution center

Zhao, Peng

doi:10.2991/lemcs-14.2014.40

Cited by 6 publications

(6 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In addition to same-day delivery with simplified routing costs, one-dimensional models have application in other areas where a vehicle or machine's movement is constrained along a single dimension; see [22,23,57]. Also, our model is closely related to the Order Batching Problem (OBP) [25,42], which determines optimal assignment of pick orders to batches and the pick tour sequence for each batch in warehouse operations. The Dynamic Order Batching Problem (DOBP) is an extension with orders arriving dynamically while the decision maker processes previous orders; see [13].…”

Section: Vehicle Routing and Dispatch Problemsmentioning

confidence: 99%

The One-Dimensional Dynamic Dispatch Waves Problem

Klapp

Erera

Toriello

2018

Transportation Science

View full text Add to dashboard Cite

We study same-day delivery (SDD) systems by formulating the Dynamic Dispatch Waves Problem (DDWP), which models a depot where delivery requests arrive dynamically throughout a service day. At any dispatch epoch (wave), the information available to the decision maker is (1) a set of known, open requests which remain unfulfilled, and (2) a set of potential requests that may arrive later in the service day. At each wave, the decision maker decides whether or not to dispatch a vehicle, and if so, which subset of open requests to serve, with the objective of minimizing expected vehicle operating costs and penalties for unserved requests. We consider the DDWP with a single delivery vehicle and request destinations on a line, where vehicle operating times and costs depend only on the distance between points. We propose an efficient dynamic programming approach for the deterministic variant, and leverage it to design an optimal a priori policy with predetermined routes for the stochastic case. We then show that fully dynamic policies may perform arbitrarily better than a priori ones, and propose heuristics and dual bounds for this case.One enhancement to customer service in this sector is same-day delivery (SDD). Several e-retailers and logistics service providers have introduced programs in major US cities; see Table 1. We define SDD as a distribution service where consumers place orders on the same day that they should be delivered. For companies that implement SDD, it is imperative to both offer high levels of customer service and keep logistics costs as low as possible.Providing SDD services requires two core logistics processes: (1) order management at the stocking location, including receiving, picking, and packing orders; and (2) order distribution from the stocking location to delivery locations. To date, two classes of service providers have deployed SDD services: retailers offering items primarily from owned stocks (in distribution centers or retail stores) such as Amazon and Walmart, and logistics providers serving as intermediaries that pick up packages from stocking locations and deliver them to customers, such as Google and Instacart as well as USPS, FedEx and UPS. Retailers must manage both core logistics processes, while logistics providers are typically concerned with the second one. This research effort is a study of primary tradeoffs in SDD distribution. We formulate the Dynamic Dispatch Waves Problem (DDWP) as a Markov Decision Process (MDP). The DDWP models the dynamics of a single dispatch facility (depot) where customer order requests arrive dynamically throughout an operating day. At any decision epoch, which we call a wave, the logistics operator maintains a set of known open requests with known delivery destinations and a set of potential requests that may arrive before the end of the day. At each wave, the operator decides whether or not to dispatch vehicles loaded with known orders, and the vehicle routes for dispatched orders. The objective is to minimize expected operational costs and expect...

show abstract

Section: Vehicle Routing and Dispatch Problemsmentioning

confidence: 99%

The One-Dimensional Dynamic Dispatch Waves Problem

Klapp

Erera

Toriello

2018

Transportation Science

View full text Add to dashboard Cite

show abstract

“…Bu nedenle çözüm algoritmaları daha çok sezgisel veya meta-sezgisel yöntemlerden oluşmaktadır. Ma ve Zhao (2014) literatürde bulunan ve sipariş yığınlama problemi için kullanılmış sezgisel ve meta-sezgisel algoritmalarla ilgili yayınları incelemişler ve sınıflandırmışlardır. Sipariş toplama modelleri çoğunlukla paralel raf sistemi ve tek toplayıcılar için çözümlenmiştir.…”

Section: Li̇teratürunclassified

Solution Of Order Batching Problem With Association Rules And Genetic Algorithm: A Case Study In Pharmacy Warehouse

Yener¹,

Yazg̈an²,

Cömert³

et al. 2016

Journal of Transportation and Logistics

View full text Add to dashboard Cite

ÖZBu çalışmada, bir ecza deposunun günlük sipariş toplama stratejisi incelenmiş ve uygun bir yaklaşım geliştirilmiştir. Ürünlerin ve siparişlerin hacimsel olarak küçük olduğu, toplayıcı kapasitesinin göreceli olarak büyük olduğu depolar için uygun olan, sipariş yığınlama stratejisi kullanılmıştır. Günlük siparişler, siparişler arası ilişkiyi en büyükleyen bir matematiksel modelin yardımıyla sipariş yığınlarına ayrılmış. Birden çok siparişin bir araya gelmesiyle oluşan yığınlar içerisinde benzer ürünleri içeren siparişler bulunduğu için toplama sırasında ki kayıp zaman ve mesafeden tasarruf sağlanacaktır. Matematiksel modelin kesin çözümünün zaman alması nedeniyle genetik algoritma kullanılarak sonuç üretilmiştir. Farklı toplama stratejileri sonucunda kat edilen toplam mesafe benzetim yardımıyla hesaplanarak, istatistiki olarak sonuçların güvenilirliği ve performansları sonuç bölümünde tartışılmıştır. Solution Of Order Batching Problem With Association Rules And Genetic ABSTRACTIn this study, daily strategy of order picking is examined and proposed a new approach in a pharmacy warehouse. If the goods and orders are relatively small for the picker's capacity, the order batching strategy should put to use. Daily orders was divided to order batches using mathematical model maximised the relationship among the orders. The order batches which are consist of more than one orders save up time and distance during the order picking period. Optimum solution of mathematical model take up time so that Genetic algorithm is used for order batching problem. Travelled the total distance is simulated in existing and batching strategy, the confidingness and performance of the results are tested statistically and argued in conclusion.

show abstract

“…Making order picking less laborious is also important to improving efficiency (Ho et al, 2008;Thomas and Meller, 2015). A number of articles have reported that it accounts for as much as 55% (De Koster et al, 2007;Tompkins et al, 2010), 50-65% (Ma and Zhao, 2014), 60-65% (Henn, 2012), or even 60-70% (Chen et al, 2015) of warehousing costs.…”

Section: Introductionmentioning

confidence: 99%

An interventionist strategy for warehouse order picking: Evidence from two case studies

Giannikas

Robertson

et al. 2017

International Journal of Production Economics

View full text Add to dashboard Cite

As the role of the customer becomes more important in modern logistics, warehouses are required to improve their response to customer orders. To meet the responsiveness expected by customers, warehouses need to shorten completion times. In this paper, we introduce an interventionist order picking strategy that aims to improve the responsiveness of order picking systems. Unlike existing dynamic strategies, the proposed strategy allows a picker to be intervened during a pick cycle to consider new orders and operational disruptions. An interventionist strategy is compared against an existing dynamic picking strategy via a case study. We report benefits both in terms of order completion time and travel distance. This paper also introduces a set of system requirements for deploying an interventionist strategy based on a second case study.

show abstract

A review of algorithms for order batching problem in distribution center

Cited by 6 publications

References 27 publications

The One-Dimensional Dynamic Dispatch Waves Problem

The One-Dimensional Dynamic Dispatch Waves Problem

Solution Of Order Batching Problem With Association Rules And Genetic Algorithm: A Case Study In Pharmacy Warehouse

An interventionist strategy for warehouse order picking: Evidence from two case studies

Contact Info

Product

Resources

About