During the autumn of 2008 I obtained office experience by working at the local government of Örnsköldsvik. I started working on the district green plan of the green structure and that led to the work of this exam paper. The purpose of this exam paper has been to define some standpoints for the green structure of the local government district of Örnsköldsvik. I have used both a larger and a smaller scale to obtain a wide a perspective as possible of the green structure. The larger scale gives an overall view of the whole municipality while the smaller scale is found in the study of the two local areas Centrum and Domsjö. For the local government planning to be able to obtain an agreeable level of verdure to the residents it is necessary that the green structure is brought up on the agenda.

The aim of this thesis is to examine the properties of the municipalities in Sweden that influence the choice of being a certified Fairtrade city. The independent variables which are used in the statistical analysis are municipal governance, local tax rate, whether there is an university and/or university college in the municipality, average income and higher education in the municipality. The variables are examined by logistic regression. Since there are no statistical data on ethical procurement, this exogenous variable isn?t included in the regression.

In non-profit organizations, surplus of the organization goes back to the organization's members. We have noted that Hyresgästföreningen initiated a change in 2005 when the organization merged its local membership registries to a national registry. There are few studies explaining how non-profit organizations are using management in an organizational change. What happens with the business management at an organizational change that is similar to the change in Hyresgästföreningen? The aim of this thesis is to explore how the governance of a nonprofit organization is changing at an organizational change.

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 objective of this study was to examine how an IT department has been affected by the changes of increased local usage of IT, and how the usage have affected municipalities IT departments demands of IT support. In the study we explore how both the IT department and the IT support works by interviewing present and former employees at the local IT department. The current IT department have undergone a series of local changes over the last 20 years, the department has gone from only having internal users to getting the entire municipalitiy?s agencies of IT as users. It started with how the municipality began to dig down fiber optic cable in the middle of the 1990?s, and today has started to develop solutions as to how to meet the demands of future usage of IT.

ABSTRACTSegregation is more and more common in the Swedish society, especially in those suburbs called ?miljonprogramsförorter? which are characterized as grey and boring districts with low status. These suburbs are often mentioned in the media and the public associate them with immigrants, problems and crimes. Kungsmarken in Karlskrona is one of these suburbs and the purpose of this essay was to compare the media image with the images local participants had of Kungsmarken. The questions I brought up were how media was describing Kungsmarken, how this image has contributed to the low status of Kungsmarken, and if this image was reflecting the local participants? images.

Based on different integration policies, we aim to examine how five municipalities in Stockholm County are working to promote integration at a local level with focus on voter participation and to some extent, representativeness among foreign-born. Statistics provided by SCB shows that foreign-born tends to vote to a lesser extent than those born in Sweden. Further, we aim to examine the implementation of two policy documents established at a national level concerning integration in contrast to policy documents established at a local level in each different municipality. Further, we aim to examine summaries of actions taken in response to the local integration programs, as well as personal interviews. Each municipality will be considered separately, but we thus seek to make a comparative study.

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.

En sammanfattning av uppsatsen på maximalt 8000 tecken..

The creation of Region Skåne, and the transfer of the development responsibility from the national administrative country board (Länsstyrelsen) has given the state new challenges. New structures have grown between Region and State, and also between different municipalities. These can be characterized as Policy-networks, and the goal of this study is to analyze the planning process of the regional infrastructure with these theories.This is a qualitative study of the infrastructure process in Skåne, and the actors that acts within this process. It has been studied with the eyes of the theories of Governance and Policy-networks. The main method to collect material has been through interviews with different actors within the process, and very little written material has been used.

During the 1920?s the town of Bollnäs had the ambition to expand. The expansion included a merger with Björkhamre and the colonization of unused areas, e.g. the area around Onbacken. The archaeologist Gustaf Hallström came to Bollnäs to investigate an ancient tomb located on Onbacken.

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.