Storage assignment optimization in a multi-tier shuttle warehousing system

Wang, Yanyan; Mou, Shandong; Wu, Yaohua

doi:10.3901/cjme.2015.1221.152

Cited by 24 publications

(14 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It could be interesting to attempt to combine exact algorithms from the mixed integer programming paradigm, such as branch-and-bound and branch-and-cut, to improve their performance [55,56]. It could be also interesting to apply the proposed algorithm to other optimization problems including hybrid flowshop scheduling problem with duedate window [57], assignment optimization in a multi-tier shuttle warehousing system [58], optimization of the dressing parameters [59], etc.…”

Section: Discussionmentioning

confidence: 99%

Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times

Pan

Gao

2017

Applied Mathematics and Computation

View full text Add to dashboard Cite

This paper proposes a total of nine algorithms to minimize the makespan for the hybrid flowshop scheduling problem with sequence-dependent setup times. The first six algorithms are trajectory-based metaheuristics, including three variants of iterated local search and three variants of iterated greedy. The remaining three algorithms are population-based metaheuristics, namely, the improved fruit fly optimization, the improved migrating birds optimization, and the discrete artificial bee colony optimization. We present some advanced and effective technologies, including three mixed neighborhood structures, an enhanced perturbation method, and an enhanced destruction and construction procedure for the trajectory-based metaheuristics. We propose a path-relinking-based cooperative search, a diversity control scheme, and a diversified initialization approach for the improved fruit fly optimization. We calibrate the parameters and operators for the proposed algorithms by means of a design of experiments approach. To evaluate the proposed algorithms, we present several adaptations of other recent well-known meta-heuristics for the problem and conduct a comprehensive set of computational and statistical experiments to demonstrate the effectiveness of the presented algorithms. Among them, the discrete artificial bee colony optimization is the best-performing algorithm and it is able to improve 126 out of the 240 best known solutions for the benchmarks in the literature.

show abstract

Section: Discussionmentioning

confidence: 99%

Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times

Pan

Gao

2017

Applied Mathematics and Computation

View full text Add to dashboard Cite

show abstract

“…The open queueing network is used to take account of the interactions between lifts and shuttles. Again, there are approaches that are not validated through simulation, e.g., Heragu et al [11], Wang et al [29], and approaches that are validated through simulation: Marchet et al [23], Ekren et al [8], and Epp et al [9]. The restriction of these approaches is that they evaluate the waiting times between lifts and shuttles.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The system that is investigated in this paper is a tier-captive single-aisle SBS/RS for double-deep storage, as shown in [23] Tier-captive SCC OQN (yes) Single-deep Ekren et al [7] Tier-captive SCC/DCC SIM Single-deep Lerher et al [21] Tier-captive SCC/DCC SIM Single-deep Marchet et al [24] Tier-captive SCC SIM Single-deep Lerher [14] Tier-captive SCC/DCC CTM (no) Single-deep Sari et al [25] Tier-captive SCC/DCC CTM (yes) Single-deep Kartnig et al [12] Tier-captive DCC SQ (yes) Single-deep Trummer et al [27] Tier-captive SCC/DCC SIM Single-deep Lerher et al [18] Tier-captive SCC/DCC CTM (no) Single-deep Lerher et al [20] Tier-captive DCC SIM Single-deep Ekren et al [6] Tier-captive DCC SIM Single-deep Wang et al [29] Tier-captive SCC/DCC OQN (no) Single-deep Lerher [15] Tier-captive SCC/DCC CTM (yes) Double-deep Eder et al [4] Tier-captive SCC/DCC SQLC (yes) Single-deep Eder et al [3] Tier-captive SCC/DCC SQLC (yes) Double-deep Lerher et al [22] Tier-captive SCC/DCC CTM (no) Single-deep Lerher et al [17] Tier-captive SCC/DCC SIM Single-deep Lerher et al [19] Tier-captive SCC/DCC SIM Single-deep Borovinšek et al [1] Tier-captive SCC/DCC CTM (no) Single-deep Ekren et al [8] Tier-captive SCC/DCC OQN (yes) Single-deep Lerher [16] Tier-captive DCC SIM Single-deep Epp et al [9] Tier-captive SCC/DCC OQN(yes) Single-deep Eder et al [5] Tier-captive SCC/DCC SQLC (yes) Single-deep Kriehn et al [13] Tier-captive SCC/DCC SIM Single-deep Ha et al [10] Tier-captive SCC SIM Single-deep Eder [2] Tier -There are different transfer times from and to the shuttle depending on the depth of the rack. -There is no difference in time between the transfer of totes to and from the lifts.…”

Section: System Descriptionmentioning

confidence: 99%

An approach for a performance calculation of shuttle-based storage and retrieval systems with multiple-deep storage

Eder

2020

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This paper presents a method to determine the performance of shuttle-based storage and retrieval systems (SBS/RS) with tier captive single-aisle shuttles and multiple-deep storage. The basis of this calculation method is a continuous-time open queueing system with limited capacity. The cycle times of lifts and shuttles, determined by a spatial value approach, can be directly used in the presented method with their time distributions. To take the multiple storage into account, a probabilitybased approach is applied. The invented approach is validated by a comparison with a discrete event simulation. A European material handling provider had given the data used in this comparison. Finally, an example is presented to outline how this calculation model can be used for designing SBS/RS which fulfil the predefined requirements. The result of this example is that with an increase of the storage depth to a certain value, the throughput increases and the cost decreases up to the same storage depth. Keywords Automated warehouse • Shuttle-based storage and retrieval system • Multiple-deep storage • Analytical and numerical modeling • Performance analysis (2020) 107:859-873

show abstract

“…As shown in Figure 1, this new application inherits the merits of the AS/RS, and improves space utilization and storage capacity, as well as flexibility. AS/SC warehousing systems represent an improvement of AS/RS in terms of batch production and order processing, whereby shuttles can move between lanes via the stacker crane [8,9]. AS/SC warehousing systems have a stacker crane in each aisle and several shuttles.…”

Section: Introductionmentioning

confidence: 99%

Modeling of Parallel Movement for Deep-Lane Unit Load Autonomous Shuttle and Stacker Crane Warehousing Systems

et al. 2020

Self Cite

View full text Add to dashboard Cite

The autonomous shuttle and stacker crane (AC/SC) warehousing system, as a new automated deep-lane unit load storage/retrieval system, has been becoming more popular, especially for batch order fulfilment because of its high flexibility, low operational cost and improved storage capacity. This system consists of a shuttle sub-system that controls motion along the x-axis and a stacker crane sub-system that controls motion along the y-axis and z-axis. The combination of shuttles and a stacker crane performs storage and retrieval tasks. Modelling the parallel motion is an important design tool that can be used to calculate the optimal number of shuttles for a given configuration of the warehousing system. In this study, shuttle movements from one lane to another are inserted into the stock-keeping unit (SKU) task queue, and convert such that they are consistent with the retrieval tasks. The tasks are then grouped according to their starting lane, and converted to an assembly-line parallel job problem by analysing the operating mode with the objectives of minimising the total working time of the stacker crane and the wasted shuttle time. A time sequence mathematical model based on the motion of the shuttles and stacker crane is proposed, and an improved Pareto-optimal elitist non-dominated sorting genetic algorithm is used to solve this multi-objective optimization problem. The model is validated via a simulation study, and via a real-world warehousing case study. We go on to describe guidelines for the layout and configuration of AS/SC warehousing systems, including the optimal number of shuttles and number of x-axis storage cells of lanes, which can improve efficiency and minimise both capital investment and operating costs.

show abstract

Storage assignment optimization in a multi-tier shuttle warehousing system

Cited by 24 publications

References 22 publications

Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times

Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times

An approach for a performance calculation of shuttle-based storage and retrieval systems with multiple-deep storage

Modeling of Parallel Movement for Deep-Lane Unit Load Autonomous Shuttle and Stacker Crane Warehousing Systems

Contact Info

Product

Resources

About