The diploma thesis deals with project design documentation of a Relaxation – recreation hotel Dubník in Stará Turá. The object is designed as a two floor building with basement below ground level. Object´s ground plan is rectangular shaped. First floor contains a lobby, restaurant, a kitchen, and a hotel administration part. Second floor is meant for accomodiaton. Sauna and ice pool is designed in basement. Construction system is combinated. Coping consists of a double sloping roof made out of wooden roof trusses.

The subject of this thesis is processing of design documentation for construction of the fitness and relax centre. The designed building is situated in the town centre of Giraltovce, in built-up area near watercourse Radomka. It is designed as two-storey without basement and with warm flat roofs. The part of roofing with vegetation is used as a terrace. The building envelope is a ventilated facade of fair-faced bricks in combination with cement-bonded particleboards imitating the texture of wood. The structural system is designed as column system with point-supported slab from cast-in-place reinforced concrete.

Diploma thesis is solving new function of abandodoned brownfiled, which is connected to the national cultural herritage of Dolní oblast Vítkovic. New function is made of sport relax centre with wellness program, accomodation in hotel and refreshment in restaurant. This new function completes reuse of munument with view at blast furnace, exhibitions and museums. Sport relax centre is connected with monument by promenade leading to the bank of river Ostravice. Area includes sport grounds, relaxing places and water area.

Submitted by Caroline Periotto (carol@ufscar.br) on 2016-09-19T18:29:26Z No. of bitstreams: 1 DissRBL.pdf: 2233937 bytes, checksum: 7a73fb1e4ba8f340cb8d4bdf4e8153d4 (MD5) / Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-09-20T18:01:34Z (GMT) No. of bitstreams: 1 DissRBL.pdf: 2233937 bytes, checksum: 7a73fb1e4ba8f340cb8d4bdf4e8153d4 (MD5) / Approved for entry into archive by Marina Freitas (marinapf@ufscar.br) on 2016-09-20T18:05:15Z (GMT) No. of bitstreams: 1 DissRBL.pdf: 2233937 bytes, checksum: 7a73fb1e4ba8f340cb8d4bdf4e8153d4 (MD5) / Made available in DSpace on 2016-09-20T18:05:28Z (GMT). No. of bitstreams: 1 DissRBL.pdf: 2233937 bytes, checksum: 7a73fb1e4ba8f340cb8d4bdf4e8153d4 (MD5) Previous issue date: 2015-12-14 / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / The Brazilian market for dairy products is highly competitive and is still dominated by multinationals. Thus, it's essential that the national companies to invest in operational efficiency in order to compete successfully. Therefore, this research focuses in a small dairy company of the state of Pará, whose distribution system requires periodic stops for battery recharging. Moreover, the system is characterized by multiple periods and multiple time windows. To our knowledge, so far the literature hasn't presented a directly applicable methodology for the treatmeant of the application with similar characteristics. Therefore, aiming to provide more effective solutions than the ones in practice, a mixed integer linear model was developed to describe (and solve) the problem as a vehicle routing problem with time window constraints, multi-period and periodic stops for recharging. The results showed that the model adequately describes the distribution of the company, and the obtained solutions are better than those currently practiced. Furthermore, the model shows good performance within 3600 seconds of computational time for instances of 40 customers, 1 vehicle and 1 and 2 recharging stations. Aiming to tackle with larger examples, we developed a mathematical programming heuristic Relax-and-Fix to solve the model. It was also tested adapting a similar model present in the literature in order to analyze if the relaxation of some restrictions have a positive impact on the quality of the solutions. Finally, we propose a location-distribution model for recharging stations in order to examine whether the addition of new stations produce significant improvements in the solutions. / O mercado brasileiro de laticínios é altamente competitivo, sendo ainda dominado por multinacionais. Desta forma, é indispensável que as empresas nacionais invistam na eficiência operacional de forma a concorrer satisfatoriamente neste mercado. À vista disso, o foco desta pesquisa é uma pequena empresa de laticínios do Estado do Pará, cujo o sistema de distribuição a pontos de venda possui a particularidade de necessitar de paradas periódicas para recarga da bateria. Ainda, esse sistema tem como característica múltiplos períodos e múltiplas janelas de tempo. Nota-se que o levantamento bibliográfico realizado não apontou nenhuma metodologia diretamente aplicável para solução da aplicação real tratada. Portanto, objetivando provar soluções mais efetivas que as correntemente aplicadas na prática, foi desenvolvido um modelo linear inteiro misto para descrever (e resolver) o problema como um problema de roteamento de veículos com restrições janela de tempo, multi-períodos e paradas periódicas para recarga. Os resultados mostraram que o modelo proposto descreve adequadamente o processo distribuição da empresa, e as soluções obtidas são melhores que as praticadas atualmente. Além disso, verificou-se que o modelo tem um desempenho satisfatório em até 3600 segundos de processamento para instâncias de até 40 clientes, 1 veículo e até 2 postos de recarga. Com vistas ao tratamento de problemas de maior porte, foi desenvolvida uma heurística de programação matemática do tipo Relax-and-Fix para resolução do modelo. Também foi testada a adaptação de um modelo similar presente na literatura, visando analisar se a relaxação de algumas restrições impacta positivamente na qualidade das soluções. Finalmente, é proposto um modelo de localização-distribuição de postos de recarga, de forma a se examinar se a inclusão de novos postos produz melhorias significativas nas soluções atuais. / FAPESP: 14/10330-0

