Abstract
Route planning satisfied multiple requests is an emerging branch in the route planning field and has attracted significant attention from the research community in recent years. The prevailing studies focus only on seeking a route by minimizing a single kind of Travel Cost, such as trip time or distance, among others. In reality, most users would like to choose an appropriate route, neither fastest nor shortest route. Usually, a user may have multiple requirements, and an appropriate route would satisfy all requirements requested by the user. In fact, planning an appropriate route could be formulated as a problem of Multi-weight Multi-destination Route Planning with Deadlines Constraints (MWMDRP-DC). In this article, we propose a framework, namely, MWMD-Router, which addresses the MWMDRP-DC problem comprehensively. To consider the travel costs with time-variation, we propose not only four novel dynamic graph miner to extract travel costs that reveal users’ requirements but also two new algorithms, namely, Basic MWMD Route Planning and Advanced MWMD Route Planning, to plan a route that satisfies deadline requirements and optimizes another criterion like travel cost with time-variation efficiently. To the best of our knowledge, this is the first work on route planning that considers handling multiple deadlines for multi-destination planning as well as optimizing multiple travel costs with time-variation simultaneously. Experimental results demonstrate that our proposed algorithms deliver excellent performance with respect to efficiency and effectiveness.
- Ove Andersen, Christian S. Jensen, Kristian Torp, and Bin Yang. 2013. Ecotour: Reducing the environmental footprint of vehicles using eco-routes. In Proceedings of the 14th IEEE International Conference on Mobile Data Management. Vol. 1. IEEE, 338--340.Google ScholarDigital Library
- Rui Araújo, Ângela Igreja, Ricardo de Castro, and Rui Esteves Araujo. 2012. Driving coach: A smartphone application to evaluate driving efficient patterns. In Proceedings of the 2012 IEEE Intelligent Vehicles Symposium. IEEE, 1005--1010.Google ScholarCross Ref
- Esther M. Arkin and Refael Hassin. 1994. Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55, 3 (Dec. 1994), 197--218. DOI:https://doi.org/10.1016/0166-218X(94)90008-6Google ScholarDigital Library
- Nikhil Bansal, Avrim Blum, Shuchi Chawla, and Adam Meyerson. 2004. Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC’04). Association for Computing Machinery, New York, NY, 166--174. DOI:https://doi.org/10.1145/1007352.1007385Google ScholarDigital Library
- Piotr Blaszczyk, Wojciech Turek, and Krzysztof Cetnarowicz. 2014. Extensible platform for studying the behavior of drivers in urban traffic. In Proceedings of the IEEE 17th International Conference on Intelligent Transportation Systems. IEEE, 1359--1362.Google ScholarCross Ref
- Vaida Ceikute and Christian S. Jensen. 2015. Vehicle routing with user-generated trajectory data. In Proceedings of the 16th IEEE International Conference on Mobile Data Management. Vol. 1. IEEE, 14--23.Google Scholar
- Chi Hong Cheong and Man Hon Wong. 2006. Mining popular paths in a transportation database system with privacy protection. In Proceedings of the 22nd International Conference on Data Engineering Workshops. DOI:https://doi.org/10.1109/ICDEW.2006.91Google ScholarDigital Library
- Siddharth Das. 2017. A fast, efficient technique for finding a path through multiple destinations. In Proceedings of the 2017 IEEE International Conference on Electro Information Technology. IEEE, 404--409.Google ScholarCross Ref
- Lei Deng, Mohammad H. Hajiesmaili, Minghua Chen, and Haibo Zeng. 2016. Energy-efficient timely transportation of long-haul heavy-duty trucks. In Proceedings of the 7th International Conference on Future Energy Systems (e-Energy’16). Association for Computing Machinery, New York, NY, Article 10, 12 pages. DOI:https://doi.org/10.1145/2934328.2934338Google ScholarDigital Library
- Yong Ge, Hui Xiong, Alexander Tuzhilin, Keli Xiao, Marco Gruteser, and Michael Pazzani. 2010. An energy-efficient mobile recommender system. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’10). Association for Computing Machinery, New York, NY, 899--908. DOI:https://doi.org/10.1145/1835804.1835918Google ScholarDigital Library
- Abeer Hakeem, Narain Gehani, Xiaoning Ding, Reza Curtmola, and Cristian Borcea. 2019. Multi-destination vehicular route planning with parking and traffic constraints. In Proceedings of the 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services. 298--307. DOI:https://doi.org/10.1145/3360774.3360824Google ScholarDigital Library
- Mordechai (Muki) Haklay and Patrick Weber. 2008. OpenStreetMap: User-generated street maps. IEEE Pervasive Computing 7, 4 (Oct. 2008), 12--18. DOI:https://doi.org/10.1109/MPRV.2008.80Google ScholarDigital Library
- Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4, 2 (1968), 100--107.Google ScholarCross Ref
- Minh X. Hoang, Yu Zheng, and Ambuj K. Singh. 2016. FCCF: Forecasting citywide crowd flows based on big data. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPACIAL’16). Association for Computing Machinery, New York, NY, Article 6, 10 pages. DOI:https://doi.org/10.1145/2996913.2996934Google Scholar
- Ming Hua and Jian Pei. 2010. Probabilistic path queries in road networks: Traffic uncertainty aware path selection. In Proceedings of the 13th International Conference on Extending Database Technology (EDBT’10). Association for Computing Machinery, New York, NY, 347--358. DOI:https://doi.org/10.1145/1739041.1739084Google ScholarDigital Library
- Yu Huang, Bo-Hau Lin, and Vincent S. Tseng. 2017. Efficient multi-destinations route planning with deadlines and cost constraints. In Proceedings of the 18th IEEE International Conference on Mobile Data Management. IEEE, 228--233.Google Scholar
- Patrick Jaillet, Jin Qi, and Melvyn Sim. 2016. Routing optimization under uncertainty. Operations Research 64, 1 (2016), 186--200.Google ScholarDigital Library
- Bin Jiang, Junjun Yin, and Sijian Zhao. 2009. Characterizing the human mobility pattern in a large street network. Physical Review E 80, 2 (2009), 021136.Google ScholarCross Ref
- Evangelos Kanoulas, Yang Du, Tian Xia, and Donghui Zhang. 2006. Finding fastest paths on a road network with speed patterns. In Proceedings of the 22nd International Conference on Data Engineering. IEEE, 10--10.Google ScholarDigital Library
- Hans-Peter Kriegel, Matthias Renz, and Matthias Schubert. 2010. Route skyline queries: A multi-preference path planning approach. In Proceedings of the 26th International Conference on Data Engineering. IEEE, 261--272.Google ScholarCross Ref
- Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, George Kollios, and Shang-Hua Teng. 2005. On trip planning queries in spatial databases. In Proceedings of the 9th International Conference on Advances in Spatial and Temporal Databases. Claudia Bauzer Medeiros, Max J. Egenhofer, and Elisa Bertino (Eds.). Springer, Berlin, 273--290.Google ScholarDigital Library
- Tingting Li, Jianping Wu, Anrong Dang, Lyuchao Liao, and Ming Xu. 2019. Emission pattern mining based on taxi trajectory data in Beijing. Journal of Cleaner Production 206 (2019), 688--700.Google ScholarCross Ref
- Zhenhui Li, Jiawei Han, Ming Ji, Lu-An Tang, Yintao Yu, Bolin Ding, Jae-Gil Lee, and Roland Kays. 2011. MoveMine: Mining moving object data for discovery of animal movement patterns. ACM Transactions on Intelligent Systems and Technology 2, 4, (July 2011), 32. DOI:https://doi.org/10.1145/1989734.1989741Google ScholarDigital Library
- Jing Lian and Lin Zhang. 2018. One-month beijing taxi GPS trajectory dataset with taxi IDs and vehicle status. In Proceedings of the 1st Workshop on Data Acquisition To Analysis (DATA’18). Association for Computing Machinery, New York, NY, 3--4. DOI:https://doi.org/10.1145/3277868.3277870Google ScholarDigital Library
- Henry Lieu, N. Gartner, C. J. Messer, and A. K. Rathi. 1999. Traffic flow theory. Public Roads 62 (1999), 45--47.Google Scholar
- Shen Lin and Brian W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 2 (1973), 498--516.Google ScholarDigital Library
- Dominique Lord, Abdelaziz Manar, and Anna Vizioli. 2005. Modeling crash-flow-density and crash-flow-V/C ratio relationships for rural and urban freeway segments. Accident Analysis 8 Prevention 37, 1 (2005), 185--199.Google Scholar
- Eric Hsueh-Chan Lu, Huan-Sheng Chen, and Vincent S. Tseng. 2013. Efficient approaches for multi-requests route planning in urban areas. In Proceedings of the 14th International Conference on Mobile Data Management. Vol. 1. IEEE, 36--45.Google Scholar
- Atsushi Maruyama, Naoki Shibata, Yoshihiro Murata, Keiichi Yasumoto, and Minoru Ito. 2004. A personal tourism navigation system to support traveling multiple destinations with time restrictions. In Proceedings of the 18th International Conference on Advanced Information Networking and Applications. Vol. 2. IEEE, 18--21.Google ScholarCross Ref
- Andrey Tietbohl Palma, Vania Bogorny, Bart Kuijpers, and Luis Otavio Alvares. 2008. A clustering-based approach for discovering interesting places in trajectories. In Proceedings of the 2008 ACM Symposium on Applied Computing (SAC’08). ACM, New York, NY, 863--868. DOI:https://doi.org/10.1145/1363686.1363886Google ScholarDigital Library
- Mohammad K. Sepehrifar, Ali Fanian, and Mohammad B. Sepehrifar. 2020. Shortest path computation in a network with multiple destinations. Arabian Journal for Science and Engineering 45 (2020), 3223--3231.Google ScholarCross Ref
- J. Siegel, R. Bhattacharyya, A. Deshpande, and S. Sarma. 2014. Vehicular engine oil service life characterization using on-board diagnostic (OBD) sensor data. In Proceedings of the 2014 IEEE SENSORS. IEEE, 1722--1725.Google Scholar
- Sabine Storandt. 2012. Quick and energy-efficient routes: Computing constrained shortest paths for electric vehicles. In Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS’12). Association for Computing Machinery, New York, NY, 20--25. DOI:https://doi.org/10.1145/2442942.2442947Google ScholarDigital Library
- Ping-Huang Ting, Jiun-Ren Hwang, Ji-Liang Doong, and Ming-Chang Jeng. 2008. Driver fatigue and highway driving: A simulator study. Physiology 8 behavior 94, 3 (2008), 448--453.Google Scholar
- Paolo Toth and Daniele Vigo (Eds.). 2001. The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, USA.Google Scholar
- Bruce Wallace, Rafik Goubran, Frank Knoefel, Shawn Marshall, and Michelle Porter. 2014. Measuring variation in driving habits between drivers. In Proceedings of the 2014 IEEE International Symposium on Medical Measurements and Applications. IEEE, 1--6.Google ScholarCross Ref
- Susan E. Williams, Stacy Cagle Davis, and Robert Gary Boundy. 2017. Transportation Energy Data Book: Edition 36. Technical Report. Oak Ridge National Lab (ORNL), Oak Ridge, TN.Google Scholar
- Xiangye Xiao, Yu Zheng, Qiong Luo, and Xing Xie. 2010. Finding similar users using category-based location history. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS’10). Association for Computing Machinery, New York, NY, 442--445. DOI:https://doi.org/10.1145/1869790.1869857Google ScholarDigital Library
- Bin Yang, Chenjuan Guo, Christian S. Jensen, Manohar Kaul, and Shuo Shang. 2014. Stochastic skyline route planning under time-varying uncertainty. In Proceedings of the 30th International Conference on Data Engineering. IEEE, 136--147.Google ScholarCross Ref
- Yang Yue, Yan Zhuang, Qingquan Li, and Qingzhou Mao. 2009. Mining time-dependent attractive areas and movement patterns from taxi trajectory data. In Proceedings of the International Conference on Geoinformatics. IEEE, 1--6.Google Scholar
- Xianyuan Zhan, Yu Zheng, Xiuwen Yi, and Satish V. Ukkusuri. 2017. Citywide traffic volume estimation using trajectory data. IEEE Transactions on Knowledge and Data Engineering 29, 2, 272--285. DOI:https://doi.org/10.1109/TKDE.2016.2621104Google ScholarDigital Library
- Yu Zheng, Lizhu Zhang, Xing Xie, and Wei-Ying Ma. 2009. Mining interesting locations and travel sequences from GPS trajectories. In Proceedings of the 18th International Conference on World Wide Web (WWW’09). ACM, New York, NY, 791--800. DOI:https://doi.org/10.1145/1526709.1526816Google ScholarDigital Library
Index Terms
- Dynamic Graph Mining for Multi-weight Multi-destination Route Planning with Deadlines Constraints
Recommendations
Multi-destination vehicular route planning with parking and traffic constraints
MobiQuitous '19: Proceedings of the 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and ServicesThis paper aims to provide an efficient solution for people in a city who drive their cars to visit several destinations, where they need to park for a while, but do not care about the visiting order. This instance of the multi-destination route ...
Multi‐AGV route planning in automated warehouse system based on shortest‐time Q‐learning algorithm
AbstractRoute planning for automated guided vehicles (AGVs) is one of the key factors that affects work efficiency of automated storage and retrieval systems (AS/RSes). Route planning plays an important role in the operation of AGVs. Since the ...
Dynamic route planning with uncertain information
Navigating an autonomous vehicle through a threatening zone whose characteristics may change in an unpredictable manner is an important problem that has received much attention in the recent past. The paper describes the design of a route planning ...
Comments