Skip to main navigation Skip to search Skip to main content

A Two-Sided Stable Matching Method in Ridesharing

  • Jingwei Lv
  • , Jiannan Hao
  • , Shuzhen Yao
  • , Huobin Tan*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Many researchers have studied optimization methods for ridesharing. However, the individual interests of passengers and drivers are not considered enough. So we propose a two-sided stable matching method according to the actual preferences of passengers(requesters) and drivers(workers). We also design a pruning algorithm based on Euclidean distance to speed up the matching process. Experiments based on real data show that our method can perform well.

Original languageEnglish
Title of host publicationProceedings of 2022 8th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2022
EditorsFuji Ren, Witold Pedrycz, Zhiquan Luo, Dan Yang, Tianrui Li, Mengqi Zhou, Weining Wang, Aijing Li, Dandan Dandan, Liu Yaru Zou, Yanna Liu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages671-675
Number of pages5
ISBN (Electronic)9781665477352
DOIs
StatePublished - 2022
Event8th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2022 - Chengdu, China
Duration: 26 Nov 202228 Nov 2022

Publication series

NameProceedings of 2022 8th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2022

Conference

Conference8th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2022
Country/TerritoryChina
CityChengdu
Period26/11/2228/11/22

Keywords

  • Dynamic Ridesharing
  • Pruning
  • Single-worker multiple-requesters
  • Stable Matching

Fingerprint

Dive into the research topics of 'A Two-Sided Stable Matching Method in Ridesharing'. Together they form a unique fingerprint.

Cite this