On the Application of Dynamic Programming Fixed-Point Iterative Method in the Determination of the Shortest Route/Path between Umuahia and Abuja, all in Nigeria

Main Article Content

Eziokwu C. Emmanuel

Abstract

In this research, dynamic programming seeks to address the problem of determining the shortest path between a source and a sink by the method of a fixed-point iteration well defined in the metric space (X,d), d the distance on X=U the connected series of edges that suitably works with the formula
xf
xxFXdistSSUinnkj+=()==()=()= 10*,min,
=
=+
==ijnjijniijijkuiudiUSsourceS,,min,,,,,min00ssink
Such that
dd
dijkjik+, ikjkij≠≠≠,,
With the pivot row and pivot column being row k.
Then, evaluation of the shortest route between Umuahia and Abuja by the above method revealed it to be 702 km by going from Umuahia through Enugu through Ankpa through Lokoja and then to Abuja (i.e., TED GS. by the Backward dynamic method)

Article Details

How to Cite
Emmanuel, E. C. . (2022). On the Application of Dynamic Programming Fixed-Point Iterative Method in the Determination of the Shortest Route/Path between Umuahia and Abuja, all in Nigeria. Asian Journal of Mathematical Sciences(AJMS), 5(4). https://doi.org/10.22377/ajms.v5i4.401
Section
Research Article