期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
基于剩余时间的公共自行车动态调度模型
1
作者 章文韬 胡赟爽 +1 位作者 黄振清 赵岳清 《台州学院学报》 2018年第6期7-11,22,共6页
公共自行车租赁系统是城市交通一个重要的环节。文章就这一问题进行研究,建立基于剩余时间的车辆动态调度预测模型,利用租赁点的自调控性,使其在达到空桩或满桩状态前这段剩余时间进行车辆调度,以满足用户的借还车需求。该模型相比于目... 公共自行车租赁系统是城市交通一个重要的环节。文章就这一问题进行研究,建立基于剩余时间的车辆动态调度预测模型,利用租赁点的自调控性,使其在达到空桩或满桩状态前这段剩余时间进行车辆调度,以满足用户的借还车需求。该模型相比于目前最常用的基于车桩比的车辆动态调度模型有着一定的优越性。以临海市部分租赁点为对象,对上述两个模型进行比较,发现这两个模型都具有较高的可靠性,但基于剩余时间的车辆动态调度模型可以减少调度总量和次数。 展开更多
关键词 车辆调度 车桩比 剩余时间 调度数量
下载PDF
基于图论的AGV数量配置与调度优化方法
2
作者 诸葛沁沁 许钢焱 周耀明 《工业工程与管理》 CSCD 北大核心 2024年第2期217-226,共10页
为了提高无人仓库的自动引导车(automated guided vehicle,AGV)系统运行效率,研究了大规模场景下无人仓库的AGV数量配置与调度问题。以最小化AGV数量和AGV总运输成本为目标,抽象出任务之间的时空约束来构建AGV共享网络,将数量配置与调... 为了提高无人仓库的自动引导车(automated guided vehicle,AGV)系统运行效率,研究了大规模场景下无人仓库的AGV数量配置与调度问题。以最小化AGV数量和AGV总运输成本为目标,抽象出任务之间的时空约束来构建AGV共享网络,将数量配置与调度优化问题转化成图论当中的加权最小路径覆盖问题。计算结果表明:对比直接求解数学规划模型,图论方法在大规模场景下求解高效稳定,能够在满足任务时间要求的情况下,用更少的AGV数量以及对应运输成本最小的调度方案完成任务;针对300个任务规模的数量配置与调度问题,图论方法能够在4 s内完成求解,与数学规划模型的求解速度差距达到3个数量级,AGV数量减少10.3%。 展开更多
关键词 仓储物流 AGV数量配置与调度 时空网络 加权最小路径覆盖
原文传递
A Dynamic Load Balancing Method of Cloud-Center Based on SDN 被引量:6
3
作者 WANG Yong TAO Xiaoling +1 位作者 HE Qian KUANG Yuwen 《China Communications》 SCIE CSCD 2016年第2期130-137,共8页
In order to balancing based on data achieve dynamic load flow level, in this paper, we apply SDN technology to the cloud data center, and propose a dynamic load balancing method of cloud center based on SDN. The appro... In order to balancing based on data achieve dynamic load flow level, in this paper, we apply SDN technology to the cloud data center, and propose a dynamic load balancing method of cloud center based on SDN. The approach of using the SDN technology in the current task scheduling flexibility, accomplish real-time monitoring of the service node flow and load condition by the OpenFlow protocol. When the load of system is imbalanced, the controller can allocate globally network resources. What's more, by using dynamic correction, the load of the system is not obvious tilt in the long run. The results of simulation show that this approach can realize and ensure that the load will not tilt over a long period of time, and improve the system throughput. 展开更多
关键词 SDN cloud computing data center dynamic load balancing
下载PDF
A routing algorithm for industrial wireless network based on ISA100.11a
4
作者 王平 Yang Lihua +2 位作者 Wang Heng Wu Guanchen Dai Qingchao 《High Technology Letters》 EI CAS 2015年第1期46-53,共8页
ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.... ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.According to timeslot,superframe,links,channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm,the algorithm selects the link quality,timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm.Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay,but also meet the requirements of the deterministic scheduling.The algorithm can effectively solve the problem of packet loss and transmission delay during data transmission,and provide a valuable solution for efficient data transmission based on determinacy. 展开更多
关键词 industrial wireless network ISA100.11 a k shortest paths algorithm transmission delay link quality superframe
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部