One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations

Abstract

In this paper we focus on the problems of one-dimensional storage location and order picking in a single carousel. We illustrate several applications, review the literature and list some open problems, and present a general model that includes the one-dimensional carousel storage location problem as well as other well-known combinatorial optimization problems as special cases.

Keywords:

• Storage space location
• carousel applications
• combinatorial optimization
• quadratic assignment problem