The default option for an operator is to take the shortest path between two points on a network. But if there are multiple paths having the same distance between two points (e.g., a grid network with equal distance between adjacent nodes), what’s the secondary logic to decide which path to take?
The Network Navigator uses Dijkstra's algorithm to calculate the shortest path from each node to each other node. The first shortest valid path it finds from a node to another node will be the path it takes.
In the case of two paths that are the same distance from one node to another, it will use whichever one it found first. The order you created the nodes and the order that you connected the nodes will affect which path is found first.
Thank you for your explanation. Is there a way to find the path with minimum number of turns among all the same shortest distance paths?
The behavior of the Network Navigator is compiled into the object in the library: MAIN:/project/library/NetworkNavigator>behaviour/cppfunctions/generateDistanceTable()
To change the behavior of how it works, you would need to subclass that object using the Module Development SDK and then override the functions that you want to change. That is not an easy task and is probably overkill for what you are trying to do.
An easier way would probably be to determine the path you want to take yourself and then break up your travel task into multiple tasks that go to the particular nodes you want to go to in the order you want to go.
8 People are following this question.
FlexSim can help you understand and improve any system or process. Transform your existing data into accurate predictions.
FlexSim is a fully 3D simulation software environment. FlexSim can be used to simulate any process in any industry.
FlexSim®, FlexSim Healthcare™, Problem Solved.®, the FlexSim logo, the FlexSim X-mark, and the FlexSim Healthcare logo with stylized Caduceus mark are trademarks of FlexSim Software Products, Inc. All rights reserved.
