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.

This master thesis was carried out at Scania in Södertälje, Sweden. It investigates the possibility of changing a connector interface that is used when there is a need for splicing the wheel speed sensor and thereby determine the consequences.The problems that exist with the current connector interface occur during assembly, as more time is required to complete a connection in a reliable manner. A complete connection requires joining the male and female connector, insert the connection into a protective retainer and then strap a cable tie on each end of the retainer. This process makes it more time consuming and it requires 20-30 seconds to complete the connection. Solving this problem would save time and enable easier assembly, therefore resulting in economical benefits.This thesis was accomplished through discussions with different sections at Scania, studying available documentations, observations during assembly, writing a requirement specification and contacting suppliers.The aforementioned methods resulted in four connector suggestions, the DT and DTMH connector from Deutsch, MCON connector from TE connectivity and MLK connector from Kostal, each of them compliant with the set demands of the surrounding environment.

The aim of this master thesis is to study if the websites of the Swedish public libraries are accessible to all people. According to the library law all people must have access to the public libraries and their information services. Today, when the Internet is one of the largest sources of information, it is important that all people, including those with different kind of disabilities, children, elderly, immigrants and people with old technical equipment, have access to the public libraries websites.We have in this study considered the graphic user interface, the language, the structure and the navigation possibilities at ten public library websites. We have from a checklist of our own, based upon the opinion of different experts such as Jacob Nielsen and Tommy Sundström, investigated the websites.The main finding of our study is that the websites are generally accessible even thou we found a lack of accessible for immigrants. Most of the websites had some pages in English, but none hade all pages in this language.

1995 startade medlemmar ur Swedish Oral Medicine Society tillsammans med Institutionen förData och Informationsteknik på Chalmers tekniska högskola projektet MedView. Projektets syfte äratt utveckla modeller, metoder och datorbaserade verktyg för att stödja kliniker i deras dagligaarbete och forskning. 2005 lanserades webbcommunityn SOMWeb och projektet gick in i sin andrafas med fokus på nätbaserad kunskapshantering. Den virtuella mötesplatsen togs emot väl och detbeslutades att satsa vidare på ökad funktionalitet via Internet.Denna rapport beskriver utvecklingen av en webbapplikation som möjliggör åtkomst av denmedicinska bilddatabas som byggts upp under MedView-projektet. Som utgångspunkt förapplikationens funktionalitet och innehåll står skrivbordsapplikationen MedImager.

Prosthetic leg can give a negative psychological effect to the user, which ends up in decreased self-esteem and that the user hides his handicap. xCover gives a more natural volume and a cool look. xCover changes the look of the prosthetic leg C-leg. The product is constructed by us, Patrik Svensson and Magnus Zetterqvist, for Christoffer Lindhe at Lindhextend AB. Christoffer has hired Martin Bergman at Smedjan 17 to make the design.

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.

Denna rapport redogör kring arbetet med tjänsten Hästjuristen och svårigheterna kring att designa och utveckla en webbplats som inger förtroende och tillit. Hästjuristen är en helt ny tjänst som erbjuder information om hästjuridik och nedladdning av juridiska avtal rörande hästar. Målet med arbetet har varit att ta fram en fullt fungerande tjänst som är tilltalande, användarvänlig och förtroendeingivande för att göra det enklare för behövande att erhålla sig korrekta avtal.Arbetet med tjänsten har haft tre teoretiska modeller för webbutveckling för e-handelstjänster som grund. Intervjuer, personas, prototyper och användartester har varit delar av arbetsprocessen.Resultatet är en webbaserad tjänst som erbjuder nedladdning av hästavtal, information om hästjuridik och medlemskap. Webbplatsen är fullt responsiv och kodad i CSS, HTML, PHP och JavaScript..

The scope of this investigation is to decide how and to what extent the energy consumption of apassive house is affected by the users? knowledge and habits. To achieve this a literary study hasbeen made and as a complement the planning of a passive house was completed.The result of a primary study of the rules and regulations that effect passive houses in Swedenshows that the user?s influence on passive houses is a completely unregulated area. Even thoughthere is no regulation, a need for some general knowledge of the passive house concept has beenexpressed.To further investigate how the users? knowledge and habits affect the energy consumption and ifthere is a difference between different households? energy consumption , three main factors havebeen identified.

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.