University Links: Home Page | Site Map
Covenant University Repository

OPTIMIZING THE MOVEMENT OF PEOPLE AND GOODS IN A LOCAL COMMUNITY USING TRANSPORTATION MODEL

Oreofeoluwa, Bamigboye and Oladipupo, O. O. and Agarana, M. C. and Oluwasanmi, Olabode (2018) OPTIMIZING THE MOVEMENT OF PEOPLE AND GOODS IN A LOCAL COMMUNITY USING TRANSPORTATION MODEL. In: IOP Conf. Series: Materials Science and Engineering.

[img] PDF
Download (373Kb)

Abstract

Transportation problem is one of the real regions of utilization of linear programming, in this paper, we would take a gander at how to upgrade the separation and time taken to make a trip starting with one point then onto the next in a Local community, with Otta Local government area as our concentration, utilizing the transportation display. Having the capacity to accomplish this accomplishment would improve the development of individuals and merchandise inside the organization by sparing time and separation it takes to move starting with one point then onto the next. Google delineate used to figure the separation and time it takes to move from one intersection to the next and a manual test was completed to check the outcomes from google. The ideal arrangement demonstrated that time and separation can be lessened if certain intersections were utilized and if new street is to be made. Three methods would be utilized to locate the underlying achievable arrangement, they are: Northwest corner method, least cost method, Vogel method, Modi method and Best candidate method would be utilized to locate the ideal arrangement

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Transportation Model, Optimal Solution, Best candidate method
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Divisions: Faculty of Engineering, Science and Mathematics > School of Mathematics
Depositing User: Mrs Hannah Akinwumi
Date Deposited: 28 May 2019 08:44
Last Modified: 28 May 2019 08:44
URI: http://eprints.covenantuniversity.edu.ng/id/eprint/12703

Actions (login required)

View Item View Item