Constrained route optimization on the Brenta mountain trail network

Routing over mountainous terrain is a challenging problem, as a practical route has to consider the horizontal distance as well as the extra cost incurred by elevation changes. This study investigates preference -based route optimization within a Digital Elevation Model (DEM)-integrated mountain trail network in the Brenta Dolomites, Trentino, northern Italy. A Digital Elevation Model (DEM) is a way of modeling terrain on a computer, taking a continuous landscape and turning it into a grid of discrete, connected points with different movement costs. Previous studies have shown that DEM-based least-cost path techniques and the Dijkstra's algorithm can effectively search for pathways in mountainous terrains. These methods, however, are typically based on a predefined cost function and have limited capability to incorporate explicit terrain constraints. For spatial planning problems, mathematical optimization methods have been applied to handle complex constraints and decision variables. This research extends these ideas by developing a constrained optimization framework for route selection in an integrated mountain trail system of a DEM. This study addresses that question by constructing a real, DEM-derived weighted graph for Brenta Dolomites, a mountain group in Trentino, northern Italy, near Madonna di Campiglio, in which nodes represent discrete terrain locations and edges represent feasible movements between neighboring cells. Each edge is assigned a cost that combines horizontal distance with a physically motivated penalty for elevation change, so that the resulting network reflects real physical effort rather than map distance. Dijkstra's algorithm is used as a way to find the shortest path. Mathematical optimization is used to add rules that can't be handled well by finding the shortest path. Comparing with ways to plan routes is also used to check the routes based on distance climbing how fast they run on a computer and if they follow the rules. The results show that adding rules about the land can make a choice between how the path is and how much climbing is needed. The study gives a way to see when extra rules make the path change and how better path planning can match wishes of people, in mountain areas.

Authors

Publication Details

Journal
Advances in Operation Research and Production Management
Published
2026-11-19
DOI
https://doi.org/10.54254/3029-0880/2026.39054
Primary Topic
Transportation Planning and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Constrained route optimization on the Brenta mountain trail network

Xiyu Meng, Chongyuan Xu, Jiaxuan Wu, Haozhuo Bo
Advances in Operation Research and Production Management
Transportation Planning and Optimization
article

Constrained route optimization on the Brenta mountain trail network

Xiyu Meng, Chongyuan Xu, Jiaxuan Wu, Haozhuo Bo
article en

Abstract

Routing over mountainous terrain is a challenging problem, as a practical route has to consider the horizontal distance as well as the extra cost incurred by elevation changes. This study investigates preference -based route optimization within a Digital Elevation Model (DEM)-integrated mountain trail network in the Brenta Dolomites, Trentino, northern Italy. A Digital Elevation Model (DEM) is a way of modeling terrain on a computer, taking a continuous landscape and turning it into a grid of discrete, connected points with different movement costs. Previous studies have shown that DEM-based least-cost path techniques and the Dijkstra's algorithm can effectively search for pathways in mountainous terrains. These methods, however, are typically based on a predefined cost function and have limited capability to incorporate explicit terrain constraints. For spatial planning problems, mathematical optimization methods have been applied to handle complex constraints and decision variables. This research extends these ideas by developing a constrained optimization framework for route selection in an integrated mountain trail system of a DEM. This study addresses that question by constructing a real, DEM-derived weighted graph for Brenta Dolomites, a mountain group in Trentino, northern Italy, near Madonna di Campiglio, in which nodes represent discrete terrain locations and edges represent feasible movements between neighboring cells. Each edge is assigned a cost that combines horizontal distance with a physically motivated penalty for elevation change, so that the resulting network reflects real physical effort rather than map distance. Dijkstra's algorithm is used as a way to find the shortest path. Mathematical optimization is used to add rules that can't be handled well by finding the shortest path. Comparing with ways to plan routes is also used to check the routes based on distance climbing how fast they run on a computer and if they follow the rules. The results show that adding rules about the land can make a choice between how the path is and how much climbing is needed. The study gives a way to see when extra rules make the path change and how better path planning can match wishes of people, in mountain areas.

Advances in Operation Research and Production ManagementVol. 5(3)
Transportation Planning and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon