Experimental investigation of shared storage assignment policies in automated storage/retrieval systems

Kulturel, Sadan; Özdemirel, Nur Evin; Sepil, Canan; BOZKURT, ZAFER

doi:10.1080/07408179908969873

Cited by 28 publications

(22 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With simulation more extensive experiments under stochastic conditions can be performed (e.g., Schwarz et al, 1978;Kaylan and Medeiros, 1988;Kulturel et al, 1999;Van den Berg and Gademann, 2000). Malmborg (1996) and Malmborg and Altassan (1998) develop a storage policy trade-off for respectively unit load and small systems to roughly compare different policies in a short time prior to a simulation study.…”

Section: Performance Of Storage Assignment Rulesmentioning

confidence: 99%

See 1 more Smart Citation

A survey of literature on automated storage and retrieval systems

Roodbergen

Vis

2009

European Journal of Operational Research

494

208

View full text Add to dashboard Cite

Automated Storage and Retrieval Systems (AS/RSs) are warehousing systems that are used for the storage and retrieval of products in both distribution and production environments. This paper provides an overview of literature from the past 30 years. A comprehensive explanation of the current state of the art in AS/RS design is provided for a range of issues such as system configuration, travel time estimation, storage assignment, dwell point location, and request sequencing. The majority of the reviewed models and solution methods are applicable to static scheduling and design problems only. Requirements for AS/RSs are, however, increasingly of a more dynamic nature for which new models will need to be developed to overcome large computation times and finite planning horizons, and to improve system performance. Several other avenues for future research in the design and control of AS/RSs are also specified.

show abstract

Section: Performance Of Storage Assignment Rulesmentioning

confidence: 99%

“…Kulturel et al (1999) compare a three class-based policy with a duration of stay policy, which was originally introduced by Goetschalckx and Ratliff (1990). While applying the duration of stay policy, products with the shortest duration in the warehouses are assigned to storage locations closest to the I/O-point.…”

Section: Performance Of Storage Assignment Rulesmentioning

confidence: 99%

A survey of literature on automated storage and retrieval systems

Roodbergen

Vis

2009

European Journal of Operational Research

494

208

View full text Add to dashboard Cite

show abstract

“…These savings can be directly translated into increased throughput capacity for existing systems and can be used to improve the design of proposed systems. Based on the same approach as in Goetschalckx and Ratliff (1990), and using computer simulation, Kulturel et al (1999) compared two shared storage assignment policies in an AS/RS. The AS/RS was assumed to operate under a continuous review, order quantity and reorder point inventory policy.…”

Section: Storage Assignmentmentioning

confidence: 99%

Automated Storage and Retrieval Systems: A Review on Travel Time Models and Control Policies

Tang

Vasili

2012

Warehousing in the Global Supply Chain

View full text Add to dashboard Cite

Automated storage and retrieval system (AS/RS) is one of the major material handling systems, which is widely used in distribution centers and automated production environments. AS/RSs have been utilized not only as alternatives to traditional warehouses but also as a part of advanced manufacturing systems. AS/RSs can play an essential role in modern factories for work-in-process storage and offer the advantages of improved inventory control and cost-effective utilization of time, space and equipment. Many issues and approaches related to the efficiency improvement of AS/RSs have been addressed in the literature. This chapter presents an overview of this literature from the past 40 years. It presents a comprehensive description of the current state-of-the-art in AS/RSs and discusses future prospects. The focus is principally on travel time estimates and different control policies such as dwell-point of the stacker crane, storage assignment, request sequencing and so on. In particular, this chapter will provide researchers and decision makers with an understanding of how to apply existing approaches effectively. IntroductionThe chapter is presented in four sections. The current section and Sect. 8.2 provide brief background information on facilities planning and design, material handling,

show abstract

“…If a warehouse is not perfectly balanced, the simulation results based on a deterministic environment suggest that the full duration-of-stay policy outperforms the class-based turnover policy with two classes, which in turn outperforms the class-based duration-of-stay policy with two classes. Kulturel et al (1999) compare the class-based turnover policy with the class-based duration-of-stay policy using computer simulations for a warehouse with three classes that face stochastic demand. Their results echo the findings of Goetschalckx and Ratliff (1990), which show that the class-based turnover policy generally outperforms the class-based durationof-stay policy.…”

Section: Introductionmentioning

confidence: 99%

Robust Storage Assignment in Unit-Load Warehouses

2012

View full text Add to dashboard Cite

A ssigning products to and retrieving them from proper storage locations are crucial decisions in minimizing the operating cost of a unit-load warehouse. The problem becomes intractable when the warehouse faces variable supply and uncertain demand in a multiperiod setting. We assume a factor-based demand model in which demand for each product in each period is affinely dependent on some uncertain factors. The distributions of these factors are only partially characterized. We introduce a robust optimization model that minimizes the worst-case expected total travel in the warehouse with distributional ambiguity of demand. Under a linear decision rule, we obtain a storage and retrieval policy by solving a moderate-size linear optimization problem. Surprisingly, despite imprecise specification of demand distributions, our computational studies suggest that the linear policy achieves close to the expected value given perfect information and significantly outperforms existing heuristics in the literature.

show abstract

Experimental investigation of shared storage assignment policies in automated storage/retrieval systems

Cited by 28 publications

References 10 publications

A survey of literature on automated storage and retrieval systems

A survey of literature on automated storage and retrieval systems

Automated Storage and Retrieval Systems: A Review on Travel Time Models and Control Policies

Robust Storage Assignment in Unit-Load Warehouses

Contact Info

Product

Resources

About