ISCAS OpenIR
On personalized and sequenced route planning
Dai, J; Liu, CF; Xu, JJ; Ding, ZM
2016
发表期刊WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
ISSN1386-145X
卷号19期号:4页码:679-705
摘要Online trip planning is a popular service that has facilitated a lot of people greatly. However, little attention has been paid to personalized trip planning which is even more useful. In this paper, we define a highly expressive personalized route planning query-the Personalized and Sequenced Route (PSR) Query which considers both personalization and sequenced constraint, and propose a novel framework to deal with the query. The framework consists of three phases: guessing, crossover and refinement. The guessing phase strives to obtain one high quality route as the baseline to bound the search space into a circular region. The crossover phase heuristically improve the quality of multiple guessed routes via a modified genetic algorithm, which further narrows the radius of the search space. The refinement phase backwardly examines each candidate point and partial route to rule out impossible ones. The combination of these phases can efficiently and effectively narrow our search space via a few iterations. In the experiment part, we firstly show our evaluation results of each phase separately, proving the effectiveness of each phase. Then, we present the evaluation results of the combination of them, which offers insight into the merits of the proposed framework.; Online trip planning is a popular service that has facilitated a lot of people greatly. However, little attention has been paid to personalized trip planning which is even more useful. In this paper, we define a highly expressive personalized route planning query-the Personalized and Sequenced Route (PSR) Query which considers both personalization and sequenced constraint, and propose a novel framework to deal with the query. The framework consists of three phases: guessing, crossover and refinement. The guessing phase strives to obtain one high quality route as the baseline to bound the search space into a circular region. The crossover phase heuristically improve the quality of multiple guessed routes via a modified genetic algorithm, which further narrows the radius of the search space. The refinement phase backwardly examines each candidate point and partial route to rule out impossible ones. The combination of these phases can efficiently and effectively narrow our search space via a few iterations. In the experiment part, we firstly show our evaluation results of each phase separately, proving the effectiveness of each phase. Then, we present the evaluation results of the combination of them, which offers insight into the merits of the proposed framework.
收录类别SCI
关键词Spatial Databases Online Route Planning
部门归属Chinese Acad Sci, Inst Software, Beijing 100190, Peoples R China. Univ Chinese Acad Sci, Beijing 100049, Peoples R China. Swinburne Univ Technol, Sch Software & Elect Engn, Dept Comp Sci & Software Engn, Fac Sci Engn & Technol, Melbourne, Vic 3122, Australia. Soochow Univ, Sch Comp Sci & Technol, Suzhou, Peoples R China. Beijing Univ Technol, Sch Comp Sci, Beijing 100124, Peoples R China.
语种英语
WOS记录号WOS:000374968300007
引用统计
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/17319
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Dai, J,Liu, CF,Xu, JJ,et al. On personalized and sequenced route planning[J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS,2016,19(4):679-705.
APA Dai, J,Liu, CF,Xu, JJ,&Ding, ZM.(2016).On personalized and sequenced route planning.WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS,19(4),679-705.
MLA Dai, J,et al."On personalized and sequenced route planning".WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS 19.4(2016):679-705.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
art%3A10.1007%2Fs112(2504KB) 开放获取使用许可请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Dai, J]的文章
[Liu, CF]的文章
[Xu, JJ]的文章
百度学术
百度学术中相似的文章
[Dai, J]的文章
[Liu, CF]的文章
[Xu, JJ]的文章
必应学术
必应学术中相似的文章
[Dai, J]的文章
[Liu, CF]的文章
[Xu, JJ]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。