Made available in DSpace on 2016-06-02T19:50:25Z (GMT). No. of bitstreams: 1 6346.pdf: 5901404 bytes, checksum: 2d78b0f5f68ac25a089acd315f55b157 (MD5) Previous issue date: 2014-06-09 / The production of sugar, ethanol and electricity from sugar cane necessarily involves harvesting and transportation of raw materials, which are expensive and complex operations and have significant influence on the quality of the industrial raw material. The literature reports several optimization approaches related to the planning of planting, harvesting and transporting of sugarcane, however the scheduling of harvesting fronts is underexplored. This thesis intends to contribute to the state-of-art of this important issue in the context of the Brazilian agribusiness. Optimization approaches to support scheduling decisions of harvesting fronts considering the balance of harvesting and transportation capacities, as well as good agronomic management are proposed. The approaches are inspired by the representation of the problem as a lot sizing and scheduling model with parallel machines and sequence-dependent setup costs and times, a modelling technique well studied in the production planning and control literature. Three variants of this formulation, based on mathematical programming models, were developed and tested in two real case studies of medium size sugar mills. Heuristic methods based on aggregation procedures and mathematical programming have also been studied and developed to solve large scaled problems found in practice. Among the three variants studied, one presented the best solution quality within the expected execution time. Important scenario analysis were done indicating that the schedule s fulfilment provides reduction of harvesting and transporting complexity to the following season, which can generate significant saves in the cases studied. Besides that, comparing the proposed scheduling method with one of the sector s practice, it can be generated also significant cost reduction in the cases studied. The results were analyzed according to a validation methodology (descriptive facet of tetraedrum) well known in the literature. / A produção de açúcar, álcool e energia elétrica a partir de cana-de-açúcar passa necessariamente pela colheita e transporte da matéria-prima, que são operações custosas, complexas e que interferem significativamente na qualidade da matéria-prima industrial. A literatura reporta várias abordagens de otimização relacionadas ao planejamento do plantio, da colheita e do transporte de cana-de-açúcar, todavia a programação das frentes de colheita é pouco explorada. Nesta tese pretende-se contribuir para o estado da arte deste importante tema no contexto do agronegócio brasileiro. Propõe-se abordagens de otimização para apoiar decisões de programação das frentes de colheita, considerando-se o equilíbrio das capacidades de colheita e transporte, bem como um bom manejo agronômico. As abordagens são inspiradas na representação do problema por meio de um modelo de dimensionamento de lotes e sequenciamento da produção em máquinas paralelas com custos e tempos de setup dependentes da sequência, bem estudado na literatura em contextos de planejamento e controle da produção. Para isso foram desenvolvidas três variantes desta formulação baseadas em programação matemática, voltadas para a programação das frentes de colheita, que foram testadas em dois estudos de caso reais de usinas de cana-de-açúcar de médio porte do setor. Métodos heurísticos baseados em procedimentos de agregação e programação matemática também foram estudados e desenvolvidos para a resolução dos problemas de grande porte encontrados na prática. Das três variantes estudadas, uma delas apresentou melhor qualidade da solução dentro de tempos computacionais aceitáveis para o problema. Análises de cenário importantes foram feitas indicando que o cumprimento da programação proporciona redução de complexidade da colheita e transporte na safra seguinte, podendo gerar economias significativas nos casos estudados. Além disso, a comparação dos resultados das abordagens aqui exploradas com o que é praticado no setor indica um potencial de redução de custos também significativo para os casos estudados. Os resultados foram analisados de acordo com uma metodologia de validação (faceta descritiva do tetraedro) conhecida na literatura.

