关键词: 城市交通, 停车位资源优化利用, 停车泊位共享, 图着色, 蚁群算法

Abstract:

In order to solve the parking problems in major cities, an innovative method based on shared parking theory is proposed which aims at making the fullest use of the private-owned and non-public parking slots to satisfy the increasing parking demand. Since the time available for parking is often consists of discrete fragments, exerting rigid time restraints for parking, efficient utilization of those parking slots resources is hard to achieve in practice. An optimization method, focused on higher parking slots occupancy rate, is designed to match the available time intervals parking slots supply and the parking demand from drivers, thus realizing the efficient utilization of the shared parking slots. First, a model and formulation based on weighted vertex coloring problem with restrictions on colors is given which aims at making the fullest use of the parking slots; then a modified ACO (Ant Colony Optimization) algorithm is provided so as to solve the NP-C problem by specifying the strategies for route choosing and pheromone updating; finally experiments are conducted based on the features of the parking slots supply which make a comparison between the modified ACO algorithm and the FCFS (First Come First Serve) algorithm. The results of the experiments show the performance, characterized by the total amount of time allocated to the drivers, of modified ACO is 11.82% higher than the FCFS algorithm.

Key words: urban traffic, optimization of parking slots resources utilization, shared parking, graph coloring, ACO