The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The author has, with the help of AK Consultancy Indoor Air AB, formed a series of questions regarding moisture problems in buildings and how these are handled in extreme climates with high temperatures and a high relative humidity. Furthermore to analyse and indentify key material that makes a construction safe against moisture problems. Ventilation, AC and the choice of materials have in a later stage of the thesis been investigated to enhance the knowledge of moisture protection. The research for this report includes measurements on existing buildings, calculation models on the building envelope for analyses and the ingoing materials of the envelope. The health aspect of moisture problems related to ?sick building syndrome? has been included and interviews have been conducted to gather relevant information.A study of the American system, ASHRAE, American Society of Heating, Refrigeration and Air Conditioning Engineers and the standards used in Singapore has been made to highlight the difference.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The project has been performed in collaboration with Thule Sweden AB, a global leader in developing safe, simple and elegant solutions for the transportation of various types of equipment. The company has developed a new T-track which is telescopically, they stand mount system to connect the roof box to the roof rack does not fit into this. Therefore, the company considered that it was necessary to have a new product that meets the requirements of the new roof rack. They wanted a new, smarter solution would be developed. The bulk of this essay has been to find a new concept to connect the roof box to the roof racks. The result is a saxkonstruktion that slides down the roof rack T-profile and protected out of a puck-like housing. The product is small, simple and elegant solution.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

Information stored on unprotected computers that gets lost or stolen, and falls intothe wrong hands, can easily be accessed by moving the hard disk to a controlledcomputer, or by booting the computer from a removable medium, in order to getaround the operating system login. This is something that largely affects companieswhere customer information, trade secrets and other sensitive information can becompromised. A classic solution to the problem is encryption of individual files, but ithas some drawbacks as it puts a great responsibility on the users and unencryptedinformation can be left by mistake. A better solution to the problem is transparentencryption of the entire hard disk, i.e. that encryption and decryption of informationis performed automatically and without the user being affected.

Computer based information systems play an important role in modern military combat vehicles. The crew needs to be able to quickly get information about both the vehicle and its outer surroundings in order to quickly make the correct decisions. In this report, we describe the development of a prototype new information system for the BvS10 vehicle, manufactured by BAE System Hägglunds AB in Örnsköldsvik.An important aspect of the system is the time it takes from the point that the information is generated by the vehicle sensors until it is presented to the user. The system must be able to ensure that it never displays information that is out of date. Thus, it is important to create a layer and component based architecture for the solution, making it possible to control, in detail, the information?s age as it moves through the system.

Dogs with behavioral problemsThis study was made to investigate if there was a problem in today?s society regarding dogs showing for example excessive aggression and/or anxiety. The main questions in this study was "is there a problem today" and "if there is a problem, what can we do to prevent it". To investigate these questions interviews were made with six different professions concerning the dog domain. The result of the study shows that three of the interviewed considered it to be a problem, one did not have an opinion on the matter and two choose not to call it a dog related problem because it mostly depends on the owner.

Intelligent IT-based solutions, often called Smart Grids, are considered to be the future balancers of renewable energy sources. One area within the Smart Grid concept is called demand response, which is focused on making customers more consumption flexible by making them more active in their consumption. In this thesis the aim is to analyze a business model by investigating the income potential for a demand response solution as well as its market potential. This has been done through literature studies, interviews and development of a computational model.The use of 5000 households with flexible consumption can provide a cost reduction of 17.2% or 2.4 million SEK for a balance responsible party during an average year. If the solution is used to make strategic bids on the regulation markets the study indicates that the largest potential for revenues lies within this strategy.

Behaviour problems are often behaviours that cat owners don´t like, but are normal to the cat. The reason to why cat owners experience certain feline behaviours as problematic is probably due to the current practice in cat housing. The ways that cats are kept today causes somewhat of a compromise between cat and owner and inhibits the expressions of the cat's natural and normal behaviour. The cat owners may misunderstand their cats behaviour, for example the cat owners believe that their cats perform certain behaviours because of feelings of guilt, hate, revenge or maybe to protest against something or someone. An animal hospital may help solve behaviour problems, but also help the cat owners to undstand their cat´s behaviour in an other perspective. The aim of this study is to investigate the need of a cat ethologist in animal hospitals.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.