Based-Agent Distributed Architecture to Manage the Dynamic Multi-hop Ridesharing System

A diverse range of architectures and concepts has been suggested by academic researchers within the theme of ridesharing. Most of these studies have tried to join together two main elements: the need for mobility and the resources used to achieve this action. Based on empty seats in the private cars, rideshare systems allow a substantial number of people to share car rides. If a request can be matched with only one offer, then the problem is called single hop ride matching. It is called multihop ride matching, if a request can be matched with several offers at different times. In this paper, we focus on the Multi-Hop Ride matching Problem (MHRP) which offers more flexible than other forms of ridesharing and proposes more choices for the rider. As a transportation service, the MHRP is generally geographically distributed in dynamic changing environments. With this in mind, and aiming at setting up a distributed architecture through which an optimizing decentralized process should be performed, we propose a distributed software architecture based on communicating agents with different behaviors. The reason for the growing success of agents behaviors technology especially in performing complex tasks and operating with each other to achieve a desired global goal.