How to Find a Comfortable Bus Route - Towards Personalized Information Recommendation Services

Authors

  • Danhuai Guo Computer Network Information Center, Chinese Academy of Sciences, Beijing, 100190
  • Ziqi Zhao School of Information, Renmin University of China, Beijing, 100872
  • Wei Xu School of Information, Renmin University of China, Beijing, 100872
  • Jinsong Lan Computer Network Information Center, Chinese Academy of Sciences, Beijing, 100190
  • Tao Zhang School of Information, Renmin University of China, Beijing, 100872
  • Shuguang Liu Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, Chongqing, 400714
  • Jianhui Li Computer Network Information Center, Chinese Academy of Sciences, Beijing, 100190
  • Yuanchun Zhou Computer Network Information Center, Chinese Academy of Sciences, Beijing, 100190

DOI:

https://doi.org/10.5334/dsj-2015-014

Keywords:

Online information services, Bus routes, Recommendation, Multi-objective programming, Genetic algorithm

Abstract

With the generation of massive data from bus IC cards, how to effectively and efficiently recommend comfortable bus routes to bus passengers is a challenging and complex task. In this paper, waiting time, crowded time, and driving time between different bus stations on different bus routes at different times of the day are calculated from bus IC cards data history. Then, a multi-objective program with various constraints is suggested to recommend comfortable bus routes for bus passengers, and a genetic algorithm is developed to search for expected solutions. The proposed method is implemented using bus IC cards data from Chongqing, China and will be a promising tool for bus passengers when choosing comfortable bus routes.

Downloads

Published

2015-05-22

Issue

Section

Proceedings Papers