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 main subject with this master thesis is to take a closer look on how some of the university libraries of Gothenburg have evaluated their electronic services (such as search-systems, Internet-based services, CD-ROM etc.). The information technology has made its way into the library field during the past century and needs to be evaluated and quality measured to ensure the best possible service to the users. Since evaluation of electronic services is a new area in the evaluation field, some problems has arisen in terms of choosing evaluation strategies and finding the appropriate performance indicators for the evaluation process. The main questions asked in the thesis are; - Which are the most common theoretical strategies for evaluation? - How do some of the university libraries of Gothenburg perform evaluation in practice? - How does the various strategies for evaluation apply to the context of this thesis? The results show that specific strategies for evaluation aren't used in the reports discussed in this thesis.

The purpose of this study was to examine how the social services are applying the sections of the law concerning custody transfer within foster care. More specifically the aim was to find out what circumstances are underlying the social services decision to go through with a custody transfer within the foster care, and to find out which difficulties and possibilities the law offers when it comes to this process. The study was based on interviews with six respondents, within the social services, who have great experiences working with these issues. The study concluded that there are several factors which affects the decision whether to implement at custody transfer or not, and some of these are the child?s attachment, the child?s fundamental needs and consent from the involving parties in the case.

This is a study about how realtors or estate agents market their services in social media. Social media is an upcoming channel in marketing and is becoming more important every day. The user generated content on internet is a new way of communication where companies don?t have to be considered as soulless, if companies use it correctly. This study investigates estate agents efforts to market their services in these channels and how they do it.

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 aim of this study in social work was to investigate Swedish part-time sex workers' experiences of selling sex, of the Swedish Prohibition of Purchase of Sexual Services Act, of people's attitudes toward selling and buying sexual services and the consequences thereof. In the analysis the Erving Goffman stigma theories were used.Three part-time sex workers described their day-to-day experiences of selling sex as well as holding an ordinary job. None of them experienced that the Prohibition of Purchase of Sexual Services Act had an immediate effect on them in their work, what bothered them most was the attitudes toward sex work from society, friends and relatives. The negative attitude forced them to live a double life. None of the sex workers had the impression that the legislation had any concrete effects on their customers.

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.

This study highlights the problematic situation fathers encounter when they require help and support in a custodial dispute. Previous research shows the emergence of a new, more involved father. In the light of this earlier research, this study will show a father that is willing to fight for his rights to be a present and engaged parent in the case of a separation from the mother. The aim was to analyze the subjective perceptions of five fathers in custodial dispute. This analysis did not only show how they perceive their role as a father and their masculinity but also the way they feel about the help they got from social services and other institutions.

The municipalities of Sweden have a great responsibility when it comes to adapt the physical planning to a more sustainable development. The development of the society depends upon the growth of new communities and other public services, but to build new communities in a long-term sustainable manner you need good methods and guidance. This study presents four sustainability certification scheme intended to improve and adapt the planning, implementation and performance of new communities and infrastructure project to more sustainable methods based on economic, ecological and social sustainability. These systems are the latest versions of environmental classifications and similar rating schemes, but with a broader focus since they also include the social aspect of sustainability.This study aims to investigate what role sustainability certification schemes can play in local planning for sustainable development. The study compares the certification systems criteria to the tools and goals that the Swedish municipalities have been provided with, to lead efforts towards a more sustainable society.

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.