Skip to Main Content
The increasing number of cars is an important issue for big cities administrations and several problems are related to this phenomenon, such as air pollution, traffic jams, drivers stress and so on. A potential solution for this problem is the use of car polling systems, which support the process of car sharing among users. However, current systems only work as a channel where providers and consumers can arrange shared cars for public transport. This work extends this idea via the use of DARP (Dial-a-Ride Problem) and metaheuristic concepts so that the allocation of rides can be carried out in an autonomous and dynamic way. The main aim of this approach is to optimize and facilitate the sharing process of personal cars, so that the number of vehicles in the roads can be reduced together with all the problems that such vehicles raise on.