AUCTION BASED DISPATCH MODEL IN ONLINE MOTORCYCLE TAXI SYSTEM

摘要

One problem in the existing online motorcycle taxi system is generalization among drivers. The generalization includes price, travel distance, and pickup distance. Meanwhile, both drivers and passengers cannot be generalized. For example, some drivers want to get higher price while other drivers want to take shorter travel distance. In the other side, some passengers want to get lower price while other passengers want to get lower waiting time. Based on these needs, in this research, we propose new online motorcycle taxi dispatch system that accommodates this various requirements. The proposed model is developed based on auction model. The auction is done automatically, sealed, and it is single round auction. In this research, the driver?s requirements are: maximum travel distance, maximum pickup distance, and price range. Meanwhile, the passenger?s requirements are: maximum waiting time and price range. There are three proposed models in this research. In the first model, pickup distance limitation is implemented. In the second model, travel distance limitation is implemented. In the third model, both pickup distance and travel distance limitations are implemented. In the test, besides comparing to each other, these proposed models are also compared with the previous nearest driver model. The test result is as follows. The previous nearest driver model performs the highest success ratio. The first model performs the highest average driver revenue. The third model performs the lowest average waiting time and average pickup distance.