閱讀全文 | |
篇名 |
A Fast Response Multi-Objective Matching Algorithm for Ridesharing
|
---|---|
並列篇名 | A Fast Response Multi-Objective Matching Algorithm for Ridesharing |
作者 | Jiaze Sun、Nan Han、Jianbin Huang、Jiahui Deng、Yang Geng |
英文摘要 | In many metropolitans, especially during rush hours on holidays, thousands of riders will initiate travel orders at the same time, and the existing carpool matching model cannot handle largescale travel orders quickly enough. For handling this problem, a fast and efficient multiobjective carpool matching algorithm (MOCMA) is put forward, which generates a set of different matching schemes suitable for different practical scenarios. First, the idea of partition is adopted to gather riders and drivers with similar journeys, and the relationship matrix construction algorithm (RMCA) is proposed; then from the perspective of riders and drivers, the maximum service quality and the maximum shared mileage are two objectives, and a set of non-dominated solution sets are generated using MOCMA; finally, the simulation experiment results show that MOCMA proposed is suitable for different practical scenarios, the matching success rate is as high as 99.7%, and it has significant advantages over MOEA/D, SPEA2, and FastPGA. |
起訖頁 | 1107-1116 |
關鍵詞 | Ridesharing、Ride-Matching、Multi-objective optimization、Genetic algorithm |
刊名 | 網際網路技術學刊 |
期數 | 202109 (22:5期) |
出版單位 | 台灣學術網路管理委員會 |
DOI |
|
QR Code | |
該期刊 上一篇
| Enhancing Machine Comprehension Using Multi-Knowledge Bases and Offline Answer Span Improving System |
該期刊 下一篇
| Service Process Improvement Based on Business Process Management |