Application of dynamic programming to the traveling salesman problem: case study Ghana Education Service Inspectorate Division, Greater Accra Metropolis
| dc.contributor.author | Gandis, Gariba Karmasun | |
| dc.date.accessioned | 2014-03-19T10:37:38Z | |
| dc.date.accessioned | 2023-04-21T18:34:04Z | |
| dc.date.available | 2014-03-19T10:37:38Z | |
| dc.date.available | 2023-04-21T18:34:04Z | |
| dc.date.issued | 2013-05-19 | |
| dc.description | A Thesis Submitted to the Department of Mathematics, Kwame Nkrumah University of Science and Technology in Partial fulfilment of the requirement for the degree of Master of Philosophy, (Industrial Mathematics). | en_US |
| dc.description.abstract | The Traveling Salesman Problem (TSP) arises in many different contexts. In this thesis, we model and solve the Inspectorate division problem of the Ghana Education Service, Accra Metropolis as a Traveling Salesman Problem. The problem is formulated as a network of distances and the solution is presented based on dynamic programming to identify the maximum number of schools an officer can visit with minimum distance. Data on distances were obtained from the Inspectorate Division-GES, Accra. In comparison, the maximum number of schools the officers normally visited was three (3) on a route from past experience whiles our proposed method increased the number of schools to be visited at the same time and condition to five(5). | en_US |
| dc.description.sponsorship | KNUST | en_US |
| dc.identifier.uri | https://ir.knust.edu.gh/handle/123456789/5808 | |
| dc.language.iso | en | en_US |
| dc.title | Application of dynamic programming to the traveling salesman problem: case study Ghana Education Service Inspectorate Division, Greater Accra Metropolis | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- GANDIS GARIBA KARMASUN_M.pdf
- Size:
- 537.68 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full Thesis