摘要
为提高铁路集装箱中心站的运作效率,研究了带有干涉约束和安全约束的轨道式门式起重机的调度问题,以最小化最大装卸作业时间为目标构建了一个混合整数规划模型。由于该模型求解难度大,为此提出了一种萤火虫优化算法(FA),使用小规模和大规模随机算例对算法进行测试。测试结果表明:无论是求解小规模问题还是大规模问题,FA算法都比CPLEX和GA算法具有较快的寻优速度和较高的寻优精度。
To improve the operation efficiency of railway container terminals,the rail-mounted gantry cranes scheduling problem（RMGCSP） is studied with consideration of interference and safety distance between these cranes.In order to minimize makespan of the train loading/ discharging operation,a mixed integer programming model for the considered RMGCSP is formulated.In the view of the solving difficulty,a firefly algorithm（FA） is proposed.The effectiveness of the FA is evaluated on some random instances both small scale and large scale.Experimental results show that the FA algorithm can search for global optimization more quickly and precisely than CPLEX and GA.
出处
《西华大学学报（自然科学版）》
CAS
2013年第4期77-82,共6页
Journal of Xihua University:Natural Science Edition
基金
四川省教育厅项目(12ZB322)
西华大学制造与自动化省高校重点实验室开放研究基金资助项目(szjj2012-023)
关键词
铁路集装箱中心站
轨道吊调度
干涉约束
安全约束
萤火虫优化
railway container terminal
gantry crane scheduling
interference constraint
safety constraint
glowworm swarm optimization
