Este trabalho tem por objetivo propor a utilização de soluções pré-definidas e comprovadas na abordagem MDA, auxiliando o desenvolvedor na resolução de problemas recorrentes ao desenvolvimento de software. A utilização destas soluções pré-definidas leva a um aumento de produtividade no contexto MDA e na geração de software baseado em boas práticas. Para que este objetivo seja cumprido, é empreendida uma análise sobre o MDA e sobre como operacionalizar as transformações entre modelos. Também é empreendida uma análise sobre o suporte fornecido pela UML e sobre reutilização em desenvolvimento orientado a modelos. Por fim este trabalho apresenta partes de uma aplicação protótipo, construída para ser uma prova de conceito de código gerado através da combinação de UML e soluções pré-definidas. / The goal of this work is to propose the use of pre-defined solutions on MDA approach, supporting the developer in solving recurrent problems of software development. The use of these pre-defined solutions leads to an increase of productivity in MDA context, and in the generation of software based on best practices. To reach this goal, an analysis of MDA is undertaken, as well as an analysis of how to enable the transformations between models. It is also undertaken an analysis about the use of UML and the reuse in model driven development. Finally this work presents portions of a prototype application, constructed to be a proof-of-concept of generated code, combining UML and the pre-defined solutions.

Este trabalho tem por objetivo propor a utilização de soluções pré-definidas e comprovadas na abordagem MDA, auxiliando o desenvolvedor na resolução de problemas recorrentes ao desenvolvimento de software. A utilização destas soluções pré-definidas leva a um aumento de produtividade no contexto MDA e na geração de software baseado em boas práticas. Para que este objetivo seja cumprido, é empreendida uma análise sobre o MDA e sobre como operacionalizar as transformações entre modelos. Também é empreendida uma análise sobre o suporte fornecido pela UML e sobre reutilização em desenvolvimento orientado a modelos. Por fim este trabalho apresenta partes de uma aplicação protótipo, construída para ser uma prova de conceito de código gerado através da combinação de UML e soluções pré-definidas. / The goal of this work is to propose the use of pre-defined solutions on MDA approach, supporting the developer in solving recurrent problems of software development. The use of these pre-defined solutions leads to an increase of productivity in MDA context, and in the generation of software based on best practices. To reach this goal, an analysis of MDA is undertaken, as well as an analysis of how to enable the transformations between models. It is also undertaken an analysis about the use of UML and the reuse in model driven development. Finally this work presents portions of a prototype application, constructed to be a proof-of-concept of generated code, combining UML and the pre-defined solutions.

<p>The transportation cost of logs from forest to customers is a large part of the overall cost for the Swedish forestry industry. Finding good routes from harvesting points to saw and pulp mills is a complex task, where the total number of feasible routes is extremely high. In this thesis we present two methods for log truck scheduling. </p><p>The first is to, from a given set of routes, find the most valuable subset that fulfils the customers demand. We use a model that is similar to the set partitioning problem and a method that is referred to as a composite pricing coupled with Branch and Bound. The composite pricing based method prices the routes (columns) and chooses the most valuable ones that are then added to the LP relaxation. Once an LP optimum is found, the Branch and Bound method is used to find an integer optimum solution. We have tested this on a case of realistic size. </p><p>The second method is a tabu search heuristic. Here, the purpose is to create efficient and qualitative routes from a given number of trips (referred to as predefined trips). From a start solution tabu search systematically generates new solutions. This method was tested on a small problem and on a five times larger problem to study how the size of the problem affected the result. It was also tested and compared on two cases in which the backhauling possibilities (i.e. instead of traveling empty the truck picks up another load on the return trip) had and had not been studied. The composite pricing based method and the tabu search method proved to be very useful for this kind of scheduling.</p>

The transportation cost of logs from forest to customers is a large part of the overall cost for the Swedish forestry industry. Finding good routes from harvesting points to saw and pulp mills is a complex task, where the total number of feasible routes is extremely high. In this thesis we present two methods for log truck scheduling. The first is to, from a given set of routes, find the most valuable subset that fulfils the customers demand. We use a model that is similar to the set partitioning problem and a method that is referred to as a composite pricing coupled with Branch and Bound. The composite pricing based method prices the routes (columns) and chooses the most valuable ones that are then added to the LP relaxation. Once an LP optimum is found, the Branch and Bound method is used to find an integer optimum solution. We have tested this on a case of realistic size. The second method is a tabu search heuristic. Here, the purpose is to create efficient and qualitative routes from a given number of trips (referred to as predefined trips). From a start solution tabu search systematically generates new solutions. This method was tested on a small problem and on a five times larger problem to study how the size of the problem affected the result. It was also tested and compared on two cases in which the backhauling possibilities (i.e. instead of traveling empty the truck picks up another load on the return trip) had and had not been studied. The composite pricing based method and the tabu search method proved to be very useful for this kind of scheduling.

No description available.

No description available.

LNG, natural gas, Brayton cycle, Rankine cycle