Essays about: "lokalsökning"

Showing result 1 - 5 of 8 essays containing the word lokalsökning.

  1. 1. Optimization Methods for Snow Removal of Bus Stops

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Corina Hüni; [2023]
    Keywords : Snow removal; Travelling Salseman Problem with Time Windows; Heuristic; Local search; Tabu search; Snöröjning; Handelsresandeproblemet med Tidsfönster; Heuristik; Lokalsökning; Tabusökning;

    Abstract : Snow removal is an important optimization problem in countries with snowfall. Bus stops can only be cleared after the adjacent street is cleared. 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. Comparison of Two Constraint Solvers for University Timetable Creation with Focus on Algorithm Choices

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

    Author : Herman Karlsson; Sebastian Williams; [2020]
    Keywords : ;

    Abstract : The problem of finding an optimal schedule for universities based on their numerous constraints is NP-complete and thus requires heuristics to get good solutions. Our study has compared two constraint solvers that employ different combinations of heuristics to determine which is more suitable for universities. READ MORE

  5. 4. Comparing Two-Phase Hybrid Metaheuristics for the University Course Timetabling Problem (UCTP)

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

    Author : Isabella Andersson; Carl Petter Svensson; [2019]
    Keywords : ;

    Abstract : Timetabling is a time consuming and difficult task for large organizations. One popular research field is the university course timetabling problem (UCTP). UCTP is the NP-hard combinatorial problem of scheduling courses at a university while satisfying some constraints. READ MORE

  6. 5. Methods for optimizing large scale thermal imaging camera placement problems

    University essay from Linköpings universitet/Optimeringslära

    Author : Hugo Lindell; [2019]
    Keywords : Camera planning; camera placement; large scale multi-objective optimization; large neighbourhood search; SCP heuristics; Kameraplanering; kameraplacering; storskalig flermålsoptimering; lokalsökning; övertäckningsproblemsheuristiker;

    Abstract : The objective of this thesis is to model and solve the problem of placing thermal imaging camera for monitoring piles of combustible bio-fuels. The cameras, of different models, can be mounted at discrete heights on poles at fixed positions and at discrete angles, and one seeks camera model and mounting combinations that monitor as much of the piles as possible to as low cost as possible. READ MORE