检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李尤丰[1] 李勤丰[2,3] 刘玉霞[4] 周晓峰[3]
机构地区:[1]金陵科技学院信息技术学院,江苏南京211169 [2]金陵科技学院公共基础课部,江苏南京211169 [3]河海大学计算机与信息学院,江苏南京211100 [4]解放军国际关系学院基础部,江苏南京210039
出 处:《南京师大学报(自然科学版)》2014年第1期104-111,共8页Journal of Nanjing Normal University(Natural Science Edition)
基 金:江苏省现代教育技术研究课题(2011-R-19470)
摘 要:港口物流环节中,集卡的调度直接影响着港口的工作效率.目前,对集卡装和卸同时进行的调度模型和算法鲜有研究.本文以一艘船待装集装箱、一艘船待卸集装箱、装卸同时进行为例,提出一种动态优化模型,并用遗传算法求解.但其不同于一般的遗传算法,这里创造性地引入N6邻域方法来减少解空间搜索范围,提高遗传算法效率;设计了多种交叉操作和变异操作,来增加解的多样性,避免算法陷入早熟;设计了变异概率P,保证了算法的收敛性.实验结果验证了该模型和算法的有效性,从而有效提高集卡运输效率.The truck dispatching is an important way to improve the efficiency of port logistics. In order to meet the re-quirements of rapid loading or unloading containers,loading and unloading of container truck scheduling simultaneously emerged. However,the problem is seldom considered. Here, in case two boats, an improved model about loading and unloading of trucks at the same time was given. And based on it,a new GA was presented. In order to reduce the time during seeking the best solution, the method of N6 neighborhood was proposed to improve the efficiency of GA. To increase the diversity and avoid the premature convergence,a combination of several crossover and mutation operations was introduced. The convergence was assured by the mutation probability P. The experimental results show the correctness and effectiveness of the hybrid genetic algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.16.10.2