2019 IEEE International Conferences on Ubiquitous Computing &Amp; Communications (IUCC) and Data Science and Computational Inte 2019
DOI: 10.1109/iucc/dsci/smartcns.2019.00054
|View full text |Cite
|
Sign up to set email alerts
|

TMATCH: A New Framework for Supporting Car-Sharing Under Carpooling Model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…Assuming that there are already two sharing requests q 1 and q 2 in the vehicle's sharing schedule as shown in Figure 3 when inserting the departure q 3 .o and destination positions q 3 .d of a new request q 3 into the sharing schedule, the dispatch centre will choose a location with the shortest diversions to insert; supposing that q 3 .o is inserted between q 1 .o and q 2 .o and that q 3 .d is inserted between q 1 .d and q 2 .d, the order in which the vehicles will pick up and drop of passengers is q 1 , q 3 , and q 2 . We check whether the arrival times of the vehicles at q 3 .o and q 2 .o satisfy equation ( 1) and check whether the arrival times of the vehicles at q 2 .d and q 3 .d satisfy equation (2). If the time constraint is satisfed, we use equations ( 4) or (5) to calculate the detour ratio of the trip, and if the detour ratio satisfes equations ( 6) or (7), the request is inserted into the trip schedule.…”
Section: Passenger Request Insert Checkmentioning
confidence: 99%
See 1 more Smart Citation
“…Assuming that there are already two sharing requests q 1 and q 2 in the vehicle's sharing schedule as shown in Figure 3 when inserting the departure q 3 .o and destination positions q 3 .d of a new request q 3 into the sharing schedule, the dispatch centre will choose a location with the shortest diversions to insert; supposing that q 3 .o is inserted between q 1 .o and q 2 .o and that q 3 .d is inserted between q 1 .d and q 2 .d, the order in which the vehicles will pick up and drop of passengers is q 1 , q 3 , and q 2 . We check whether the arrival times of the vehicles at q 3 .o and q 2 .o satisfy equation ( 1) and check whether the arrival times of the vehicles at q 2 .d and q 3 .d satisfy equation (2). If the time constraint is satisfed, we use equations ( 4) or (5) to calculate the detour ratio of the trip, and if the detour ratio satisfes equations ( 6) or (7), the request is inserted into the trip schedule.…”
Section: Passenger Request Insert Checkmentioning
confidence: 99%
“…With the acceleration of urbanization, people's travel needs are also increasing, and the increasing number of vehicles on the urban road network has aggravated the problem of road congestion. How to make the best use of resources, reduce energy consumption and ease trafc congestion has become an urgent issue [1][2][3]. Taxi sharing has become a better solution to travel difculties and trafc congestion, meeting the individual needs of passengers and making full use of vehicle resources.…”
Section: Introductionmentioning
confidence: 99%
“…Last of all, we discuss how to execute tasks matching over road network. [7]. We have created a platform which gives hierarchical variation of the geographical region using grids, landmarks, etc.…”
Section: Literature Surveymentioning
confidence: 99%