Multiobjective dynamic routing with predefined stops for automated vehicles

References

• Alonso-Mora, J., A. Wallar, and D. Rus. 2017. “Predictive Routing for Autonomous Mobility-on-Demand Systems with Ride-Sharing.” IEEE/RSJ International Conference on Intelligent Robots and Systems, Vancouver, BC, Canada. ( IROS): 3583–3590. doi:10.1109/IROS.2017.8206203.
   Google Scholar
• Apáthy, M. S. 2017. “Practical Route Planning Algorithm.” Periodica Polytechnica Transportation Engineering 45 (3): 133–140. doi:10.3311/PPtr.9916.
   Google Scholar
• Böker, G., and J. Lunze. 2002. “Stability and Performance of Switching Kalman Filters.” International Journal of Control 75 (16/17): 1269–1281. doi:10.1080/0020717021000023708.
   Web of Science ®Google Scholar
• Collie, B., J. Rose, R. Choraria, and A. K. Wegscheider. 2017. “Reimagined Car: Shared, Autonomous, and Electric Vehicle.” BCG report, December 18. Accessed 30 April 2018. https://www.bcg.com/publications/2017/reimagined-car-shared-autonomous-electric.aspx
   Google Scholar
• Daganzo, C., and N. Geroliminis. 2008. “An Analytical Approximation for the Macroscopic Fundamental Diagram of Urban Traffic.” Transportation Research Part B 42 (9): 771–781. doi:10.1016/j.trb.2008.06.008.
   Google Scholar
• Diakonikolas, I., and M. Yannakakis. 2009. “Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems.” SIAM Journal on Computing 39 (4): 1340–1371. doi:10.1137/080724514.
   Web of Science ®Google Scholar
• Dijkstra, E. W. 1959. “A Note on Two Problems in Connexion with Graphs.” Numerische Mathematik 1 (1): 269–271. doi:10.1007/BF01386390.
   Google Scholar
• Disser, Y., M. Müller-Hannemann, and M. Schnee. 2007. “Multi-Criteria Shortest Paths in Time-Dependent Train Networks.” In Proceedings of the 7th international conference on Experimental algorithms (WEA’08), C. C. McGeoch (Ed.). Springer-Verlag, Berlin, Heidelberg, pp. 347–361. doi: 10.1007/978-3-540-68552-4_26.
   Google Scholar
• Duckham, M., and L. Kulik. 2003. “Simplest’ Paths: Automated Route Selection for Navigation.” In Lecture Notes in Computer Science 2825: 169–185. doi:10.1007/978-3-540-39923-0_12.
   Google Scholar
• Eklund, P. W., S. Kirkby, and S. Pollitt. 1996. “A Dynamic Multi-Source Dijkstra’s Algorithm for Vehicle Routing.” Australian New Zealand Conference on Intelligent Information Systems. Proceedings. ANZIIS 96, Adelaide, SA, Australia. pp. 329–333. doi:10.1109/ANZIIS.1996.573976.
   Google Scholar
• Fu, L., D. Sun, and L. R. Rilett. 2006. “Heuristic Shortest Path Algorithms for Transportation Applications: State of the Art.” Computers & Operations Research 33 (11): 3324–3343. doi:10.1016/j.cor.2005.03.027.
   Web of Science ®Google Scholar
• Hawas, Y. E., and H. El-Shayed. 2015. “Autonomous Real Time Route Guidance in Inter-Vehicular Communication Urban Networks.” Vehicular Communications 2 (1): 36–46. doi:10.1016/j.vehcom.2015.01.001.
   Web of Science ®Google Scholar
• Hoang, V.-D., and K.-H. Jo. 2015. “Path Planning for Autonomous Vehicle Based on Heuristic Searching Using Online Images.” Vietnam Journal of Computer Science 2 (2): 109–120. doi:10.1007/s40595-014-0035-4.
   Google Scholar
• Jadaan, K., H. Khreis, and Á. Török. 2018. “Exposure to Traffic-Related Air Pollution and the Onset of Childhood Asthma: A Review of the Literature and the Assement Methods Used.” Periodica Polytechnica Transportation Engineering 46 (1): 21–28. doi:10.3311/PPtr.10113.
   Google Scholar
