| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 108588 | Journal of Transportation Systems Engineering and Information Technology | 2011 | 7 Pages |
The quay crane dynamic scheduling problem based on berth schedules in container terminal involves the allocation of limited quay crane resources and the scheduling of loading and unloading tasks on each ship, with its berth time and location known, in order to reduce the total time of all the ships arriving at the terminal in the planning horizon. Under the real constraints of non-crossing of quay cranes and the sequence requires among tasks, the non-linear mathematical planning model is set up. A genetic algorithm is proposed according to the characteristics of the problem, and the chromosome representation is structured on the sequence of tasks. The model and the algorithm are proved effectiveness via the comparisons of scheduling results with results with literature on a single ship, the comparisons of scheduling results between multi-ships and single ship, and the simulation of quay crane dynamic scheduling among multi-ships.
摘要所谓基于泊位计划的集装箱码头岸桥动态调度问题，是指在计划周期内，在每艘船舶均已安排了靠泊时间和靠泊位置的前提下，将有限的岸桥资源在船舶上的装卸任务间进行动态分配与排序，以最大限度地减少计划期内所有船舶的滞港时间. 在充分考虑岸桥不能交叉作业、装卸任务有作业顺序要求等现实约束下，对此问题构建了非线性数学规划模型，基于问题自身的特点设计了基于任务排序的染色体结构，用遗传算法进行求解. 通过与文献中单船的调度结果的对比、单船岸桥调度与多船动态岸桥调度结果的对比，以及多船动态岸桥调度的仿真实验，证明了模型及算法的有效性.
