Sökning: "vehicle routing problem"

Visar resultat 1 - 5 av 52 uppsatser innehållade orden vehicle routing problem.

  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. Estimating Poolability of Transport Demand Using Shipment Encoding : Designing and building a tool that estimates different poolability types of shipment groups using dimensionality reduction.

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

    Författare :Marvin Kërçini; [2023]
    Nyckelord :Poolability; Transport networks; Autoencoder; Dimensionality reduction; Vehicle Routing Problem; Raggruppabilità; Reti di trasporto; Autoencoder; Riduzione della dimensionalità; Vehicle Routing Problem; Poolbarhet; Transportnätverk; Autokodare; Dimensionsreduktion; Fordonsdirigeringsproblem;

    Sammanfattning : Dedicating less transport resources by grouping goods to be shipped together, or pooling as we name it, has a very crucial role in saving costs in transport networks. Nonetheless, it is not so easy to estimate pooling among different groups of shipments or understand why these groups are poolable. LÄS MER

  7. 5. Simulated annealing for Vehicular Ad-hoc Networks

    Master-uppsats, Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)

    Författare :ETHISH VENUMBAKKA; [2023]
    Nyckelord :Simulated Annealing; Vehicle Ad Hoc Networks;

    Sammanfattning : In this thesis, we tackle a significant optimization challenge within Vehicular Ad Hoc Networks (VANETs) by employing a simulated annealing approach. We focus on developing an efficient Vehicle Routing Problem (VRP) algorithm to sift through numerous potential solutions and identify the best one. LÄS MER