Sökning: "Combinatorial Optimization"

Visar resultat 1 - 5 av 48 uppsatser innehållade orden Combinatorial Optimization.

  1. 1. Comparison of two mixed integer solvers with real world data from combinatorial auctions

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

    Författare :Kristoffer Norrman; [2023]
    Nyckelord :;

    Sammanfattning : Coupa is a software company specialising in Business Spending Management, BSM. In the Uppsala office they utilise MIP solvers to help their clients lower sourcing outlays by translating sourcing auc- tions into MIP problems [1] [2]. LÄS MER

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

  4. 3. The Applicability and Scalability of Graph Neural Networks on Combinatorial Optimization

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Peder Hårderup; [2023]
    Nyckelord :applied mathematics; combinatorial optimization; machine learning; graph neural networks; scalability; tillämpad matematik; kombinatorisk optimering; maskininlärning; grafiska neurala nätverk; skalbarhet;

    Sammanfattning : This master's thesis investigates the application of Graph Neural Networks (GNNs) to address scalability challenges in combinatorial optimization, with a primary focus on the minimum Total Dominating set Problem (TDP) and additionally the related Carrier Scheduling Problem (CSP) in networks of Internet of Things. The research identifies the NP-hard nature of these problems as a fundamental challenge and addresses how to improve predictions on input graphs of sizes much larger than seen during training phase. LÄS MER

  5. 4. Improving software testing speed : using combinatorics

    Kandidat-uppsats, Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)

    Författare :Sami Mwanje; [2023]
    Nyckelord :Testing optimization; Test time reduction; Test quality; Machine learning; Mathematical models; Software testing; Combinatorial testing; Au- tomation; Embedded systems; Pairwise Testing;

    Sammanfattning : Embedded systems hold immense potential, but their integration into advanced devices comes with significant costs. Malfunctions in these systems can result inequipment failures, posing serious risks and potential accidents. LÄS MER

  7. 5. Coverage Motion Planning for Search and Rescue Missions : A Costmap Based Approach for fixed wing UAVs using Simulated Annealing &Cubic Splines

    Master-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Författare :Fredrik Rönnkvist; [2023]
    Nyckelord :Motion planning; Path planning; Cubic splines; Coverage path planning.;

    Sammanfattning : The present study proposes a novel approach to Coverage Path Planning for unmanned aerial vehicle (UAV) inspired by the Orienteering Problem. The main goal is to develop an algorithm suitable for Search and Rescue Missions, which can produce a search pattern with dynamical constrains, that is not limited to the traditional back-and-forth motion or spiral patterns. LÄS MER