中文摘要：

以某救灾物资自动化立体仓库为背景,研究了出库过程中的2-RGV调度问题。为避免运行于直线轨道上的两辆穿梭车发生碰撞,将存取系统划分为不重叠的两个区域,并将两个区域内的运送分别分配给两辆穿梭车。建立了基于区域划分的2-RGV调度问题的混合整数线性规划模型,目标是最小化所有物料的总出库时间。提出了一个混合遗传算法求解该问题,并采用包含穿梭车顺序、穿梭车分配及出库站分配的染色体编码方式。算例试验显示提出的模型和算法能够有效求解该问题。

英文摘要：

This paper studies the two rail-guided vehicles（RGV）scheduling problem during the retrieval operations in a disaster relief automated storage and relief system. To avoid collisions between the two RGVs running on the same rail, the storage and retrieval system is divided into two non-overlapping zones,and the RGV moves of the two zones are dispatched to the two RGVs separately. The 2-RGV scheduling problem based on partitioning approach is formulated into a mixed integer linear programming model. The objective is to minimize the total retrieval time for all the items to be retrieved. To solve the problem, a hybrid generic algorithm is proposed and a chromosome representation, which contained the information of the RGV move sequence, the RGV assignments and the output station assignments, is used. Computational experiments indicate that the model is effective and the hybrid generic algorithm performs well on randomly generated problem instances.