Optimal Visitation of Base Transciever Station Site: (Case Study of Vodafone Network; New Juabeng Municipality, Eastern Region, Ghana)

Thumbnail Image
Journal Title
Journal ISSN
Volume Title
This research work presents a case study of the optimal visitation of Base Transceiver Station (BTS) site in a mobile communication network. The main objective is to formulate a mathematical model that takes into consideration the actual distances between the twenty four (24) BTS Site. Also to determine the optimal route for visiting the entire twenty four (24) BTS Site within the New Juabeng Municipality to minimize travelling cost, time and distance for Vodafone maintenance Engineers and entire sub-contractors working on the BTS sites. The problem is formulated as an Integer Programming Model and solution is presented via the simulated Annealing Algorithms based Meta-heuristic for the Travelling Salesman Problem. Data on distances were collected from potential length Between the BTS and with a Matlab implementation codes, results are obtained. In comparison with the existing routing system at Vodafone Network the results evince the outperformance of the simulated Annealing algorithm in terms of efficiency. In fact, the simulated Annealing results reveal a tremendous improvement in the total route length by approximately 45%.
A thesis submitted to the Institute of Distance Learning, Kwame Nkrumah University of Science and Technology in partial fulfilment of the requirement for the award of Master of Science degree in Industrial Mathematics.