The min-max order picking problem in synchronised dynamic zone-picking systems

2022-04-01
Saylam, Serhat
Çelik, Melih
Süral, Haldun
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
164
views
0
downloads
In both manual and automated warehouses, a combination of efficient zoning and picker routing plays an important role in improving travel time, congestion, and system throughput. This paper considers the order picker routing problem in a dynamic and synchronised zoning environment, where the items corresponding to each customer order are picked simultaneously in multiple zones, and zones may change between different orders. The objective is to minimise the maximum time of completing the picking activities in any zone. Using a min-max type of objective not only minimises the makespan of an order picking wave, but it also helps balance the workload of the order pickers more effectively. We present a mathematical model for the optimal solution of this problem, as well as a dynamic programming approach to find the optimal solution for the case where a zone is a set of adjacent aisles. Computational experiments on randomly generated instances show that the dynamic programming approach is able to find optimal solutions in negligible computational times.
Warehouse management, order picking, zone picking, workload balancing, dynamic programming, heuristics, PERFORMANCE APPROXIMATION, MULTIPLE PICKERS, WAREHOUSE, DESIGN, ASSIGNMENT, ALGORITHM, DISTANCE
https://hdl.handle.net/11511/96942
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Department of Industrial Engineering, Article

Suggestions

An iterative hub location and routing problem for postal delivery systems
Çetiner, Selim; Sepil, Canan; Süral, Haldun; Department of Industrial Engineering (2003)
In this study, we consider the Turkish postal delivery system and develop an effective solution approach for the combined hub location and routing problem where the location of hub nodes are determined, the nonhub regional postal offices are allocated to the hubs, and the optimal set of routes are determined for each hub. Since the realized post-routing distances between origin-destination pairs are different from those used in the hub-location model, we develop an algorithm that finds the route-compatible ...
The congested multicommodity network design problem
Paraskevopoulos, Dimitris C.; Gürel, Sinan; Bektas, Tolga (2016-01-01)
This paper studies a version of the fixed-charge multicommedity network design problem where in addition to the traditional costs of flow and design, congestion at nodes is explicitly considered. The problem is initially modeled as a nonlinear integer programming formulation and two solution approaches are proposed: (i) a reformulation of the problem as a mixed integer second order cone program to optimally solve the problem for small to medium scale problem instances, and (ii) an evolutionary algorithm usi...
A computation-implementation parallelization approach to the vehicle loading and routing problem
Çavdar, Bahar; Sokol, Joel (Wiley, 2019-01-01)
In this article, we address a version of the capacitated vehicle routing problem where there is a constraint on the total time that can be spent on computing delivery routes and loading the vehicles. This problem, which we call the vehicle loading and routing problem (VLRP), can arise, for example, in the delivery of small, quick-turnaround orders from a warehouse. We propose a computation-implementation parallelization (CIP) approach to solving large VLRP instances, and present computational results showin...
A genetic algorithm for the uncapacitated single allocation planar hub location problem
Damgacioglu, Haluk; DİNLER, DERYA; Özdemirel, Nur Evin; İyigün, Cem (2015-10-01)
Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each s...
Detecting queue length on urban arterials using floating car data (FCD)
Altıntaşı, Oruç; Tüydeş Yaman, Hediye; Tuncay, Kağan; Department of Civil Engineering (2018)
Accurate estimation of queue lengths whether in the approach of a signalized intersection or near a bottleneck location along an uninterrupted urban arterial is essential for better traffic management. This requires reliable traffic data, which is traditionally obtained from loop detectors, video cameras, etc. More recently, Floating Car Data (FCD) is being increasingly used as an alternative traffic data source due to its lower cost and high coverage area. Commercially available FCD is obtained from GPS eq...
Citation Formats
S. Saylam, M. Çelik, and H. Süral, “The min-max order picking problem in synchronised dynamic zone-picking systems,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 0–0, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/96942.
METU IIS - Integrated Information Service open@metu.edu.tr