针对自动化立体仓储的订单批量处理过程中的优化调度问题,采用离散型帝国竞争算法对订单调度流程进行求解,构建出库订单优先调度和复合订单调度两种对比流程来进行优劣势的探讨以及算法比较.调度实例求解结果表明,所提出算法的优化质量更高,且在处理大批量复合订单时更具有优越性,从而验证了所提出算法的有效性和优越性. Aiming at the problem of optimal scheduling in order processing of automated three-dimensional warehouses, the Discrete Empire Competition Algorithm was used to solve the order scheduling process, and two comparison processes of order priority order and composite order schedule were constructed to discuss the advantages and disadvantages and the algorithm The results of the scheduling example show that the proposed algorithm has better optimization quality and superiority when dealing with high-volume composite orders, which verifies the effectiveness and superiority of the proposed algorithm.