Authors: Daniel Maposa; Ndava Constantine Mupondo; Trust Tawanda
Addresses: Monash South Africa Campus, Monash University Australia, Private Bag X60, Roodepoort, 1725, South Africa ' Department of Applied Mathematics, National University of Science and Technology, P.O. Box AC 939, Ascot, Bulawayo, Zimbabwe ' Department of Applied Mathematics, National University of Science and Technology, P.O. Box AC 939, Ascot, Bulawayo, Zimbabwe
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.
International Journal of Logistics Economics and Globalisation, 2014 Vol.6 No.1, pp.56 - 77
Received: 08 May 2021
Accepted: 12 May 2021
Published online: 14 Aug 2014 *