An ant colony optimization routing algorithm for two order pickers with congestion consideration

Chen, Fangyu; Wang, Hongwei; Qi, Chao; Xie, Yong

doi:10.1016/j.cie.2013.06.013

Cited by 76 publications

(44 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Azadnia et al [2013] considered heuristics that solve sequencing and batching first, then routing in a second stage. For warehouses with three cross-aisles, Chen et al [2013] focused on preventing the congestion that occurs when there are just two pickers. For example congestion might occur if the two order pickers attempt to simultaneously traverse the same narrow pick aisle from opposite directions.…”

Section: Heuristics Multiple Blocksmentioning

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

Section: Heuristics Multiple Blocksmentioning

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

show abstract

“…In the literature, vehicle routing problems can be structured differently according to various constraints, such as capacitated VRP [120][121][122][123][124][125][126], the VRP with heterogeneous fleet of vehicles [127], open VRP [128][129][130][131], VRP with time windows [132][133][134][135][136][137][138], VPR with both pick-up and delivery [139][140][141][142][143][144], location routing problem [145][146][147], period VRP [148][149][150][151], multidepot VRP [152][153][154][155][156], VRP with backhaul [157][158][159], inventory routing problem [160][161][162][163], dynamic VRP [164], or the mixture [165][166]…”

Section: Vrpmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

“…The majority of research has concentrated on developing heuristics for the routing of order pickers, as heuristics often lead to tours that are more convenient for the order picker (Hwang et al, 2004;Petersen and Aase, 2004;Theys et al, 2010). More recently, some authors have considered picker blocking and congestion in routing order pickers through the warehouse (Pan and Wu, 2012;Hong et al, 2012;Chen et al, 2013).…”

Section: Order Picking Literaturementioning

confidence: 99%