Institutional Repository
| On personalized and sequenced route planning | |
| Dai, J; Liu, CF; Xu, JJ; Ding, ZM | |
| 2016 | |
| Source | WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
 |
| ISSN | 1386-145X |
| Volume | 19Issue:4Pages:679-705 |
| English Abstract | 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. |
| Indexed Type | SCI |
| Keyword | Spatial Databases Online Route Planning |
| Department | 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. |
| Language | 英语 |
| WOS ID | WOS:000374968300007 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17319 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| art%3A10.1007%2Fs112（2504KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment