基于网络流的自动化集装箱码头堆场空间分配

摘要

为解决自动化集装箱码头堆场空间分配问题,突出自动化集装箱码头堆场的布局特征以及制定堆存计划时的特点,将堆存计划视为一个具有时间和空间维度的网络优化问题,提出一种基于网络流的自动化集装箱码头堆场空间动态分配的模型,并使用禁忌搜索算法来求解.结果表明,通过该方法可以确保同一时间段内作业的进口箱和出口箱均衡的分配在箱区中,同时满足场桥的“重进重出”.最后对CPLEX和禁忌搜索算法求解的结果进行比较,证明了禁忌搜索算法的优越性.%In order to solve the problem of yard allocation in automated container terminal,considering the layout characteristics of the automatic container terminal yard,the yard planning problem is regarded as a network optimization problem with time and space dimension.Therefore,a model for space allocation in automated container terminal based on network flow is proposed.In addition,we used tabu search algorithm (TS) to solve the problem.The results show that the inlet container and the outlet container in the same period can be evenly distributed in the container yard by this method,and meanwhile it achieves " loaded in and loaded out".Finally,the results of CPLEX and tabu search algorithm are compared to prove the superiority of tabu search algorithm.