关键词: 城市交通, 动态网络调度模型, Hadoop, 互联网定制公交, 蚁群算法

Abstract:

For Internet customized bus service model in the presence of route planning is not reasonable, lack of common model problems, K- mean algorithm is used to cluster the residents of real- time travel demand, based on constructed for Internet customized bus with the greatest demand service rate and minimum cost for the double target, its maximum capacity and passenger time threshold factors for the constraints of the dynamic scheduling model and for the fast solution of the model design parallel ant colony algorithm based on Hadoop platform. Taking Guangzhou city as an example, the real-time test validity of the model and algorithm. The results show that the proposed model and algorithm can be applied to the Internet customized bus service, has the positive significance to promote the "Internet plus transportation".

Key words: urban traffic, dynamic network scheduling model, Hadoop, customized shuttle bus, ant colony algorithm