http://swrc.ontoware.org/ontology#Article
Modeling and Evaluating Taxi Ride-sharing for Event Trips
en
[オリジナル論文] taxi ride sharing, mathematical modeling, mixed integer linear programming, matching algorithm, heuristic algorithm
University of Tsukuba
University of Tsukuba
DENSO CORPORATION
DENSO CORPORATION
University of Tsukuba
University of Tsukuba
Taketo Yoshida
Masaki Yano
Kenichiro Horikawa
Keita Sato
Shota Minami
Maiko Shigeno
While ride-sharing systems have received great interest and spread widely in recent years, taxi ride-sharing is expected to be highly effective at ride-sharing. This research is an investigation into the possibility of taxi ride-sharing for passengers having a common purpose, such as an event trip, in which passengers having the same reason for taking a trip are handled. Although solutions to taxi ride-sharing problems are usually evaluated on the basis of the distance traveled by taxis, our proposed model minimizes the total trip distance of all passengers without lengthening the minimum total distance traveled by the taxi. This taxi ride-sharing problem is formulated as a mixed integer linear programming (MILP) problem. For this problem, an exact algorithm under the restriction of ride capacity and a heuristic algorithm that solves general cases are proposed. Moreover, numerical experiments were done to assess the performance of our heuristic algorithm and evaluate solutions in terms of distances of routes and fare that is paid.
While ride-sharing systems have received great interest and spread widely in recent years, taxi ride-sharing is expected to be highly effective at ride-sharing. This research is an investigation into the possibility of taxi ride-sharing for passengers having a common purpose, such as an event trip, in which passengers having the same reason for taking a trip are handled. Although solutions to taxi ride-sharing problems are usually evaluated on the basis of the distance traveled by taxis, our proposed model minimizes the total trip distance of all passengers without lengthening the minimum total distance traveled by the taxi. This taxi ride-sharing problem is formulated as a mixed integer linear programming (MILP) problem. For this problem, an exact algorithm under the restriction of ride capacity and a heuristic algorithm that solves general cases are proposed. Moreover, numerical experiments were done to assess the performance of our heuristic algorithm and evaluate solutions in terms of distances of routes and fare that is paid.
AA11464803
情報処理学会論文誌数理モデル化と応用（TOM）
12
2
1-11
2019-07-17
1882-7780