Essays about: "Graffärgningsproblemet"

Found 4 essays containing the word Graffärgningsproblemet.

  1. 1. Comparing Quantum Annealing and Simulated Annealing when Solving the Graph Coloring Problem

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

    Author : Nora Odelius; Isak Reinholdsson; [2023]
    Keywords : Quantum Computing; Quantum Annealing; Simulated Annealing; Graph Coloring Problem; Kvantberäkningar; Quantum Annealing; Simulated Annealing; Graffärgningsproblemet;

    Abstract : Quantum annealing (QA) is an optimization process in quantum computing similar to the probabilistic metaheuristic simulated annealing (SA). The QA process involves encoding an optimization problem into an energy landscape, which it then traverses in search for the point of minimal energy representing the global optimal state. READ MORE

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

  5. 4. Effects of Different Worker Heuristics in Marriage in Honey Bees Optimization : As Applied to the Graph Coloring Problem

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

    Author : Lisa Li; Jakob Vyth; [2018]
    Keywords : ;

    Abstract : Marriage in Honey Bees Optimization (MBO) is an interesting meta-heuristic inspired by the mating process of honey bees, where worker bees are collectively responsible for raising the next generation of the colony. In MBO, worker bees are represented by heuristics that are used to navigate the search space. READ MORE