检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:范厚明[1,2] 郭振峰[1] 杨宇[1,2] Fan Houming;Guo Zhenfeng;Yang Yu(School of Transportation Management, Dalian Maritime University, Dalian 116026, China;Institute of Strategy Management and System Planning, Dalian Maritime University, Dalian 116026, China)
机构地区:[1]大连海事大学交通运输管理学院,大连116026 [2]大连海事大学战略管理与系统规划研究所,大连116026
出 处:《系统仿真学报》2017年第12期3051-3060,共10页Journal of System Simulation
基 金:国家自然科学基金(61473053);大连市科学技术计划(2015D12ZC181)
摘 要:基于为缓解码头高峰时段集卡不规律到达导致的拥堵问题所建立的集卡预约机制,研究港外堆场的送箱集卡在多个集装箱码头间的调度问题。在满足码头出口船舶集港要求的同时,以降低外堆场运营成本为原则,将调用的集卡数量最少化为目标函数,建立集卡调度模型。设计改进的蚁群算法求解该模型,确定了每个时间段运抵不同码头的集装箱调度计划。并用算例分析验证了模型和算法的有效性。算例结果表明在合理的调度计划下,可以有效减少集卡资源的投入,提高堆场收益。Based on thetruck appointment system which is used for coping with the serious congestion in the port caused by trucks irregular arrival at peak time, the truck scheduling problem for delivering containers from outside yard to multiple container terminals is studied.Under the premise of meeting the requirements of container arrivals for export vessels, a truck scheduling model is built to reduce the outside yard's operation cost with the objective of minimizing the quantify of the dispatched trucks. A modified ant colony algorithm is designed to solve the model, and the truck scheduling plan for delivering containers to different terminals in different time periods can be determined. Numerical experimentsshow thattheproposedmodeland designed algorithmtake oneffectiveness. The study demonstrates that effectively decreasing the truck inputs and improving the benefits of yard are possible under the rational truck scheduling plan.
分 类 号:U492.22[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.67