拼车中的双边稳定匹配方法

2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS) Pub Date : 2022-11-26 DOI:10.1109/ccis57298.2022.10016360

Jingwei Lv, Jiannan Hao, Shuzhen Yao, Huobin Tan

{"title":"拼车中的双边稳定匹配方法","authors":"Jingwei Lv, Jiannan Hao, Shuzhen Yao, Huobin Tan","doi":"10.1109/ccis57298.2022.10016360","DOIUrl":null,"url":null,"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.","PeriodicalId":374660,"journal":{"name":"2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Two-Sided Stable Matching Method in Ridesharing\",\"authors\":\"Jingwei Lv, Jiannan Hao, Shuzhen Yao, Huobin Tan\",\"doi\":\"10.1109/ccis57298.2022.10016360\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":374660,\"journal\":{\"name\":\"2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ccis57298.2022.10016360\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ccis57298.2022.10016360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

许多研究者对拼车的优化方法进行了研究。然而，乘客和司机的个人利益没有得到足够的考虑。因此，我们根据乘客(请求者)和司机(工人)的实际偏好，提出了一种双边稳定匹配方法。设计了基于欧氏距离的剪枝算法，加快了匹配过程。基于实际数据的实验表明，该方法具有良好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Two-Sided Stable Matching Method in Ridesharing

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2022 IEEE 8th International Conference on Cloud Computing and Intelligent Systems (CCIS)

自引率

0.00%

发文量