Sökning: "Routing problem"

Visar resultat 6 - 10 av 176 uppsatser innehållade orden Routing problem.

  1. 6. Analysis and time calculations of NC files : Time calculation of Nailing Bridge machine movements

    Kandidat-uppsats, Högskolan i Halmstad/Akademin för informationsteknologi

    Författare :Julia Rohnér; Emelie Sköld; [2023]
    Nyckelord :CNC-Machines; NC files; time calculations;

    Sammanfattning : Randek is a company that develops machines. The machines are used to build prefabricated houses. They have developed a CNC machine called Nailing Bridge that creates house walls. One of their issues is that they must predict the time it takes to build a wall because their customers need to know how long it takes to deliver their house. LÄS MER

  3. 7. 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

  4. 8. 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

  5. 9. Transport logistics for a biogas plant : an approach for an optimal collection of manure from local farms by the planned biogas plant Biogas Väst Skaraborg AB

    Master-uppsats, SLU/Dept. of Economics

    Författare :Adam Landelius; William Wejsfelt; [2023]
    Nyckelord :VRP; IRP; VRPB; IRPB; logistics; optimising; biogas;

    Sammanfattning : Vehicle routing problems (VRPs) are a prevalent concern for businesses that rely on effective logistics to collect and transport items. Biogas Väst, a company that collects liquid manure from local farms and returns residue, is facing a VRP that includes both linehaul and backhaul operations. LÄS MER

  7. 10. Heuristic Clustering Methods for Solving Vehicle Routing Problems

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Georgios Nordqvist; Erik Forsberg; [2023]
    Nyckelord :optimization; vehicle routing problem; sweep clustering; k-means clustering; hierarchical clustering;

    Sammanfattning : Vehicle Routing Problems are optimization problems centered around determining optimal travel routes for a fleet of vehicles to visit a set of nodes. Optimality is evaluated with regard to some desired quality of the solution, such as time-minimizing or cost-minimizing. LÄS MER