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 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.

För företag inom logistik och lager är kostnadseffektiva och pålitliga logistiklösningar viktiga faktorer. Inleverans till lager, plock från lagerhylla, pack till kolli samt leverans till slutkund är exempel på logistiska aktiviteter och ständigt pågår förbättringsarbeten för att kostnadsoptimera och säkerställa att rätt artikel lagras, plockas och levereras på ett säkert och optimalt sätt.Denna examensrapport redovisar en heuristisk metod för att kostnadseffektivt och säkert plocka och packa läkemedel. Systemlösningen för metoden är implementerad och i drift på två av KD Pharmas läkemedelslager i Sverige. Metoden kan härledas från två klassiska, datalogiska problem som var för sig är lösbara med kända algoritmer men som i kombination är ett komplext problem som endast ger lösningar genom iterativa metoder. I akademiska sammanhang brukar dessa två problem kallas ?Traveling Salesman? respektive ?Binpacking?, det vill säga problemlösningar som syftar till att finna kortast väg genom ett nodnät och effektivt packa stycken i boxar.

I denna rapport har vi utforskat olika metoder som löser handelsresandeproblemetmed hjälp av rumsfyllande kurvor. Vi har utgått från en klassisk algoritm av Bartholdioch Platzman och förbättrat den med avseende på lösningslängd med två egna algoritmer.Vi har under arbetets gång utvecklat programvara som använder dessa algoritmer.Vi har undersökt körningstid, lösningslängd och stabilitet för de olika algoritmerna ochanalyserat resultaten. Rapporten innehåller även en inledande teoretisk beskrivning avplanfyllande kurvor och NP-komplexitet..

The purpose of this Master Thesis is to compare two American novel suites for young women, Louisa May Alcott?s Little Women and Good Wives to Ann Brashares series of The Sisterhood of the Traveling Pants. The social status of women and children in the US during the 19th century is analyzed and compared historically and literary with the situation 130 years later.The main question is, what differences exist in the books and is there a connection between the changes in society and literature?The method of this Master Thesis is to make a comparative narratological analysis placed in a historical context.The result shows that the multiple character remains and enhances the identification process. Motherhood in the works of Alcott is prominent, whereas in the works of Brashares, sisterhood replaces motherhood.In Alcott?s US during the 19th century, Christian faith was in the foreground.

Computational thinking was brought to the forefront in 2006 by Jeannette Wing. Computational thinking is a problem solving method that uses computer science techniques.The thesis is analyzing computational thinking and how it could be applied to graph theory. Characteristics and main fields from computational thinking is being analysed. This analysis is applied to graph theory to see the potential in developing a proposal for how an exercise can look for an introductory course in discrete data types. Only basic knowledge of graphs is required to perform the exercise.

Computational thinking was brought to the forefront in 2006 by Jeannette Wing. Computational thinking is a problem solving method that uses computer science techniques.The thesis is analyzing computational thinking and how it could be applied to graph theory. Characteristics and main fields from computational thinking is being analysed. This analysis is applied to graph theory to see the potential in developing a proposal for how an exercise can look for an introductory course in discrete data types. Only basic knowledge of graphs is required to perform the exercise.

This master thesis was made to describe how sales organisations are constructed in Sweden within an industry with almost every sales situation as a new task selling, and where almost every selling is over one million Skr. One of these industries is the homebuilding industry with companies that manufacturers prefabricated houses and semi-fixed manufactured homes in Sweden. The pre-studies where made by using the Internet, intervjues and theory studies to construct a conceptual framework. The sales organisation was conceptualized to be able to measure: salesman, sales leader, improved skills, communication, reported information, compensation and company targets. This conceptualisation and operationalisation lead to a survey that captured organisations within the homebuilding industry in Sweden.

The purpose of this study is to shed light on and describe Kramfors travel centers function and relationship to the surrounding urban environment, and how this core is experienced by residents and visitors. To do this, the use of the travel center, its relationship to Kramfors city center and the perception of it, as well as possible improvement areas has been studied.This has been examined using a quantitative method by designing a questionnaire and the usage of a research strategy through the implementation of a small-scale survey. Within this a cluster sampling was applied.The result shows that Kramfors travel centers is primarily used for traveling and is used most frequently by the visitors within the study. It is also shown that residents 'primary reason for traveling from the travel center is friends and family, followed by shopping, and that the visitors' primary motive for traveling is friends and family as well, followed by work. The mode of transportation between the travel center and destinations are mainly walking, while the mode of transport between homes and the travel center proves to be the car.

In autumn in 2010 the project group came in contact with the travel company Golf Joy in Halmstad. They had been briefed on the problems of their customers had when they travel with their golf bags and contacted Halmstad University for help in solving this problem. When we heard about this idea, we became curious and contacted the company. After a successful meeting, we took the problem with us to the school and began to brainstorm to see how we could solve the problem. The goal was to produce a stylish and functional travel golf bag with the cart and bag in one and launch it in the golf season in 2012.