多行车同轨运行的作业避碰及调度优化

Collision avoidance and scheduling optimization of multiple cranes on a common track

多台行车在同一轨道上运行时,不可避免会存在冲突,需优化吊运任务的行车分配方案,减少各行车之间的避让次数。综合行车运行方向和任务优先级序列,提出基于优先级传递的作业避碰策略,实现多行车之间的有效避碰;通过仿真时间钟的推进,模拟行车运行,生成调度可行解。通过遗传算法,优化吊运任务的行车分配与优先级序列,同时实现任务完成数量的最大化和行车被动运输总距离的最小化,从而达到优化行车运行调度的目的。实例验证了所提出方法的可行性和合理性。

More than one cranes run on a common track and unexpected conflicts between adjacent cranes may happen clue to the spatialconstraint. Therefore, the allocation of the lifting tasks should be optimized so as to reduce the number of the conflict. For a- voiding collision among cranes, a scheme is proposed via the combination of the driving direction, task priority sequence and the dissemination of the task priority. Then, with the introduction of the simulation clock, the operation of all cranes is imitated and a feasible solution is generated. Finally, the genetic algorithm is hired to allocate all lifting tasks to cranes and optimize tasks＇ priority with two objectives being achieved concurrently ,the maximization of the number of the completed tasks and the minimization of the total passive transport distance. In this way, the schedule of all cranes can be produced and optimized. The experimental resuits prove the feasibility and effectiveness of the proposed methodology.