检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵姣[1] 叶然然 ZHAO Jiao;YE Ranran(College of Transportation Engineering,Chang’An University,ShanXi Xi'An,710064,China)
出 处:《工业工程与管理》2020年第6期51-58,共8页Industrial Engineering and Management
基 金:陕西省自然科学基金青年项目(2020JQ-399);中央高校基本科研项目(300102220101)。
摘 要:针对集装箱码头岸吊、集卡和场吊的集成调度问题,考虑岸吊之间不允许发生碰撞以及保证集装箱卸载的优先次序等约束的基础上,建立了混合整数线性规划模型,并设计了带有扰动策略的粒子群优化算法寻找该问题的近优解。针对岸吊、集卡和场吊在不同数量组合下的调度问题进行分析,说明合理设置各种设备数量以及对各种设备进行集成优化调度的必要性。将随机算例中的计算结果与CPLEX软件获得的最优解相比较验证算法的有效性。A mixed-integer linear programming model for the integrated scheduling problem of quay cranes,trucks and yard cranes was formulated,considering the conflicts between the quay cranes and the unloading precedence relationship between containers,as well as the handling feature at container terminals. An improved PSO(Particle Swarm Optimization)algorithm was developed to solve this problem,in which a disturbing strategy was incorporated into the algorithm to improve solution quality. The analysis of the experiments on different combination of the numbers of quay cranes,trucks and yard cranes showedthat the reasonable numbers of quay cranes,trucks and yard cranes and the integrated scheduling of them were necessary.Based on the comparison of the results and the optimal solutions obtained by CPLEX software in the generated instances,the experiments showed that the near optimal solutions can be obtained by the proposed PSO algorithm.
分 类 号:TP2[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7