Peer-to-Peer Shared Ride Systems

Authors:
Yun Hui Wu;Lin Jie Guan;Stephan Winter
Affiliations:
Department of Geomatics, The University of Melbourne, Victoria, Australia 3010;Department of Geomatics, The University of Melbourne, Victoria, Australia 3010;Department of Geomatics, The University of Melbourne, Victoria, Australia 3010
Venue:
GeoSensor Networks
Year:
2008

Citing 4
Cited 1

Lifelong planning A*

Artificial Intelligence
Experiences creating three implementations of the repast agent modeling toolkit

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Towards lightweight information dissemination in inter-vehicular networks

Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Resource discovery using spatio-temporal information in mobile ad-hoc networks

W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems

Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes

GIScience '08 Proceedings of the 5th international conference on Geographic Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shared ride systems match the travel demand of transport clients with the supply by vehicles, or hosts, such that the clients find rides to their destinations. A peer-to-peer shared ride system allows clients to find rides in an ad-hoc manner, by negotiating directly with nearby hosts via radio-based communication. Such a peer-to-peer shared ride system has to deal with various types of hosts, such as private cars and mass transit vehicles. Their different behaviors affect the negotiation process, and consequently the travel choices. In this paper, we present and discuss a model of a peer-to-peer shared ride system with different types of agents. The behavior of the model is investigated in a simulation of different communication and way-finding strategies. We demonstrate that different types of agents enrich the choices of the clients, and lead to local solutions that are nearly optimal.