上海交通大学学报(自然版) ›› 2012, Vol. 46 ›› Issue (09): 1431-1435.
胡大勇, 姚振强
收稿日期:2011-10-24
出版日期:2012-09-28
发布日期:2012-09-28
基金资助:国家自然科学基金资助项目(51121063),国家科技支撑计划资助项目(2006
HU Da-Yong, YAO Zhen-Qiang
Received:2011-10-24
Online:2012-09-28
Published:2012-09-28
摘要: 基于对卸船机调度特征的描述,建立了以最小化卸载作业完成时间为目标的卸船机调度优化模型,设计了混合遗传算法组件以获得问题近似最优解,通过松弛原问题中的难约束,推导了松弛问题的下界并作为原问题的下界.同时,对具有不同规模的问题进行实例计算与分析.结果表明,所设计的混合遗传算法能够在可接受的计算时间内获得合理的解.
中图分类号:
胡大勇, 姚振强. 轨道路径约束的散货卸船机调度优化策略 [J]. 上海交通大学学报(自然版), 2012, 46(09): 1431-1435.
HU Da-Yong, YAO Zhen-Qiang. Optimization Strategy for Bulk Ship Unloader Scheduling with Rail Routing Constraints[J]. Journal of Shanghai Jiaotong University, 2012, 46(09): 1431-1435.
| [1]Zhu Y, Lim A. Crane scheduling with noncrossing constraint [J]. Journal of the Operational Research Society, 2006, 57(12): 14641471.[2]Lee D H, Wang H Q, Miao L X. Quay crane scheduling with noninterference constraints in port container terminals [J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(1): 124135.[3]Bierwirth C, Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals [J]. European Journal of Operational Research, 2010, 202(3): 615627.[4]Moccia L, Cordeau J F, Gaudioso M, et al. A branchandcut algorithm for the quay crane scheduling problem in a container terminal [J]. Naval Research Logistics, 2006, 53(1): 4559.[5]Sammarra M, Cordeau J F, Laporte G, et al. A tabu search heuristic for the quay crane scheduling problem [J]. Journal of Scheduling, 2007, 10(45): 327336.[6]Ng W C, Mak K L. Quay crane scheduling in container terminals [J]. Engineering Optimization, 2006, 38 (6): 723737.[7]Bierwirth C, Meisel F. A fast heuristic for quay crane scheduling with interference constraints [J]. Journal of Scheduling, 2009, 12(4): 345360.[8]Yalaoui F, Chu C. An efficient heuristic approach for parallel machine scheduling with job splitting and sequencedependent setup times [J]. IIE Transactions, 2003, 35(2): 183190.[9]胡大勇, 姚振强. 调整时间与顺序相关的等同并行机调度[J]. 机械工程学报, 2011, 47(16): 160165.HU Dayong, YAO Zhenqiang. Identical parallel machines scheduling with sequencedependent setup times [J]. Chinese Journal of Mechanical Engineering, 2011, 47(16): 160165.[10]Anghinolfi D, Paolucci M. Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach [J]. Computers and Operations Research, 2007, 34(11): 34713490. |
| [1] | 张荣夫, 王金强, 刘敏霞. 基于资源最优化的复杂系统模块化设计优化方法[J]. 空天防御, 2025, 8(3): 86-94. |
| [2] | 范厚明,徐振林,李阳,刘文琪,耿静. 混合遗传算法求解多中心联合配送路径问题[J]. 上海交通大学学报, 2019, 53(8): 1000-1009. |
| [3] | 袁群, 左奕. 基于改进混合遗传算法的冷链物流配送中心选址优化[J]. 上海交通大学学报, 2016, 50(11): 1795-1800. |
| [4] | 刘天堂, 江志斌, 胡鸿韬, 刘冉. 加强的混合遗传算法求解能力约束弧路径问题[J]. 上海交通大学学报(自然版), 2013, 47(04): 619-625. |
| 阅读次数 | ||||||
|
全文 |
|
|||||
|
摘要 |
|
|||||