Non-iterative algorithm for finding shortest route

Daniel Maposa, Ndava Constantine Mupondo and Trust Tawanda

International Journal of Logistics Economics and Globalisation, 2014, vol. 6, issue 1, 56-77

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.

Keywords: travelling salesman problem; TSP; non-iterative algorithms; shortest route; tableau; network problems; networks. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=64294 (text/html)
Access to full text is restricted to subscribers.

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:ids:injleg:v:6:y:2014:i:1:p:56-77

Access Statistics for this article

More articles in International Journal of Logistics Economics and Globalisation from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().