Crew Route Scheduling Using the Multiple Traveling Salesman Problems
| dc.contributor.author | Amartei, Percy Nii Amaa | |
| dc.date.accessioned | 2012-06-20T13:39:52Z | |
| dc.date.accessioned | 2023-04-20T01:57:09Z | |
| dc.date.available | 2012-06-20T13:39:52Z | |
| dc.date.available | 2023-04-20T01:57:09Z | |
| dc.date.issued | 2011-06-20 | |
| dc.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 | en_US |
| dc.description.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. | en_US |
| dc.description.sponsorship | KNUST | en_US |
| dc.identifier.uri | https://ir.knust.edu.gh/handle/123456789/4112 | |
| dc.language.iso | en | en_US |
| dc.title | Crew Route Scheduling Using the Multiple Traveling Salesman Problems | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- PERCY NII AMAA AMARTEI.pdf
- Size:
- 973.85 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full Thsesis