The last decade has created an increasing pressure on companies to decrease their impact on the environment and to increase their effectiveness of recycling the company?s resources, especially for the steel industry. Companies have also started to realize the economic aspects of an effective internal reverse logistics. In the past the value of an effective internal reverse logistic was something that companies tend to underestimate and there are few academic studies done in this area. The purpose of this essay has been to identify key factors to create an effective in plant storage, transport, sorting and handling of returned steel. From these factors a generalized model for creating an effective return steel flow will be developed.

The thesis has investigated how Sandvik Coromant could implement the SMED principle on one of their grinders groups and what improvements it would lead to. The aim of the thesis is to identify the current situation and investigate how their setup times would be affected by SMED. The work initiated with a literature analysis about the SMED principles and then proceeded with an analysis of the current situation where the activity was time mapped. The analysis consisted of time trials of the process that the thesis would include. The time studies revealed opportunities for structural improvements to create environment for a more structured process.

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.

Friytande bilpooler tillåter envägsresor med start och slut vid vilken parkeringsplatssom helst inom ett avgränsat driftområde, vanligen en stadskärna. Till skillnadfrån traditionella bilpooler, vari bilar alltid ska återlämnas där de hämtats, finns riskatt fordon blir olämpligt fördelade. Driftoptimering genom dynamisk prissättning utvecklades i detta arbete med målet att möjliggöra ett kostnadsffektivt sätt att säkerställa tillgänglighet av fordon, och därmed lönsamhet, i friytande bilpooler.Två modeller för dynamisk prissättning utvecklades, samt implementerades i en prototyp av en IT-lösning för friytande elbilspooler. Grunden till den första modellenutgjordes av en verifierad modell för kostnadsminimering av stationsbaserade bilpooler med envägsresor. Modellen är baserad på MILP och hämtades ur Alvina Keksavhandling Decision support tools for carsharing systems with exible return time and stations (2006).

Along with rising energy prices and increasing awareness of environmental issues, the criteria for buildings energy performance have been sharpened through the years. Today, ?passive house? and ?low energy house? are commonly used phrases in the construction industry and is expected to become increasingly common in the future.For houses with well-insulated building envelope the importance of well constructed details increases when minimizing the heat losses. Examples of these details are floor-wall junction and window openings in the wall. In such connections thermal bridges occur, which means that heat more easily is transported out of the building, compared to the rest of the building envelope.This report deals with detail solutions around windows and a comparison between a traditional slab and a foundation from Koljern consisting of foam glass.

A third party access to district heating networks has been proposed in Sweden, to increase the competition on the district heating market. Such third party access could create opportunities for the agricultural sector as an energy producer. This study describes the technical, economical and environmental prerequisites for a farmer cluster to build and run a heating plant, fueled with local wood fuel. The heating plant in the described scenario is 8 MW and will supply a village of 1000 houses, and is fueled with wood chips exclusively. Supplying a heating plant with fuel puts high demands on the logistics, since there need to be a continuous flow of fuel. In the scenario, wood residues from felling and thinning is stored in stacks in the forest, and a few times a year chipped and transported to a storage area at the heating plant. In the study, an estimation of the profitability has been made by estimating the cost of the investment, personnel, operating and maintenance costs and costs for the fuel and ash handling.

This literature study concerned the use and function of the radioactive isotope carbon-14, as a dating method of organic material, within the scientific field of physical geography. In this report it is presented the need of atmospheric calibration curves and the development of these as a necessity to translate carbon-14 years to calibrated calendar years. A number of common age-depth models that is used to give an approximation of an accumulation sequence and its related dates over the actual time period in different natural archives is presented and discussed. Different problems that commonly occur when age-depth models are utilized as for instance reservoir effects, contaminations or other age deviations are addressed and analyzed. The software CLAM in presented and discussed and was also used to produce age-depth models.

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.