By Topic

A novel approach based on a distributed dynamic graph modeling set up over a subdivision process to deal with distributed optimized real time carpooling requests

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sghaier, M. ; LAGIS, Ecole Centrale de Lille, Villeneuve-d''Ascq, France ; Zgaya, H. ; Hammadi, S. ; Tahon, C.

Years ago, researchers started spending efforts in carpooling domain leading to many systems. Those systems are either operating or not and even if some of them succeeded, they still need improvement. As optimization and dynamicity are the most lacking aspects, we are interested in setting up an optimized dynamic carpool service. This problem's high complexity constitutes a big handicap through the way to perform efficient process. Consequently, it is here addressed based on a decentralized parallel requests' process and a distributed architecture is adopted. In this context, we propose a subdivision principle in order to decompose the served network and establish a Distributed Dynamic Graph. The latter models the available information about passengers and drivers and helps to establish a distributed parallel process. In addition, the multi-agent concept has been adopted to set up an automated framework where several communicating entities evolve and perform requests' management.

Published in:

Intelligent Transportation Systems (ITSC), 2011 14th International IEEE Conference on

Date of Conference:

5-7 Oct. 2011