QQ客服 官方微博 反馈留言

	Ship Scheduling in Inland Waterway Networks Based on Cellular Automata Graph
	Geng, Xiongfei
	2016
关键词	Graph model waterway network capacity velocity dependent inland river
英文摘要	This paper presents models and algorithms for vessel scheduling based on a graph model of inland waterway networks. In particular, it models the waterway networks by a directed graph, G = (V, E, W), where the node set V represent the harbors and the cross points of the waterways; the arc set E represent the river segments between the cross points and the weight set W represent the shipping capacity of each arc, in terms of how many ships can travel through the given waterway segment in a fixed time interval. The graph model is a simplified model of cellular automata. The difference is that the shipping capacity is modeled not only as a function of the specific conditions of the waterway segment, but also as a function of the volumes and real-time velocities of vessels. So that the capacity model is parameterized. Then, based on the simplified cellular automata model, a scheduling algorithm for minimizing the transportation time of a set of vessels with given routes are proposed, which is evaluated by simulations.; National Key Technology Support Program [2014BAK12B06, 2015BAG20B02]; CPCI-S(ISTP); 450-453
语种	英语
出处	8th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)
DOI标识	10.1109/CyberC.2016.93
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/470206]
专题	软件与微电子学院
推荐引用方式 GB/T 7714	Geng, Xiongfei. Ship Scheduling in Inland Waterway Networks Based on Cellular Automata Graph. 2016-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。