On Application of Dynamic Program Fixed Point Iterative Method of Optimization in the Determination of the Shortest Route (Path) Between Government House and Amuzukwu Primary School, All in Umuahia, Abia StateOn Application of Dynamic Program Fixed Point On Application of Dynamic Program Fixed Point Iterative Method of Optimization in the Determination of the Shortest Route (Path) Between Government House and Amuzukwu Primary School, All in Umuahia, Abia State

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 work with the formula
xf
xxFXSSUiuinnkjijnj10*,,min,min,distminijniijijkudiUSS,,,,,00sourcesink
Such that
dd
dikjkijijkjik,,,
with the pivot row and pivot column being row k.
Then, evaluation of the shortest route between Government House and Amuzukwu Primary School all in Umuahia and Abuja by the above method revealed it to be 720 m by taking the route SACDFG.
It was remarked that the longest route which is the route form government House to Ibiam road, to Aba road, to Warri road, to Club road, to Uwalaka road, and finally to Amuzukwu Road which now terminates at our Destination, Amuzukwu Primary School with Road distance of 2590 m does not posses other advantages while it should be made use of. The shortest routes were necessarily recommended to road users as the best route to use because its route SACDJFGT is the shortest route with the distance of 1790 m.

Article Details

Section
Research Article

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.