Algorithm of building route

[helloartur1]

Hello everyone! For my article I need to find some information about algorithm of building routes specifically in OpenRouteService. I searched in many sites and documentations, but didn’t find any information about it. Could you help me, please?

[jschnell]

Hey,

You can find some information in this forum, e.g.

What is the algorithm used by ORS API for QGIS

What is the algorithm that ORS uses to deliver the shortest route and the fastest route? is Dijkstra, A * or CH (Contraction Hierarchies). Also, theoretically, what is the difference between the shortest and the fastest route, why could they be different? I need some source that indicates this information. Thank you

Openrouteservice algorithm

Hey, have a look here: Scientific sources for foot-walking and other profiles - #5 by amandus or look for more posts quoting “cite” or “citation” in the forum. Best regards

Scientific sources for foot-walking and other profiles

Regarding the tool: there are no up to date publications that describe ors in the state it is today. There are some publications that do a general overview from 2007 and 2008: https://www.researchgate.net/profile/Alexander-Zipf/publication/228679185_A_Web_Accessibility_Analysis_Service_based_on_the_OpenLS_Route_Service/links/02e7e517aba95b38d6000000/A-Web-Accessibility-Analysis-Service-based-on-the-OpenLS-Route-Service.pdf or Otherwise you could just cite our website: https://openrouteser…

Best regards