KNUSTSpace >
Theses / Dissertations >
Distance Learning >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/5808

Title: Application of dynamic programming to the traveling salesman problem: case study Ghana Education Service Inspectorate Division, Greater Accra Metropolis
Authors: Gandis, Gariba Karmasun
Issue Date: 19-May-2013
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).
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), May-2013
URI: http://hdl.handle.net/123456789/5808
Appears in Collections:Distance Learning

Files in This Item:

File Description SizeFormat

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback