How to find a comfortable bus route - Towards personalized information recommendation services | |
Guo, Danhuai2; Zhao, Ziqi1; Xu, Wei1; Lan, Jinsong2; Zhang, Tao1; Liu, Shuguang3; Li, Jianhui2; Zhou, Yuanchun2 | |
2015 | |
DOI | 10.5334/dsj-2015-014 |
英文摘要 | 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. © 2015 The Author(s). |
语种 | 英语 |
电子版国际标准刊号 | 16831470 |
内容类型 | 会议论文 |
源URL | [http://119.78.100.138/handle/2HOD01W0/9771] |
专题 | 中国科学院重庆绿色智能技术研究院 |
作者单位 | 1.School of Information, Renmin University of China, Beijing; 100872, China; 2.Computer Network Information Center, Chinese Academy of Sciences, Beijing; 100190, China; 3.Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, Chongqing; 400714, China |
推荐引用方式 GB/T 7714 | Guo, Danhuai,Zhao, Ziqi,Xu, Wei,et al. How to find a comfortable bus route - Towards personalized information recommendation services[C]. 见:. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论