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.

This master thesis work was done by two students at Machine Design at KTH for Lesjöfors Stockholmsfjäder AB. The task was to develop a calculation program for gas springs. The program is going to ease the selection of gas springs for a given case of a lid that should be opened. The program is going to be used internal by sales people at Lesjöfors AB in Sweden and internationally. The program is therefore written in English.The program was developed in Microsoft Visual C# 2008 Express Edition.

Boulognerskogen is a park in the central of Skövde that have had a health resort, paths for strolling, outdoor-bath, outdoor-sport areas and events. During the 1970:th there was a lack of interest for the park and very few visited it. By a motion from a resident in Skövde wich proposes that a city playground will be build in Boulognerskogen gave me an opportunity to investigate how the potential of the park can be used to create a funny and nice place to visit for children in company with adults. By a program that contains the main goals and design program for a city playground in Boulognerskogen, I wanted to present a proposal that could meet childrens needs to play and to use the conditions of the place to create places to play in, and where children in company with adults could be together. To reach this, I wanted to try different methods that could lead to a proposal that was well supported by children and adults, and wich was possible to use by the local authority in their further actions. The methods that I used was therefor an important part of the work. I have choosen to define the concept "city playground" as a greater playground situated in the center of the town that are suitable for outings and as a meetingplace, with a varation in playground attractions and promote children and adults to be together, aiming at younger children in the ages of 1-10 years in company with adults, but should also give space to activities of other groups.

The purpose of our study was to examine how three teachers and four students relate to the program "Fem myror" in teaching. We have been through qualitative interviews with two teachers and one special teacher received a detailed picture of how their literacy programs made in relation to the "Fem myror." Qualitative interviews have also been made with four students, a boy and three girls, in order to examine their attitude to the program. From educators? interview answers, we think we can say that the theory and practice conform to what we read in the literature may be associated with what we observed during our time in the business. The study has shown that all teachers believe the program will be a good educational tool to take to read and write.

When different type of programs are developed one wants to make these adjustable to future changes and requirements. It must be done a good design of the program from the beginning to make it possible to continue development of it without having to redo big parts of it to high costs. In the area of object orientation there are design pattern, which can be used to design systems that can be adjusted to new changes in an easier way. I have in this thesis chosen to take a closer look at how to design a program that sends SMS to cell phones through a system of an operator. One requirement on the program is that it has to be possible to change what operator to send though in an easy way.

Since the 1980's economic policies has become an important issue in municipalities and more resources are put into projects that are intended to have a positive influence on the local economic growth. From a theoretical perspective of regime theory and a model of local political economy, concerning the strategies chosen by the actors involved designed by Jon Pierre, the discussion points to the fact that it is possible to affect the local development. The municipalities discussed and compared in this thesis, Bromölla and Östra Göinge, have similar prerequisite for growth mainly due to their dependence to large industrial companies.In order to fulfill the aim of the thesis and examine the change in economic policies over time and between the two municipalities a comparative method is used. The creation of local governing coalitions is emphasized which makes efforts and intentions of individual actors crucial for the success of the local economic policies. Bromölla started their more active efforts in the area of economic policies earlier than Östra Göinge and has also come a bit further in the process.

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.

Att "smarta" brädspelande datorprogram har blivit mycket bättre under de senaste årtiondena har väl knappast kunnat undgå någon. Med brädspel menar jag spel såsom Go, Othello, Backgammon och Schack. Idag spelar program, som körs på en reguljär PC, bättre än de flesta människor. Vad är det som gör dessa program så bra? Hur kan man lära en dator att spela ett så pass komplext spel som Othello på en sådan nivå att ingen människa har en chans att vinna? I detta examensarbete kommer jag att försöka förklara mekanismerna bakom ett toppspelande Othelloprogram.

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.