| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 2.33 MB | Adobe PDF |
Advisor(s)
Abstract(s)
Este projecto tem como objectivo a optimizaĆ§Ć£o das rotas dos tĆ©cnicos de serviƧo apĆ³s venda da Schmitt+Sohn Elevadores, associadas Ć realizaĆ§Ć£o das manutenƧƵes preventivas a cada elemento contratado Ć empresa (elevadores, escadas rolantes, etc). Como tal, Ć© necessĆ”rio fazer uma distribuiĆ§Ć£o dos equipamentos que se encontram em carteira, por um dos tĆ©cnicos que assegura a manutenĆ§Ć£o, pelos vĆ”rios dias Ćŗteis de cada mĆŖs, e pelas horas
de trabalho de cada dia. Apesar do tĆ©cnico ter disponĆveis, por dia, 8h de trabalho, apenas 6h podem ser preenchidas com manutenƧƵes preventivas. As 2h restantes sĆ£o essencialmente para possĆveis manutenƧƵes correctivas para as quais o tĆ©cnico seja solicitado. Caso o tĆ©cnico nĆ£o seja contactado para resolver nenhuma avaria, essas horas podem ser utilizadas pelo mesmo para adiantar trabalho do dia seguinte, isto Ć©, visitar jĆ” alguns dos prĆ³ximos pontos de manutenĆ§Ć£o preventiva do dia seguinte, ou para compensar trabalho que esteja atrasado. De salientar que, para cada dia, as deslocaƧƵes do tĆ©cnico de
qualquer local ao primeiro ponto de uma rota ou de regresso do Ćŗltimo ponto de uma rota nĆ£o sĆ£o contabilizadas.
O trabalho desenvolvido nesta dissertaĆ§Ć£o pretende dar resposta ao problema apresentado pela Schmitt+Sohn Elevadores. Para isso foi desenvolvida uma heurĆstica para a optimizaĆ§Ć£o das rotas dos tĆ©cnicos. Esta Ć© baseada no conceito de āvizinho mais prĆ³ximoā que procura sempre o ponto que se apresenta mais perto do Ćŗltimo ponto que foi adicionado Ć rota. Com base nesta metodologia, nos processos de escolha dos pontos que formam clusters, e na selecĆ§Ć£o dos pontos iniciais de cada uma das rotas diĆ”rias, a ferramenta de optimizaĆ§Ć£o resultante define as rotas diĆ”rias para que o percurso efectuado por cada tĆ©cnico num mĆŖs seja o menor possĆvel. SĆ£o feitas alteraƧƵes Ć s rotas definidas inicialmente quando encontrados pontos de uma mesma entrada a serem visitados em dias diferentes. Isto obrigaria o tĆ©cnico a fazer duas viagens ao mesmo local. Por fim, o resultado Ć© apresentado num documento Word a ser utilizado pelo tĆ©cnico como guia diĆ”rio das suas deslocaƧƵes aos equipamentos que necessitam de verificaƧƵes periĆ³dicas. Os resultados obtidos foram comparados com as rotas que estavam a ser usadas pela empresa, tendo apresentado resultados de melhor qualidade, constatando-se a eficiĆŖncia da soluĆ§Ć£o criada pelo algoritmo proposto neste trabalho.
The objective of this project is to optimize the routes of the service technicians after sales of Schmitt+Sohn Elevators, related to the execution of the preventive maintenance to each element contracted to the company (elevators, escalators, etc). Thus, it is necessary to make a distribution of the equipments that are on the wallet, by one of the technicians that ensure the maintenance, by all the available days of the week of each month and by the hours of work of each day. Although the technician has 8 hours of work available by day, only 6 of them can be associated with planned preventive maintenances. The other 2 hours are essencially to possible corrective maintenances that the technician could be called to solve. If the technician isnāt called to solve a breakdown those other hours could be used by him to advance work of the next day, like visiting already some of the following points of preventive maintenance of the next day, or compensate work that is late. Noteworthy that, for each day, the traveling time of the technician from any location to the first point of a route or from the last point of a route at the end of the day arenāt count in the solution. The work developed in this thesis provides an answer to the problem presented by Schmitt+Sohn Elevators. For that was developed an heuristic to the optimization of the technician routes. This heuristic is based on the ānearest neighborā concept which searches always for the point that is closer to the last one that was added to the route. Based on this methodology, on the choice processes of the points that form clusters, and on the selection of the initial points of each route for each day, the optimization tool defines the daily routes for the course done by each technician on a month to be the shortest possible. Changes are made to the routes defined initially when points from the same entry are founded being visited in different days. This would force the technician to do two trips to the same place. In the end, the result is presented in a Word document to be used by the technician as a daily guide to his travels to the equipments that need periodic verifications. The obtained results were compared with the routes that were being used by the company, with the first ones presenting results of better quality, confirming the efficiency of the algorithm proposed in this work.
The objective of this project is to optimize the routes of the service technicians after sales of Schmitt+Sohn Elevators, related to the execution of the preventive maintenance to each element contracted to the company (elevators, escalators, etc). Thus, it is necessary to make a distribution of the equipments that are on the wallet, by one of the technicians that ensure the maintenance, by all the available days of the week of each month and by the hours of work of each day. Although the technician has 8 hours of work available by day, only 6 of them can be associated with planned preventive maintenances. The other 2 hours are essencially to possible corrective maintenances that the technician could be called to solve. If the technician isnāt called to solve a breakdown those other hours could be used by him to advance work of the next day, like visiting already some of the following points of preventive maintenance of the next day, or compensate work that is late. Noteworthy that, for each day, the traveling time of the technician from any location to the first point of a route or from the last point of a route at the end of the day arenāt count in the solution. The work developed in this thesis provides an answer to the problem presented by Schmitt+Sohn Elevators. For that was developed an heuristic to the optimization of the technician routes. This heuristic is based on the ānearest neighborā concept which searches always for the point that is closer to the last one that was added to the route. Based on this methodology, on the choice processes of the points that form clusters, and on the selection of the initial points of each route for each day, the optimization tool defines the daily routes for the course done by each technician on a month to be the shortest possible. Changes are made to the routes defined initially when points from the same entry are founded being visited in different days. This would force the technician to do two trips to the same place. In the end, the result is presented in a Word document to be used by the technician as a daily guide to his travels to the equipments that need periodic verifications. The obtained results were compared with the routes that were being used by the company, with the first ones presenting results of better quality, confirming the efficiency of the algorithm proposed in this work.
Description
Keywords
Rotas de veĆculos ManutenƧƵes Preventivas Equipamentos HeurĆstica de āvizinho mais prĆ³ximoā Algoritmo Routes of Vehicles Preventive Maintenances Equipments āNearest Neighborā Heuristic Algorithm