Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Crew Route Scheduling Using the Multiple Traveling Salesman Problems

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

Saved in:
Bibliographic Details
Main Author: Amartei, Percy Nii Amaa
Format: Thesis
Language:English
Published: 2012
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613134210990080
access_status_str Open Access
author Amartei, Percy Nii Amaa
author_browse Amartei, Percy Nii Amaa
author_facet Amartei, Percy Nii Amaa
author_sort Amartei, Percy Nii Amaa
collection Thesis
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
format Thesis
id oai:ir.knust.edu.gh:123456789/4112
institution KNUST (Ghana)
language English
last_indexed 2026-06-10T12:31:18.486Z
license_str Not specified — see source repository
provenance_str_mv Harvested via OAI-PMH from KNUSTSpace — Kwame Nkrumah University of Science & Technology (Ghana)
publishDate 2012
publishDateRange 2012
publishDateSort 2012
record_format dspace
source_str KNUSTSpace — Kwame Nkrumah University of Science & Technology (Ghana)
spelling oai:ir.knust.edu.gh:123456789/4112 Crew Route Scheduling Using the Multiple Traveling Salesman Problems Amartei, Percy Nii Amaa 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 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. KNUST 2012-06-20T13:39:52Z 2023-04-20T01:57:09Z 2012-06-20T13:39:52Z 2023-04-20T01:57:09Z 2011-06-20 Thesis https://ir.knust.edu.gh/handle/123456789/4112 en application/pdf
spellingShingle Amartei, Percy Nii Amaa
Crew Route Scheduling Using the Multiple Traveling Salesman Problems
title Crew Route Scheduling Using the Multiple Traveling Salesman Problems
title_full Crew Route Scheduling Using the Multiple Traveling Salesman Problems
title_fullStr Crew Route Scheduling Using the Multiple Traveling Salesman Problems
title_full_unstemmed Crew Route Scheduling Using the Multiple Traveling Salesman Problems
title_short Crew Route Scheduling Using the Multiple Traveling Salesman Problems
title_sort crew route scheduling using the multiple traveling salesman problems
url https://ir.knust.edu.gh/handle/123456789/4112
work_keys_str_mv AT amarteipercyniiamaa crewrouteschedulingusingthemultipletravelingsalesmanproblems