We are excited to announce that the repository will soon undergo an upgrade, featuring a new look and feel along with several enhanced features to improve your experience. Please be on the lookout for further updates and announcements regarding the launch date. We appreciate your support and look forward to unveiling the improved platform soon.
dc.contributor.author | McGladdery, Duncan![]() |
|
dc.date.accessioned | 2019-02-04T13:11:30Z | |
dc.date.available | 2019-02-04T13:11:30Z | |
dc.date.created | 2017 | |
dc.date.issued | 2017 | |
dc.description | Mini Dissertation (B Eng. (Industrial and Systems Engineering))--University of Pretoria, 2017. | en_ZA |
dc.description.abstract | Bus Company (BUSCO) approached Fourier-E, an industrial engineering company, to develop and optimise the Duty Master for their Sowetan operations. The Duty Master is a scheduling blue print that dictates the operations and management of a company's bus eet. Through the manipulation of positioning routes and depot allocations, a Duty Master should minimise distances travelled and eet size. In doing so, operating costs are reduced. Fourier-E had already developed their own algorithm for BUSCO's Sowetan Duty Master, which had resulted in substantial savings in the number of busses required to complete all revenue routes and total distances travelled. However, the run-time of their model of approximately 20 minutes to generate a solution is a serious limitation and prohibitive for client use. The primary aim of this project was to develop an online user-friendly model to en- able BUSCO to rapidly solve their eet scheduling requirements. Speci cally, the new algorithm had to be capable of generating a solution for the Duty Master in less than ten seconds. To accommodate the reduction in run-time, Fourier-E speci ed that the devel- oped algorithm must generate a solution which is at least 80% as good as their existing one in terms of busses saved and positioning kilometres driven. The problem of developing the Duty Master can be modelled as a Mulit-Depot Vehi- cle Routing Problem with Pickup and Delivery, Time Windows and Intermediate Facili- ties (MDVRPPDTWIF). To solve the problem, a greedy-heuristic was developed, called \Greedy-Bin". Computational tests showed that the algorithm exceeds all Fourier-E's speci cations and performs particularly well in run speed, whch at 1.23 seconds, is 976 times faster than the existing approach. The Greedy Bin algorithm performs at 88% of Fourier-E's with regards to busses saved and 96.7% for kilometres saved. The Greedy-Bin algorithm met all validation criteria. In order for clients to access the algorithm, an online user interface was developed which enables rapid evaluation of various operatonal scenarios. To achieve this, ve variables that can be manipulated by the client were added to the model, namely: bus speed, revenue routes, loading bu er, distance bu er and day and night depot capacities. Model outputs are: the number of busses needed to complete all revenue routes, positioning distance, depot allocations and eet utilisation throughout the day. Manipulation of the Duty Master model also demonstrates its capacity to save on oper- ating expenses by generating alternative solutions for depot allocations. Additionally, the nancial implications of changing bus speeds and manipiulating loading and positioning bu ers are demonstrated. Finally, in an industry where tenders for new revenue routes are highly competitive, the model can be used to assess the potential nancial implications of adding new routes and in doing so, inform the decision of whether or not to tender for those routes. | en_ZA |
dc.format.medium | en_ZA | |
dc.identifier.uri | http://hdl.handle.net/2263/68393 | |
dc.language | en | |
dc.language.iso | en | en_ZA |
dc.publisher | University of Pretoria. Faculty of Engineering, Built Environment and Information Technology. Dept. of Industrial and Systems Engineering | en_ZA |
dc.rights | © 2017 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. | en_ZA |
dc.subject | Mini-dissertations (Industrial and Systems Engineering) | en_ZA |
dc.title | Greedy Algorithm and Model for Analysis of a Bus Fleet's Operations | en_ZA |
dc.type | Mini Dissertation | en_ZA |