Essays about: "Greedy heuristic"
Showing result 6 - 10 of 21 essays containing the words Greedy heuristic.
-
6. Methods for optimizing large scale thermal imaging camera placement problems
University essay from Linköpings universitet/OptimeringsläraAbstract : 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
-
7. An Evaluation of the Great Deluge Algorithm in Course Timetabling : As Applied to the KTH-Inspired University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) can be loosely described as assigning events (e.g lectures) to rooms and timeslots in a way that results in a feasible timetable that is optimal according to some custom criteria. The problem has become increasingly relevant as more programs become available in universities. READ MORE
-
8. A column generation approach to scheduling of parallel identical machines
University essay from Linköpings universitet/Matematiska institutionenAbstract : This thesis aims to implement a combination of Linear Programming Column Generation and a Large Neighbourhood Search heuristic to solve scheduling problems. The resulting method is named Integer Programming Column Search (IPCS). READ MORE
-
9. Improving robotic vacuum cleaners : Minimising the time needed for complete dust removal
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The purpose of this study was to examine the cleaning efficiency of an autonomous vacuum cleaner robot; namely, reducing the cleaning time needed in an empty room. To do this we explored how the path planning could be improved upon given access to a dust map that would allow for more sophisticated algorithms depending on the state of the room. READ MORE
-
10. 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)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
