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.

SammanfattningInom den kommunala rehabiliteringen möter arbetsterapeuten personer med vitt skilda slag av sjukdomar och funktionsnedsättningar. En av de vanligare grupperna är personer, som av olika skäl drabbas av kognitiva nedsättningar. Arbetsterapeuten bedömer personer med kognitiva funktionsnedsättningar bl.a. med hjälp av olika bedömningsinstrument. Screening -instrumentet Mini Mental Test (MMT) är ett av de mest använda.

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.

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 Uganda, small scale pig production plays a major role for households to earn a living and to secure their access to meat. Piglet mortality due to diar-rhoea-related dieseases is high. In an attempt to understand the underlying causes for this high mortality this study aims to investigate the role of trans-missible gastroenteritis virus (TGEV) and is a part of a larger project con-ducted at Makerere university in Uganda. A complicating factor in this investigation is the porcine respiratory corona-virus (PRCV), a stabile mutant form of the TGE virus. The occurrence of this virus had shown to alter the impact of TGEV in e.g. Europe and North Amer-ica.

Stabilization of subgrade is an internationally common technique to improve the characteristics of a soft soil. Improving the stiffness and bearing capacity of the subgrade enables the pavement to be designed with reduced depths of subbase and basecourse aggregates. This makes the stabilization technique both economically and environmentally interesting. Both natural and stabilized soils have high inherent property variability that should be considered when the characteristic value is derived. By analyzing the spatial variability in stabilized and natural subgrades it is possible get the parameters needed for reliability?based modeling of soil properties.

Målet med Brunnsviken Brief Quality of Life Inventory (BBQ) är att skapa en kortfattad och lättadministrerad skattningsskala för självupplevd livskvalitet med goda psykometriska egenskaper vilken är gratis för alla att använda. I framtagningen av BBQ har data insamlad med Quality of Life Inventory (QOLI) i tidigare studier använts för att identifiera de livsområden med störst betydelse för självupplevd livskvalitet. I aktuell studie har normvärden tagits fram för den i studien ingående undersökningsgruppen bestående av 167 psykologistudenter. Studien har visat att BBQ har utmärkt reliabilitet (test-retest), 0,89. Vidare hade BBQ lika god validitet för undersökningsgruppen som QOLI.

Tidigare studier har visat att bristen på strukturell empowerment på vårdavdelning ofta leder till försämrad personalhälsa, sämre arbetsmiljö och mindre samarbete med kollegor samt högre grad av utmattningssymtom. Syftet med studien var att beskriva vårdpersonalens upplevelse av strukturell empowerment vid en akut kirurg- och ortopedavdelning, samt att undersöka om det finns några skillnader mellan sjuksköterskors och undersköterskors skattning av strukturell empowerment. Ytterligare ett syfte var att beskriva vårdpersonalens upplevelse av arbetstillfredsställelse samt att reliabilitetstesta ett instrument som mäter strukturell empowerment. Data gällande strukturell empowerment samlades in med instrumentet Condition of Work Effectiveness Questionnaire (CWEQ och CWEQ II) och data gällande arbetstillfredsställelse samlades in med en studiespecifik fråga. Femtioen enkäter delades ut, 43 personer svarade vid första mätningen och 39 personer vid andra mätningen.

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.