无人驾驶条件下共享停车匹配模型及算法

针对如何减少无人驾驶车辆在泊车过程中不必要的频繁移位和因此增高的事故风险,构建了在满足合理共享停车需求条件下最小化无人车移位成本的共享停车供需匹配优化模型,并利用解的结构特征设计了一种具有针对性的模拟退火求解算法.鉴于无人车灵活变换泊位的特征,将泊车需求与泊位供给在时间上加以分割,从而使得基于分割时段的匹配模型可以反映...

Shared Parking Supply-demand Matching Model and Algorithm with Autonomous Vehicles

In order to reduce the unnecessary translocations and the incurred accident risk during the parking ofautonomous vehicles, this paper formulated a shared parking supply-demand matching optimization model withsatisfying the acceptable parking demand as its constraints and minimizing the cost of translocation of autonomousvehicles as its objective. Based on the structural property of the feasible solution, this paper designed a simulatedannealing algorithm to solve the proposed model. Since autonomous vehicles can change the parking spaces freely, thepaper divided the parking demand and the shared parking supply into small segments to make the model to reflect thefeature of autonomous vehicles. Combining the matching sets with the time segments can form a matching mapcorresponding to a specified feasible solution of the matching model. By making use of the structural feature ofmatching maps, this paper defined the neighborhood of a matching map associated with a given time segment and thenfinished the design of the critical operations of the simulated annealing algorithm. The results show that: (a) the newmethod can realize the shared parking supply-demand matching with autonomous vehicles; (b) the number oftranslocations of autonomous vehicles can decreases to less than 5% of the initial value after optimizing; and (c) ingeneral, the optimal matching map is not unique, which provides other parking requirements with operation possibility.