Multi-Hop Carpooling

SCHEME: PATHFINDER

CALL: 2018

DOMAIN: IS - Information and Communication Technologies

FIRST NAME: Emile

LAST NAME: Simon

INDUSTRY PARTNERSHIP / PPP: No

INDUSTRY / PPP PARTNER:

HOST INSTITUTION: LIST

KEYWORDS: Multi-Hop, Carpooling, Routing, Optimization, Data processing

START: 2014-02-15

END: 2014-12-14

WEBSITE: https://www.list.lu

Submitted Abstract

The project MytHiC, Multi-Hop Carpooling, aims at improving the quality and quantity of offers of carpooling rides, so as to increase the usage of carpooling in general. Fostering carpooling is well known to significantly decrease traffic congestion and environmental impact, thanks to a higher car occupancy.The curent state-of-the-art limitation we seek to adress is that today’s carpooling platforms/services only provide offers of single-hop rides, or multi-modal rides with other means of transportation. This results in unnecessarily low number of alternative solutions (often none) for a travel request from a specific point to another. The user would then consider using other means of transportation (like personal car) instead of carpooling. This resulting in a very low person per car average overall.The solution we propose is to identify and create so-called optimized ‘multi-hop’ carpooling rides, where the passenger uses several successive carpooling trips to reach his/her destination from his/her departure point. Using multi-hop rides dramatically increase the number of available destinations (quality) and number of possible rides (quantity), which in turn will result in an uptake in carpooling usage (this addressing objectives 1 and 2 of the Modu 2.0 framework).The literature about identifying and/or designing Multi-Hop Carpooling rides is virtually non-existent. We have submitted a patent with our original solution in this area. A fortiori, this solution is not yet proposed by current carpooling solutions providers and platforms. Today’s large computational capabilities make our solution applicable and profitable.

This site uses cookies. By continuing to use this site, you agree to the use of cookies for analytics purposes. Find out more in our Privacy Statement