- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report
[FlexSim 25.1.5]
I am currently building a simulation model using the AGV Network. However, I've found that when using the built-in AGV Network in FlexSim, I cannot select paths based on my own custom calculations (e.g., guiding the AGV through a specific path by calculating a custom Cost value). I require dynamic calculations for my routing.
Based on my research, there are three available methods in FlexSim. Could you please confirm if my understanding is correct?
- Route Cost - Divide By Speed
- Route Cost - Multiply By Custom Path Cost
- CustomizationDelegate - getPathTravelWeight
I understand that options 1 and 2 are for static calculations, while option 3 allows for dynamic calculations. Since I need dynamic routing, I attempted the third method. I assigned a "Path.Cost" label to each path and updated these costs in the Process Flow immediately before the Travel activity. However, the simulation became so slow that it was practically impossible to run.
The scale of my model is quite large: approximately 500 AGVs and several thousand paths and control points. My assumption is that updating the cost for each path triggers a global update of all paths and forces the system to recalculate the shortest path (via A* or Dijkstra), which is causing the performance bottleneck. Is this correct?
If so, what I actually want to achieve is as follows:
I want to create a custom calculation formula using my own Cost values to determine the path from a starting point (AGV or specific Control Point) to a destination (specific Control Point). I would like to manually generate the route, including intermediate waypoints using the Dijkstra algorithm, and have the AGV follow that specific path.
In short, the core of my request is to bypass the default pathfinding and configuration of the FlexSim AGV Network and apply a custom-calculated route. I need a solution that minimizes the computational load to ensure the simulation runs at a reasonable speed.
Could anyone provide a solution or a better approach?
Solved! Go to Solution.