Sökning: "greedy algorithm"

Visar resultat 1 - 5 av 60 uppsatser innehållade orden greedy algorithm.

  1. 1. Simultaneous scheduling of railway maintenance and trains : Modelling and solving train interactions close to a maintenance operation

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

    Författare :Pauline Vaillant; [2023]
    Nyckelord :Optimization; Linear programming; Heuristics; Railway scheduling; Maintenance planning; Optimering; Linjärprogrammering; Heuristik; Järnvägsplanering; Underhållsplanering;

    Sammanfattning : Rail transport plays a key role in the mobility of passengers and goods. It is expected to grow the decarbonization of society. In that context, it is important to use the railway network efficiently, and jointly planning trains and network maintenance allows for better use of resources. LÄS MER

  3. 2. AI and real-time Strategy Games

    Master-uppsats, Stockholms universitet/Institutionen för data- och systemvetenskap

    Författare :Juan Pablo Botello Deras; [2023]
    Nyckelord :;

    Sammanfattning : As artificial intelligence continues to progress, applications hope to have AI perform tasks as good, if not better, than a human. A good way to test theoretical applications is through games, simple to complex. LÄS MER

  4. 3. Design and Analysis of Non-symmetric Satellite Constellations

    Master-uppsats, KTH/Lättkonstruktioner, marina system, flyg- och rymdteknik, rörelsemekanik

    Författare :Jomuel Danilo Costales; [2023]
    Nyckelord :Space; Satellite; Constellation; Coverage; Non-symmetric; Walker; Set Cover problem; Greedy algorithm; Space; Satellit; Constellation; Täckning; Icke-symmetrisk; Walker; Set Cover problem; Greedy algoritm;

    Sammanfattning : Satellite constellation design has been a well-studied problem since the beginning of the space age. In recent years new concepts and approaches tried to solve it with fewer satellites whilst guaranteeing coverage to the areas of interest, whether globally or regionally. LÄS MER

  5. 4. Order Matching Optimization : Developing and Evaluating Algorithms for Efficient Order Matching and Transaction Minimization

    Master-uppsats, Linköpings universitet/Produktionsekonomi

    Författare :Victor Jonsson; Adam Steen; [2023]
    Nyckelord :Order Matching; Mixed Integer Optimization; Minimum Common Integer Partition Problem; Algorithms; Call Auction Trading;

    Sammanfattning : This report aimed to develop algorithms for solving the optimization problem of matchingbuy and sell orders in call auctions while minimizing the number of transactions. The developed algorithms were evaluated based on their execution time and solution accuracy. LÄS MER

  7. 5. Implementation of an Irregular Packaging Algorithm for Multi-Container

    Master-uppsats, Uppsala universitet/Industriell teknik

    Författare :Azad Fakhir Salih; [2023]
    Nyckelord :irregular packaging problem; genetic algorithm; bottom-left placement; polygon-based geometric representation; proximity-based strategies;

    Sammanfattning : This study introduces an innovative approach to address a complex, real-world packing problem experienced at Emerson Rosemount Tank Radar. The objectives of the study are manifold: primarily, the optimization of packing efficiency within specified geometric and box constraints, and secondarily, the fulfillment of specific packing objectives. LÄS MER