@inproceedings{572e1a55810e400b9a910dd4ac6f8832,
title = "Constrained Route Planning Based on the Regular Expression",
abstract = "Traditional route planning algorithms, which mainly focus on common metrics to find the optimal route from source to destination, are not enough to solve route planning requirements with location constraints like sequence, alternative and avoidance. For example, finding the shortest path passing the whole or a part of user-defined locations or location categories in order or disorder, or not passing some specified locations or categories. Mainly focusing on these scenarios, this paper formalizes the constrained route planning problem based on the regular expression generated by user requirements and gives a general framework for the exact solution. By using different shortest path algorithms, we show how the framework works efficiently with shortest path algorithms. Finally, extensive experiments on real road network datasets demonstrate the efficiency of our proposal.",
keywords = "A* search algorithm, Constrained route planning, Dijkstra{\textquoteright}s algorithm, The regular expression, The shortest path",
author = "Jing Wang and Huiping Liu and Zhao Zhang",
note = "Publisher Copyright: {\textcopyright} 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.; 13th International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2017 ; Conference date: 11-12-2017 Through 13-12-2017",
year = "2018",
doi = "10.1007/978-3-030-00916-8\_10",
language = "英语",
isbn = "9783030009151",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
publisher = "Springer Verlag",
pages = "98--108",
editor = "Imed Romdhani and Lei Shu and Timothy Gordon and Hara Takahiro and Zhangbing Zhou and Deze Zeng",
booktitle = "Collaborative Computing",
address = "德国",
}