Non-iterative algorithm for finding shortest route
by Daniel Maposa; Ndava Constantine Mupondo; Trust Tawanda
International Journal of Logistics Economics and Globalisation (IJLEG), Vol. 6, No. 1, 2014

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.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Economics and Globalisation (IJLEG):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email