Space for spiritual and physical freedom in harmony of civilisation and nature. Clearly defined dominant building leaving the visitors and passants in full freedom.

With project I present a make more attractive part of the territory of the dam, through which I bring two new paths for visitors from the coast and the other from the surface. The overall objective of the procejt is to attract visitors to the dam for more than one day trip or just a walk. The number of hotels and guesthouses on the dam is excessive. I have therefore decided to offer nature lovers accommodation in the country in the immediate vicinity of water while ensuring the necessary comfort. The objective of the present proposal is to present a potential year-round use options of Brno dam - Spa in the frozen surface of the dam, accommodation for schools, and summer camps could revitalize this part even during other year periods.

Le problème d’ordre linéaire (LOP) a reçu beaucoup d’attention dans différents domaines d’application, allant de l’archéologie à l’ordonnancement en passant par l’économie et même de la psychologie mathématique. Ce problème est aussi connu pour être parmi les problèmes NP-difficiles. Nous considérons dans cette thèse une variante de (LOP) sous contrainte de cardinalité. Nous cherchons donc un ordre linéaire d’un sous-ensemble de sommets du graphe de préférences de cardinalité fixée et de poids maximum. Ce problème, appelé (FCLOP) pour ’fixed-cardinality linear ordering problem’, n’a pas été étudié en tant que tel dans la littérature scientifique même si plusieurs applications dans les domaines de macro-économie, de classification dominante ou de transport maritime existent concrètement. On retrouve en fait ses caractéristiques dans les modèles étendus de sous-graphes acycliques. Le problème d’ordre linéaire est déjà connu comme un problème NP-difficile et il a donné lieu à de nombreuses études, tant théoriques sur la structure polyédrale de l’ensemble des solutions réalisables en variables 0-1 que numériques grâce à des techniques de relaxation et de séparation progressive. Cependant on voit qu’il existe de nombreux cas dans la littérature, dans lesquelles des solveurs de Programmation Linéaire en nombres entiers comme CPLEX peuvent en résoudre certaines instances en moins de 10 secondes, mais une fois que la cardinalité est limitée, ces mêmes instances deviennent très difficiles à résoudre. Sur les aspects polyédraux, nous avons étudié le polytope de FCLOP, défini plusieurs classes d’inégalités valides et identifié la dimension ainsi que certaines inégalités qui définissent des facettes pour le polytope de FCLOP. Nous avons introduit un algorithme Relax-and-Cut basé sur ces résultats pour résoudre les instances du problème. Dans cette étude, nous nous sommes également concentrés sur la relaxation Lagrangienne pour résoudre ces cas difficiles. Nous avons étudié différentes stratégies de relaxation et nous avons comparé les bornes duales par rapport à la consolidation obtenue à partir de chaque stratégie de relâcher les contraintes afin de détecter le sous-ensemble des contraintes le plus approprié. Les résultats numériques montrent que nous pouvons trouver des bornes duales de très haute qualité. Nous avons également mis en place une méthode de décomposition Lagrangienne. Dans ce but, nous avons décomposé le modèle de FCLOP en trois sous-problèmes (au lieu de seulement deux) associés aux contraintes de ’tournoi’, de ’graphes sans circuits’ et de ’cardinalité’. Les résultats numériques montrent une amélioration significative de la qualité des bornes duales pour plusieurs cas. Nous avons aussi mis en oeuvre une méthode de plans sécants (cutting plane algorithm) basée sur la relaxation pure des contraintes de circuits. Dans cette méthode, on a relâché une partie des contraintes et on les a ajoutées au modèle au cas où il y a des de/des violations. Les résultats numériques montrent des performances prometteuses quant à la réduction du temps de calcul et à la résolution d’instances difficiles hors d’atteinte des solveurs classiques en PLNE. / Linear Ordering Problem (LOP) has receive significant attention in different areas of application, ranging from transportation and scheduling to economics and even archeology and mathematical psychology. It is classified as a NP-hard problem. Assume a complete weighted directed graph on V n , |V n |= n. A permutation of the elements of this finite set of vertices is a linear order. Now let p be a given fixed integer number, 0 ≤ p ≤ n. The p-Fixed Cardinality Linear Ordering Problem (FCLOP) is looking for a subset of vertices containing p nodes and a linear order on the nodes in S. Graphically, there exists exactly one directed arc between every pair of vertices in an LOP feasible solution, which is also a complete cycle-free digraph and the objective is to maximize the sum of the weights of all the arcs in a feasible solution. In the FCLOP, we are looking for a subset S ⊆ V n such that |S|= p and an LOP on these S nodes. Hence the objective is to find the best subset of the nodes and an LOP over these p nodes that maximize the sum of the weights of all the arcs in the solution. Graphically, a feasible solution of the FCLOP is a complete cycle-free digraph on S plus a set of n − p vertices that are not connected to any of the other vertices. There are several studies available in the literature focused on polyhedral aspects of the linear ordering problem as well as various exact and heuristic solution methods. The fixed cardinality linear ordering problem is presented for the first time in this PhD study, so as far as we know, there is no other study in the literature that has studied this problem. The linear ordering problem is already known as a NP-hard problem. However one sees that there exist many instances in the literature that can be solved by CPLEX in less than 10 seconds (when p = n), but once the cardinality number is limited to p (p < n), the instance is not anymore solvable due to the memory issue. We have studied the polytope corresponding to the FCLOP for different cardinality values. We have identified dimension of the polytope, proposed several classes of valid inequalities and showed that among these sets of valid inequalities, some of them are defining facets for the FCLOP polytope for different cardinality values. We have then introduced a Relax-and-Cut algorithm based on these results to solve instances of the FCLOP. To solve the instances of the problem, in the beginning, we have applied the Lagrangian relaxation algorithm. We have studied different relaxation strategies and compared the dual bound obtained from each case to detect the most suitable subproblem. Numerical results show that some of the relaxation strategies result better dual bound and some other contribute more in reducing the computational time and provide a relatively good dual bound in a shorter time. We have also implemented a Lagrangian decomposition algorithm, decom-6 posing the FCLOP model to three subproblems (instead of only two subproblems). The interest of decomposing the FCLOP model to three subproblems comes mostly from the nature of the three subproblems, which are relatively quite easier to solve compared to the initial FCLOP model. Numerical results show a significant improvement in the quality of dual bounds for several instances. We could also obtain relatively quite better dual bounds in a shorter time comparing to the other relaxation strategies. We have proposed a cutting plane algorithm based on the pure relaxation strategy. In this algorithm, we firstly relax a subset of constraints that due to the problem structure, a very few number of them are active. Then in the course of the branch-and-bound tree we verify if there exist any violated constraint among the relaxed constraints or. Then the characterized violated constraints will be globally added to the model. (...)

