Discussions about the democratic deficit of the European Union have gotten more intense and the criticism usually points towards a great gap between the citizens and the EU politics. In this study the political communication policy is being put under the scope to investigate to what extent the policy is designed to counter the democratic deficit, supported by the theory of deliberative democracy. The analysis examines three aspects of the deficit ? decentralization, participation and the distribution of information ? and makes research into the communicative measures that have been implemented. The importance for EU to make deliberation possible is stressed throughout the essay and in the conclusion I argue that improvements still need to be made.  .

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.

Detta arbete behandlar hur en bostads- och verksamhetsutbyggnad i Älö by skulle kunna ske. Det övergripande syftet med arbetet är att genom planering skapa förutsättningar för en hållbar utveckling i tätortsnära landsbygd med avseende på områdets natur- och kulturvärden, försörjning och social samhörighet. Problemformuleringen består av tre frågor; hur nya bostäder i Älö kan planeras för att bevara dagens glesa landsbygdskaraktär, hur bevarande av Älös funktionsblandning i form av lantbrukande, småföretagande och hur boende kan kombineras med nya bostäder och ökad turism utan att förstöra byns kvaliteter. Metoden för arbetet var en kombination av litteraturstudier, intervjuer och ett analyserande planförslag. Litteraturen som studerades var tvärsektoriell och belyste landsbygden utifrån historia, dagens situation och hur framtidens landsbygd kan komma att se ut. Intervjuer som genomfördes var gruppintervjuer med semi-struktur. Dessa tillsammans med litteraturstudien var grunden i utformningen av planförslaget. Den teoretiska bakgrunden inleds med hur historiska skiftesreformer, by- och gårdstyper har påverkat landsbygdens utseende.

Följande examensarbete är ett gestaltningsinriktat planförslag för en ny stationsnära stadsdel i Landskrona stad som vidareutvecklar områdets kollektivtrafiknära läge. Den fysiska utformningen bygger på en nätstruktur med gena stråk och fysiska rumsbildningar som skapar målpunkter, grönstruktur och utblickar i landskapet. Planförslaget baseras på en diskussion om skala, utformning och synintryck med slutsats att den fysiska grundutformningen och byggnadernas arkitektur hör ihop, där nyckeln är variation, mänsklig skala och mängden synintryck som miljön erbjuder. Landskrona är en sundsnära mellanstor stenstad i Skåne med karaktär av befästningsstad, parker, kolonier och tydliga bebyggelseårsringar. Staden har också en industrihistoria som varvsstad där varvskrisen på 1970-talet slog hårt mot staden med stor arbetslöshet till följd. Än idag finns ett verksamt varv kvar och kranmastar utgör ett tydligt riktmärke i staden. I arbetet ligger fokus på skala och utformning, två nybyggnadsprojekt har analyserats, stadsdelen Örestad i Köpenhamn och Bo01-området, Västra Hamnen, Malmö. Även skala och stadsplanemönster i Landskrona har studerats.

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 term Temporary places could be used to describe a wide range of shapes, functions and not least different time sets . In this thesis, however, the intention of temporality should be seen as the main definition regarding this subject. This thesis is based on a literature study and the aim is to explore temporary places, their values and their functions. Furthermore, the purpose is also to highlight temporary places as a method to be used by urban planners, in order to create more flexibility in the city planning of today. The thesis describes the underlying factors and conditions creating an increased interest in flexible planning. Furthermore, a number of tactics and applications are presented, all drawn from current research on the topic.

Syfte: Syftet med uppsatsen är att redogöra för de generella tankarna kring ISO 26 000, analysera KappAhls CSR policy genom att koppla policyn till ISO 26 000 samt redogöra för hur KappAhl konkret arbetar med CSR.Teori: Teorier som används i uppsatsen är institutionell teori, intressentteori men även Carrolls CSR Pyramidmodell. Tanken är att med hjälp av dessa teorier kunna analysera innehållet av standarderna, KappAhls CSR-policy och hur de konkret arbetar med dessa standarder och riktlinjer.Empiri: Empirin består av tre delar där den första och andra delen utgörs av innehållsanalys av standarden ISO 26 000 och KappAhls CSR policy med fokus på uppförandekoden för deras leverantörer. Den sista delen beskriver hur KappAhl allmänt jobbar med CSR i vardagen.Slutsats: Uppsatsen avslutas med en diskussion om KappAhls tillämpning av ISO 26 000 och deras egna CSR policy. Dessa standarder och riktlinjer finns för att bidra med ett etiskt ansvar men också får att det ligger i deras intresse att följa dessa. Genom att följa standarderna förstärks varumärket och överlevnadsförmågan ökar..