Sökning: "multiobjective optimization"

Visar resultat 1 - 5 av 12 uppsatser innehållade orden multiobjective optimization.

  1. 1. Optimal Capacity Connection Queue Management for TSOs and DSOs

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

    Författare :Therese Nilsson Rova; [2023]
    Nyckelord :Power System Optimization; Connection Queue Management; Genetic Algorithm; Transmission Expansion Planning;

    Sammanfattning : As the electricity demand increases dramatically in Sweden, the need of using the existing electricity grid as efficiently as possible gains more importance. Simultaneously as needs expand, so does production in the form of wind parks and solar parks. LÄS MER

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

  4. 3. Active Learning for Solving Expensive Optimization Problems

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Siwei Fu; [2022]
    Nyckelord :;

    Sammanfattning : Many practical engineering and computer science problems can be translated into a global otimization problem where the task is to find the best (optimal) vector 𝒙𝒙∗ that gives the smallest possible function value 𝑓𝑓 = 𝑓𝑓(𝒙𝒙∗) for some function 𝑓𝑓() of interest. Often the function 𝑓𝑓() is expensive in the sense that it cannot be easily evaluated computationally or experimentally in terms of time and/or resources required. LÄS MER

  5. 4. Multiobjective Optimization of a Pre-emptive Flexible Job-shop Problem with Machine Transportation Delay

    Kandidat-uppsats, Mälardalens universitet/Akademin för innovation, design och teknik

    Författare :Albin Eriksson; [2022]
    Nyckelord :multiobjective optimization; nsga-ii; scheduling problem;

    Sammanfattning : The job scheduling problem is a type of scheduling problem where a list of jobs and machines are given. A solution consists of a schedule where each job is assigned to one or multiple machines at a certain time. LÄS MER

  7. 5. Fair Partitioning of Procedurally Generated Game Maps for Grand Strategy Games

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Jens Ottander; [2022]
    Nyckelord :Procedural map generation; Constrained optimization; Categorical optimization; Multiobjective optimization; Genetic algorithms; NSGA-III; MOEA D-IEpsilon; Grand Strategy Games; Partitioning; Multiplayer Games;

    Sammanfattning : Due to the high cost of manual content creation within the game development industry, methods for procedural generation of content such as game maps and levels have emerged. However, methods for generating game maps have remained relatively unexplored in competitive multiplayer contexts. LÄS MER