The Proposal of a Distributed Algorithm for Solving the Multiple Constraints Parking Problem

The parking problem in big cities has become one of the key causes of the city traffic congestion, driver frustration and air pollution. So to avoid these problems, parking monitoring is an important solution. Recently many new technologies have been developed that allows vehicle drivers to effectively find the free parking places in the city but these systems still limited because they don 't take into consideration road networks constraints. In this paper, We design a distributed system that will help drivers to find the optimal route between their positions and an indoor parking in the city taking into consideration a set of constraints such as (distance, traffic, amount of fuel in the car, available places in te parking, and parking cost). We propose a distributed technique based on multi objective Ant Colony Optimisation (ACO). The proposed method aim to manage multi objective parking problem in real time using the behavior of real ants and multi agent systems to decrease the traffic flow and to find the optimal route for drivers.