Order picking is typically the most costly operation in a warehouse and traveling is typically the most time consuming task within order picking. In this study we focus on the layout design for a rectangular warehouse, a warehouse with parallel storage blocks with main aisles separating them. We specifically analyze the impact of adding cross aisles that cut storage blocks perpendicularly, which can reduce travel times during order picking by introducing flexibility in going from one main aisle to the next. We consider two types of cross aisles, those that are equally spaced (Case 1) and those that are unequally spaced, which respectively have equal and unequal distances among them. For Case 2, we extend an earlier model and present a heuristic algorithm for finding the best distances among cross aisles. We carry out extensive computational experiments for a variety of warehouse designs. Our findings suggest that warehouse planners can obtain great travel time savings through establishing equally spaced cross aisles, but little additional savings in unequally-spaced cross isles. We present a look-up table that provides the best number of equally spaced cross aisles when the number of cross aisles
(N) and the length of the warehouse (T) are given. Finally, when the values of N and T are not known, we suggest establishing three cross aisles in a warehouse.
http://research.sabanciuniv.edu.
Impact of Cross Aisles in a Rectangular Warehouse: A Computational Studyertekg
Download Link > https://ertekprojects.com/gurdal-ertek-publications/blog/impact-of-cross-aisles-in-a-rectangular-warehouse-a-computational-study/
Order picking is typically the most costly operation in a warehouse and traveling is typically the most time consuming task within order picking. In this study we focus on the layout design for a rectangular warehouse, a warehouse with parallel storage blocks with main aisles separating them. We specifically analyze the impact of adding cross aisles that cut storage blocks perpendicularly, which can reduce travel times during order picking by introducing flexibility in going from one main aisle to the next. We consider two types of cross aisles, those that are equally spaced (Case 1) and those that are unequally spaced, which respectively have equal and unequal distances among them. For Case 2, we extend an earlier model and present a heuristic algorithm for finding the best distances among cross aisles. We carry out extensive computational experiments for a variety of warehouse designs. Our findings suggest that warehouse planners can obtain great travel time savings through establishing equally spaced cross aisles, but little additional savings in unequally-spaced cross isles. We present a look-up table that provides the best number of equally spaced cross aisles when the number of cross aisles (N) and the length of the warehouse (T) are given. Finally, when the values of N and T are not known, we suggest establishing three cross aisles in a warehouse.Order picking is typically the most costly operation in a warehouse and traveling is typically the most time consuming task within order picking. In this study we focus on the layout design for a rectangular warehouse, a warehouse with parallel storage blocks with main aisles separating them. We specifically analyze the impact of adding cross aisles that cut storage blocks perpendicularly, which can reduce travel times during order picking by introducing flexibility in going from one main aisle to the next. We consider two types of cross aisles, those that are equally spaced (Case 1) and those that are unequally spaced, which respectively have equal and unequal distances among them. For Case 2, we extend an earlier model and present a heuristic algorithm for finding the best distances among cross aisles. We carry out extensive computational experiments for a variety of warehouse designs. Our findings suggest that warehouse planners can obtain great travel time savings through establishing equally spaced cross aisles, but little additional savings in unequally-spaced cross isles. We present a look-up table that provides the best number of equally spaced cross aisles when the number of cross aisles (N) and the length of the warehouse (T) are given. Finally, when the values of N and T are not known, we suggest establishing three cross aisles in a warehouse.
Shape analysis using conformal mapping is a technique that analyzes geometric shapes by mapping their connections and distributions into computer programs. It is useful in fields like archaeology, architecture, medical imaging, and computer design. Conformal mapping preserves angles between shapes and can map 2D and 3D shapes onto each other. For brain mapping specifically, spherical harmonics equations are used to compress brain surface data and compare different brain scans. Conformal mapping proves useful for medical applications due to its ability to uniformly map points on brain surfaces without distortion.
Aisle Configurations For Unit-Load WarehousesNicole Heredia
This document discusses two alternative warehouse aisle designs that aim to reduce travel distances for workers during single-command cycles in unit-load warehouses. The first design inserts an optimally shaped cross aisle into a warehouse with parallel picking aisles. Modeling shows this can reduce expected travel distance by over 20%. The second design arranges picking aisles and a V-shaped cross aisle in a "fishbone" pattern, promising expected travel reductions of up to 20% compared to traditional designs. Both designs offer significant potential savings over the standard parallel aisle layout ubiquitous in current warehouses.
This document summarizes a research study that developed a structured method to compare the costs, space requirements, and handling needs of pallet racks and gravity flow racks for distribution center storage systems. The method considers product profiles including mix, cycle stock, and safety stock characteristics. Two case studies demonstrated the effectiveness of this structured comparison method. The introduction provides background on how pallet racks and gravity flow racks have different space, labor, travel, and equipment needs, and notes that selection currently relies on experience rather than a repeatable analysis of SKU profiles and their volume flows, safety stocks, and cycle stocks.
ARTICLE IN PRESS0925-5273$ - sedoi10.1016j.ijp.docxdavezstarr61655
ARTICLE IN PRESS
0925-5273/$ - se
doi:10.1016/j.ijp
�
Correspondi
E-mail addre
(K. van Donsel
Int. J. Production Economics 121 (2009) 620–632
www.elsevier.com/locate/ijpe
Logistics drivers for shelf stacking in grocery retail stores:
Potential for efficiency improvement
Susan van Zelst, Karel van Donselaar
�
, Tom van Woensel,
Rob Broekmeulen, Jan Fransoo
Department of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Received 17 March 2006; accepted 28 June 2006
Available online 30 August 2006
Abstract
In retail stores, handling of products typically forms the largest share of the operational costs. The handling activities are
mainly driven by the shelf stacking process. While the impact of the handling costs on the profitability of a store is
substantial, there are no models available of the different drivers influencing store handling. In this paper, a study of the
shelf stacking process is presented. First, a conceptual model based on warehouse operations is derived. It is shown that
stacking costs are non-linear with the number of consumer units stacked. Secondly, by means of a motion and time study,
data has been collected for dry groceries in four stores of two different European retail companies. Using regression, the
developed model clearly demonstrates the impact of the most important drivers for stacking efficiency: case pack (CP) size,
number of CPs stacked simultaneously, the filling regime and the working place of the employees. Efficiency gains of
8–49% by changing the driver parameter value are identified. Based on the presented insights both retail companies have
already decided to structurally change their current operations.
r 2006 Elsevier B.V. All rights reserved.
Keywords: Retail operations; Handling; Store; Shelf stacking; Motion and time study; Model
1. Introduction
In times of severe competition, many retailers
recognize the importance of controlling costs. With
known supply chain costs, the information needed
to most effectively structure the supply chain can be
provided. Moreover, different opportunities needed
to simultaneously reduce costs and increase perfor-
mance can be identified. In Fig. 1 (see Broekmeulen
e front matter r 2006 Elsevier B.V. All rights reserved
e.2006.06.010
ng author.
ss: [email protected]
aar).
et al., 2006) the operational logistical costs made in
the part of the supply chain that includes the
retailer’s warehouse and the store are presented.
Since we focus on operational costs, total shelf
space and the assortment are assumed to be known.
Furthermore, since this cost analysis is based on
non-perishables (dry groceries), obsolescence costs
are negligible. As a result, the inventory costs in the
cost pie in Fig. 1 only consist of the inventory
holding costs. It can be seen that the majority of the
operational costs are handling costs. In another
empirical study by Saghir and Jönson (2001) the
same trend was .
This document provides a literature review on order picking in warehouses. Order picking is the most labour-intensive and costly activity for warehouses, estimated to account for 55% of total warehouse operating expenses. Efficient order picking requires robust process design and optimal control. The review covers recent research on key decision areas in order picking, including layout design, storage assignment, routing methods, order batching, and zoning. While research has grown rapidly, opportunities remain to explore optimal combinations across these decision areas.
Supply chain design under uncertainty using sample average approximation and ...SSA KPI
This document summarizes a study on supply chain design under uncertainty. The authors present a two-stage stochastic programming model of a supply chain consisting of splitting and combining production processes. The first stage involves strategic decisions about facility locations and capacities. The second stage models operational decisions over multiple time periods to satisfy uncertain demand. Short-term demand uncertainty is modeled using forecasting and scenario generation methods. The authors solve the problem using sample average approximation combined with dual decomposition and present computational results for different sample sizes and levels of data aggregation in the second stage.
Impact of Cross Aisles in a Rectangular Warehouse: A Computational Studyertekg
Download Link > https://ertekprojects.com/gurdal-ertek-publications/blog/impact-of-cross-aisles-in-a-rectangular-warehouse-a-computational-study/
Order picking is typically the most costly operation in a warehouse and traveling is typically the most time consuming task within order picking. In this study we focus on the layout design for a rectangular warehouse, a warehouse with parallel storage blocks with main aisles separating them. We specifically analyze the impact of adding cross aisles that cut storage blocks perpendicularly, which can reduce travel times during order picking by introducing flexibility in going from one main aisle to the next. We consider two types of cross aisles, those that are equally spaced (Case 1) and those that are unequally spaced, which respectively have equal and unequal distances among them. For Case 2, we extend an earlier model and present a heuristic algorithm for finding the best distances among cross aisles. We carry out extensive computational experiments for a variety of warehouse designs. Our findings suggest that warehouse planners can obtain great travel time savings through establishing equally spaced cross aisles, but little additional savings in unequally-spaced cross isles. We present a look-up table that provides the best number of equally spaced cross aisles when the number of cross aisles (N) and the length of the warehouse (T) are given. Finally, when the values of N and T are not known, we suggest establishing three cross aisles in a warehouse.Order picking is typically the most costly operation in a warehouse and traveling is typically the most time consuming task within order picking. In this study we focus on the layout design for a rectangular warehouse, a warehouse with parallel storage blocks with main aisles separating them. We specifically analyze the impact of adding cross aisles that cut storage blocks perpendicularly, which can reduce travel times during order picking by introducing flexibility in going from one main aisle to the next. We consider two types of cross aisles, those that are equally spaced (Case 1) and those that are unequally spaced, which respectively have equal and unequal distances among them. For Case 2, we extend an earlier model and present a heuristic algorithm for finding the best distances among cross aisles. We carry out extensive computational experiments for a variety of warehouse designs. Our findings suggest that warehouse planners can obtain great travel time savings through establishing equally spaced cross aisles, but little additional savings in unequally-spaced cross isles. We present a look-up table that provides the best number of equally spaced cross aisles when the number of cross aisles (N) and the length of the warehouse (T) are given. Finally, when the values of N and T are not known, we suggest establishing three cross aisles in a warehouse.
Shape analysis using conformal mapping is a technique that analyzes geometric shapes by mapping their connections and distributions into computer programs. It is useful in fields like archaeology, architecture, medical imaging, and computer design. Conformal mapping preserves angles between shapes and can map 2D and 3D shapes onto each other. For brain mapping specifically, spherical harmonics equations are used to compress brain surface data and compare different brain scans. Conformal mapping proves useful for medical applications due to its ability to uniformly map points on brain surfaces without distortion.
Aisle Configurations For Unit-Load WarehousesNicole Heredia
This document discusses two alternative warehouse aisle designs that aim to reduce travel distances for workers during single-command cycles in unit-load warehouses. The first design inserts an optimally shaped cross aisle into a warehouse with parallel picking aisles. Modeling shows this can reduce expected travel distance by over 20%. The second design arranges picking aisles and a V-shaped cross aisle in a "fishbone" pattern, promising expected travel reductions of up to 20% compared to traditional designs. Both designs offer significant potential savings over the standard parallel aisle layout ubiquitous in current warehouses.
This document summarizes a research study that developed a structured method to compare the costs, space requirements, and handling needs of pallet racks and gravity flow racks for distribution center storage systems. The method considers product profiles including mix, cycle stock, and safety stock characteristics. Two case studies demonstrated the effectiveness of this structured comparison method. The introduction provides background on how pallet racks and gravity flow racks have different space, labor, travel, and equipment needs, and notes that selection currently relies on experience rather than a repeatable analysis of SKU profiles and their volume flows, safety stocks, and cycle stocks.
ARTICLE IN PRESS0925-5273$ - sedoi10.1016j.ijp.docxdavezstarr61655
ARTICLE IN PRESS
0925-5273/$ - se
doi:10.1016/j.ijp
�
Correspondi
E-mail addre
(K. van Donsel
Int. J. Production Economics 121 (2009) 620–632
www.elsevier.com/locate/ijpe
Logistics drivers for shelf stacking in grocery retail stores:
Potential for efficiency improvement
Susan van Zelst, Karel van Donselaar
�
, Tom van Woensel,
Rob Broekmeulen, Jan Fransoo
Department of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Received 17 March 2006; accepted 28 June 2006
Available online 30 August 2006
Abstract
In retail stores, handling of products typically forms the largest share of the operational costs. The handling activities are
mainly driven by the shelf stacking process. While the impact of the handling costs on the profitability of a store is
substantial, there are no models available of the different drivers influencing store handling. In this paper, a study of the
shelf stacking process is presented. First, a conceptual model based on warehouse operations is derived. It is shown that
stacking costs are non-linear with the number of consumer units stacked. Secondly, by means of a motion and time study,
data has been collected for dry groceries in four stores of two different European retail companies. Using regression, the
developed model clearly demonstrates the impact of the most important drivers for stacking efficiency: case pack (CP) size,
number of CPs stacked simultaneously, the filling regime and the working place of the employees. Efficiency gains of
8–49% by changing the driver parameter value are identified. Based on the presented insights both retail companies have
already decided to structurally change their current operations.
r 2006 Elsevier B.V. All rights reserved.
Keywords: Retail operations; Handling; Store; Shelf stacking; Motion and time study; Model
1. Introduction
In times of severe competition, many retailers
recognize the importance of controlling costs. With
known supply chain costs, the information needed
to most effectively structure the supply chain can be
provided. Moreover, different opportunities needed
to simultaneously reduce costs and increase perfor-
mance can be identified. In Fig. 1 (see Broekmeulen
e front matter r 2006 Elsevier B.V. All rights reserved
e.2006.06.010
ng author.
ss: [email protected]
aar).
et al., 2006) the operational logistical costs made in
the part of the supply chain that includes the
retailer’s warehouse and the store are presented.
Since we focus on operational costs, total shelf
space and the assortment are assumed to be known.
Furthermore, since this cost analysis is based on
non-perishables (dry groceries), obsolescence costs
are negligible. As a result, the inventory costs in the
cost pie in Fig. 1 only consist of the inventory
holding costs. It can be seen that the majority of the
operational costs are handling costs. In another
empirical study by Saghir and Jönson (2001) the
same trend was .
This document provides a literature review on order picking in warehouses. Order picking is the most labour-intensive and costly activity for warehouses, estimated to account for 55% of total warehouse operating expenses. Efficient order picking requires robust process design and optimal control. The review covers recent research on key decision areas in order picking, including layout design, storage assignment, routing methods, order batching, and zoning. While research has grown rapidly, opportunities remain to explore optimal combinations across these decision areas.
Supply chain design under uncertainty using sample average approximation and ...SSA KPI
This document summarizes a study on supply chain design under uncertainty. The authors present a two-stage stochastic programming model of a supply chain consisting of splitting and combining production processes. The first stage involves strategic decisions about facility locations and capacities. The second stage models operational decisions over multiple time periods to satisfy uncertain demand. Short-term demand uncertainty is modeled using forecasting and scenario generation methods. The authors solve the problem using sample average approximation combined with dual decomposition and present computational results for different sample sizes and levels of data aggregation in the second stage.
Rich routing problems arising in supply chain management (2012)siska_suryanto
This document discusses rich routing problems that arise in supply chain management. It presents six models that integrate vehicle routing with other supply chain operations like production lotsizing, scheduling, warehouse batching, packing and inventory management. Each model combines two decision problems, like lotsizing and delivery routing. The models account for interdependencies between supply chain activities to improve resource efficiency.
Decision Support For Packing In WarehousesGurdal Ertek
This document summarizes a research paper titled "Decision Support for Packing in Warehouses" by Ertek and Kilic. The paper proposes three algorithms - greedy, beam search, and tree search - to solve a packing problem for an automobile manufacturer's spare parts warehouse. The problem involves optimally packing items from customer orders into boxes to minimize costs. This is a novel 3D multiple bin size bin packing problem that has not been previously analyzed in literature. The paper compares the performance of the proposed algorithms in terms of cost and computation time.
This document discusses various warehouse safety hazards and recommendations for prevention. The main hazards identified include unsafe storage and racking, forklift trucks, slips and trips, and hazardous substances. Recommendations are provided such as properly stacking goods, training staff, maintaining clear aisles, cleaning up spills, and handling hazardous chemicals safely. The goal is to conduct a risk assessment to identify specific risks and take steps to prevent accidents in the warehouse.
A Modified PSO Based Solution Approach for Economic Ordered Quantity Problem ...irjes
This paper presents formulation of Economic Ordered Quantity (EOQ) problem considering Order
Size Limits, Stock Limits and Prohibited Ordering Segments, after that a modified PSO algorithm that utilizes
the PSO with double chaotic maps is presented to solve this problem. In proposed approach, the logistic map
and lozi map are applied alternatively to the velocity updating function of the particles. Using PSO with
irregular velocity updates which is performed by these maps forces the particles to search greater space for best
global solution. However the random function itself derived from a well-defined mathematical expression which
limits its redundancy hence in the paper we are utilizing the two different chaotic maps which are used
alternatively this mathematically increased the randomness of the function. The simulation of the algorithm for
the formulated EOQ problem verifies the effectiveness and superiority of the algorithm over standard
algorithms for such a complex problem which are difficult to solve by analytical approaches.
This document summarizes a systematic literature review of 68 articles on warehouse design published between 1999-2015. It begins by introducing the importance of warehouse design and identifies gaps in previous reviews. To facilitate analysis, the document develops a framework with three dimensions: inputs that influence design decisions, the design/implementation process, and outputs. It then describes the methodology, which involved developing a literature search strategy, selecting articles, and examining them according to the framework. The findings are classified based on theoretical/empirical approaches and quantitative/qualitative models used. Overall, the review aims to identify the main aspects of warehouse design covered and gaps to inform both industry professionals and future research.
Accumulo Summit 2016: GeoMesa: Using Accumulo for Optimized Spatio-Temporal P...Accumulo Summit
LocationTech GeoMesa is a project that builds on open-source, distributed databases like Accumulo, HBase, and Cassandra to scale up indexing, querying, and analyzing billions of spatio-temporal data points. GeoMesa uses space-filling curves to index multi-dimensional data in Accumulo, and we'll discuss recent improvements for non-point geometries. Over the two and a half years GeoMesa has been an open-source project, GeoMesa's Accumulo schemas have evolved and our team has had a chance to work through creating and optimizing custom Accumulo iterators. These custom iterators allow for better query performance and interesting aggregations. GeoMesa provides support for distributed processing in Spark via MapReduce input and output formats that extend their Accumulo counterparts. We will discuss the performance benefit gained by reducing the number of default map/Spark tasks created for complex query patterns. The talk will conclude with updates about GeoMesa's integration with Jupyter notebook and improvements to GeoMesa's Spark integration.
– Speaker –
Dr. James Hughes
Mathematician, Commonwealth Computer Research, Inc (CCRi)
Dr. James Hughes is a mathematician at Commonwealth Computer Research, Inc. in Charlottesville, Virginia. He is a core committer for GeoMesa which leverages Accumulo and other distributed database systems to provide distributed computation and query engines. He is a LocationTech committer for GeoMesa, SFCurve, and GeoBench. He serves on the LocationTech Project Management Committee and Steering Committee. Through work with LocationTech and OSGeo projects like GeoTools and GeoServer, he works to build end-to-end solutions for big spatio-temporal problems. He holds a PhD in algebraic topology from the University of Virginia.
— More Information —
For more information see http://www.accumulosummit.com/
This document summarizes research applying an ant colony optimization algorithm to solve the 3D constrained rectangular bin packing problem. The goal is to pack arbitrary sized 3D rectangular bins into standard sized containers in a way that minimizes empty space. The algorithm considers constraints like placement, overlapping, stability and develops a packing pattern represented by matrices. Experiments show the ant colony approach improves performance over other algorithms and is computationally efficient for solving this NP-hard bin packing optimization problem.
This is the research presentation of Simulation based storage policy in a unit load warehouse, to identify optimum storage policy for different inventory scenarios
The document describes the development of an automatic roll pass design method to minimize the number of roll passes needed in metal forming. It uses artificial intelligence technologies like expert systems and a hybrid model to evaluate surface profiles. This allows modeling the search for an optimal sequence as a tree path search. The approach optimizes roll pass geometry automatically while reducing the time needed for design. It was validated by comparing to other automatic systems.
Review paper on structural behaviour of industrial pallet rack with braced an...eSAT Journals
Abstract
According to the structural point of view Industrial Pallet rack structure can be considered typical steel framed structure. This work presents a general analysis of an industrial pallet rack structure, evaluating the influence of each of the components on the global stability. An analytical study for the sensitivity of pallet rack configuration in linear static equivalent lateral loads. The aim is to braced/unbraced frames were design and their analytical models are to be built in software. The finite element analysis is used to determine axial forces in beam and column, maximum storey displacement and buckling loads on braced/unbraced pallet rack structure. Bracing systems are mostly provided to enhance the stiffness factor of the structures with the seismic loads. Unbraced systems have mostly translational modes of failure and are very flexible due to excessive loads.
Keywords: Pallets Rack, Cold Formed Steel, Seismic Design, Finite Element Analysis, Buckling Capacity
A Partial Backlogging Two-Warehouse Inventory Models for Decaying Items with ...IOSR Journals
- The document presents a mathematical inventory model for deteriorating items stored in two warehouses - an owned warehouse (OW) and a rented warehouse (RW).
- The model considers inflation, stock-dependent demand, and allows for partial shortages that are backlogged. It analyzes two cases: one starting with no shortages and one starting with shortages.
- Differential equations are developed to determine the inventory levels in each warehouse over time. The solutions provide expressions for the inventory levels as functions of time and cost parameters.
This document discusses warehouse layout and material flow planning. It describes the key areas of a warehouse including receiving, storage, picking, sorting and shipping. Space requirements need to be determined for these areas based on historical and projected volumes. Product storage requirements depend on factors like inventory levels, SKU variations, pick activities and velocity. Material flow can be U-shaped, straight through, modular or multi-story depending on the warehouse needs and processes. The goal is to design an efficient layout and flow to maximize space utilization and productivity.
This document provides information and tasks related to investigating parabolic curves through the design of suspension bridges and industrial packaging. It outlines three approaches - arithmetic, procedural, and conceptual - for examining parabolas in real-life applications. Students are asked to draw bridge plans showing supports, cables, and hangers on a coordinate plane and calculate related values. For packaging, students define the three investigation approaches and derive equations to generalize box dimensions and maximize capacity based on variable input.
This document provides information and tasks related to investigating parabolic curves through the design of suspension bridges and industrial packaging. It outlines three approaches - arithmetic, procedural, and conceptual - for examining parabolas in real-life applications. Students are asked to draw bridge plans showing supports, cables, and hangers on a coordinate plane and calculate related values. For packaging, students define the three investigation approaches and derive generalized equations to calculate box dimensions and capacity based on a given variable.
The document summarizes a research article that develops regression models as an alternative to the "Square Root Law" formula for optimizing the number of warehouses in a distribution network. The regression models were built based on simulations of demand using Gaussian and Gamma distributions. The models allow calculating inventory levels and stock availability for a given number of warehouses. Both regression models were statistically significant with relevant determination coefficients, though the Gaussian model performed slightly better. The results from the "Square Root Law" were sometimes similar but could vary based on demand distribution and variability. The regression models may provide more accurate optimization by accounting for demand characteristics. The models were later expanded to include cost components to analyze total costs for different product groups, availability levels, and number of warehouses
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
This document outlines an investigation into optimizing packaging dimensions using non-linear algebra. It will use three methods: arithmetic, procedural, and conceptual. The conceptual method minimizes waste and maximizes efficiency by employing generalized equations to represent relationships between variables like length, width, capacity and an input variable x. The investigation will define each method, explore patterns in sample packaging dimensions, develop equations to represent relationships, and graph the results to determine maximum capacity. The goal is to find cost-effective and sustainable packaging dimensions.
The document provides an overview of warehousing and discusses key concepts such as the role of warehousing, major warehouse operations, and facility design issues. It describes how warehouses serve as buffers that hold inventory, allow for consolidation of products, and can perform value-added processing tasks. The major warehouse operations discussed are receiving, put-away, order picking, checking, packing, and shipping. Key facility design problems addressed include storage location assignment and design of the fast-pick area to optimize order picking. The role and requirements of cross-docking facilities are also summarized.
This article appeared in a journal published by Elsevier. The .docxhowardh5
This article appeared in a journal published by Elsevier. The attached
copy is furnished to the author for internal non-commercial research
and education use, including for instruction at the authors institution
and sharing with colleagues.
Other uses, including reproduction and distribution, or selling or
licensing copies, or posting to personal, institutional or third party
websites are prohibited.
In most cases authors are permitted to post their version of the
article (e.g. in Word or Tex form) to their personal website or
institutional repository. Authors requiring further information
regarding Elsevier’s archiving and manuscript policies are
encouraged to visit:
http://www.elsevier.com/authorsrights
http://www.elsevier.com/authorsrights
Author's personal copy
A simheuristic algorithm for the Single-Period Stochastic
Inventory-Routing Problem with stock-outs
Angel A. Juan a,⇑, Scott E. Grasman b, Jose Caceres-Cruz a,1, Tolga Bektas� c
a Department of Computer Science, Multimedia, and Telecommunication, IN3-Open University of Catalonia, 08018 Barcelona, Spain
b Department of Industrial and Systems Engineering, Rochester Institute of Technology, USA
c Southampton Management School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, UK
a r t i c l e i n f o
Article history:
Available online 7 December 2013
Keywords:
Inventory-Routing Problem
Stochastic demands
Stock-outs
Simulation–optimization
Simheuristics
Randomized heuristics
a b s t r a c t
This paper describes a ‘simheuristic’ algorithm – one which combines simulation with
heuristics – for solving a stochastic variant of the well-known Inventory-Routing Problem.
The variant discussed here is integrated by a vehicle routing problem and several inventory
problems characterized by stochastic demands. Initial stock levels and potential stock-outs
are also considered, as well as a set of alternative refill policies for each retail center. The
goal is to find the personalized refill policies and associated routing plan that minimize, at
each single period, the expected total costs of the system, i.e., the sum of inventory and
routing costs. After motivating it, a detailed description of the problem is provided. Then,
a review of the related literature is performed and our simulation–optimization approach
is introduced. The paper presents a set of numerical experiments comparing the proposed
method against different refill strategies and discusses how total costs evolve as the level of
system uncertainty and the inventory-holding costs per unit are varied.
� 2013 Elsevier B.V. All rights reserved.
1. Introduction
One of the most important paradigms in supply chain management is to move from sequential decision making toward
integrated decision making, where all parties in the supply chain determine the best policy for the entire system. This is in
contrast to sequentially optimized decisions in supply chains.
Supplier and buyer driven channels in a two-stage supply chainGurdal Ertek
This summarizes a research paper that explores supplier and buyer-driven channels in a two-stage supply chain model. It develops models where either the supplier or buyer has dominant bargaining power to determine pricing. The paper shows that when the buyer has power, it is optimal for them to use only a multiplier on wholesale price and not a markup. It also shows market price and sensitivity increases with operational costs. The sensitivity of market price to wholesale price increases non-linearly and is bounded from below. Increasing costs have a decreasing marginal impact on prices and profits. There are cases where suppliers prefer buyer-driven channels and vice versa.
Simulation modeling for quality and productivity in steel cord manufacturingGurdal Ertek
We describe the application of simulation modeling to estimate and improve quality and productivity performance of a steel cord manufacturing system. We describe the typical steel
cord manufacturing plant, emphasize its distinguishing characteristics, identify various production settings and discuss applicability of simulation as a management decision support tool. Besides presenting the general structure of the developed simulation model, we focus on wire fractures, which can be an important source of system disruption.
http://research.sabanciuniv.edu.
More Related Content
Similar to Impact of Cross Aisles in a Rectangular Warehouse:A Computational Study
Rich routing problems arising in supply chain management (2012)siska_suryanto
This document discusses rich routing problems that arise in supply chain management. It presents six models that integrate vehicle routing with other supply chain operations like production lotsizing, scheduling, warehouse batching, packing and inventory management. Each model combines two decision problems, like lotsizing and delivery routing. The models account for interdependencies between supply chain activities to improve resource efficiency.
Decision Support For Packing In WarehousesGurdal Ertek
This document summarizes a research paper titled "Decision Support for Packing in Warehouses" by Ertek and Kilic. The paper proposes three algorithms - greedy, beam search, and tree search - to solve a packing problem for an automobile manufacturer's spare parts warehouse. The problem involves optimally packing items from customer orders into boxes to minimize costs. This is a novel 3D multiple bin size bin packing problem that has not been previously analyzed in literature. The paper compares the performance of the proposed algorithms in terms of cost and computation time.
This document discusses various warehouse safety hazards and recommendations for prevention. The main hazards identified include unsafe storage and racking, forklift trucks, slips and trips, and hazardous substances. Recommendations are provided such as properly stacking goods, training staff, maintaining clear aisles, cleaning up spills, and handling hazardous chemicals safely. The goal is to conduct a risk assessment to identify specific risks and take steps to prevent accidents in the warehouse.
A Modified PSO Based Solution Approach for Economic Ordered Quantity Problem ...irjes
This paper presents formulation of Economic Ordered Quantity (EOQ) problem considering Order
Size Limits, Stock Limits and Prohibited Ordering Segments, after that a modified PSO algorithm that utilizes
the PSO with double chaotic maps is presented to solve this problem. In proposed approach, the logistic map
and lozi map are applied alternatively to the velocity updating function of the particles. Using PSO with
irregular velocity updates which is performed by these maps forces the particles to search greater space for best
global solution. However the random function itself derived from a well-defined mathematical expression which
limits its redundancy hence in the paper we are utilizing the two different chaotic maps which are used
alternatively this mathematically increased the randomness of the function. The simulation of the algorithm for
the formulated EOQ problem verifies the effectiveness and superiority of the algorithm over standard
algorithms for such a complex problem which are difficult to solve by analytical approaches.
This document summarizes a systematic literature review of 68 articles on warehouse design published between 1999-2015. It begins by introducing the importance of warehouse design and identifies gaps in previous reviews. To facilitate analysis, the document develops a framework with three dimensions: inputs that influence design decisions, the design/implementation process, and outputs. It then describes the methodology, which involved developing a literature search strategy, selecting articles, and examining them according to the framework. The findings are classified based on theoretical/empirical approaches and quantitative/qualitative models used. Overall, the review aims to identify the main aspects of warehouse design covered and gaps to inform both industry professionals and future research.
Accumulo Summit 2016: GeoMesa: Using Accumulo for Optimized Spatio-Temporal P...Accumulo Summit
LocationTech GeoMesa is a project that builds on open-source, distributed databases like Accumulo, HBase, and Cassandra to scale up indexing, querying, and analyzing billions of spatio-temporal data points. GeoMesa uses space-filling curves to index multi-dimensional data in Accumulo, and we'll discuss recent improvements for non-point geometries. Over the two and a half years GeoMesa has been an open-source project, GeoMesa's Accumulo schemas have evolved and our team has had a chance to work through creating and optimizing custom Accumulo iterators. These custom iterators allow for better query performance and interesting aggregations. GeoMesa provides support for distributed processing in Spark via MapReduce input and output formats that extend their Accumulo counterparts. We will discuss the performance benefit gained by reducing the number of default map/Spark tasks created for complex query patterns. The talk will conclude with updates about GeoMesa's integration with Jupyter notebook and improvements to GeoMesa's Spark integration.
– Speaker –
Dr. James Hughes
Mathematician, Commonwealth Computer Research, Inc (CCRi)
Dr. James Hughes is a mathematician at Commonwealth Computer Research, Inc. in Charlottesville, Virginia. He is a core committer for GeoMesa which leverages Accumulo and other distributed database systems to provide distributed computation and query engines. He is a LocationTech committer for GeoMesa, SFCurve, and GeoBench. He serves on the LocationTech Project Management Committee and Steering Committee. Through work with LocationTech and OSGeo projects like GeoTools and GeoServer, he works to build end-to-end solutions for big spatio-temporal problems. He holds a PhD in algebraic topology from the University of Virginia.
— More Information —
For more information see http://www.accumulosummit.com/
This document summarizes research applying an ant colony optimization algorithm to solve the 3D constrained rectangular bin packing problem. The goal is to pack arbitrary sized 3D rectangular bins into standard sized containers in a way that minimizes empty space. The algorithm considers constraints like placement, overlapping, stability and develops a packing pattern represented by matrices. Experiments show the ant colony approach improves performance over other algorithms and is computationally efficient for solving this NP-hard bin packing optimization problem.
This is the research presentation of Simulation based storage policy in a unit load warehouse, to identify optimum storage policy for different inventory scenarios
The document describes the development of an automatic roll pass design method to minimize the number of roll passes needed in metal forming. It uses artificial intelligence technologies like expert systems and a hybrid model to evaluate surface profiles. This allows modeling the search for an optimal sequence as a tree path search. The approach optimizes roll pass geometry automatically while reducing the time needed for design. It was validated by comparing to other automatic systems.
Review paper on structural behaviour of industrial pallet rack with braced an...eSAT Journals
Abstract
According to the structural point of view Industrial Pallet rack structure can be considered typical steel framed structure. This work presents a general analysis of an industrial pallet rack structure, evaluating the influence of each of the components on the global stability. An analytical study for the sensitivity of pallet rack configuration in linear static equivalent lateral loads. The aim is to braced/unbraced frames were design and their analytical models are to be built in software. The finite element analysis is used to determine axial forces in beam and column, maximum storey displacement and buckling loads on braced/unbraced pallet rack structure. Bracing systems are mostly provided to enhance the stiffness factor of the structures with the seismic loads. Unbraced systems have mostly translational modes of failure and are very flexible due to excessive loads.
Keywords: Pallets Rack, Cold Formed Steel, Seismic Design, Finite Element Analysis, Buckling Capacity
A Partial Backlogging Two-Warehouse Inventory Models for Decaying Items with ...IOSR Journals
- The document presents a mathematical inventory model for deteriorating items stored in two warehouses - an owned warehouse (OW) and a rented warehouse (RW).
- The model considers inflation, stock-dependent demand, and allows for partial shortages that are backlogged. It analyzes two cases: one starting with no shortages and one starting with shortages.
- Differential equations are developed to determine the inventory levels in each warehouse over time. The solutions provide expressions for the inventory levels as functions of time and cost parameters.
This document discusses warehouse layout and material flow planning. It describes the key areas of a warehouse including receiving, storage, picking, sorting and shipping. Space requirements need to be determined for these areas based on historical and projected volumes. Product storage requirements depend on factors like inventory levels, SKU variations, pick activities and velocity. Material flow can be U-shaped, straight through, modular or multi-story depending on the warehouse needs and processes. The goal is to design an efficient layout and flow to maximize space utilization and productivity.
This document provides information and tasks related to investigating parabolic curves through the design of suspension bridges and industrial packaging. It outlines three approaches - arithmetic, procedural, and conceptual - for examining parabolas in real-life applications. Students are asked to draw bridge plans showing supports, cables, and hangers on a coordinate plane and calculate related values. For packaging, students define the three investigation approaches and derive equations to generalize box dimensions and maximize capacity based on variable input.
This document provides information and tasks related to investigating parabolic curves through the design of suspension bridges and industrial packaging. It outlines three approaches - arithmetic, procedural, and conceptual - for examining parabolas in real-life applications. Students are asked to draw bridge plans showing supports, cables, and hangers on a coordinate plane and calculate related values. For packaging, students define the three investigation approaches and derive generalized equations to calculate box dimensions and capacity based on a given variable.
The document summarizes a research article that develops regression models as an alternative to the "Square Root Law" formula for optimizing the number of warehouses in a distribution network. The regression models were built based on simulations of demand using Gaussian and Gamma distributions. The models allow calculating inventory levels and stock availability for a given number of warehouses. Both regression models were statistically significant with relevant determination coefficients, though the Gaussian model performed slightly better. The results from the "Square Root Law" were sometimes similar but could vary based on demand distribution and variability. The regression models may provide more accurate optimization by accounting for demand characteristics. The models were later expanded to include cost components to analyze total costs for different product groups, availability levels, and number of warehouses
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
This document outlines an investigation into optimizing packaging dimensions using non-linear algebra. It will use three methods: arithmetic, procedural, and conceptual. The conceptual method minimizes waste and maximizes efficiency by employing generalized equations to represent relationships between variables like length, width, capacity and an input variable x. The investigation will define each method, explore patterns in sample packaging dimensions, develop equations to represent relationships, and graph the results to determine maximum capacity. The goal is to find cost-effective and sustainable packaging dimensions.
The document provides an overview of warehousing and discusses key concepts such as the role of warehousing, major warehouse operations, and facility design issues. It describes how warehouses serve as buffers that hold inventory, allow for consolidation of products, and can perform value-added processing tasks. The major warehouse operations discussed are receiving, put-away, order picking, checking, packing, and shipping. Key facility design problems addressed include storage location assignment and design of the fast-pick area to optimize order picking. The role and requirements of cross-docking facilities are also summarized.
This article appeared in a journal published by Elsevier. The .docxhowardh5
This article appeared in a journal published by Elsevier. The attached
copy is furnished to the author for internal non-commercial research
and education use, including for instruction at the authors institution
and sharing with colleagues.
Other uses, including reproduction and distribution, or selling or
licensing copies, or posting to personal, institutional or third party
websites are prohibited.
In most cases authors are permitted to post their version of the
article (e.g. in Word or Tex form) to their personal website or
institutional repository. Authors requiring further information
regarding Elsevier’s archiving and manuscript policies are
encouraged to visit:
http://www.elsevier.com/authorsrights
http://www.elsevier.com/authorsrights
Author's personal copy
A simheuristic algorithm for the Single-Period Stochastic
Inventory-Routing Problem with stock-outs
Angel A. Juan a,⇑, Scott E. Grasman b, Jose Caceres-Cruz a,1, Tolga Bektas� c
a Department of Computer Science, Multimedia, and Telecommunication, IN3-Open University of Catalonia, 08018 Barcelona, Spain
b Department of Industrial and Systems Engineering, Rochester Institute of Technology, USA
c Southampton Management School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, UK
a r t i c l e i n f o
Article history:
Available online 7 December 2013
Keywords:
Inventory-Routing Problem
Stochastic demands
Stock-outs
Simulation–optimization
Simheuristics
Randomized heuristics
a b s t r a c t
This paper describes a ‘simheuristic’ algorithm – one which combines simulation with
heuristics – for solving a stochastic variant of the well-known Inventory-Routing Problem.
The variant discussed here is integrated by a vehicle routing problem and several inventory
problems characterized by stochastic demands. Initial stock levels and potential stock-outs
are also considered, as well as a set of alternative refill policies for each retail center. The
goal is to find the personalized refill policies and associated routing plan that minimize, at
each single period, the expected total costs of the system, i.e., the sum of inventory and
routing costs. After motivating it, a detailed description of the problem is provided. Then,
a review of the related literature is performed and our simulation–optimization approach
is introduced. The paper presents a set of numerical experiments comparing the proposed
method against different refill strategies and discusses how total costs evolve as the level of
system uncertainty and the inventory-holding costs per unit are varied.
� 2013 Elsevier B.V. All rights reserved.
1. Introduction
One of the most important paradigms in supply chain management is to move from sequential decision making toward
integrated decision making, where all parties in the supply chain determine the best policy for the entire system. This is in
contrast to sequentially optimized decisions in supply chains.
Similar to Impact of Cross Aisles in a Rectangular Warehouse:A Computational Study (20)
Supplier and buyer driven channels in a two-stage supply chainGurdal Ertek
This summarizes a research paper that explores supplier and buyer-driven channels in a two-stage supply chain model. It develops models where either the supplier or buyer has dominant bargaining power to determine pricing. The paper shows that when the buyer has power, it is optimal for them to use only a multiplier on wholesale price and not a markup. It also shows market price and sensitivity increases with operational costs. The sensitivity of market price to wholesale price increases non-linearly and is bounded from below. Increasing costs have a decreasing marginal impact on prices and profits. There are cases where suppliers prefer buyer-driven channels and vice versa.
Simulation modeling for quality and productivity in steel cord manufacturingGurdal Ertek
We describe the application of simulation modeling to estimate and improve quality and productivity performance of a steel cord manufacturing system. We describe the typical steel
cord manufacturing plant, emphasize its distinguishing characteristics, identify various production settings and discuss applicability of simulation as a management decision support tool. Besides presenting the general structure of the developed simulation model, we focus on wire fractures, which can be an important source of system disruption.
http://research.sabanciuniv.edu.
Visual and analytical mining of transactions data for production planning ...Gurdal Ertek
The document proposes a framework that combines visual and analytical mining of transaction data for production planning and marketing. The framework uses interactive pie charts for filtering, k-means clustering for analysis, and parallel coordinate plots for comparison. It was implemented in a prototype called CuReMa. Future work could incorporate additional visualizations, data fields, clustering algorithms, and criteria to further analyze enterprise transaction data.
Visual and analytical mining of transactions data for production planning ...Gurdal Ertek
This document proposes a framework that combines visual and analytical mining of transaction data for production planning and marketing. The framework includes three main steps: filtering using interactive visualizations like pie charts, clustering using algorithms like k-means, and comparison using visualizations like parallel coordinate plots. It then describes an implementation of this framework called CuReMa that allows interactive visual querying, analytical clustering, and visual comparison of sales transaction data to help with production planning and marketing decisions.
Visual and analytical mining of transactions data for production planning ...Gurdal Ertek
This document proposes a framework that combines visual and analytical mining of transaction data for production planning and marketing. The framework includes three main steps: filtering using interactive visuals like pie charts, clustering using algorithms like k-means, and comparison using visualizations like parallel coordinate plots. It then describes an implementation of this framework called CuReMa and areas for future work, like incorporating other data fields, algorithms, and criteria.
Visual and analytical mining of sales transaction data for production plannin...Gurdal Ertek
Recent developments in information technology paved the way for the collection of large amounts of data pertaining to various aspects of an enterprise. The greatest challenge faced in
processing these massive amounts of raw data gathered turns out to be the effective management of data with the ultimate purpose of deriving necessary and meaningful information
out of it. The following paper presents an attempt to illustrate the combination of visual and analytical data mining techniques for planning of marketing and production activities. The
primary phases of the proposed framework consist of filtering, clustering and comparison steps implemented using interactive pie charts, K-Means algorithm and parallel coordinate plots
respectively. A prototype decision support system is developed and a sample analysis session is conducted to demonstrate the applicability of the framework.
http://research.sabanciuniv.edu.
In crossdocking, the inbound materials coming in trucks to the
crossdock facility are directed to outbound doors and are directly loaded into trucks that will perform shipment, or are staged for a very brief time period before loading. Crossdocking has a great potential to bring savings in logistics: For example, most of the logistics success of Wal-Mart, the world’s leading retailer, is attributed to crossdocking.In this paper,the types of
crossdocking are identified, the situations and industries where crossdocking is applicable are explained, prerequisites, advantages and drawbacks are listed, and implementation issues are discussed. Finally a case study that describes the crossdocking applications of a 3rd party logistics firm is
presented.
http://research.sabanciuniv.edu.
Application of local search methods for solving a quadratic assignment proble...Gurdal Ertek
This paper discusses the design and application of local search methods to a real-life application at a steel cord manufacturing plant. The case study involves a layout problem that can be represented as a Quadratic Assignment Problem (QAP). Due to the nature of the manufacturing process, certain machinery need to be allocated in close proximity to each other. This issue is incorporated into the objective function through assigning high penalty costs to the unfavorable allocations. QAP belongs to one of the most difficult class of combinatorial optimization problems, and is not solvable to optimality as the number of facilities increases. We implement the well-known local
search methods, 2-opt, 3-opt and tabu search. We compare the solution performances of the methods to the results obtained from the NEOS server, which provides free access to many optimization solvers on the internet.
http://research.sabanciuniv.edu.
Financial benchmarking of transportation companies in the New York Stock Exch...Gurdal Ertek
This document summarizes a study that performed financial benchmarking on transportation companies listed on the New York Stock Exchange using data envelopment analysis (DEA) and data visualization. Financial data from 2005 annual reports were used as inputs and outputs for the DEA model to calculate efficiency scores. The scores were then visualized to identify patterns among the companies in different subsectors (marine, railroad, etc.). The visualizations showed that 7 of 18 marine transportation companies were fully efficient, while railroad companies had the lowest average efficiency. This approach provided insights into comparative performance within and across subsectors.
Development of an Interactive Simulation of Steel Cord Manufacturing for Indu...Gurdal Ertek
We developed an interactive simulation program to be used in industrial engineering education, based on an earlier simulation study of a steel cord manufacturing plant. In the class project, the students are asked to design strategies/algorithms for finding the optimal values of operational decision variables by using the program.
http://research.sabanciuniv.edu.
Application of the analytic hierarchy process (AHP) for selection of forecast...Gurdal Ertek
In this paper, we described an application of the Analytic Hierarchy Process (AHP) for the ranking and selection of forecasting software. AHP is a multi-criteria decision making (MCDM) approach, which is based on the pair-wise comparison
of elements of a given set with respect to multiple criteria. Even though there are applications of the AHP to software selection problems, we have not encountered a study that involves forecasting software. We started our analysis by filtering
among forecasting software that were found on the Internet by undergraduate students as a part of a course project. Then we processed a second filtering step, where we reduced the number of software to be examined even further. Finally we
constructed the comparison matrices based upon the evaluations of three “semiexperts”, and obtained a ranking of forecasting software of the selected software using the Expert Choice software. We report our findings and our insights, together with the results of a sensitivity analysis.
http://research.sabanciuniv.edu.
Spreadsheet Optimization of Flow for WIP Goods at a Yarn and Tire Cord Manufa...Gurdal Ertek
We developed a spreadsheet optimization model to find the optimal material handling policy at a leading yarn and tire cord manufacturer’s facility. The focus of the study is to optimize the movement of looms of yarn and tire cord between two major manufacturing steps. The considered flow network within the
manufacturing facility is a miniature two-stage supply chain, including the middle layer of depots. Movement of material takes place through forklift trucks and cranes, which impose electricity, labor, maintenance, and depreciation costs. After
introducing the company, the facility, and the project goals, we present the underlying linear programming (LP) model and our spreadsheet implementation. The results of our model suggest an annual saving of approximately $22,000 for the facility.
http://research.sabanciuniv.edu.
Optimizing waste collection in an organized industrial region: A case studyGurdal Ertek
In this paper we present a case study which involves the design of a supply chain network for industrial waste collection. The problem is to transport metal waste from 17 factories to containers and from containers to a disposal center (DC) at an
organized region of automobile parts suppliers. We applied the classic mixedinteger programming (MIP) model for the two-stage supply chain to the solution of this problem. The visualization of the optimal solution provided us with several
interesting insights that would not be easily discovered otherwise.
http://research.sabanciuniv.edu.
Demonstrating warehousing concepts through interactive animationsGurdal Ertek
This document describes the development of interactive animations to demonstrate warehousing concepts. The authors created animations using Macromedia Flash to illustrate key warehousing topics like distribution strategies, order picking schemes, pick-to-light systems, bucket brigades, carousels, order picker trucks, and mobile storage systems. The animations are intended to supplement traditional educational materials and improve understanding of warehouse operations and management. Evaluation of the animations' effectiveness at enhancing learning is proposed for future work.
A framework for visualizing association mining resultsGurdal Ertek
Association mining is one of the most used data mining tech-
niques due to interpretable and actionable results. In this study we propose a framework to visualize the association mining results, specifically frequent itemsets and association rules, as graphs. We demonstrate the applicability and usefulness of our approach through a Market Basket Analysis (MBA) case study where we visually explore the data mining results for a supermarket data set. In this case study we derive several
interesting insights regarding the relationships among the items and suggest how they can be used as basis for decision making in retailing.
http://research.sabanciuniv.edu.
Application of the cutting stock problem to a construction company: A case studyGurdal Ertek
This paper presents an application of the well-known cutting stock problem to a construction firm. The goal of the 1Dimensional (1D) cutting stock problem is to cut the bars of desired lengths in required quantities from longer bars of given
length. The company for which we carried out this study encounters 1D cutting stock problem in cutting steel bars (reinforcement bars) for its construction projects. We have developed several solution approaches to solving the company’s problem: Building and solving an integer programming (IP) model in a modeling environment, developing our own software that uses a mixed integer programming (MIP) software library, and testing some of the commercial software packages available on the internet. In this paper, we summarize our experiences with all the three approaches. We also present a benchmark of existing commercial software packages, and some critical insights. Finally, we suggest a visual approach for increasing performance in solving the cutting stock problem and demonstrate the applicability of this approach using the company’s data on two construction projects.
http://research.sabanciuniv.edu.
Benchmarking the Turkish apparel retail industry through data envelopment ana...Gurdal Ertek
This paper presents a benchmarking study of the Turkish apparel retailing industry. We have applied the Data Envelopment Analysis (DEA) methodology to determine the efficiencies of the companies in the industry. In the DEA model the number of stores, number of corners, total sales area and number of employees were included as inputs and annual sales revenue was included as the output. The efficiency scores obtained through DEA were visualized for gaining insights about
the industry and revealing guidelines that can aid in strategic decision making.
http://research.sabanciuniv.edu.
Visual mining of science citation data for benchmarking scientific and techno...Gurdal Ertek
This document analyzes science citation data from the Essential Science Indicators database to benchmark the scientific and technological competitiveness of countries. It uses visualization tools like Mondrian, Miner3D, and Omniscope to analyze dimensions like number of papers published, citations received, citations per paper, papers per thousand people, and population for countries in fields like engineering, computer science, and economics. The analyses aim to identify the most competitive countries, correlations between fields, most influential papers, and insights from combining data with socioeconomic factors.
B2B payments are rapidly changing. Find out the 5 key questions you need to be asking yourself to be sure you are mastering B2B payments today. Learn more at www.BlueSnap.com.
Implicitly or explicitly all competing businesses employ a strategy to select a mix
of marketing resources. Formulating such competitive strategies fundamentally
involves recognizing relationships between elements of the marketing mix (e.g.,
price and product quality), as well as assessing competitive and market conditions
(i.e., industry structure in the language of economics).
Company Valuation webinar series - Tuesday, 4 June 2024FelixPerez547899
This session provided an update as to the latest valuation data in the UK and then delved into a discussion on the upcoming election and the impacts on valuation. We finished, as always with a Q&A
Taurus Zodiac Sign: Unveiling the Traits, Dates, and Horoscope Insights of th...my Pandit
Dive into the steadfast world of the Taurus Zodiac Sign. Discover the grounded, stable, and logical nature of Taurus individuals, and explore their key personality traits, important dates, and horoscope insights. Learn how the determination and patience of the Taurus sign make them the rock-steady achievers and anchors of the zodiac.
Storytelling is an incredibly valuable tool to share data and information. To get the most impact from stories there are a number of key ingredients. These are based on science and human nature. Using these elements in a story you can deliver information impactfully, ensure action and drive change.
3 Simple Steps To Buy Verified Payoneer Account In 2024SEOSMMEARTH
Buy Verified Payoneer Account: Quick and Secure Way to Receive Payments
Buy Verified Payoneer Account With 100% secure documents, [ USA, UK, CA ]. Are you looking for a reliable and safe way to receive payments online? Then you need buy verified Payoneer account ! Payoneer is a global payment platform that allows businesses and individuals to send and receive money in over 200 countries.
If You Want To More Information just Contact Now:
Skype: SEOSMMEARTH
Telegram: @seosmmearth
Gmail: seosmmearth@gmail.com
At Techbox Square, in Singapore, we're not just creative web designers and developers, we're the driving force behind your brand identity. Contact us today.
Navigating the world of forex trading can be challenging, especially for beginners. To help you make an informed decision, we have comprehensively compared the best forex brokers in India for 2024. This article, reviewed by Top Forex Brokers Review, will cover featured award winners, the best forex brokers, featured offers, the best copy trading platforms, the best forex brokers for beginners, the best MetaTrader brokers, and recently updated reviews. We will focus on FP Markets, Black Bull, EightCap, IC Markets, and Octa.
Recruiting in the Digital Age: A Social Media MasterclassLuanWise
In this masterclass, presented at the Global HR Summit on 5th June 2024, Luan Wise explored the essential features of social media platforms that support talent acquisition, including LinkedIn, Facebook, Instagram, X (formerly Twitter) and TikTok.
Tata Group Dials Taiwan for Its Chipmaking Ambition in Gujarat’s DholeraAvirahi City Dholera
The Tata Group, a titan of Indian industry, is making waves with its advanced talks with Taiwanese chipmakers Powerchip Semiconductor Manufacturing Corporation (PSMC) and UMC Group. The goal? Establishing a cutting-edge semiconductor fabrication unit (fab) in Dholera, Gujarat. This isn’t just any project; it’s a potential game changer for India’s chipmaking aspirations and a boon for investors seeking promising residential projects in dholera sir.
Visit : https://www.avirahi.com/blog/tata-group-dials-taiwan-for-its-chipmaking-ambition-in-gujarats-dholera/
Event Report - SAP Sapphire 2024 Orlando - lots of innovation and old challengesHolger Mueller
Holger Mueller of Constellation Research shares his key takeaways from SAP's Sapphire confernece, held in Orlando, June 3rd till 5th 2024, in the Orange Convention Center.
Evgen Osmak: Methods of key project parameters estimation: from the shaman-in...
Impact of Cross Aisles in a Rectangular Warehouse:A Computational Study
1. Ertek, G., Incel, B. and Arslan, M. C. (2007). "Impact of Crossaisles in a rectangular warehouse: A
computational study," in Facility Logistics: Approaches and Solutions to Next Generation
Challenges, Editor: Maher Lahmar. Auerbach.
Note: This is the final draft version of this paper. Please cite this paper (or this final draft) as
above. You can download this final draft from http://research.sabanciuniv.edu.
Impact of Cross Aisles in a Rectangular Warehouse:
A Computational Study
Gürdal Ertek, Bilge Incel, and Mehmet Can Arslan
Faculty of Engineering and Natural Sciences
Sabanci University
Istanbul, Turkey
2. 1
Impact of Cross Aisles in a Rectangular Warehouse: A Computational Study
Gürdal Ertek1
Sabancı University
Faculty of Engineering and Natural Sciences
Orhanlı, Tuzla, 34956, Istanbul, Turkey
ertekg@sabanciuniv.edu
Bilge Incel
Roketsan
Ankara-Samsun Karayolu 40. Km
06780, Elmadağ, Ankara, Turkey
b_incel@yahoo.com
Mehmet Can Arslan
Sabancı University
Faculty of Engineering and Natural Sciences
Orhanlı, Tuzla, 34956, Istanbul, Turkey
mehmeta@su.sabanciuniv.edu
Abstract
Order picking is typically the most costly operation in a warehouse and traveling is
typically the most time consuming task within order picking. In this study we focus on
the layout design for a rectangular warehouse, a warehouse with parallel storage blocks
with main aisles separating them. We specifically analyze the impact of adding cross
aisles that cut storage blocks perpendicularly, which can reduce travel times during order
picking by introducing flexibility in going from one main aisle to the next. We consider
two types of cross aisles, those that are equally spaced (Case 1) and those that are
unequally spaced, which respectively have equal and unequal distances among them. For
Case 2, we extend an earlier model and present a heuristic algorithm for finding the best
distances among cross aisles. We carry out extensive computational experiments for a
variety of warehouse designs. Our findings suggest that warehouse planners can obtain
great travel time savings through establishing equally spaced cross aisles, but little
additional savings in unequally-spaced cross isles. We present a look-up table that
provides the best number of equally spaced cross aisles when the number of cross aisles
(N) and the length of the warehouse (T) are given. Finally, when the values of N and T are
not known, we suggest establishing three cross aisles in a warehouse.
Keywords: warehouse design, warehouse layout, order picking, cross aisles, rectangular
warehouse.
1
Corresponding author
3. 2
1. Introduction
Order picking is generally the most significant operation in a warehouse,
accounting for approximately 60% of all operational costs in a typical warehouse
(Frazelle, 2001, page 147). Cost of order picking is affected by the decisions regarding
the facility layout and the selection of storage and retrieval systems, and by the
implemented strategies such as zoning, batching and routing. Travel cost is typically the
largest cost component within order picking, accounting for about 50% of the costs
associated with order picking activities (Frazelle and Apple, 1996). Since order picking,
specifically traveling, is costly, reducing the travel time spent for order picking can
significantly reduce operational costs.
Figure 1. Case 0: A rectangular warehouse with four storage blocks, five main aisles, and
no cross aisles (The vectors show a route to pick an order with seven items).
In this chapter, we present the findings of a study that focuses on the strategic
layout decisions of how many cross aisles to establish within a rectangular warehouse
and how to determine the distances among them. A rectangular warehouse can be
4. 3
defined as a warehouse with equi-length parallel storage blocks, separated by aisles in
between (Figure 1). A sub-region of a large warehouse where routing decisions are made
independently from the remaining regions can also be considered as a rectangular
warehouse, given that it satisfies the structural properties described above. A rectangular
warehouse may have only main aisles which separate the storage blocks vertically
(Figure 1), or may also contain one or more cross aisles perpendicular to the main aisles,
which divide the storage blocks horizontally (Figures 2, 3 and 4). The main advantage of
cross aisles is that they enable savings in travel times, especially during the order picking
operations. Figures 1 and 2 illustrate an example of a rectangular warehouse where the
creation of a cross aisle can reduce the travel distance while picking an order with seven
items: The addition of the cross aisle (Figure 2) shortens the travel distance by enabling
shortcuts from the 5th
main aisle to the 4th
main aisle and from the 4th
main aisle to the 3rd
main aisle.
Figure 2. The warehouse displayed in Case 0 with an interior cross aisle with shortcuts
linking main aisle 5 to main aisle 4 and main aisle 4 to main aisle 3.
5. 4
Storage blocks typically consist of steel racks that are installed on the warehouse
floor permanently during the construction of a warehouse. Thus the decisions regarding
the quantities and dimensions of storage blocks, main aisles and cross aisles are strategic
decisions. These decisions should be made considering many factors, including:
The physical dimensions of the building.
The characteristics of the materials to be stored, including physical dimensions,
weights, shelf lives, pallet sizes and projected demand patterns.
The characteristics of warehouse equipment such as forklifts and AGVs.
The quantity and capabilities of the workforce.
The capabilities of the information system; i.e., the Warehouse Management
System (WMS).
One classic challenge raised by these factors is how to incorporate the interactions
between different decision levels in the design and operation of warehouses
(Rouwenhorst et al., 2000). For example, the strategic decision of determining the best
warehouse layout, the tactical decision of assigning the products to the storage locations
in the best way, and the operational decision of determining the best order picking routes
are all interdependent. In our study we assume that the widths of the storage blocks, the
main aisles and the cross aisles are fixed, and that the items stored in the warehouse all
have the same demand frequencies. Even under these simplifying assumptions, the
strategic decisions regarding the number of cross aisles and the distances between them
(the lengths of storage blocks) have to be made by estimating the average travel distance
in order picking under a specific routing algorithm. Hence, in our study we assume that
6. 5
the routing algorithm and the storage locations of products are pre-determined, and focus
on the strategic decisions regarding cross aisles.
Figure 3. A rectangular warehouse with equally spaced cross aisles (Case 1).
Figure 4. A rectangular warehouse with unequally spaced cross aisles (Case 2).
7. 6
For a rectangular warehouse, one can identify the following three cases with
respect to the number of cross aisles N and the distances in between them:
Case 0: Warehouse with no cross aisles (N=0), as shown in Figure 1.
Case 1: Warehouse with N equally spaced cross aisles (N1), as shown in Figure
3.
Case 2: Warehouse with N unequally spaced cross aisles (N1), as shown in
Figure 4.
In our study we seek answers to the following research questions regarding the
rectangular warehouse:
1. Should the cross aisles be established equally spaced (Case 1) or unequally spaced
(Case 2)? In other words, should the storage blocks have an equal length or
variable lengths?
2. How much travel time savings do cross aisles bring? Under which settings do
cross aisles bring the most travel time savings?
3. How many cross aisles should there ideally be in a rectangular warehouse? In
other words, what is the best number of cross aisles?
To answer these questions, we carry out extensive computational experiments
reflecting a variety of warehouse settings with different values for warehouse lengths (T),
number of cross aisles (M), and pick densities (D). Based on a thorough analysis of our
experimental results, we come up with solid answers to the research questions posed
above.
One unique aspect of our research is that we extensively apply the starfield
visualization technique from the field of information visualization. In starfield
8. 7
visualization, various fields of a dataset are mapped to the axes of a colored 2-D or 3-D
scatter plot, and to the attributes of the glyphs (data points) such as color, size, and shape.
Information visualization is the growing field of computer science that combines the
fields of data mining, computer graphics, and exploratory data analysis (in statistics) in
pursuit of visually understanding data (Keim 2002, Spence 2001). The ultimate goal in
information visualization is to discover hidden patterns and gain actionable insights
through a variety of -possibly interactive- visualizations.
The use of a visualization approach in the analysis of our numerical results will
enable us to make important observations, and develop managerial insights. To the best
of our knowledge, this is the first attempt where data/information visualization techniques
are employed to this extent in the warehousing and facility logistics literature.
2. Related Literature
Rouwenhorst et al. (2000) present a reference framework and classification of
warehouse design and operating problems. Van den Berg and Zijm (1999) provide
another review of the warehousing literature that classifies warehouse management
problems. Sharp (2000) summarizes functional warehouse operations, database
considerations, and tactical, strategic and operational issues in warehouse planning and
design.
Within the vast facility logistics literature, there exists studies that solely focus on
order picking routing and order batching for the purpose of reducing travel time. An early
study by Ratliff and Rosenthal (1983) solves for the routing problem in order picking.
Based on the number of aisles, the authors propose an algorithm that solves the problem
9. 8
to optimality. They state that the algorithm computation time grows linearly in the
number of aisles, and is thus scalable for solving real world problems.
Roodbergen and De Koster (2001) analyze the relationship between warehouse
layout and average travel time. They consider a rectangular warehouse in which a single
cross aisle divides the warehouse into two equal length blocks. The authors present a
dynamic programming algorithm to determine the shortest order picking routes, and show
that the addition of the cross aisle decreases average order picking time significantly.
In another study, Roodbergen and De Koster (2001) compare several algorithms
for routing order pickers in a warehouse with more than one cross aisle. They introduce
two new heuristics, combined and combined+
, and compare them with the S-Shape,
Largest Gap and Aisle-by-Aisle heuristics in the literature. The authors prove through
computational tests that the combined+
heuristic performs best among the five heuristics.
A branch-and-bound algorithm is used as a benchmark to compare the performances of
the generated heuristics.
De Koster et al. (1999) report a real world application, where they significantly
improve the efficiency of manual order picking activities at a large retail distribution
center in Netherlands. In the first stage of their study, the authors apply a routing
heuristic, which ensures that order pickers pick items from both sides of an aisle. This
heuristic alone achieves a 30% reduction in travel time, and consequently a saving of 1.2
order pickers. In the latter stage of their study the authors apply order batching, time-
savings method and a combined routing heuristic (De Koster and Van der Poort 1998)
jointly, and achieve 68% reduction in travel distance and a saving of 3 to 4 pickers. This
10. 9
study is the perfect example of how the order picking strategies and routing algorithms
proposed in the literature can be applied in the real world to achieve substantial savings.
Our study is mainly related to the work of Vaughan and Petersen (1999), who
consider both layout and routing. Vaughan and Petersen are motivated by the fact that
cross aisles can reduce travel distances due to their flexibility in order picking. The
authors develop a shortest path pick sequencing model that is applicable to any number of
equally spaced cross aisles (equal length storage blocks) in the warehouse. Their model
assumes that all the items along an aisle are picked before proceeding to the next aisle,
and the order picking progresses from the leftmost aisle to the rightmost aisle. This policy
is referred to as aisle-by-aisle policy. The authors compute the optimal routes for a large
number of randomly generated picking requests, over a variety of warehouse layout and
order picking parameters. Their results suggest that when the main storage aisle length
(T) is small, an excessive number of cross aisles can increase the average travel distance.
This is true especially when the number of storage aisles (M) is small, and when pick
density is very small or very large. The authors warn that the savings due to cross aisles
diminish, even turn into losses, if the number of cross aisles becomes excessive. This is
because the extra distance to traverse the cross aisles increases the travel distances.
Additionally, the authors find out that as the main storage aisle length (T) increases the
optimal number of cross aisles also increases and report that cross aisles are most
beneficial for longer warehouses.
11. 10
3. The Vaughan and Petersen Model
Vaughan and Petersen (1999) assume certain characteristics with respect to the
rectangular warehouses and order picking policies. Since our study is built on their
model, which we will refer to as the V&P model, these assumptions are also valid for our
model:
There are parallel main aisles and products are stored on both sides of the main
aisles.
Each order includes a number of items to be picked, which are generally located
in various main aisles.
All stocks of a particular item are stored in a single location.
Order pickers can traverse the aisles in both directions and change directions
within the main aisles.
The main aisles are narrow enough to pick from both sides of the aisle without
changing position.
The main aisles are wide enough such that two or more order pickers can operate
in the main aisle at the same time.
There are two natural cross aisles in the warehouse, at the head and rear of the
warehouse.
Cross aisles are not used to store items; they are only used to pass to the next
main aisle.
The items of an order are collected in a single tour.
Block lengths are determined by the locations of the cross aisles that divide main
aisles perpendicularly. In our study, the number of cross aisles refers to the number of
12. 11
interior cross aisles, which are between the default head and rear cross aisles. We
assume that picking routes start and end at the southeast and southwest corners of the
warehouse, respectively. Even though some research assumes that order picking ends at
the starting point (De Koster and Van der Poort 1998, Roodbergen and De Koster 2001),
this does not make a great change in travel distance (and thus travel time). Petersen
(1997) notes that this change results in at most 1% deviation in travel distance.
(a) (b)
Figure 5. (a) A warehouse with storage blocks of equal lengths and (b) a warehouse with
storage blocks with unequal lengths (Arrows represent the total vertical travel distance to
pick items in main aisle m when the main aisle is entered from the ith
cross aisle and left
from the jth
cross aisle).
The dynamic programming algorithm developed by Vaughan and Petersen (1999)
finds the optimal route to pick an order under the aisle-by-aisle policy. The complete
notation for their so called shortest path model is as follows:
L: Length of a storage block.
T: Length of the warehouse (equal to the length of main aisles), LNT 1 .
13. 12
M: Number of main aisles.
N: Number of interior cross aisles (The total number of cross aisles is N+2).
A: Width of a cross aisle. This parameter is essential for the calculation of the best aisle-
by-aisle route. The model assumes that an order picker walks along the center of the cross
aisles. This walking pattern is illustrated in Figure 5 and the additional distance of A/2 to
walk to the middle of the cross aisle is reflected in the formulas for B1m and B2m.
B: Width of a main aisle.
C: Width of a storage block.
The notation until now is related to the warehouse layout. The notation below is given for
to a particular order to be picked:
Km: The number of items to be picked by the order picker from main aisle m = 1, 2, .., M.
Thus the order consists of
M
m
mK
1
items in total.
Xm(t): The location of an item t in main aisle m = 1, 2, …, M, and t = 1, 2, …, Km
(undefined if Km = 0) where 0 Xm(t) T.
(The expressions listed below are demonstrated in Figure 5a.)
Xm
+
: The location of the item at the south-most location (highest value) in main aisle m
(undefined if Km = 0), i.e. Xm
+
= max ( )m
t
X t .
Xm
-
: The location of the item at the north-most location (smallest value) in main aisle m
(undefined if Km = 0), i.e. Xm
-
= min ( )m
t
X t .
Cm(i,j): The total vertical travel distance required to pick all the items in main aisle m, if
main aisle m is entered at cross aisle i and exited to main aisle m-1 at cross aisle j.
14. 13
B1m(i,j): The length of forward-tracking leg required to pick the items in main aisle m to
the north of cross aisle h, h = min (i,j).
B2m(i,j): The length of back-tracking leg required to pick the items in main aisle m to the
south of cross aisle h, h = max (i,j).
fm(i): The minimum total picking distance required to pick all the items in aisle m, m-1,
m-2, ..., 2, 1 if main aisle m is entered at cross aisle position i.
In the V&P model Cm, B1m, and B2m are calculated as follows:
),(2)(),(1),( jiBALjijiBjiC mmm ; where
);,min(for))/)),((min(5.0(),min(2
),,min(for0
,0for0
),(1
jLiLXLXjLiLAXjLiL
jLiLX
K
jiB
mmm
m
m
m
and
).,max(for))/)),max(((5.0(),max(2
),,max(for0
,0for0
),(2
jLiLXLjLiLXAXjLiL
jLiLX
K
jiB
mmm
m
m
m
The dynamic programming equations for each stage are given as follows:
1( ) min ( , ) ( )m m m
j
f i C i j f j , where 1 1( ) ( , 1)f i C i N .
Stages of the dynamic programming are related to the main aisle numbers in the
warehouse. The desired shortest-path picking route is determined by evaluating
( 1)Mf N .
4. The Modified Model
Now we present our model that allows us to find the best routes according to the aisle-by-
aisle heuristic for the case of unequally-spaced cross aisles (Case 2). The primary
15. 14
difference between our model and the V&P model is that the storage blocks now have
variable lengths Li (Figure 5b) instead of a fixed length of L (Figure 5a) where Li is the
length of the ith
storage block for i = 1,…, N+1. Thus, the length of the warehouse T
which is equal to the length of the main aisles can be expressed as
1
1
N
i
i
T L
.
Next, we define two new notations that give us the indices of the blocks where the north-
most and south-most items within an aisle are located:
Blockof(Xm
+
): Index of storage block Li in main aisle m where Xm
+
is located for i = 1, 2,
…, N+1.
Blockof(Xm
-
): Index of storage block Li in main aisle m where Xm
-
is located for i = 1, 2,
…, N+1.
Finally, the Cm, B1m and B2m values are calculated based on the modified
definitions of block lengths Li and the warehouse length T which can be expressed as:
max( , )
min( , ) 1
( , ) 1 ( , ) 2 ( , )
i j
m m s m
s i j
C i j B i j L i j A B i j
,
where
1 1
1 ( , ) 2 min( , ) (0.5 min( , ) ( ))
ji
m mm s f
s f
B i j L L A i j BlockofX X
, and
1 1
2 ( , ) 2 max( , ) (0.5 ( ) 1 max( , ))
ji
m mm s f
s f
B i j L L A Blockof i jX X
5. Algorithms to Identify Best Storage Block Lengths Li
Given T, M, N, A, B, C and D values, the problem of finding the best storage
block lengths Li is a difficult problem. This is because the length of a tour is found by
16. 15
solving a dynamic programming problem and the locations of the items are uniformly
distributed. The objective function to be minimized is the average travel distance (and
thus, the average travel time) over all orders, with the optimal travel distance for each
order computed through dynamic programming optimization. We thus develop and
implement two heuristic search algorithms, namely GSA (Grid Search Algorithm) and
RGSA (Refined Grid Search Algorithm), to find the best Li values. GSA takes a
warehouse (with its T, M, N, A, B, C values), a set of generated orders and the number of
grids as parameters, and identifies an initial solution, which consists of Li values. RGSA
takes the solution of GSA as the initial solution and carries out a search to reduce the
average travel distance (i.e., average travel time). These algorithms are given in pseudo-
code and are explained in the Appendix.
Table 1. Experimental design.
Factor Number of values Values
396scenarios
Length of main aisles (T) (meters) 6 30, 60, 90, 120, 150, 180
Number of main aisles (M) 6 5, 10, 15, 20, 25, 30
Pick density (D)
(items/aisle)
11 0.1, 0.5, 1.0, 1.5, 2.0,
2.5, 3.0, 3.5, 4.0, 4.5, 5.0
Number of cross aisles (N) 1 (for Case 0)
8 (for Case 1)
3 (for Case 2)
0
1, 2, 3, 4, 5, 6, 7, 8
1, 2, 3
(A, B, C) * (meters) 1 (2.50, 1.25, 1.25)
*: A: Width of a cross aisle; B: Width of a main aisle; C: Width of a storage block
17. 16
6. Experimental Design
The different values of model parameters that we have used in our computational
experiments are depicted in Table 1. We investigate 396 scenarios (problem instances)
corresponding to 396 combinations of the warehouse length (T), the number of aisles (M)
and the pick density (D). In all these scenarios, the A, B, C parameters are respectively set
to fixed values of 2.50, 1.25 and 1.25 (meters).
Figure 6. Savings with respect to the pick density (D).
One fundamental parameter is the pick density (D), which is the average number
of items per main aisle. In each scenario, the total number of items to be picked is
calculated as the multiplication of the pick density (D) with the number of main aisles
(M). The 11 pick density values listed above are used for calculating the order sizes
during the estimation of average route length for each scenario. Thus the 11 order sizes
18. 17
used in the experiments are 0.1M, 0.5M, 1.0M, 1.5M, 2.0M, 2.5M, 3.0M, 3.5M, 4.0M,
4.5M and 5.0M.
Figure 7. Savings with respect to the warehouse length (T).
The parameter values in our study are selected such that we can extend the
experiments of Vaughan and Petersen (1999). Compared to the 126 scenarios
(combinations of T, M and D) in their study, we consider 396 scenarios. In addition, our
parameters take values over broader ranges, we calculate average travel distances over a
greater number of instances (1000 orders as opposed to 100 instances), and we consider
Case 2 besides Case 1.
For each warehouse (T, M, N, A, B, C) and for each order size (D*M) we apply
the following procedure:
Step 1: Generate a set of 1000 orders with D*M items each: Each item to be picked is
assigned to a storage location by first randomly generating a main aisle number, and then,
19. 18
randomly generating the position within that main aisle on the interval [0, T). The
locations of the items to be picked in each order are assumed to be uniformly distributed
across the warehouse. This assumption can be encountered in related studies (e.g.; see
Roodbergen and De Koster, 2001).
Step 2: Apply RGSA.
Step 2.a: Apply GSA for the generated set of orders and the given warehouse:
For each feasible configuration of storage blocks, the shortest path dynamic
programming algorithm of the V&P model is solved for each of the orders in the
set of orders. Average travel distances in the set of orders is obtained and an
initial best configuration of storage blocks that provides the minimum average
order picking travel distances is returned.
Step 2.b: Apply the remaining steps of RGSA: Given the initial solution returned
by GSA, RGSA works on improving the Li values with the objective of
minimizing average travel distance.
In Step 1 of the above procedure, the seed used to generate the random numbers is
always chosen the same. The result of the experiments is a dataset with 396 rows and the
following 17 columns: T, M, N, D, average travel length in Case 0, average travel length
in Case 1 for N=1, 2, …, 8 (8 distinct columns), average travel length in Case 2 for N=1,
2, 3 (3 distinct columns), area of the warehouse (for the scenario). We carry out our
analysis in Section 7 using this dataset. The values in the dataset are computed through a
heuristic algorithm (which is not optimal) and through Monte Carlo simulation. Since we
20. 19
are using heuristic algorithms, from now on, the solution which will be referred to as the
best solution is actually the incumbent solution, which is not necessarily optimal.
Figure 8. Savings with respect to the number of main aisles (M).
7. Analysis of Experimental Results
In this section we analyze, through starfield visualizations, the results of our
computational experiments for the 396 scenarios. The first three figures that we discuss in
this section (figures 6, 7and 8) are referred to as colored scatter plots in exploratory data
analysis literature (Hoffman and Grinstein, 2002). According to this naming scheme,
Figures 9 and 10 are referred to as jittered colored scatter plots, and figures 11, 12, and
13 are referred to as colored 3-D scatter plots. However, rather than using the
terminology in exploratory data analysis, we refer to all these plots as starfield
visualizations, following the terminology in the field of information visualization
21. 20
(Shneiderman, 1999). The starfield visualization is an extended version of the scatter
plot, with coloring, size, zooming and filtering.
Figure 9. Percentage travel time savings with respect to the warehouse length (T) and
number of main aisles (M).
In each of figures 6 through 13, information regarding which parameter is mapped
to which attribute of the plot/glyphs is displayed below the plot. For example, in Figure 6,
D (pick density) values are mapped to color of the glyphs, percentage travel time savings
(in Case 2 compared to Case 1) are mapped to the X-axis, and percentage space savings
(in Case 2 compared to Case 1) are mapped to the Y-axis. The range of pick density
values is 0 to 5. Lighter colors represent larger values of the mapped parameter, and
darker colors represent smaller values of the mapped parameter. All the mappings are
linear. Rectangular frames, such as frames (a) and (b) in Figure 6, are drawn to highlight
specific regions in the plots that exhibit the interesting properties.
22. 21
Figure 10. Percentage Space savings with respect to the warehouse length (T) and
number of main aisles (M).
7.1. Savings in Case 2 Compared to Case 1
Figures 6 through 10 illustrate the percentage savings gained in layouts with
unequally spaced cross aisles (Case 2) compared to layouts with equally spaced cross
aisles (Case 1). In figures 6, 7 and 8, each scenario is represented by a glyph (data point),
the percentage travel time (distance) savings in Case 2 compared to Case 1 are mapped to
the X-axis, the percentage space savings are mapped to the Y-axis, and various
parameters (D, T, and M) are mapped to colors of the glyphs. In Figures 9 and 10, each
scenario is again represented by a glyph, but this time the T values are mapped to the X-
axis, the M values are mapped to the Y-axis, and the percentage savings (in travel time
and in warehouse space) are mapped to colors of the glyphs.
23. 22
In Figure 6, frame (a) shows that the scenarios with large percentage travel time
savings are all characterized by high pick densities (large D values). Frame (b) shows that
under certain scenarios, the percentage travel time savings are obtained only at the cost of
big losses in warehouse space (negative percentage space saving values on the Y-axis).
In Figure 7, frame (a) shows that the scenarios with the largest percentage travel
time savings are for warehouses that have medium T values. Frames (b) and (c) show that
scenarios which benefit from Case 2 with respect to percentage space savings are all
characterized by large length values (light colors). However, in these scenarios there may
be savings as well as losses in percentage travel time, as can be seen in Frames (a) and
(b), respectively. Frame (d), on the other hand, shows that in instances with shorter
warehouses (glyphs with darker colors) the best number of cross aisles for Case 2 is more
than the best number of cross aisles for Case 1, and this can result in large percentage
losses in warehouse space. These instances are all characterized by high pick densities in
from frame (b) of Figure 6.
In Figure 8, the frame shows that the scenarios in which Case 2 results in
significant space savings, but also the travel time losses (negative values on the X-axis)
are all characterized by large M values (light tones of gray). From figures 6 and 7, we
remember that these are also scenarios with low pick densities and largest T values.
The maximum percentage travel time saving (X value of the rightmost glyph)
obtained in the 396 scenarios is 5.28%. This result strikingly suggests that unequally
spaced cross aisles (Case 2) bring little additional savings in comparison to equally
spaced cross aisles (Case 1). In our study, finding the best number and best positions of
unequally spaced cross aisles required implementation of a non-trivial algorithm and
24. 23
allocation of significant running times for the computations (approximately ten days in
total, most of it for computing the solutions for N=3 in Case 2). Thus, we can conclude
that warehouse planners are better off establishing rectangular warehouses with equally-
spaced cross-aisles instead of unequally-spaced cross-aisles. These results provide
answers to the first research question posed in Section 1.
Figure 11. Percentage Travel time savings with respect to the warehouse length (T),
number of main aisles (M) and pick density (D) for N=1.
Figures 9 and 10 allow the analysis of savings with respect to T and M, which
are mapped to the X and Y-axes, respectively. Since there are 11 scenarios for each (T,
M) pair, jittering is applied to a certain extent to avoid occlusion. So in these two figures
the glyphs which are clustered together have the same T and M values, but differ in their
pick densities (D values).
25. 24
In Figure 9, frame (a) shows that for small values of T, percentage travel time
savings in Case 2 are higher in general (lighter glyphs). For large warehouses, which are
highlighted by frame (b), there are less savings, or even losses in Case 2. This may be due
to the fact that our algorithm finds the best positions in Case 2 is run only for N=1, 2, and
3. We thus believe that development of efficient algorithms for solving Case 2 for larger
values of N is critical.
Figure 12. Percentage travel time savings with respect to the warehouse length (T),
number of main aisles (M) and pick density (D) for N=5.
In Figure 10, frame (a) shows that shorter warehouses can incur big space
losses in Case 2, since for the associated scenarios, the best number of cross aisles
required in Case 2 (to minimize travel time) is typically more than the number of cross
aisles required in Case 1. Frame (b) shows, as expected, that there are space savings in
Case 2 compared to Case 1, since N3 in Case 2 and N8 in Case 1. In general, through
26. 25
our observations in Section 7.1, we can conclude that it is sufficient to focus only on Case
1 which we continue to analyze in Sections 7.2 and 7.3.
7.2. Impact of T, M and D in Case 1
Figures 11 and 12 show the change in percentage travel time savings in Case 1
(for N=1 and N=5) compared to Case 0, under the 396 combinations of T, M and D
(which are mapped to X, Y, and Z axes, respectively). Percentage travel time saving in
each scenario is mapped to color of the related glyph. As shown in frame (a) of both
figures, the largest travel time savings are realized for pick densities (D values) between
0.5 and 2.5. This observation is consistent with earlier findings of Vaughan and Petersen
(1999), who state that “the greatest cross aisle benefit occurs at pick densities in the range
0.6 to 1.0 units/aisle,” which answers the second research question posed in Section 1.
27. 26
Figure 13. The best number of cross aisles (N) with respect to the warehouse length (T),
number of main aisles (M) and pick density (D).
In both figures 11 and 12, the impact of M is observed to be negligible, except
for D=0.1 (warehouses with very small orders). This conclusion is reached by observing
that the colors of the glyphs do not change significantly along the Y-axis, except for
D=0.1. Meanwhile, as shown in frame (b) of both figures, shorter warehouses (with small
T values) are most sensitive to changes in D.
Vaughan and Petersen (1999) also state that the “addition of cross aisles
generally decreases the picking travel distance on average, with travel distances
frequently in the range 70%-80%, or even less, of that associated with the no cross aisles
N=0 layout,” quantifying the savings that can be obtained. This is another significant
finding of our study. The percentage travel time savings in figures 11 and 12 take values
between 0 and 35.30. That is, we observe travel time savings of up to 35.30% by adding
cross aisles, confirming the earlier findings of the authors.
Table 2. The best number of cross aisles for different (T, M) pairs, accompanied with the
maximum travel time losses that one can encounter under any D.
T=30 T=60 T=90 T=120 T=150 T=180
M=5 1
0.52%
2
1.32%
2
0.51%
3
0.30%
4
0.59%
4
0.37%
M=10 1
1.86%
2
0.32%
3
0.23%
3
0.66%
4
0.58%
4
0.38%
M=15 1
2.40%
2
0.86%
3
0.22%
4
0.10%
4
0.35%
5
0.21%
M=20 2
2.55%
3
0.81%
3
0.44%
4
0.10%
4
0.31%
5
0.10%
28. 27
M=25 2
2.43%
3
0.74%
3
0.42%
4
0.18%
5
0.31%
5
0.12%
M=30 2
2.45%
3
0.74%
3
0.54%
4
0.16%
5
0.27%
5
0.15%
7.3. Best Number of Cross Aisles in Case 1
Figure 13 shows the change in the best number of cross aisles in Case 1,
which is mapped to color. The parameters T, M, and D are again mapped to X, Y, and Z
axes, respectively. Since none of the scenarios has its best N value equal to 8, the range of
N values is between 1 and 7. Also, since the glyphs in the figure do not have the lightest
tones of gray, we can observe that the best N values are seldom 7 or 6. A count in the
experimental results shows that in 389 (all but 7) of the 396 scenarios, the best N value is
less than or equal to 5. The most frequently encountered N value is 4, with 129 scenarios
implying that N=4 is the most desirable number of cross aisles.
We can conclude from Figure 13 that the main determinant of the best N value
is the warehouse length T, since there are big changes in the color tone as one goes from
smaller to larger values of T. By judging from the pattern of change in color tone, one can
conclude that M also has some impact as well. At this point, we can address the third
research question stated in Section 1 in two parts, both of which are very relevant and
important: What is the best number of cross aisles for known values of T and M? And is
there a best number of cross aisles, regardless of T and M?
The first question is very relevant, since in designing warehouse layouts,
warehouse planners typically have a very limited knowledge on future D values, while
they generally have a good judgment of which values T and M should take. The answer to
the first question is given in Table 2, which displays the best number of cross aisles for
29. 28
different (T, M) pairs, accompanied with the maximum travel time losses that one can
encounter under any D values. For example, for (T, M)=(90, 10), the planner should
establish 3 cross aisles. Among the 11 D values tested in our experiments for this (T, M)
combination, establishing a different number of cross aisles resulted in at most 0.23%
savings compared to 3 cross aisles.
Figure 14. The maximum percentage gap –over all scenarios– between the travel time
under N and the best travel time for that scenario.
The second question is very relevant as well, since many warehouse planners
would prefer to learn and always remember a single number, rather than having to refer
to Table 2 in this chapter. Thus, the question is which number of cross aisles to
recommend to a warehouse planner regardless of T, M, or D values. The answer to this
question is simply 3. A warehouse planner can always build warehouses with 3 equally
spaced cross aisles without compromising a significant loss in travel time, in particular,
when compared to warehouses with different numbers of cross aisles.
30. 29
Of course, this result is valid if the A, B, C values are close to the values in
Table 1, and the warehouse operates under the assumptions of our model, including the
usage of the aisle-by-aisle policy for routing. For the scenarios that we analyze in our
experiments, the worst travel time loss for 3 cross aisles is 6.26% (Figure 14), and the
worst warehouse space (area) loss is 15.38% (Figure 15). Figures 14 and 15 show the
worst average losses for other values of N.
Figure 15. The maximum percentage gap –over all scenarios– between the warehouse
space under N and the warehouse space for the best N for that scenario.
If the warehouse space (area) is the most critical resource, then a warehouse
planner can establish 2 cross aisles, instead of 3. In our experiments, having 2 cross aisles
resulted in at most 16.68% loss in travel time (Figure 14), and 7.69% loss in warehouse
space (Figure 15). Thus, layouts with 3 (equally spaced) cross aisles are robust in terms
of travel time, and layouts with 2 cross aisles are robust in terms of warehouse space.
31. 30
8. Conclusions and Future Work
In this chapter, we presented a detailed discussion of the impact of cross aisles on
a rectangular warehouse. We analyzed both equally spaced and unequally spaced cross
aisles, which we referred to as Case 1 and Case 2, respectively. For Case 1 we utilized the
dynamic programming algorithm presented in Vaughan and Petersen (1999) to determine
the optimal order picking routes under aisle-by-aisle policy. For Case 2, we made
modifications to the Vaughan and Petersen (1999) model, including the change of
formulas for certain parameters and introduction of new expressions before running the
dynamic programming algorithm. We computed the average travel times using Monte
Carlo simulation for 396 distinct scenarios, which correspond to 396 different warehouse
and demand combinations. Our primary findings are:
1. It is more desirable to establish only equally-spaced cross aisles than to establish
unequally spaced cross aisles.
2. Establishing (equally spaced) cross aisles can bring significant travel time savings
and should definitely be considered: We obtained savings up to 35.30% in our
experiments. Biggest travel time savings are realized for pick densities between
0.5 and 2.5 (D[0.5, 2.5]).
3. Given the length of main aisles and the number of main aisles (T and M),
warehouse planners can refer to Table 2 in this chapter to determine the best
number of (equally spaced) cross aisles. If one does not wish to refer to this table,
but wishes to learn and remember a single value for the best number of cross
aisles, we propose the value of 3.
32. 31
There are several directions for future research relating to our study. Below we list
two:
1. It is necessary to design faster and better algorithms to identify the best storage
block lengths (Li) in Case 2, and to validate further our first conclusion.
2. It is important to test the robustness of our conclusions under other demand
patterns and different routing heuristics.
Our study contributes to the research and practice of warehouse planning / facility
logistics by providing actionable insights regarding cross aisles. There is a great potential
for research that attempts to solve warehousing problems that require taking
interdependent decisions at different time horizons; for example at both strategic and
operational levels. Finally, we suggest the adoption of data analysis techniques from the
field of information visualization for discovering knowledge hidden in experimental and
empirical data related to warehouse planning.
Acknowledgements
The authors thank Kemal Kılıç at Sabancı University for his extensive help in reviewing
the M.S. thesis of Bilge Incel (Küçük), which in time turned into this chapter. The
authors also thank Ş. İlker Birbil for reviewing the final draft of the paper and suggesting
many improvements.
33. 32
References
De Koster, R., Roodbergen, K. J., Van Voorden, R. (1999) “Reduction of walking time in
the distribution center of De Bijenkorf,” in New Trends in Distribution Logistics,
M. Grazia Speranza, Paul Stähly, Eds., Springer-Verlag Berlin Heidelberg.
De Koster, R., Van der Poort, E. (1998) “Routing order pickers in a warehouse: a
comparison between optimal and heuristic solutions,” IIE Transactions, vol: 30,
pp. 469-480.
Hoffman, P. E., Grinstein, G. G. (2002) “A survey of visualiations for high-dimensional
data mining,” in Information Visualization in Data Mining and Knowledge
Discovery, Usama Fayyad, Georges Grinstein and Andreas Wierse, Eds., Morgan
Kaufmann.
Frazelle, E. H. (2001) World-class warehousing and material handling. McGraw-Hill.
Frazelle, E. H., Apple, J. M. (1994) “Warehouse operations,” in The Distribution
Management Handbook. James A. Tompkins and Dale Harmelink, Eds. Mc-
Graw-Hill.
Keim, D. A. (2002) “Information visualization and visual data mining,” IEEE
Transactions on Visualization and Computer Graphics, vol: 8 no: 1, pp.1–8
Petersen, C.G. (1997) “An evaluation of order picking routing policies,” International
Journal of Operations and Production Management, vol: 17, pp. 1098-1111.
Ratliff, H. D., Rosenthal, A. S. (1983) “Order Picking in a rectangular warehouse: A
solvable case of the traveling salesman problem,” Operations Research, vol: 31,
no: 3, pp. 507-521.
34. 33
Roodbergen, K. J., De Koster, R. (2001a) “Routing order pickers in a warehouse with a
middle aisle,” European Journal Of Operational Research, vol: 133, pp. 32-33.
Roodbergen, K. J., De Koster, R. (2001b) “Routing methods for warehouses with
multiple cross aisles,” International Journal of Production Research, vol: 39, pp.
1865-1883.
Rouwenhorst, B., Reuter B., Stockrahm, V., Van Houtum, G. J., Mantel, R. J., Zijm, W.
H. M. (2000) “Warehouse design and control: framework and literature review,”
European Journal of Operational Research, vol: 122, pp. 515-533.
Sharp, P.G. (2000) “Warehouse management,” Chapter 81 in Handbook of Industrial
Engineering, Gavriel Salvendy, Ed., John Wiley & Sons, Inc., New York.
Shneiderman, B. (1999) “Dynamic queries, starfield displays, and the path to Spotfire”.
Available under http://www.cs.umd.edu/hcil/spotfire/ . Retrieved on November
2006.
Spence, R. (2001) Information visualization. Essex, England: ACM Press.
Van den Berg, J. P., Zijm, W. H. M. (1999) “Models for warehouse management:
classification and examples,” International Journal of Production Economics,
vol: 59, pp. 519-528.
Vaughan, T. S., Petersen, C. G. (1999) “The effect of warehouse cross aisles on order
picking efficiency,” International Journal of Production Research, vol: 37, pp.
881-897.
35. 34
Appendix
GRID_SEARCH_ALGORITHM (GSA)
This algorithm returns bestL, the best block lengths among tested layouts, for a
given N. The length of the gridForL array is (N+1) and indicates the number of storage
blocks. gridsForL[i] records the number of grids that constitute the length of the ith
storage block. If the summation of the elements of gridForL array is equal to noOfGrids
value, then a feasible storage block length combination is obtained. When noOfGrids =
20 and N = 2, for example, then some of the feasible storage block lengths (L1, L2, L3)
would be (1, 12, 7), (11, 4, 5), having the summation of L values equal to noOfGrids =
20.
GSA generates feasible configurations of storage blocks systematically and
returns the travel distances by solving the modified model that we present for a uniformly
distributed set of orders. Average of the travel distances for the order set is taken and the
initial best configuration of storage blocks enabling the minimum average order picking
travel distances is labeled as bestL.
This algorithm generates a greater number of feasible storage block length
alternatives as the number of grids is increased. This results in smaller unit length (G=
T/noOfGrids). However, the more the number of feasible solution gets, the more will be
the computational effort. We observed in our experiments that for the warehouse and
order settings described in the next section, noOfGrids = 7 is computationally prohibitive
(18 days running time including the cases where N = 4), and noOfGrids is selected as
seven.
36. 35
= {1,...., N+1}, O = {1,...., }
GRID_SEARCH_ALGORITHM (warehouse, orders, noOfGrids)
G = T/noOfGrids
for each gridsForL, /* s.t. gridsForL[i] noOfGrids, i */
sumOfGrids =
i
gridsForL[i]
if( sumOfGrids = = noOfGrids&&ARRAY_CONTAINS_NOZERO(gridsForL))
tempL[i] = gridsForL[i] * G, i
TempWarehouse.setL(tempL)
orders[o].setWarehouse(tempWarehouse), o O
tempSimulationStatistics = CALCULATE_SIMULATION_STATISTICS(orders)
tempTravelDistance = tempSimulationStatistics.getAverage()
if (tempTravelDistance < bestTravelDistance)
bestL = tempL
bestTravelDistance = tempTravelDistance
return bestL
CALCULATE_SIMULATION_STATISTICS (orders)
travelDistance[o] = getOptimalTravelDistance( orders[o] ), o O
return statistics for travelDistance data
...........
37. 36
REFINED_GRID_SEARCH_ALGORITHM (RGSA)
This algorithm starts with the result of the grid search algorithm as the initial
solution and applies changes in little unit lengths (G) to the initial best configuration of
storage blocks (initialBestL). In this method, first a range is defined. Half of this range
is subtracted from each storage space length and smaller unit lengths (gridsForL[i]*G)
are added to each storage space length. The travel distance for the new configuration
tempL is calculated for the given order set (orders) and compared with the best result
obtained until that time. After trying all feasible configurations of the gridsForL for the
same initial solution and calculating the travel distance for the new storage block lengths,
tempL resulting in the shortest travel distance is assigned as the best configuration of
cross aisles, bestL. Then the range is updated by dividing with the number of grids
(noOfGrids). Half of this range is subtracted from each storage space length and smaller
unit lengths (gridsForL[i]*G) are added to obtain new feasible storage block lengths
(tempL) and travel distance implied by the updated tempL is calculated for the given
order set (orders). The refined grid search is continued until the range declines to a
length, which is determined as the smallest range (resolution) to be considered. When the
range becomes as small as the resolution, the refined grid search is terminated and the
improved configuration of storage block lengths is assigned as the best configuration of
storage block lengths (bestL) for the given warehouse and order set.
Any element of gridsForL can be at most (N+1)*noOfGrids, because in the
refined grid search algorithm for each storage block, half of the range is subtracted and
the length gridsForL[i]*G is added, for instance:
From the above equations it is clearly seen that summation of the gridsForL’s
38. 37
elements has to be (N+1)*noOfGrids. Therefore, an element of gridsForL is allowed to be
(N+1)*noOfGrids at most.
The search algorithms result in the best storage block lengths that give the
minimum order picking travel distance for a problem instance (T, M, N, A, B, C, D)
among the tested configurations.
REFINED_GRID_SEARCH_ALGORITHM(warehouse, orders, noOfGrids, resolution)
initialBestL = GRID_SEARCH_ALGORITHM(warehouse, orders, noOfGrids)
range = T/noOfGrids
iterationNo = 0
continueFlag = true
while (continueFlag)
iterationNo++
if (iterationNo > 1) // if not the first iteration
range = (range/noOfGrids)/2
G = (range/noOfGrids)/2
for each gridsForL /* gridsForL[i] (N+1)*noOfGrids */
sumOfGrids =
i
gridsForL[i]
if (sumOfGrids==(N+1)noOfGrids&&ARRAY_CONTAINS_NOZERO(gridsForL))
tempL[i] = initialBestL[i] – (range/2) + gridsForL[i]*G, i
tempWarehouse.setL(tempL)
orders[o].setWarehouse(tempWaarehouse), o O