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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Dijkstra, E. (1959). A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1(1), 269–271.
Afghanistan Information Management Services (AIMS), Land Cover of Afghanistan (1997), 2014, http://www.aims.org.af/. Retrieved July 3, 2017.
Consortium for Spatial Information (CGIAR-CSI), SRTM 90m Digital Elevation Database v4.1, https://goo.gl/g2LQYC. Retrieved July 3, 2017.
Asian Development Bank (ADB), Proposed Asian Development Fund Grant Islamic Republic of Afghanistan: Road Network Development Project 1, Report and Recommendation of the President to the Board of Directors 40333, 2007, https://goo.gl/U9E9jR. Retrieved July 3, 2017.
Minister of Public Works and Government Services Canada, Northern Land Use Guidelines - Access: Roads and Trails, Tech. Rep. 5, Minister of Indian Affairs and Northern Develop. and Federal Interlocutor for Métis and Non-Status Indians, Ottawa, 2010, https://goo.gl/6Xd19b. Retrieved July 3, 2017.
Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zazai, M.F., Fügenschuh, A. (2018). Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-89920-6_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89919-0
Online ISBN: 978-3-319-89920-6
eBook Packages: Business and ManagementBusiness and Management (R0)