Investors have been shown to be driven by emotional and psychological factors. This contradicts classical financial theories, for example the Efficient Market hypothesis which states that all investors act rationally. Behavioural Finance is an area of study which describes various psychological factors which may result in irrational investor behaviour.The primary question of the study is: which factors do operating people in the financial sector consider themselves to be influenced by? The purpose of this study is to investigate the factors which affect the process of creating forecasts or making financial decisions. The study examines in addition if there is a correlation between length of investor experience and overconfidence in forecasting accuracy and investment decision making.The study includes both quantitative and qualitative analysis.

To be able to hinder the global warming the emissions of greenhouse gases, carbon dioxide foremost, must decrease. By switching to green electricity, it is possible to reduce the emissions from electricity producing sources.In 1999, Swedenergy conducted a study about whether or not Swedish households would consider buying green electricity. According to the study, about 75 percent were willing to buy green electricity. 40 percent of these were prepared to pay a premium for green electricity. However, according to the results from the study, only one percent actually bought green electricity, and since 1999, this proportion has merely increased slightly.

Mechanization of Swedish agriculture started in the beginning of the twentieth century, to be able to have more animals without raising the number of employers. The horse business has not by far kept up with these cost savings solutions. Cleaning out stables and feeding horses are the most time-consuming tasks in horse stables today. The most common way to clean out the stable is still by shovel and wheelbarrow. The clean out process can easily be mechanized through semi- permanently beds with movable walls between the boxes so that the litter can be removed by a tractor or a loader.

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.

Warning-labels as a mean of communicating social responsibility in the store. Previous studies have shown conflicting results regarding the effectiveness of warnings-labels as a way of communicating health hazards to customers and making them more conscious about the risks and changing their behavioural intentions. The focus of this study is to shed some light on how the customers react to warning-labels with different levels of fear in the store atmosphere. The results of this study tells us that liking of the retailer and its image as being socially responsible is not enhanced by the usage of a warning-label. If the retailer decides to use a warning-label, in spite of this fact, the recommendation is to use a high level of fear if the purpose is to make the category seem more risky and make the customers want to change their behaviour.

The matter of CSR and sustainable products has gained an increased amount of interest in recent years as "green products" are becoming a trend with more "eco"-alternatives in the assortment of many retailers. However, among the increasing number of socially oriented customers, it seems that although they claim an increased demand for these kind of products, its easier to "talk the talk" that to actually "walk the walk". This is due to a discrepancy between attitude and behavior, called the attitude-behavior gap. The purpose of this paper is to examine how to overcome this gap by using three different studies to get a nuanced and reality-based view of the problem. The focus within these different studies is on the potential effects inside the store and how information provided has an effect on perceived credibility and purchase intention.

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.

The purpose of this study was to determine if and how the city district of Södra Innerstaden in Malmö, by using the Skärholms model, demand their client to reciprocate. The first problem set was to see how the demand was shown in the social service act from year 1998. From there the motives behind the introduction of the Skärholms model in city district of Södra Innerstaden were researched and also if there were a demand on reciprocity in city district of Södra Innerstaden public administration. The study was conducted in an exploratory way. The method used was to describe the idea behind Skärholms model after examining documents from the public administration.