Sökning: "shortest path algorithm"
Visar resultat 1 - 5 av 49 uppsatser innehållade orden shortest path algorithm.
1. A Method for Optimizing for Charging Cost in Electric Vehicle Routing
Master-uppsats, Malmö universitet/Institutionen för datavetenskap och medieteknik (DVMT)Sammanfattning : Adoption of electric vehicles has been restrained by the availability of charging stations and consumer fear of being stranded with a depleted battery, far from the nearest charger. In many areas of the world, charging stations are now widely available and the transition from vehicles with internal combustion engines is accelerating, though still in a fairly early stage. LÄS MER
2. Reproducibility and Applicability of a Fuzzy-based Routing Algorithm in Wireless Sensor Networks
Kandidat-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskapSammanfattning : Wireless sensor networks is a broad subject with many applications and interesting research areas, such as optimization within connectivity and energy efficiency. One problem is that most published articles in this field use customized simulation environments and do not provide source code of their implementation. LÄS MER
3. Security Rounds : Enhancing Efficiency and Documentation
Uppsats för yrkesexamina på grundnivå, Högskolan i HalmstadSammanfattning : Security rounds are an important part of the security routines for manyorganizations and companies. This project aims to improve the handling ofsecurity risks and increase safety and efficiency in areas where securitypatrols are conducted. LÄS MER
4. Geospatial Optimisation Methods for Mini-grid Distribution Networks : MSc Sustainable Energy Engineering (SEE)
Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)Sammanfattning : In 2019, 770 million people worldwide lived without electricity. As many as 490 million people could be electrified with 210,000 mini-grids by 2030. Obtaining information for decision-making is crucial to determine the viability of such a project. LÄS MER
5. Implementation av centraliserad Multihop Routing med High Level Architecture : En empirisk undersökning av kontextspecifika heuristiker för effektiv grafsökning
Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskapSammanfattning : I detta arbete har en trådad simulator tagits fram enligt standarden High Level Architecture (HLA). Simulatorn är kapabel att avgöra den kortaste vägen från alla noder till alla andra noder i ett radionätverk med 200 noder på i genomsnitt 263 millisekunder. LÄS MER