Motion and layout planning in a grid-based early baggage storage system
TL;DR: This paper designs and analyzes a framework for the efficient storage and retrieval of a large number of storage items based on a multi-agent routing algorithm in a simulation-based case study at a major German airport.
Abstract: Grid-based storage systems consist of many adjacent square cells arranged in a rectangular grid. Cells are either empty or occupied by a storage item. Items are stored on conveyors and are movable simultaneously and independently into the four cardinal directions. This technology allows for very dense storage. Previous research on grid-based storages has mainly focused on retrieval performance analysis of a single storage item. In this paper, we contribute a framework for the efficient storage and retrieval of a large number of storage items based on a multi-agent routing algorithm. We evaluate the framework using different storage and retrieval strategies in a simulation-based case study, in which we design and analyze a grid-based early baggage storage system at a major German airport.
Citations
More filters
TL;DR: This paper presents a heuristic variant of the search algorithm to solve larger problem instances and shows that the algorithms clearly outperform existing approaches where they are applicate and solve more general configurations, which could not be solved to optimality before.
Abstract: Puzzle-based storage systems consist of densely stored unit loads on a square grid. The problem addressed in this paper is to retrieve a stored unit load from a puzzle-based storage using the minim...
25 citations
15 citations
TL;DR: Robotic Mobile Fulfilment Systems are increasingly applied in various warehouses, especially the e-commerce warehouses with rigid order completion requirements, with high efficiency and good scalability.
Abstract: With high efficiency and good scalability, Robotic Mobile Fulfilment Systems (RMFS) are increasingly applied in various warehouses, especially the e-commerce warehouses with rigid order completion ...
9 citations
TL;DR: A hybrid approach is proposed that combines state appraisal, neighborhood search, and beam search for the minimization of total number of item-moves when retrieving a single item with multiple escorts in the Puzzle-Based Storage system.
6 citations
TL;DR: In this paper , a hybrid approach that combines state appraisal, neighborhood search, and beam search is proposed to solve the single item retrieval problem with multiple escorts in puzzle-based storage systems.
4 citations
References
More filters
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Abstract: We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the branches definitely assignec~ to the tree under construction (they will form a subtree) ; II. the branches from which the next branch to be added to set I, will be selected ; III. the remaining branches (rejected or not yet considered). The nodes are subdivided into two sets: A. the nodes connected by the branches of set I, B. the remaining nodes (one and only one branch of set II will lead to each of these nodes), We start the construction by choosing an arbitrary node as the only member of set A, and by placing all branches that end in this node in set II. To start with, set I is empty. From then onwards we perform the following two steps repeatedly. Step 1. The shortest branch of set II is removed from this set and added to
22,704 citations
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Abstract: Although the problem of determining the minimum cost path through a graph arises naturally in a number of interesting applications, there has been no underlying theory to guide the development of efficient search procedures. Moreover, there is no adequate conceptual framework within which the various ad hoc search strategies proposed to date can be compared. This paper describes how heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching and demonstrates an optimality property of a class of search strategies.
10,366 citations
Book•
01 Jan 1990
TL;DR: This chapter discusses the configuration space of a Rigid Object, the challenges of dealing with uncertainty, and potential field methods for solving these problems.
Abstract: 1 Introduction and Overview.- 2 Configuration Space of a Rigid Object.- 3 Obstacles in Configuration Space.- 4 Roadmap Methods.- 5 Exact Cell Decomposition.- 6 Approximate Cell Decomposition.- 7 Potential Field Methods.- 8 Multiple Moving Objects.- 9 Kinematic Constraints.- 10 Dealing with Uncertainty.- 11 Movable Objects.- Prospects.- Appendix A Basic Mathematics.- Appendix B Computational Complexity.- Appendix C Graph Searching.- Appendix D Sweep-Line Algorithm.- References.
6,186 citations
TL;DR: 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.
533 citations
[...]
TL;DR: On-line scheduling illustrates many general aspects of competitive analysis, especially in the setting and numerical results, but also in the techniques used.
Abstract: We have seen a variety of on-line scheduling problems. Many of them are understood satisfactorily, but there are also many interesting open problems. Studied scheduling problems differ not only in the setting and numerical results, but also in the techniques used. In this way on-line scheduling illustrates many general aspects of competitive analysis.
253 citations