Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms

Zazai, M. Fawad; Fügenschuh, Armin

doi:10.1007/978-3-319-89920-6_62

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These solutions represent a set of optimal trade-offs to design ideal transport and energy infrastructures. The presented work is based on Zazai (2020) and is a largely extended version of Zazai and Fügenschuh (2018).…”

Section: Introductionmentioning

confidence: 99%

Computing the trajectories for the development of optimal routes

Zazai

Fügenschuh

2020

Optim Eng

Self Cite

View full text Add to dashboard Cite

Planning the construction of new transport routes or power lines on terrain is usually carried out manually by engineers, with no guarantee of optimality. We introduce a new approach for the computation of an optimal trajectory for the construction of new transit routes and power lines between two locations on a submanifold $$U\subset \mathbb {R}^{3}$$ U ⊂ R 3 representing the topography of a terrain. U is approximatively modeled by a special weighted grid. On this grid, the shortest paths for the construction of new routes are determined, whereby we consider three optimization criteria: routes with minimum distance, routes with lowest construction costs and routes with minimum absolute altitude variations or minimum absolute gradients. Subsequently, a combination of these criteria is used to expand this problem into a multi-criteria optimization problem. A shortest path algorithm, such as the Dijkstra algorithm, is used to compute optimal compromises for the construction of new routes.

show abstract

Section: Introductionmentioning

confidence: 99%