Schemaläggning av hissar vid prioritetsanrop : En studie i hantering av prioritetsanrop av hissar på svenska sjukhus vilka styrs av Nearest Car Algorithm

Detta är en Kandidat-uppsats från KTH/Skolan för datavetenskap och kommunikation (CSC); KTH/Skolan för datavetenskap och kommunikation (CSC)

Författare: Elin Clemmedsson; Christoffer Rödöö; [2015]

Nyckelord: ;

Sammanfattning: In our modern society, time is important. Technology is used in countless ways to faster get us from one point to another. The purpose of this report is to inquire whether there is a way to implement an option for personnel at Swedish hospitals to claim priority on an elevator call, and to do this in an efficient way. An ordinary elevator system has been simulated with an implementation of \textit{Nearest Car algorithm}, an algorithm which calculates the most suitable elevator car to serve a specific call considering the distance between the call floor and the car and the direction. Along with this algorithm, different ways to handle priority calls has been implemented to see how they affect the mean transport time for both passengers with priority and regular passengers in the elevator. This has been made to decide if any of these algorithms are suitable for using in practice. It is established that the mean time for priority calls are substantially lower in all tested algorithms and that the ordinary calls mean time are not affected very much. However, it is stated that more thorough tests are required before a conclusion can be made about the implementations effectivity. 

  HÄR KAN DU HÄMTA UPPSATSEN I FULLTEXT. (följ länken till nästa sida)