IDEAS home Printed from https://ideas.repec.org/a/ids/injleg/v6y2014i1p56-77.html
   My bibliography  Save this article

Non-iterative algorithm for finding shortest route

Author

Listed:
  • Daniel Maposa
  • Ndava Constantine Mupondo
  • Trust Tawanda

Abstract

The use of non-iterative shortest route algorithm for finding shortest route between points in a network is illustrated. The non-iterative approach can be applied to various network problems that can be solved using shortest route algorithm and provides a solution with much less effort. The algorithm makes use of an n × n tableau to produce an optimum solution. The non-iterative technique provides an efficient solution procedure in terms of computational savings for large versions of network problems. The study revealed that problems can be solved using a reasonable amount of computer time by the non-iterative algorithm when other approaches are computationally unrealistic. This paper also establishes that the travelling salesman problem can be solved by non-iterative approach.

Suggested Citation

  • Daniel Maposa & Ndava Constantine Mupondo & Trust Tawanda, 2014. "Non-iterative algorithm for finding shortest route," International Journal of Logistics Economics and Globalisation, Inderscience Enterprises Ltd, vol. 6(1), pages 56-77.
    • Handle: RePEc:ids:injleg:v:6:y:2014:i:1:p:56-77
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=64294
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:injleg:v:6:y:2014:i:1:p:56-77. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=64 .

    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.