• Liberzon, D. 2003. Switching Systems and Control. ISBN 978-1-4612-0017-8. Boston: Birkhäuser.
   Google Scholar
• New York Taxi trip data. “NYC OpenData: Yellow Taxi Trip Data.” 2014. Accessed 11 April 2018. https://data.cityofnewyork.us/view/gn7m-em8n.
   Google Scholar
• Ortúzar, D., and L. G. Willumsen. 2001. Modelling Transport. ISBN: 978-0471861102, Chichester, West Sussex, United Kingdom: Wiley.
   Google Scholar
• Oskarbski, J., K. Birr, M. Miszewski, and K. Zarski. 2015. “Estimating the Average Speed of Public Transport Vehicles Based on Traffic Control System Data.” Models and Technologies for Intelligent Transportation Systems (MT-ITS), Budapest, Hungary. doi:10.1109/MTITS.2015.7223269.
   Google Scholar
• Pala, M., N. O. Eragi, F. López-Colino, A. Sanchez, A. de Casrto, and J. Garrido. 2013. “HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments.” ISPRS International Journal of Geo-Information 2 (3): 729–748. doi:10.3390/ijgi2030729.
   Web of Science ®Google Scholar
• Papageorgiou, M., and G. Vigos. 2008. “Relating Time-Occupancy Measurements to Space-Occupancy and Link Vehicle-Count.” Transportation Research Part C 16 (1): 1–17. doi:10.1016/j.trc.2007.06.001.
   Web of Science ®Google Scholar
• Parulekar, M., V. Padte, T. Shah, K. Shroff, and R. Shetty. 2013. “Automatic Vehicle Navigation Using Dijkstra’s Algorithm.” International Conference on Advances in Technology and Engineering (ICATE), Mumbai, India. pp. 1–5. doi:10.1109/ICAdTE.2013.6524721.
   Google Scholar
• PostBus. “Project ‘Smartshuttle’: Shape the Mobility of the Future.” Accessed 29 April 2018. https://www.postauto.ch/en/project-smartshuttle-0.
   Google Scholar
• Speranza, M. G. 2018. “Trends in Transportation and Logistics.” European Journal of Operational Research 264 (3): 830–836. doi:10.1016/j.ejor.2016.08.032.
   Web of Science ®Google Scholar
• Storandt, S. 2012. “Algorithms for Vehicle Navigation.” PhD dissertation, Universität Stuttgart.
   Google Scholar
• Szalay, Z., T. Tettamanti, D. Esztergár-Kiss, I. Varga, and C. Bartolini. 2018. “Development of a Test Track for Driverless Cars: Vehicle Design, Track Configuration, and Liability Considerations.” Periodica Polytechnica Transportation Engineering 46 (1): 29–35. doi:10.3311/PPtr.10753.
   Google Scholar
• Tavasszy, L., K. Ruijgrok, and I. Davydenko. 2012. “Incorporating Logistics in Freight Transportation Models: State of the Art and Research Opportunities.” Transport Reviews 32 (2): 203–219. doi:10.1080/01441647.2011.644640.
   Web of Science ®Google Scholar
• Tettamanti, T., M. T. Horváth, and I. Varga. 2014. “Road Traffic Measurement and Related Data Fusion Methodology for Traffic Estimation.” Transport and Telecommunication 15 (4): 269–279. doi:10.2478/ttj-2014-0023.
   Google Scholar
• Yen, J. Y. 1970. “An Algorithm for Finding Shortest Routes from All Source Nodes to a Given Destination in General Networks.” Quarterly of Applied Mathematics 27 (4): 526–530. doi:10.1090/qam/253822.
   Web of Science ®Google Scholar
• Zhang, R., F. Rossi, and M. Pavone. 2016. “Routing Autonomous Vehicles in Congested Transportation Networks: Structural Properties and Coordination Algorithms.” Proceedings of Robotics: Science and Systems, AnnArbor, Michigan, USA. doi:10.15607/RSS.2016.XII.032.
   Google Scholar