This report is about how an Internet of Things (IoT) optimization can be done with Machine learning (ML). The IoT- devices in this report are sensors in containers that read how full the containers are. The report contains a case from Sogeti. Were a client can use this optimization to get better routes for their garbage truck, with this solution the garbage trucks will only go to full containers and be able to skip empty or close to empty containers. This will result in less fuel costs and a better environment. This solution can be used for every industry that needs a route optimization. To do this there must first be understanding for what IoT is and what is possible to do with it then there need to be understanding about ML. The report cover these parts and tell how the method Design science (DS) is being used to produce this solution and some information about the method. This project also works agile with iterations under the implementation stage in DS. On the ML part there is an argumentation of a comparison of witch algorithm should be used. There are two candidates: Hill- Climbing and K-means Cluster. For this solution K-means cluster will be the one being used. K-means clustering is an unsupervised algorithm that doesn’t need practice data, it pairs data that are very similar and builds clusters. It will do this with full containers and build clusters with the ones that have similar coordinates so the full containers are close to each other. When this is done the clusters exports to a database and then there is a brief description on how its possible to make a map that makes a route between the containers in the cluster.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:his-13747 |
Date | January 2017 |
Creators | Hellborg, Per |
Publisher | Högskolan i Skövde, Institutionen för informationsteknologi |
Source Sets | DiVA Archive at Upsalla University |
Language | Swedish |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0023 seconds