Abstract

The objective of the study was to allocate the available buses of the transport authority to the authority's service intra and inter states routes in a manner that will yield optimum profit, taking all the constraints into consideration. The problem was modeled using Linear Programming (LP) and the TORA - computer software result yielded a maximum objective value of N897, 214 per day after 20 iterations, which is a better result compared to the current intuitive schedule by the authority that yields N766, 046 per day.

Highlights

  • Niger State Transport Authority (NSTA) is a state-own transport service operator in Minner, Niger state, Nigeria with the following seven commuting services i

  • The data below were collected in December, 2012 from NSTA headquarters which is located at Shango by Paiko Road, Opposite Trade Fair Complex, Minna

  • Number of Buses per Route per Day: This is the number of buses that NSTA currently allocates to ply a particular route per day Maximum Number of Trips per Bus per Day: This is the maximum number of times that a bus can possibly make a ‘to-and-fro’ journey in a day

Read more

Summary

Introduction

Niger State Transport Authority (NSTA) is a state-own transport service operator in Minner, Niger state, Nigeria with the following seven commuting services i. City service within Minna municipal, Bida and Kontagora towns iv. Haulage and Hire services to all parts of Nigeria v. Passenger Boat service from kofa to kabo in Suleja area council vii. Civil servants and students Bus services within Minna municipal (NSTA, n.d) this study was limited to the first two services – inter and intra state services due to interest and inadequate finance. These routes are as follows: MINNA-BIDA MINNA-MOKWA MINNA-NEW BUSA MINNA-KTAGORA MINNA-KAGARA MINNA-WUSHISHI MINNA-SULEJA MINNA-SERKI PAWA

The Problem Situation
Brief History of NSTA
Brief Literature Review on Linear Programming
Surplus Variables
14. An Augmented solution
Advantages of LP
Disadvantages of LP
Raw Data Collected
Data Analysis
NSTA Problem Formulation
Result of the Problem Formulation
10. Recommendation
11. Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call