The University of Southampton
University of Southampton Institutional Repository

Sharing rides with friends: a coalition formation algorithm for ridesharing

Sharing rides with friends: a coalition formation algorithm for ridesharing
Sharing rides with friends: a coalition formation algorithm for ridesharing
We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, arrange one-time rides at short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system modelling such problem as a graph constrained coalition formation (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the applicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to -36.22%). Moreover, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds)
Bistaffa, Filippo
c3867bb6-ac44-472e-bb89-e5ed315cdedd
Farinelli, Alessandro
1d096018-a929-4ff4-9b2a-308458863213
Ramchurn, Sarvapali D.
1d62ae2a-a498-444e-912d-a6082d3aaea3
Bistaffa, Filippo
c3867bb6-ac44-472e-bb89-e5ed315cdedd
Farinelli, Alessandro
1d096018-a929-4ff4-9b2a-308458863213
Ramchurn, Sarvapali D.
1d62ae2a-a498-444e-912d-a6082d3aaea3

Bistaffa, Filippo, Farinelli, Alessandro and Ramchurn, Sarvapali D. (2014) Sharing rides with friends: a coalition formation algorithm for ridesharing. At AAAI Conference on Artificial Intelligence 2015 AAAI Conference on Artificial Intelligence 2015, United States. 25 - 29 Jan 2015. 7 pp. (Submitted)

Record type: Conference or Workshop Item (Paper)

Abstract

We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, arrange one-time rides at short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system modelling such problem as a graph constrained coalition formation (GCCF) problem, where the set of feasible coalitions is restricted by a graph (i.e., the social network). Moreover, we significantly extend the state of the art algorithm for GCCF, i.e., the CFSS algorithm, to solve our GCCF model of the SR problem. Our empirical evaluation uses a real dataset for both spatial (GeoLife) and social data (Twitter), to validate the applicability of our approach in a realistic application scenario. Empirical results show that our approach computes optimal solutions for systems of medium scale (up to 100 agents) providing significant cost reductions (up to -36.22%). Moreover, we can provide approximate solutions for very large systems (i.e., up to 2000 agents) and good quality guarantees (i.e., with an approximation ratio of 1.41 in the worst case) within minutes (i.e., 100 seconds)

PDF
aaai2015.pdf - Author's Original
Download (304kB)

More information

Submitted date: November 2014
Venue - Dates: AAAI Conference on Artificial Intelligence 2015, United States, 2015-01-25 - 2015-01-29
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 372048
URI: https://eprints.soton.ac.uk/id/eprint/372048
PURE UUID: f2b0fba8-a35e-4dcf-bf57-d8bacd43e741
ORCID for Sarvapali D. Ramchurn: ORCID iD orcid.org/0000-0001-9686-4302

Catalogue record

Date deposited: 24 Nov 2014 14:11
Last modified: 06 Jun 2018 12:42

Export record

Contributors

Author: Filippo Bistaffa
Author: Alessandro Farinelli
Author: Sarvapali D. Ramchurn ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×