How to find the cheapest option now to go from A to B? Easy, just try every possible route and add the cost of the edges along the way. This is exactly what AnyLogic does internally, and that is (simplified) also what your navigation device does when you set it to find the "shortest route". The most intuitive case would be to use the length of the edge as it cost. If you have an origin and a destination inside this network, how does a navigation device select a route through this interconnected system?įirst you need to attach a cost to each edge, which you have to pay if I want to use it, like a road toll. Here is a table with these terms translated: Normal Life You want to avoid already congested routes, like the traffic avoidance in a modern navigation device with internet accessĭid I just say modern navigation device? How does such a device calculate a route? First of all it holds all the connection possibilities in a graph network, consisting of edges and vertices.You want to have the fastest route and some parts of the network have speed restrictions.You want to completely avoid some routes, for example toll routes.However in a lot of situations this is not flexible enough: But what is THE best route? AnyLogic finds the route with the shortest distance. Whenever you are using a moveTo block in a network (Note: I am explicitely excluding GIS networks here, as the situation there is a bit different), AnyLogic will use its own solution to calculate the best route to your choosen destination.
AnyLogic has a built-in routing solution.
0 kommentar(er)
