A permutation-combination heuristics for crane-based automated storage and retrieval systems considering order fulfillment time and energy consumption

Abstract

An automated storage and retrieval system (AS/RS) is a key component of enterprise logistics. Its performance metrics include, e.g., order fulfillment time and energy consumption. A crane-based automated storage and retrieval system (CB-AS/RS) is used as the study subject in this paper to build a location allocation model with the goal of minimizing order fulfillment time and minimizing energy consumption. The two-objective problem is transformed into a single-objective problem by the weight method. A genetic algorithm (GA) is used to optimize and simulate the model using spatial mapping coding. A permutation-combination heuristics (PCH) is proposed that follows the coding method and cross-operation of the GA and conducts both arrange-operation and change-operation. During the simulation, the influence of different storage utilization rates and different output and input instruction quantities in a batch of orders on the results is considered. Experimental results show that the results of the PCH algorithm are better than the GA and the optimization results are more stable. In this paper, we provide an optimization idea for the CB-AS/RS researchers and managers.

Keywords

• crane-based automated storage and retrieval system
• genetic algorithm
• permutation-combination heuristics
• order fulfillment time
• energy consumption
• location allocation