Sökning: "tabu search"

Visar resultat 16 - 20 av 43 uppsatser innehållade orden tabu search.

  1. 16. Performance Optimizing Priority Assignment in Embedded Soft Real-time Applications

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Fredrik Bergstrand; Tobias Edqvist; [2018]
    Nyckelord :;

    Sammanfattning : Optimizing task priority assignments is a well-researched area in the context of hard real-time systems, where the goal in the majority of cases is to produce a priority assignment that results in a schedulable task set. The problem has also been considered, albeit not to the same extent, in the soft real-time context where quality of service metrics determine the overall performance of systems. LÄS MER

  3. 17. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem

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

    Författare :Mikael Forsberg; [2018]
    Nyckelord :Timetabling; University Course Timetabling Problem; Metaheuristics; Hybridization; Genetic Algorithm; Tabu Search; Schemaläggning; University Course Timetabling Problem; Metaheuristik; Hybridisering; Genetisk Algoritm; Tabusökning;

    Sammanfattning : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. LÄS MER

  4. 18. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem

    Kandidat-uppsats, Linköpings universitet/Artificiell intelligens och integrerade datorsystem

    Författare :Anton Hölscher; [2018]
    Nyckelord :weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search;

    Sammanfattning : This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to solve the Weighted k-Chinese Postman Problem for undirected graphs, of varying size, representing neighbourhoods in Sweden.A tabu search heuristic was implemented with each iteration consisting of giving a cycle from the most expensive tour to the cheapest. LÄS MER

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

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

    Författare :Lisa Li; Jakob Vyth; [2018]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER

  7. 20. Ruttoptimering : En jämförelse mellan mänsklig erfarenhet och optimeringsprogram

    Kandidat-uppsats, Mittuniversitetet/Avdelningen för informationssystem och -teknologi

    Författare :Åsa Andersson; Abdiqafar Ismail; [2017]
    Nyckelord :Route optimization; GIS; heuristic; travelling salesman problem; tabu search; expert system; Ruttoptimering; GIS; heuristik; handelsresandeproblem; tabusökning; expertsystem.;

    Sammanfattning : Route optimization aims to optimize routes for vehicles withregards to resource usage. Especially when the vehicle needsto visit multiple customers on the route, a route optimizationtool is beneficiary. The purpose of this study is to comparehuman experience with a route optimization program. LÄS MER