A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles

The Internet of Vehicles (IoV) is the extension of the Internet of Things (IoT) technology in the field of transportation systems. Ride-sharing is one of intelligent travel applications in IoV. Ride-sharing is aimed at taking passengers with similar itineraries and time arrangements to travel in the...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Xiaohui Li, Hongbin Dong, Shuang Han, Xiaowei Wang, Xiaodong Yu
Formato: article
Lenguaje:EN
Publicado: Hindawi-Wiley 2021
Materias:
T
Acceso en línea:https://doaj.org/article/03691792f5c546e99bc2bbf8d8e377fc
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:03691792f5c546e99bc2bbf8d8e377fc
record_format dspace
spelling oai:doaj.org-article:03691792f5c546e99bc2bbf8d8e377fc2021-11-22T01:10:24ZA Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles1530-867710.1155/2021/2438972https://doaj.org/article/03691792f5c546e99bc2bbf8d8e377fc2021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/2438972https://doaj.org/toc/1530-8677The Internet of Vehicles (IoV) is the extension of the Internet of Things (IoT) technology in the field of transportation systems. Ride-sharing is one of intelligent travel applications in IoV. Ride-sharing is aimed at taking passengers with similar itineraries and time arrangements to travel in the same car according to a certain matching rule. To effectively integrate transport capacity resources and reduce the number of cars on the road, ride-sharing has become a popular and economical way of travel. The matching and optimizing of drivers and passengers are the core contents of a ride-sharing application system. This paper mainly studies the dynamic real-time matching of passengers and drivers in IoV, considering the main factors such as travel cost, car capacity, and utility. The matching problem is formulated in a ride-sharing system as a Role-Based Collaboration (RBC). A new utility method for the matching optimization of ride-sharing is present. In this paper, we establish a model for simulating the assignment of ride-sharing with the help of the Environments-Classes, Agents, Roles, Groups, and Objects (E-CARGO) model. The objective function and formal definitions are proposed. The utility and time of optimal matching are obtained by using the Kuhn-Munkres algorithm on the revenue matrix. The experimental results show that the proposed formal method based on the E-CARGO model and utility theory can be applied in the ride-sharing problem. Numerical experiments show that the matching time cost increases with the increase of the number of drivers and passengers participating in the ride-sharing system. When the number of drivers and passengers is different, one-to-many matching takes the least time, and one-to-one matching takes more time. When the number of drivers and passengers is the same, the time cost of one-to-one matching increases sharply with a certain value (bigger than 800). Compared with other matching methods, the time spent by the one-to-many method is reduced by 30%. The results show that the proposed solution can be applied to the matching and pricing in a ride-sharing system.Xiaohui LiHongbin DongShuang HanXiaowei WangXiaodong YuHindawi-WileyarticleTechnologyTTelecommunicationTK5101-6720ENWireless Communications and Mobile Computing, Vol 2021 (2021)
institution DOAJ
collection DOAJ
language EN
topic Technology
T
Telecommunication
TK5101-6720
spellingShingle Technology
T
Telecommunication
TK5101-6720
Xiaohui Li
Hongbin Dong
Shuang Han
Xiaowei Wang
Xiaodong Yu
A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles
description The Internet of Vehicles (IoV) is the extension of the Internet of Things (IoT) technology in the field of transportation systems. Ride-sharing is one of intelligent travel applications in IoV. Ride-sharing is aimed at taking passengers with similar itineraries and time arrangements to travel in the same car according to a certain matching rule. To effectively integrate transport capacity resources and reduce the number of cars on the road, ride-sharing has become a popular and economical way of travel. The matching and optimizing of drivers and passengers are the core contents of a ride-sharing application system. This paper mainly studies the dynamic real-time matching of passengers and drivers in IoV, considering the main factors such as travel cost, car capacity, and utility. The matching problem is formulated in a ride-sharing system as a Role-Based Collaboration (RBC). A new utility method for the matching optimization of ride-sharing is present. In this paper, we establish a model for simulating the assignment of ride-sharing with the help of the Environments-Classes, Agents, Roles, Groups, and Objects (E-CARGO) model. The objective function and formal definitions are proposed. The utility and time of optimal matching are obtained by using the Kuhn-Munkres algorithm on the revenue matrix. The experimental results show that the proposed formal method based on the E-CARGO model and utility theory can be applied in the ride-sharing problem. Numerical experiments show that the matching time cost increases with the increase of the number of drivers and passengers participating in the ride-sharing system. When the number of drivers and passengers is different, one-to-many matching takes the least time, and one-to-one matching takes more time. When the number of drivers and passengers is the same, the time cost of one-to-one matching increases sharply with a certain value (bigger than 800). Compared with other matching methods, the time spent by the one-to-many method is reduced by 30%. The results show that the proposed solution can be applied to the matching and pricing in a ride-sharing system.
format article
author Xiaohui Li
Hongbin Dong
Shuang Han
Xiaowei Wang
Xiaodong Yu
author_facet Xiaohui Li
Hongbin Dong
Shuang Han
Xiaowei Wang
Xiaodong Yu
author_sort Xiaohui Li
title A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles
title_short A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles
title_full A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles
title_fullStr A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles
title_full_unstemmed A Utility Method for the Matching Optimization of Ride-Sharing Based on the E-CARGO Model in Internet of Vehicles
title_sort utility method for the matching optimization of ride-sharing based on the e-cargo model in internet of vehicles
publisher Hindawi-Wiley
publishDate 2021
url https://doaj.org/article/03691792f5c546e99bc2bbf8d8e377fc
work_keys_str_mv AT xiaohuili autilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT hongbindong autilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT shuanghan autilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT xiaoweiwang autilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT xiaodongyu autilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT xiaohuili utilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT hongbindong utilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT shuanghan utilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT xiaoweiwang utilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
AT xiaodongyu utilitymethodforthematchingoptimizationofridesharingbasedontheecargomodelininternetofvehicles
_version_ 1718418320494952448