Skip to main content


In this section, we proposed a general, flexible, expandable, and lean data structure called Warehouse Operations Data Structure (WODS). The WODS is a set of well-defined, related information stores that facilitate the development of formal, unambiguous system descriptions in a given domain. WODS and its constituent components are completely abstracted from any specific picking area layout, order behavior, picking method or implementation. The structure provides ultimate flexibility, allowing the WODS to facilitate the process of modeling any picking layout, regardless of equipment or storage type. This significantly simplifies the development, verification, and sharing of computer models of order picking operations and facilitates the analysis of layouts, resource allocations, and operational strategies. The WODS consists of 6 relational tables. Each part of the picking process is done based on one or more of the tables from the WODS. 

A main component of WODS is its graph representation of warehouse. A graph is a set of vertices connected together via edges. Picker movement graph (Arcs, Nodes) is a graph style representation of the warehouse based on arc and node tables of the WODS in which the locations that picker might stop in (for picking or dropping purposes) are playing the role of the node and the allowable picker movements are identified by arcs.

Accompanying the WODS is a set of sample software codes as a way of testing the data structure in various scenarios as well as providing examples of one of many ways that the WODS can facilitate the process of programming.