Essays about: "Combinatorial optimization"

Showing result 6 - 10 of 47 essays containing the words Combinatorial optimization.

  1. 6. The Quantum Approximate Optimization Algorithm and it's Applications

    University essay from Uppsala universitet/Institutionen för fysik och astronomi

    Author : Erik Bashore; [2023]
    Keywords : Quantum computing; quantum optimization; combinatorial optimization problems;

    Abstract : This is a project with the ambition of demonstrating the possibilities and applications of the quantum approximation optimization algorithm (QAOA). Throughout the paper discussions on the theoretical background and fundamentals of the algorithm will be done by examining the relevant nomenclature. READ MORE

  3. 7. Reinforcement learning for improved local search : Applied to the graph coloring problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Adrian Salamon; Klara Sandström; [2023]
    Keywords : ;

    Abstract : The graph coloring problem (GCP) is an important combinatorial optimization problem (COP) with various applications and a simple formulation: to assign colors to vertices in a graph such that no adjacent vertices share a color. The GCP is NP-hard, and in order to solve it within a reasonable time frame, heuristic local search (LS) based algorithms are commonly used. READ MORE

  4. 8. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones

    University essay from KTH/Geoinformatik

    Author : Carolina Offenbacher; Ellen Thornström; [2022]
    Keywords : Capacitated Vehicle Routing Problem; Electrical distribution network; Heuristic algorithm; Scheduling; Handelsresandeproblemet; Eldistributionsnätverk; Heurustik algortim; Schemaläggning;

    Abstract : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. READ MORE

  5. 9. Discrete Flower Pollination Algorithm for the Graph Coloring Problem

    University essay from KTH/Datavetenskap

    Author : Samuel Falk; Erik Nordlöf; [2022]
    Keywords : ;

    Abstract : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. READ MORE

  6. 10. Optimization of Bacterial Strains and Development of Fermented Seaweed

    University essay from Lunds universitet/Teknisk mikrobiologi; Lunds universitet/Bioteknik

    Author : Eleni Milopoulou; [2022]
    Keywords : fermentation; lactic acid bacteria; seaweed; cultivation; bacterial growth; applied microbiology; Agriculture and Food Sciences;

    Abstract : This study aimed to understand the exploitation of bacterial strains used in various combinations to assist in the fermentation of seaweeds. The topic stems from the need to consider the valorization of seaweeds due to their abundance in natural habitats as well as their use as an innovative and sustainable food. READ MORE