共享车位服务网络动态停放调度算法与仿真研究  

Research of the Algorithm & Simulation in Dynamic Dispatching between Urban Cars &Sharing Parking Spaces

作　　者：闵慧[1] 

机构地区：[1]湖南信息职业技术学院计算机工程系,湖南长沙410200

出　　处：《软件导刊》2017年第9期90-94,共5页Software Guide

摘　　要：城市停车难问题越来越严重。将可共享停车位资源合理调度,有利用缓解城市交通问题。研究了一种优化调度算法,以提升共享车位动态调度效率,缩短车辆与车位匹配停放后的周转作业时间,使车位空闲间隔时间更小。以每个停车请求的目的地区域中心点作为标记点,将周边可用于服务的车位网点建立停车服务网络,并据此建立多车位网点停放调度服务模型。基于102组实例数据,运用系统仿真技术,将模型优化运算出的调度方案与不经过模型优化的调度方案进行对比分析,验证了模型的可靠性和适配性。Parking problems for the city has become very difficult to solve, and how to use the sharing parking resource of the city reasonably seems significant. In this paper, an optimal scheduling algorithm was proposed to improve the overall efficiency of the dynamic scheduling for parking in a macro level. The algorithm can reduce the overall job turnaround time that vehicle will take to go to the match parking spaces greatly, it also can small the idle interval of the parking spaces, at the same time, make the using of parking spaces more rational and effective. In this paper, the center of each parking request destination area was the mark point which can be used by the parking spaces surrounding to establish a parking service network, and accordingly the es- tablishment of multi-parking spaces outlets of scheduling service model. Finally, based on 102 kinds of instance data, the use of system simulation model to optimize the operation of the scheme and scheduling model without optimization of stochastic simula- tion scheduling scheme sets out a comparative analysis, in order to verify the reliability and suitability of model.

关 键 词：共享车位 动态调度 停车服务网络 周转作业 系统仿真 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]