Language: | Slovenian |
---|---|
Year of publishing: | 2010 |
Typology: | 2.11 - Undergraduate Thesis |
Organization: | UL FRI - Faculty of Computer and Information Science |
Publisher: | [R. Tomc] |
UDC: | 004(043.2) |
COBISS: | 7739732 |
Views: | 161 |
Downloads: | 7 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | English |
---|---|
Secondary title: | [Optimization of display structure using search algorithms] |
Secondary abstract: | Display signs usually consist of lightbulbs organized into a matrix and are capable of dynamically displaying messages. Since not every message uses every available bulb, it is possible to optimize the production costs of such signs by reducing the number of bulbs on the sign. As with all optimization problems, we are confronted with the two opposing goals: a) we would like to use as few lightbulbs as possible and b) we require the displayed messages to be readable. In our thesis, we implemented several optimization algorithms for searching through state space of lightbulbs' configurations, trying to find the most optimal position of the lightbulbs. We estimate the optimality of the solution using a heuristical estimate which we developed and proposed especially for our approach. The proposed estimate estimates a quality with which a sign with certain configuration of lightbulbs is capable to represent a set of selected symbols. The estimate takes into consideration number of used bulbs and favors such configurations with less bulbs. Among the implemented algorithms, the harmony search has shown to be the most successful in this task. Its solutions had best quality values and on consecutive searches showed the most consistent behaviour. |
Secondary keywords: | optimization;display;search algorithms;cost minimization;computer science;diploma; |
File type: | application/pdf |
Type (COBISS): | Undergraduate thesis |
Thesis comment: | Univerza v Ljubljani, Fakulteta za računalništvo in informatiko |
Pages: | 46 str. |
ID: | 23868243 |