Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms

M. Fawad Zazai () and Armin Fügenschuh ()
Additional contact information
M. Fawad Zazai: Helmut Schmidt University
Armin Fügenschuh: Helmut Schmidt University

A chapter in Operations Research Proceedings 2017, 2018, pp 467-473 from Springer

Abstract: Abstract Afghanistan is geo-strategically in an important transit zone in South and Central Asia, but currently lacks of modern infrastructure. We present the construction of optimal transit routes in Afghanistan through mathematical optimization. Basically there are three different optimization goals (a) the shortest route w.r.t. the distance, (b) the cheapest route w.r.t. the construction cost, and (c) the most convenient route w.r.t. the elevation change. It is possible to combine two objectives by considering the Pareto front. For the design and modeling of the routes, a computer program named “Contra ” (Computing an Optimal Network of Transit Routes through mathematical Algorithms) was developed. As a demonstrator example, we compute Pareto-optimal routes between two Afghan cities.

Keywords: Afghanistan; Transit routes; Shortest path problem; Graph theory; Dijkstra’s algorithm; Computational geometry (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_62

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

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

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().