We need your help! 🔥
Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
Travelling Salesman Problem
Solves TSP within the given network with ant-colonies algorithm. It finds the optimum Path s which visits every node
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Points | P | Point-List to generate Indecent-Network from | Point |
| Start | Start | The index of the starting point | Integer |
| Ants | Ants | The number of Ants(agents) | Integer |
| Iteration | Iteration | Cost (Distance) per connection | Integer |
| Decay | Decay | Decay factor of pheromones per iteration | Number |
| Alpha | Alpha | The power by which the values of segments would affect the attractiveness of selectable nodes | Number |
| Beta | Beta | The power by which shorter segments (with lower cost) gain values | Number |
| Seed | Seed | Random Seed | Integer |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Path | P | The optimum path | Curve |
| Length | L | The accumulative length of segments the path | Number |
| Path | P | The optimum result path | Integer |
| Edge→Node | E→N | Edge→Node Topology. This indicates a pair of nodes that define one edge. | Integer |
| Lines | L | MST Network lines | Line |
Site design © Robin Rodricks.
Heteroptera and associated data © 2024 Amin Bahrami (Helioripple Studio).
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub