Optimal Campaign Visitation of Presidential Aspirants Case Study: Brong Ahafo Region of Ghana
Loading...
Date
2010
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This research presents a solution to the problem of a presidential candidate having to visit all the twenty four constituency capitals in the Brong Ahafo Region campaigning. This problem is formulated as a travelling salesman problem (TSP). TSP involves finding an optimal route for visiting cities and returning to the point of origin. The formulation of the TSP in this work is based on symmetric TSP.
This research presents the solution based on Simulated Annealing (SA) method. A Matlab code for the TSP algorithm was used to solve the problem of a presidential candidate visiting all the twenty four constituency capitals in the Brong Ahafo Region campaigning.
The result obtained in the study showed that the optimal route that can be considered is Sunyani Domase Duayaw Nkwanta Bechem Hwediem Kenyase
Kukuom Goaso Wamfie Dormaa-Ahenkro Berekum Drobo Sampa Nsokor Wenchi Techiman Nkoranza Busuaa Kwame Danso Atebubu Jema Tuobodom Sunyani and 980km would be covered.
Description
A Thesis submitted to the Department of Mathematics Kwame Nkrumah University of Science and Technology Kumasi, in partial fulfilment of the requirements for the award of Master of Science degree in Industrial Mathematics at the Institute Of Distance Learning