The theme of the dissertation titled the Centre of Sport and Leisure Time in Brno is a design of a relaxing and sport site „Centrum Lužánky“. The subject of this project is architectonic-city-planning study, which deals with elaborating a concept of a sport centre behind Lužánky in Brno-Ponava. This dissertation contains details of the facility and the area of the current swimming pool Lužánky. The current state of the facility built in 1979 doesn’t meet requirements of visitors and sportsmen anymore. The main aim of this project is the reconstruction of the current fifty-meter swimming pool, a design of a new swimming pool placed under the ground floor of the current building, which will provide space for organizing international competitions, trainings of professional sportsmen, etc. At the same time the busyness of the current swimming pools would be lowered by building a new indoor and outdoor waterpark, especially for the group of recreational visitors. The attractiveness of the facility will be increased by the newly designed park relaxing area and proposed multipurpose area, used as a sports field in the summer and as an ice ring in the winter. Additional value of the facility is comprised by an indoor and outdoor café and large relaxing area on the roof of the waterpark. The whole area increases the community facility availability by a proposed wide range of services for health, relax and sport. The advantage of the whole concept is the mutual connection of all facilities. The entrance to the area is shortened by a designed pedestrian bridge, accessible from the south and north busy areas. The whole project is enhanced by increased number of new parking places, located particularly along the access road, the street Sportovní, going through a green zone. The road and parking places are proposed in the design of residential streets, respecting walking pedestrians. The area has a very rich sport history, which is dated back to 1922. The new concept increases th

The design of the sports and recreation center in Vsetín solves the complete revitalization of the unused territory on the periphery of the town in the Ohrada district. The aim of the project is to revive the poorly accessible and neglected area and its use not only for a wide range of sports activities, but also for leisure activities and recreation. The whole area should be freely accessible and open to a wide range of public. Four main buildings are designed in the complex: a multi-purpose sports hall, a hotel, a tennis club and a snack bar with a bicycle service. There is a football field, a basketball court and a small football pitch on the open spaces between these objects, as well as two climbing walls, an outdoor gym and a parkour area with many obstacles. The rest of the areas are pavements and free grass areas intended for leisure and recreation of visitors.