This thesis will describe the redesign of the manure fork SverigeGrepen. The productis available for purchase in Scandinavia and and parts of the rest of Europe.The product is available in stores but the companys goal is to start distribute it overthe internet. A problem today with a purchase over the internet is that the costumerhas to pay a high shipping-fee due to the products unique form. The long handlecontributes to the high shipping-fee which makes it hard to attract costumers topurchase the product online. Deficiencies have been found at the manure forks basketand needs to be examined.

The purpose of this study is to examine the view of Swedish language teachers on the role of fiction and of school libraries within the compulsory school?s teaching of Swedish of form 6-9. The questions to be answered are:? What part do Swedish language teachers (hereafter called teachers) think fiction is playing regarding the pupils inclination to read and reading promotion?? What is the attitude of teachers regarding the function of fiction in the Swedish subject?? What do teachers consider being the role of the school library in education, and can this be related to the local school library resources?To answer the questions a questionnaire was sent out to thirty-five teachers. Four qualitative interviews were also carried out among the fourteen teachers that answered the questionnaire.

There is a new beverage container on the market, a bottle made out of pure aluminum as a replacement for the traditional container made out of glass. This new container has the potential to reduce both cost and pollution during transportation, the lighter and stronger construction has every advantage compared to the old one in glass. The new container has every possibility to make it on the market. Some of the biggest brands within the soft drink market already use these bottles in countries without any recycling demands like: Coca-Cola, Heineken and Pepsi. The only thing stopping these brands from the Swedish market is the lack of a functional return system, there is only one company that uses the bottle in Sweden today and they take care of their own used bottles.

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.

Det här arbetet är en pilotstudie om vad införandet av en ny betygsskala och nya läroplaner hösten 2011 fick för genomslag i betygsstatistiken i en av landets större kommuner och för lärare på en gymnasieskola i en mindre kommun, med fokus på ämnet naturkunskap. Regeringens mål med den nya betygsskalan var att den skulle visa elevernas kunskaper mer nyanserat, vilket också skulle kunna öka deras motivation att sträva efter högre betyg. Ett annat mål var att minska risken för betygsinflation, ett problem som funnits både i äldre tiders betygsskalor och efter införandet av den förra betygsskalan. Resultatet av studien visade att betygsmedelvärdet för eleverna inte förändrades med den nya skalan, men andelen som fick det högsta betyget sjönk, särskilt bland eleverna på högskoleförberedande program. Däremot visade det sig att bland eleverna på yrkesprogrammen höjdes medelbetygen i naturkunskap och andelen som fick det högsta betyget ökade.

Studien innefattar en jämförelse av beteende och attityder till miljöfrågor mellan studenter från Jönköping, en individualistisk kultur, och Quito, en kollektivistisk kultur. Syftet är att undersöka om studenternas kulturella och sociodemografiska bakgrund återspeglar skillnader i attityd och beteende till miljöfrågor. Studien använder sig av en enkätundersökning som är baserad på tidigare forskning, det ekologiska fotavtrycket och mätinstrumentet New Ecological Paradigm skalan. Resultatet diskuteras utifrån tidigare forskning inom området med utgångspunkt från teorier om individualistisk och kollektivistisk kultur och Theory of Planned Behavior.Studien visar att det finns signifikanta skillnader i studenternas angivna miljövänliga beteende inom ett flertal områden, exempelvis studenternas angivna resvanor och hur mycket de återvinner. Resultatet tyder på att det finns förklaringar till skillnaderna i de sociodemografiska faktorerna.

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.