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.

When contemplating entering an alliance the rationale behind the decision should differ depending on the size of the companies involved as well as on other important factors. The important factors influencing the decision are related to the resource pooling potential of the alliance, the power structure along with the business network the companies are a part of. The analysis has shown proof of a need for cooperation if one wish to succeed in the telecommunication industry and it has also determined which resources that are deemed to be most important to get in touch with, for our study object, to facilitate its access to the market. Those resources are defined as a direct channel to the customer, funds/capital and the access to relevant business networks. To get in touch with these lacking resources, three alternative approaches has been proposed; all of them involving a strategic alliance decision.

In this bachelor thesis a complete prototype of an industrial vibration measurement platform has been developed. By measuring a number of variables such as acceleration, temperature and speed conclusions can be drawn on machinery health. The aim is to evaluate hardware and software solutions for a possible future product. Based on a requirement specification a proper hardware design has be developed. The hardware consists of a four-layer PCB with an ARM Cortex-M3 microcontroller and about 250 other components. The PCB was designed, assembled, tested and finally housed in a box.

The project aimed to develop a protective and stabilizing insole called Trailplate for soft andlight shoes. The demand came primarily from off-road runners in France, Switzerland, andAustria. The project was carried out at Icebug, a company that develops shoes mainly forrough terrain. The main focus has been on the trailplate which is designed to fit severaldifferent shoes.Torsional stiffness and bending resistance were the main objectives. To improve the existinginsole, a material with the right features was required.

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 question whether controlled vocabulary or natural language free-text terms is the most effective search strategy has occupied researchers in LIS for many decades. This Masters thesis is an empirical study which aims to compare these two search strategies in LISA Library and Information Science Abstracts, an online bibliographic database. 22 topics from the discipline of Library and Information Science were constructed and out of each topic one query for each search strategy was formed. Queries in natural language were formed with terms from different sources, for example dictionaries, while queries in controlled vocabulary were built with terms from LISAs electronic thesaurus. The measures used in this study were precision, relative recall pooling method and overlap.

The Swedish legislation regarding tax reduction for gifts to nonprofit organizations was stated year 2011/12. The legislation includes tax reduction for donors if the gift refers to a nonprofit organization whose work consists with ?charity for an economical need? or ?scientific research?. To be included as approved recipient the recipient has to apply for approval. This approval includes both an application fee and an annual fee.

There is currently an ongoing discussion in Sweden about the need for weather shelter for farm animals being kept outdoors during the winter season. Currently, the national animal welfare legislation requires weather shelter providing the animals? with access to a dry and clean place to rest, but under certain conditions exemptions can be granted. The Swedish Board of Agriculture has put forward a hypothesis that there is a difference between judicial decisions in animal welfare cases dealing with weather shelters, as to whether the animal has shown to be suffering or not. The aim of the study was to highlight any weaknesses or difficulties when assessing animal welfare issues associated to the absence of or design of weather shelters.

With a growing population on earth the amount of end-of-life vehicles (ELVs) and other scrap steel increases. The European Directive 2000/53/CE? requires a minimum of 95 % reuse and recovery and 85 % re-use and recycling no later than 1 January 2015, for end-of life vehicles. This imposes a need for more efficient recycling and recovery. Despite this shredder residue (SR) is commonly land filled.This report investigated the magnetic fines residue generated at Stena Metall shredder facility in Halmstad, Sweden.

The aim of this study was to increase the knowledge of possibilities and obstacles for disabled people to meet a partner. The ambition was to know more about wishes for and needs of professional or other support. The methods have been literature studies, survey research, and interviews. A simple questionnaire was sent to administrative staff and social welfare officers who gave the information that they experienced those persons with intellectual disability or Aspergers syndrome had asked for support to meet a partner. To get a perspective from inside six semi structured interviews were made with disabled people having experience of relationships, love affairs.

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.