By Topic

Dynamic Rideshare Matching Algorithms for the Taxipooling Service Based on Intelligent Transportation System Technologies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tao Chi-chung ; Tamkang Univ., Tamsui ; Chen Chun-ying

The convergence of the Intelligent Transportation System (ITS) technologies has given rise to new opportunities for creative and incentive taxi services such as taxipooling. Taxipooling is similar to carpooling which is based on the idea that sets of users having the same travel destination and sharing vehicles. This paper presents two heuristic algorithms based on greedy method and the time-space network for the case of one origin to many destinations ("one-to-many") and many origins to one destination ("many-to-one"). These algorithms are used to support a field trial at Taipei NeiHu Science and Technology Park in Taiwan. The results of numerical tests have demonstrated that the outcomes of these heuristic algorithms are fairly plausible.

Published in:

Management Science and Engineering, 2007. ICMSE 2007. International Conference on

Date of Conference:

20-22 Aug. 2007