Bins relocation problem in AutoStore: an overview

Yong Liu,Xinyi Dong

Published 2024 in Other Conferences

ABSTRACT

In today's high-speed logistics era spawned by e-commerce, with the increase of the circulation volume of goods, warehousing is urged to innovate to improve the efficiency of commodity delivery. However, the traditional methods of warehouse renovation and reconstruction will lead to huge cost consumption, which may even lead to the stagnation of warehouse operations and the backlog of orders. This makes many enterprises avoid the replacement of system structure and mode when they are faced with improving warehousing performance. This is inefficient in the long run. Though AutoStore has avoided these disadvantages of traditional warehouse upgrading, it has never received much attention since its birth for more than 20 years. Therefore, we think it is necessary to systematically elaborate this efficient warehousing system. In this study, chapter 1 introduces the structure and history of AutoStore, and sorts out the related literature. It also points out the optimization problem with the most research necessity and prospect: Bins Relocation Problem for AutoStore (BRP-AS), which is the research content of this paper; Then in chapter 2, we give a detailed definition of it and point out its principle; In chapter 3, we put forward a set of abstract methods to transform BRP-AS into mathematical problems. Meanwhile, in the chapter 4, according to the similarity of the problems, we compare BRPAS with the containers relocation problem (CRP) and the traveling salesman problem (TSP), and point out the referential solutions. Lastly, in chapter 5, we summarize the whole paper.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-39 of 39 references · Page 1 of 1

CITED BY