Order picking in a parallel-aisle warehouse with turn penalties

Date

2016-01-01

Author

ÇELİK, MELİH
Süral, Haldun

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

29
views

0
downloads

In many real-life routing problems, incorporating the negative effects of turns is an important, but often overlooked aspect. This is especially true for order picking in warehouses, where making the turns not only decreases the picking efficiency by reducing the speed of the vehicle, but it also results in other unquantifiable effects such as vehicle tipovers, increased congestion and increased risk of collision with pedestrians or other vehicles. In this paper, we consider the order picking problem in a parallel-aisle warehouse by taking into account the number and effect of the turns. In particular, we show that the problem of minimising the number of turns, minimising travel time under turn penalties, the biobjective problem that involves turn and travel time minimisation as separate objectives, and the triobjective problem with U-turn minimisation as a third objective can all be solved in polynomial time. Our computational results show that the algorithms we develop can generate the corresponding Pareto front very quickly, and significantly outperform heuristic approaches used in practice.

Subject Keywords

Management Science and Operations Research, Strategy and Management, Industrial and Manufacturing Engineering

URI

https://hdl.handle.net/11511/36779

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207543.2016.1154624

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Working time constraints in operational fixed job scheduling Eliiyi, Deniz Tuersel; Azizoğlu, Meral (Informa UK Limited, 2010-01-01) In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs effic...
Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm Solyali, O.; Ozpeynirci, O. (Informa UK Limited, 2009-01-01) This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show ...
Flow shop-sequencing problem with synchronous transfers and makespan minimization Soylu, B.; Kirca, Ou; Azizoğlu, Meral (Informa UK Limited, 2007-01-01) This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are developed. The algorithm returns optimal solutions to moderate-sized problem instances in reasonable solution times.
Selecting quality improvement projects and product mix together in manufacturing: an improvement of a theory of constraints-based approach by incorporating quality loss Köksal, Gülser (Informa UK Limited, 2004-12-01) The quality of products and processes needs to be improved continuously in today's competitive environments. Unless these improvement efforts are focused properly, companies might not achieve desirable results in terms of sales, quality and productivity. Many quality improvement (QI) approaches have a limited evaluation of the factors involved in the selection of QI projects. Theory of constraints (TOC) has been proposed by some researchers as a remedy for the better selection of QI projects. However, these...
Part-mix allocation between automated and conventional manufacturing KAYALlGIL, M. SINAN (Informa UK Limited, 1990-10) The overall part-mix of a production system is allocated optimally between the existing conventional facilities and planned automated system to be acquired. Approximate mean value analysis (MVA) is utilized to evaluate performance of the automated system under trial part-mix allocations. Cost of processing and WIPs are taken as the sources of operational costs. Cost minimizing route allocations when alternatives exist are handled by a search procedure.

Citation Formats

M. ÇELİK and H. Süral, “Order picking in a parallel-aisle warehouse with turn penalties,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 4340–4355, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36779.