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

Abstract

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 singlehop ridematching. It is called multihop ridematching, if a request can be matched with severel offers at different times. In this paper, we focus on the Multi-Hop Ridematching Problem ( ) which offers more flexible than other forms of ridesharing and proposes more choices for the rider. As a transportation service, the 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.

Dynamic Timeframe and Anticipation-Based Migration: A Real-Time Framework for Ride-Sharing

“…Alternatively, Jung, Jayakrishnan and Park (2016) [11] used a hybrid simulated annealing algorithm for the dynamic allocation of ride sharing requests. Cheikh, Hammadi and Tahon (2014) [12] introduced a model where a rider can be matched with several drivers at different times. Ma and Wolfson (2013) [13] developed a model that considers walking distance before and after ridesharing.…”

Decentralised game‐theoretic management for a community‐based transportation system

“…The authors in [12] proposed the creation of distributed software based on the concept of decentralisation upon which this study is based. This proposal focuses on cases in which the passenger receives several offers from drivers, a process which is termed multi‐hop ride‐matching.…”