IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-89920-6_62.html
   My bibliography  Save this book chapter

Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms

In: Operations Research Proceedings 2017

Author

Listed:
  • M. Fawad Zazai

    (Helmut Schmidt University
    University of the Federal Armed Forces)

  • Armin Fügenschuh

    (Helmut Schmidt University
    University of the Federal Armed Forces)

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.

Suggested Citation

  • M. Fawad Zazai & Armin Fügenschuh, 2018. "Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms," Operations Research Proceedings, in: Natalia Kliewer & Jan Fabian Ehmke & Ralf Borndörfer (ed.), Operations Research Proceedings 2017, pages 467-473, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-89920-6_62
    DOI: 10.1007/978-3-319-89920-6_62
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-89920-6_62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.