The order-picking problem in parallel-aisle warehouses

Çelik, Melih
Order-picking operations constitute the costliest activities in a warehouse. The order-picking problem (OPP) aims to determine the route of the picker(s) in such a way that the total order-picking time, hence the order-picking costs are minimized. In this study, a warehouse that consists of parallel pick aisles is assumed, and various versions of the OPP are considered. Although the single-picker version of the problem has been well studied in the literature, the multiple-picker version has not received much attention in terms of algorithmic approaches. The literature also does not take into account the time taken by the number of turns during the picking route. In this thesis, a detailed discussion is made regarding the computational complexity of the OPP with a single picker. A heuristic procedure, which makes use of the exact algorithm for the OPP with no middle aisles, is proposed for the single-picker OPP with middle aisles, and computational results on randomly generated problems are given. Additionally, an evolutionary algorithm that makes use of the cluster-first, route-second and route-first, cluster-second heuristics for the VRP is provided. The parameters of the algorithm are determined based on preliminary runs and the algorithm is also tested on randomly generated problems, with di fferent weights given to the cluster-first, route-second and route-first, cluster-second approaches. Lastly, a polynomial time algorithm is proposed for the problem of minimizing the number of turns in a parallel-aisle warehouse.


On construction of stable project schedules
Görmez, Baran; Serpil, Canan; Department of Industrial Engineering (2005)
It is a well-known fact that project activities are subject to considerable uncertainty, which may lead to multiple schedule disruptions during project execution. As a result, the random nature of activity durations has been the subject of numerous research efforts since the introduction of the initial PERT. A common problem which arises in project management is the fact that the planned schedule is often disrupted by several uncontrollable factors like weather conditions, other environmental factors, addit...
The budget constrained discrete time/cost trade-off problem in project networks
Değirmenci, Güvenç; Azizoğlu, Meral; Department of Industrial Engineering (2008)
The time/cost trade-off models in project management aim to compress the project completion time by accelerating the activity durations at an expense of additional resources. The budget problem in discrete time/cost trade-off scheduling selects the time/cost mode -among the discrete set of specified modes- for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally, however each solution may ha...
An integrated inventory control and vehicle routing problem
Solyalı, Oğuz; Süral, Haldun; Department of Industrial Engineering (2005)
In this study, we consider a logistics system, in which a single supplier delivers a product to multiple retailers over a finite time horizon. Supplier decides on the amount to order in each period and services retailers facing deterministic dynamic demand via a fleet of vehicles having limited capacity. Each retailer has specific minimum and maximum levels of inventory in an order-up-to level inventory policy setting. The problem is to simultaneously determine the quantity of product to order to the suppli...
The One-Warehouse Multiretailer Problem with an Order-Up-To Level Inventory Policy
Solyali, Oguz; Süral, Haldun; Denizel, Meltem (Wiley, 2010-10-01)
We consider a two-level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order-up-to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot-sizing problem,...
A genetic algorithm for the biobjective traveling salesman problem with profits
Karademir, Serdar; Süral, Haldun; Department of Industrial Engineering (2008)
In Traveling Salesman Problem (TSP) with profits, a profit is associated with each city and the requirement to visit all cities is removed. The purpose is to simultaneously minimize cost (excluding as many cities as possible) and maximize profit (including as many cities as possible). Although the reduced single-objective case of the problem has been well-studied, the true biobjective problem has been studied only by a few researchers. In this paper we study the true biobjective problem using the Multiobjec...
Citation Formats
M. Çelik, “The order-picking problem in parallel-aisle warehouses,” M.S. - Master of Science, Middle East Technical University, 2009.