Sökning: "Routing problem"

Visar resultat 21 - 25 av 176 uppsatser innehållade orden Routing problem.

  1. 21. A practical framework for the electric vehicle routing problem

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för reglerteknik

    Författare :Johan Hellmark; [2022]
    Nyckelord :Technology and Engineering;

    Sammanfattning : The routing of a delivery fleet is a classical optimization problem, known as the vehicle routing problem (VRP), which can heavily impact the quality of a logistic distribution process. Historically, the VRP formulation has mainly included internal combustion engine vehicles (ICEVs). LÄS MER

  3. 22. Grid-based Energy Aware Mobility Model for FANETs

    Master-uppsats, Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Författare :Mohammad Messbah Uddin; [2022]
    Nyckelord :FANET; Clustering algorithm; Unmanned Aerial Vehicle UAV ; Grid-based clustering; Mobility model; energy consumption; sustainability;

    Sammanfattning : Drones flying in squad formation while interconnected in an ad-hoc fashion are called Flying Ad hoc Networks (FANETs). These FANETs are gathering special interests in the networking community in their deployment for different vital missions. LÄS MER

  4. 23. Quality inspection of multiple product variants using neural network modules

    Master-uppsats, Högskolan i Skövde/Institutionen för ingenjörsvetenskap

    Författare :Fredrik Vuoluterä; [2022]
    Nyckelord :quality inspection; defect detection; variants; modular neural network; convolutional neural network; case study;

    Sammanfattning : Maintaining quality outcomes is an essential task for any manufacturing organization. Visual inspections have long been an avenue to detect defects in manufactured products, and recent advances within the field of deep learning has led to a surge of research in how technologies like convolutional neural networks can be used to perform these quality inspections automatically. LÄS MER

  5. 24. Improving snow removal plans through task reassignment

    Kandidat-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Erik Thomas; [2022]
    Nyckelord :Optimization; Heuristic; Snow removal; Re-routing; Task re-assignment; Ad hoc heuristic;

    Sammanfattning : The planning of snow removal routes is complicated by the fact that the amount it snows, and thus the amount of resources, that is, vehicles, needed to clear it, varies from year to year. This variation has created a demand for a way to quickly generate efficient snow removal plans that take the resources that are available into account. LÄS MER

  7. 25. BGPcredit : A Blockchain-based System for Securing BGP

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

    Författare :Yu Yang Liu; [2022]
    Nyckelord :blockchain; RPKI; consensus algorithm; border gateway protocol; security; blockchain; RPKI; konsensusalgoritm; border gateway-protokoll; säkerhet;

    Sammanfattning : Due to the absence of appropriate security mechanisms, even the latest version of Board Gateway Protocol (BGP) is still highly vulnerable to malicious routing hijacking. The original problem is that BGP allows router to accept any BGP update message without any extra validation process. LÄS MER