Problemformulering: Är informationen på prisjämförelsesidorna tillförlitlig samt oberoende av återförsäljare som kan ha intresse i att uppvisa partisk information?Syfte: Syftet är att, med hjälp av en explorativ undersökning samt användning av både kvantitativa och kvalitativa undersökningsmetoder, få klarhet i om informationen på prisjämförelsesidorna är tillförlitlig och därmed även oberoende av återförsäljare som kan ha intresse i att uppvisa partisk information.Metod: Vårt tillvägagångssätt har bestått av både en kvantitativ och en kvalitativ metod. Den kvantitativa metoden har grundats i två separata explorativa tvärsnittsstudier och den kvalitativa metoden har bestått av 7 strukturerade intervjuer.Vår ansats kan liknas vid en induktiv metod, då vi utgått från insamlad primärdata. Resultatet från dessa anknyts sedan till generella teorier. Undersökningsobjekt: Vi har valt att studera de tre prisjämförelsesidor som anser sig vara informationsoberoende: Compricer, Pricerunner och Prisjakt.Teori: Utifrån vår undersökning har vi valt teorier om marknadsföring på Internet, om e-handel, marknadsföringsmixen och slutligen Porters femkraftsmodell.

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 initial provisions concerning CFC-legislation were introduced 1990 and has since been subject to several revisions and adaptations. The fundamental purpose of the CFC-legislation is to prohibit and prevent tax evasion undertaken by such companies that own other foreign companies where generated income is subject to low rates of taxation. The CFC-legislation aims to provide the Swedish government with an op-portunity to tax this income. This is important in order to prevent tax avoidance and preserve the integrity of the system of taxation within Sweden. In order for the CFC-legislation to be as effective as possible there must exist a clear way of defining which activity that is to be regulated within its scope.

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.

Today's consumer society has led to never-ending choices in terms of brands, products and prices in an endless variety of shops. The retail industry is a very complex industry that includes many different types of sales channels and many different types of products. A consequence of this trend is that brand owners today face difficulties in understanding how their products are being evaluated and difficulties in knowing which final cause that make a consumer willing to by their product is hard to figure out. The industry is very diversified, which means that for a company to really understand their position and their role on the market it requires that the company put a lot of effort and also a lot of money in the process of trying to figure it out. We will with this paper try to explain a small piece of that understanding and we hope to get results, which contribute to the further research in this area.

Käppala wastewater treatment plant situated on the island of Lidingö northeast of Stockholm is running a project during 2004 and 2005 with the purpose to map out the capacity of anaerobic digestion in the digesters that treat primary and excess sludge. The purpose of this thesis work, which is part of that project, was to characterize the present anaerobic digestion process and to investigate its capacity to treat other organic wastes such as restaurant waste and waste from water works. To decide the potential of both methane and biogas production from different substrates batch laboratory tests were carried out. To imitate the anaerobic digestion process at Käppala continuous tests with small scale reactors were carried out. These reactors were later fed with restaurant waste.The batch laboratory tests showed that primary sludge had a potential biogas and methane production of 0,62 and 0,35 Ndm3/g VS respectively after 40 days of digestion.

The purpose of this paper is to examine the image of the Titanic disaster in two Swedish newspapers reports of the disaster. By analysing various newspapers reporting of the disaster, we wish to investigate whether there are differences in reporting of gender and class in order to say something about the contemporary outlook and the prevailing social beliefs.The source material that the study is based upon comes from the Swedish newspapers Aftonbladet and Svenska Dagbladet and their reports from the 15 April to the 30 April 1912 and the reporting from the time of the sea-hearings completion (22 May and 31 July 1912).The study finds that news reporting follows the same standards, however, are different in style of performance because of the newspapers' differing positions.The study finds that a distinction is made between the reporting of men's and women's behaviour. Whether a man followed or violated norms leads him criticized or praised in the newspapers. Women's behaviour is hailed independent if they followed the standard of what was feminine or masculine behaviour in a disaster.The study also finds that a distinction is made between passengers of the various classes in the reporting. The majority of reports concerning individuals in the First Class are in positive terms.

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.