Optimal Matching Problem for Ride-Sharing Considering Users’ Schedule Rearrangement

This paper proposed an optimal matching problem between drivers and riders for ride-sharing. The model assumes that all Space-time Extended Network (STEN) links have measurable utility based on the activity desired by each user. The ride-sharing service is designed to maximise the social utility of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of ITS research 2020-09, Vol.18 (3), p.391-399
1. Verfasser: Shimamoto, Hiroshi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!