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 purpose of this thesis is to investigate and analyze existing law concerning joint owner-ship in agriculture and forestry businesses. Joint ownership often arises through a succes-sion of ownership, therefore we will go through the most useful methods.Even if the owners of agriculture and forestry businesses are getting older, the numbers of succession of ownerships are still low. A succession of ownership is important to plan and its time is demanding. Often it takes three to five years for the completion of a succession of ownership. Therefore, owners must start their planning in time and think about what is to come of their business.

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.

In the haulage business customers are constantly requesting new features. Hence thedevelopment department must constantly update their system which ultimatelyresults in a variety of versions of the system. The large number of versions creates acomplexity which often reduces product quality and extends the developmentlifecycle time.The work on the following thesis has taken place at Scania?s Fleet Managementdepartment, which develops tools for hauliers to track their vehicle fleet in real time.The purpose of this thesis was to examine how Scania can handle an increasedamount of versions of the Fleet Management System which Scania expect will be seenin the future. The investigation was conducted by preparing a number of differentscenarios that formed the basis for a discussion of what these different scenarioswould mean for different parts of Scania?s business.

GE Healthcare wants to investigate whether additive manufacturing would be an alternative method in their workshops in the Umea? plant. Additive manufacturing is called 3D printing in everyday language and manufactures details by building them up layer by layer in an automated machine. The purpose of this work is therefore to investigate how mature additive manufacturing methods are and how they could be used at GE.The work has been divided into three parts. The first section investigates how additive manufacturing would work in the production workshop at GE.

The purpose of this study was to increase the understanding of the phenomenon that there are so many young people placed in institutions in Sweden despite the valuable knowledge regarding the problems and risks of doing so. The questions that follow in the essay were what guided the social workers to choose institutional placement for youngsters. It went on to also ask if this knowledge could contribute to an increased understanding of why there were so many young people placed in institutions despite the criticism from scientists. To accomplish the goal of the essay, former science in the subject was reported and six social workers within social services were interviewed. The material of the interviews was analyzed with help from the theory of human service organizations, street-level bureaucrats work situation and the new institutionalism.The result of the investigation showed that the social workers choices to place young people in institutions is guided by specific work and organizational factors connected with a belief in the helping function of the surroundings.

This thesis studies the negative impact that control signal saturation may have on a controlled system. Different methods that are used to compensate for this problem are also studied and evaluated. Both sensitivity to disturbances and the effect the method has on the systems'ability to follow a reference signal will be examined. Stability will be discussed, but no conclusions whether the systems are stabilized or not can be drawn. Control signal saturation will lead to a slower behavior in general.

At present day there are several different methods for measuring of paved surfaces.The most common methods today are measuring with a total station, the GlobalNavigation Satellite System (GNSS) and terrestrial laser scanning (TLS). Recently thedevelopment of unmanned aerial vehicles, known as drones, has increasedexponentially and today there are several ways of using drones for measuring surfacesby photographing and laser scanning.This thesis contains a comparison between the methods terrestrial laser scanning(TLS), and unmanned aerial vehicle photogrammetry (UAV). The measurements havebeen applied on two different test surfaces, one of asphalt and one of gravel. Thepurpose of the comparison is to investigate whether the airborne photogrammetry isequivalent accurate in its height levels as the terrestrial laser scanning. For thecomparison to be more extensive, these two methods have not only been comparedin precision but also in the areas of ease of use and economy.The precision was analyzed by comparing the height levels in randomly placed controlpoints on the test surfaces.

The aim of the study was to investigate the students´ attitudes towards mathematics, their knowledge in the subject area they find the least interesting and whether laborative/practical working methods could awaken their interest and curiosity. During our work, we have looked into previous studies regarding girls´ and boys´ attitude and performance in mathematics. We handed out surveys to students in grade 9 at a School with many people from other cultures and nationalities in Malmö in order to find the answers to our questions. The result showed that most of the students thought that the subject area "scaling" was the least interesting. The implemented action program was a laborative/practical task within the "scaling" area.

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.