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.

I detta projekt har en webbplats utformats enligt måldriven design. Arbetssättet har delvis följt den agila metoden scrum. Syftet med webbplatsen är att fungera som ett verktyg för praktiserande tjänstedesigners samt studenter i processen att välja visualiseringsteknik för att representera data. Begreppet användbarhet samt olika metoder för att testa detta har utretts. Intervjuer har genomförts, dessa har legat till grund för personor och scenarier.

This Master Thesis has been carried out in cooperation with Silva Sweden AB. A companywhich manufactures products like compasses, pedometers, headlamps, hiking poles and otherequipment for the out door life and navigation. The purpose of the project has been toassemble methods and models which support user involvement in Silva?s design process.Thus, to increase the number of products with purchasing power, enhance product quality aswell as increase foundation for new product ideas.The focus through out the project has been to assemble a pallet with methods for userinvolvement and from this select a few methods that will fit the company. The purpose of thepallet is to be accessible for the company during their work of change with the design processthat has been going on and will be in the future.

På uppdrag av GGP Sweden AB genomfördes detta projekt med syftet att ta fram en ny extriör design till Stigas åkgräsklipparemodell Park Compact.Brukarnas estetiska och funktionella behov undersöktes genom grundlig informationsinsamling i form av marknads- och konkurrentanalyser, brukar- och säljarintervjuer samt enkätundersökning. Med hjälp av insamlad data kunde produktens målgrupp identiferas, varpå primära och sekundära personas utformades. Genom dessa kunde brukarbehoven kompletteras och preciseras ytterligare.För att behålla Stigakänslan i produkten genomfördes en form- och färganalys av företagets befintliga sortiment. Tillsammans med övrig data från informationsinsamlingen mynnade denna analys ut i en moodboard som kunde användas för att på ett tidigt stadium visualisera känslan hos produkten.Data från informationsinsamlingen låg sedan till grund för att utforma en kravspecifikation och där visa de krav och önskemål som projektet förväntas uppfylla. Produktens viktigaste egenskaper framhölls som en modern exteriör design som passar nuvarande konstruktionsplattform, bibehåller familjekänslan med övriga Stigasortimentet samt har mindre direkt materialkostnad än nuvarande designlösning.

Companies in the western world can no longer compete by using traditional means such as product and price since the commerce of services continually grows. To avoid similarity and increase competitive advantages modern companies have to be more specified. The competition between companies has increased and customers are harder to reach. Customers of today can afford luxury but trend indicates that originality, identity, and status are more important than factual needs. Products created and consumed at the same time within the service market are often very homogenous (similar).

A group of companies that only recently has caught the attention of Swedish designers, enterprises and media are the so -called "furniture pirates". In Sweden it?s mainly two companies that have ended up in the spotlight. The online stores Ikon M and Designers Revolt are two companies which currently sell replicas of famous Swedish and foreign designers. Although the designs sold are copyright protected in Sweden, and most other European countries, the right holders can only stand by and watch as more or less exact copies are sold for a fraction of the price of the originals.The business model - to exploit the EU?s free movement of goods and the UK's short term of copyright protection in matter of mass-produced art (industrial design) - has proven successful for the companies that practice 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 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 paper is to standardize and simplify the design work on a few specific types of storage brackets for balconies. The company Balco AB had the wish to simplify the design work in the preparation of attachments to their balcony structures. This would be done by a calculation matrix that could be produced which then in turn could be used for each new project by the company. The design work behind the development of these fittings at each new project is costly both in terms of time devoted by each calculation but also the cost of the time. The purpose of this report is that in a systematic manner, a calculation matrix can be created that then the company instead may follow from each new project.In carrying out the project used HILTI calculation program, which was provided by the company HILTI.