基于蚁群算法的泊位调度问题

Berth Scheduling Problem Based on Ant Colony Algorithm

在集装箱港口的运作中,泊位调试系统是制约集装箱港口降低船舶在港时间和运营成本的主要瓶颈之一。泊位调度的目标就是确定集装箱港口船舶的停靠泊位和停泊时间。将码头看成离散泊位的集合,以船舶的在港时间最短为目标,应用蚁群算法对该问题进行优经研究,在满足各种约束条件的基础上,充分的利用好码头资源。利用蚁群算法的正反馈和并行搜索特点提高解的质量2和稳定性,通过对某集装箱码头的案例分析,说明该算法的有效性和实用性。

In the operations of the container ports,the berth scheduling problem is one of the main bottle necks that restrict the container prot to reduce the turn around time of the ships and the operation costs.The objective of thd berth-scheduling problem is to determine the position and berthing time of containership in prots container terminal.A wharf is assumed to be a collection of discrete berthing sections,the objective of berth scheduling is to minimize the total stay time of ships.A wharf resources are utilized and various,restrictions for berthing container vessels are satisfied by using ant colony optimization.Moreover,quality and robustness of solutions are improved by the nature of feedback and parallel paradigm of ACA,Acase applying this approach on a certain container terminal shows the validity and usefulness of the algorithm.