KNUSTSpace >
Theses / Dissertations >
College of Science >

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

Title: Crew Route Scheduling Using the Multiple Traveling Salesman Problems
Authors: Amartei, Percy Nii Amaa
Issue Date: 20-Jun-2011
Abstract: Most of the coverage of maintenance operations of the technical men of the Electricity Company of Ghana (ECG) is unplanned. They have to move from one substation to the other to work on faults and cables as well as perform routine maintenance of which the maintenance schedule needs planning. This thesis uses the multiple traveling salesman problem model to plan the routes of a given number of maintenance crew so as to reduce the cost of traveling. Data used was distances of cities from ECG map of substations and transformers location in the Makola district from period 2003 to date. An algorithm was used to input the distances in Matlab. The algorithm was run ten different times varying the number of maintenance crew from two to five. The maintenance crew of two after all the tours covered the distance of 21.8100km being the minimized distance and routes for each of the maintenance crew was modeled with the two maintenance crew being the best.
Description: A thesis submitted to the School of Graduate Studies, Kwame Nkrumah University of Science and Technology, Kumasi, in partial fulfilment of the requirements for the award of the Degree of Master of Science, 2011
URI: http://hdl.handle.net/123456789/4112
Appears in Collections:College of Science

Files in This Item:

File Description SizeFormat
PERCY NII AMAA AMARTEI THESIS 2011.pdf780.8 kBAdobe PDFView/Open

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