The purpose of this study is to analyse how the local governments have implanted the new public health policy, which Sweden adopted in April 2003. The new health policy stakes out a new direction for national public health policy. Instead of focusing on diseases the new public health policy focus in factors that determine health.Important factors to study are the role of central steering from the central government. The method used is a case study of three Swedish local governments. The main material used is interviews and different policy documents within the area of public health.The conclusion of the study shows that the local governments are fairly satisfied with the steering of public health policy by the central government.

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 investigate how the local newspaper readers felt about reading the local newspaper in a tablet device, such as the iPad. We wanted to study the attitudes from consumers towards tablets and if the traditional local newspaper can be substituted with a tablet device. We decided to use qualitative interviews as our method. The selection of respondents was based upon age, whether or not they had a subscription and if they owned a tablet device or not. We accomplished fifteen interviews with respondents living within the area where the newspapers of Barometern and Oskarshamnstidningen are spread. The study shows that the majority of the respondents who already had a subscription tended to lack interest in changing their traditional newspaper consumption. Their habits of reading the local news on paper were strong.

This essay inquires with the local authority´s rights versus obligations towards its members in agreement situations, where according to civil law compete with the according to public law.These situations become more and more common, since the public is often integrated in today´s trade and industery. Within this analyses there are statements made by HD about what is the applicable judgement concerning this complex area. HD´s different views and opinions have partly been critizesed by the auther..

This bachelor?s thesis report aims to investigate the problems that exist with the ticketing systems ofthe various regional public transportation authorities, specifically with regards to inexperiencedtravellers and cross-county travel.This is done in part through a comprehensive survey for all of Sweden where both the regional publictransportation authorities and passengers were asked about their opinions, as well as a throughin-depth survey focused on the counties of Stockholm and Uppsala. The results of these surveys arethen compiled and analyzed to identify the biggest common problems.The tree biggest problems prove to be a complicated implementation, lack of availability and lack ofinformation. In order to improve the ticketing system it is therefore proposed to implement asimplified ticketing system, as well as improved accessibility and information.         .

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.

Temat för uppsatsen har varit cykel och det utrymme cykeln får som transportsätt för persontransporter inom den fysiska planeringen. Det övergripande syftet i uppsatsen har alltså varit att studera cykelns roll inom svensk samhällsplanering, hur cykeln som transportsätt behandlas inom lokal, regional och nationell samhällsnivå och om det finns ett samband mellan nationell styrning, fysiska strukturer och cykel. Uppsatsens syfte har således varit att få en förståelse för nivåernas prioritet av transportsätt för persontransporter och att få en överblick av om och i så fall hur stadsstrukturers påverkan av cykelanvändningen hanteras. Följande frågor har ställts för att undersöka hur kommuner, regioner och den statliga nivån bedömer cykel som transportsätt i Sverige och vilken betydelse stadsstrukturer har. 1.1 Hur behandlas cykel som transportsätt på en nationell, regional och lokal nivå? 1.2 Går det att se ett samband mellan normer och riktlinjer som beslutas på nationell nivå i den planering för cykel som sker på lokal och regional nivå? 1.3 Behandlas sambandet mellan cykeltransport och glesa respektive täta stadsstrukturer inom kommunal översiktsplanering? Den empiriska delen består av två individuellt genomförda analyser av empiriskt material som representerade de olika nivåerna nationell, regional och lokal för att på så vis få en inblick i hur cykeln behandlades inom respektive nivå.

Local politicians are key actors in the democratic system and their ideas concerning democracy plays a central role in local democratic politics. The study's point of departure is the notion that local politicians are dependent of coherence between practice and theory concerning democracy and in the study of their ideas we acquire knowledge about the democratic practice.This study examines the local politicians? view of Swedish democracy and explores the logic of the discourse that makes statements concerning democracy possible. Twenty local politicians have been interviewed and from the material a discourse have been established through the use of formulation of problems and cause, nodal points and chains of analogy which is compared with democratic ideals.The study comes to the conclusion that a hegemonic discourse exists, in which central nodal points are representative and listening. The idea of the representative system is hegemonic and is based in the liberal democratic ideal although the view of the citizens rather can be traced to the radical, communitarian and deliberative ideal.

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.