摘要
针对国内多数集装箱堆场采用先到先服务的服务规则造成起重机迂回行驶现象严重的情况,提出运用Dijkstra算法和最短路径法的综合方法安排起重机作业。介绍了Dijkstra算法,建立了堆场起重机行驶成本模型,针对实际操作中的动态现象运用启发式算法中最短路径法来安排起重机服务堆列,通过一个案例来说明该综合方法的使用,并通过仿真对该综合方法和先到先服务的方法进行比较,得到较优的方法,使起重机的行驶成本下降。
In view of the situation that FCFS (first come, first served) rule is used in most domestic container yards, this paper analyses this method and points out that it often gets crane detour and increases the cost. First it introducos how to arrange the crane operation by the nearest route between two yards by the means of Dijkstra Arithmetic and to build the cost model of crane operation in container yard. According to the actual dynamic situation, then it shows how to arrange the stacking by means of Dijkstra Arithmetic and nearest - neighbor heuristic (NNH). Finally, a specific crane is given to illustrate how to use the method, and through emulating the method and FCFS, and comparing them, the optimal one is found out to minimize the cost.
出处
《起重运输机械》
北大核心
2006年第6期46-49,共4页
Hoisting and Conveying Machinery