Designing transportation routes over complex terrain requires balancing distance with constructability constraints such as slope, elevation, and obstacle avoidance. We propose a hybrid framework that combines Ant Colony Optimization (ACO) with Genetic Programming (GP) on a high-resolution geospatial mesh represented as an 8-neighbor graph enriched with terrain features. GP is used to evolve an edge-cost function via a penalty-driven fitness over multiple start-goal pairs, capturing trade-offs between competing objectives. The learned cost is then exploited by a parallel Min-Max Ant System to efficiently generate feasible routes between user-defined locations. Results show that the proposed method produces computationally efficient routes that reduce steep segments and avoid undesirable areas while maintaining limited detours.
Designing transportation routes over complex terrain requires balancing distance with constructability constraints such as slope, elevation, and obstacle avoidance. We propose a hybrid framework that combines Ant Colony Optimization (ACO) with Genetic Programming (GP) on a high-resolution geospatial mesh represented as an 8-neighbor graph enriched with terrain features. GP is used to evolve an edge-cost function via a penalty-driven fitness over multiple start-goal pairs, capturing trade-offs between competing objectives. The learned cost is then exploited by a parallel Min-Max Ant System to efficiently generate feasible routes between user-defined locations. Results show that the proposed method produces computationally efficient routes that reduce steep segments and avoid undesirable areas while maintaining limited detours.
Learning Terrain-Aware Edge Costs for Ant-Colony Route Planning via Genetic Programming / Panizza, A., Colosimo, D., Marcon, F., Nielsen, E., Genetti, S., Iacca, G.. - (2026), pp. 1639-1642. (2026 Genetic and Evolutionary Computation Conference, GECCO 2026 Companion San Jose, Costa Rica 13rd July-17th July 2026) [10.1145/3795101.3814665].
Learning Terrain-Aware Edge Costs for Ant-Colony Route Planning via Genetic Programming
Erik Nielsen;Stefano Genetti;Giovanni Iacca
2026-01-01
Abstract
Designing transportation routes over complex terrain requires balancing distance with constructability constraints such as slope, elevation, and obstacle avoidance. We propose a hybrid framework that combines Ant Colony Optimization (ACO) with Genetic Programming (GP) on a high-resolution geospatial mesh represented as an 8-neighbor graph enriched with terrain features. GP is used to evolve an edge-cost function via a penalty-driven fitness over multiple start-goal pairs, capturing trade-offs between competing objectives. The learned cost is then exploited by a parallel Min-Max Ant System to efficiently generate feasible routes between user-defined locations. Results show that the proposed method produces computationally efficient routes that reduce steep segments and avoid undesirable areas while maintaining limited detours.| File | Dimensione | Formato | |
|---|---|---|---|
|
3795101.3814665.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Creative commons
Dimensione
1.37 MB
Formato
Adobe PDF
|
1.37 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione



