Sökning: "Shortest path"

Visar resultat 1 - 5 av 96 uppsatser innehållade orden Shortest path.

  1. 1. Customizable Contraction Hierarchies for Mixed Fleet Vehicle Routing : Fast weight customization when not adhering to triangle inequality

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Martin Larsson; [2023]
    Nyckelord :Contraction Hierarchies; Customizable Contraction Hierarchies; Vehicle Routing Problem; Battery Electric Vehicles; Mixed Fleet; Kontraktionshierarkier; Anpassningsbara Kontraktionshierarkier; Ruttplanering; Batteridrivna elfordon; Blandad fordonsflotta;

    Sammanfattning : As the transport industry shifts towards Battery Electric Vehicles (BEVs) the need for accurate route planning rises. BEVs have reduced range compared to traditional fuel based vehicles, and the range can vary greatly depending on ambient conditions and vehicle load. LÄS MER

  3. 2. Route Planning of Battery Electric Heavy-Duty Commercial Vehicles : Using Contraction Hierarchies and Mixed Integer Programming

    Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Datalogi

    Författare :Olle Delborg; Elias Insulander; [2023]
    Nyckelord :route planning; route optimization; contraction hierarchies; mixed integer programming; vehicle routing problem; electric trucks; electric vehicles; battery; openstreetmap; shortest path; Dijkstra;

    Sammanfattning : This thesis addresses route planning of Battery Electric Heavy-Duty Commercial Vehicles to enhance the reliability of electric vehicle transport. Collaborating with Scania, a Swedish truck manufacturing company, the goal is to develop a pipeline that uses open source data from OpenStreetMap and performs a modified Contraction Hierarchy in order to create a graph that can be used as input to a modified Vehicle Routing Problem formulation using Mixed Integer Programming. LÄS MER

  4. 3. A Method for Optimizing for Charging Cost in Electric Vehicle Routing

    Master-uppsats, Malmö universitet/Institutionen för datavetenskap och medieteknik (DVMT)

    Författare :Matthew Lehrer; [2023]
    Nyckelord :Electric Vehicle Routing; Electric Vehicles; Shortest Path Problem with Constraints; EV; Charging Stations; Cost Optimization;

    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

  5. 4. Reproducibility and Applicability of a Fuzzy-based Routing Algorithm in Wireless Sensor Networks

    Kandidat-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskap

    Författare :Hannes Rönningen; Erik Olofsson; [2023]
    Nyckelord :End-to-end delay; Energy-efficiency; Fuzzy logic; Lifetime maximization; Multi-hop network; Multiobjective optimization; Reinforcement learning; Routing; Routing-protocol; Shortest path; Wireless sensor networks; WSN localization;

    Sammanfattning : 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

  7. 5. Security Rounds : Enhancing Efficiency and Documentation

    Uppsats för yrkesexamina på grundnivå, Högskolan i Halmstad

    Författare :André Jönsson; Mohammad Reza Atayi; [2023]
    Nyckelord :;

    Sammanfattning : 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