116 resultados para Layout algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Tendo como foco o estudo da área interna do edifício da Prefeitura Municipal de Bauru, o trabalho em questão visa o desenvolvimento de um projeto de interiores utilizando requisitos da arquitetura corporativa, e critérios de sustentabilidade para a escolha de materiais. Será considerada ainda a eficiência energética na utilização de condicionamento de ar e iluminação, assim como a otimização dos espaços de permanência e fluxo de pessoas

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The proper management of materials storage is essential to supply the needs of production and reduce the inventory costs. Moreover, an effective layout contributes to improve the productivity and reduce the operational costs of a warehouse. This way, the purpose of this study was: to propose an expansion project to the warehouse of a factory in the food sector, suggesting a layout that best fit their needs and to verify its economic feasibility. To achieve this goal, it was applied methods such as ABC curve, spaghetti diagram and concepts of economics engineering to the analysis of investment in the project. The results showed that the second layout model was better than the first, supporting the storage capacity required by the company and presenting an internal movement more efficient. However, with the investment analysis, it was found that it was not feasible, given the conditions of the company, investing in the expansion of the warehouse

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background: Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods: Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results: This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion: The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In industrial plants, there is a department responsible for planning the use of productive resources to find the best possible way to set out plans in strategic, tactical and operational levels. This department is known as PCP or PPCP, which means Planning and Production Control and Planning, Programming and Production Control, respectively. This work presents the use of some of the tools from this department, in particular the Aggregate Production Planning, to propose a new layout of electronic nutrunners for an auto parts industry output line. Through some process indicators analyzes, was identified some productivity losses. The higher loss rate occurred by the electronic nutrunners breaking, and so this work was focused in these devices. Some premises were adopted for the use of electronic nut runners, setting an ideal cycle time for the operation of the production line and making calculations to define the minimum amount of electronic nutrunners to find the production demand without damaging the equipment. With this work we observed that a relevant factor for the constant breaks of electronic nutrunners is because these are working with overload, in other words, the amount of installed equipment is not enough to supply the demand without failures

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This work was based on a case study of improvement of the warehouse layout of a multinational automotive glass sector, located in the State of Sao Paulo. The aim was to propose a layout template to be more effective and besides optimizing production would also promote an increase in warehouse packaging capacity for metal containers containing glasses, thus reducing operating costs. To achieve the desired purpose, it was developed two layout proposals and to this end inventory management tools have been used, such as ABC curve and the Spaghetti Diagram, and other concepts of Packaging Engineering and Logistics. By the end of this work, it was obtained as a result, a project in which it was possible to rearrange the packages according the demand, and the developed changes became the most efficient layout both in storage capacity as well as in the internal drive

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, to solve the reconfiguration problem of radial distribution systems a scatter search, which is a metaheuristic-based algorithm, is proposed. In the codification process of this algorithm a structure called node-depth representation is used. It then, via the operators and from the electrical power system point of view, results finding only radial topologies. In order to show the effectiveness, usefulness, and the efficiency of the proposed method, a commonly used test system, 135-bus, and a practical system, a part of Sao Paulo state's distribution network, 7052 bus, are conducted. Results confirm the efficiency of the proposed algorithm that can find high quality solutions satisfying all the physical and operational constraints of the problem.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A self-learning simulated annealing algorithm is developed by combining the characteristics of simulated annealing and domain elimination methods. The algorithm is validated by using a standard mathematical function and by optimizing the end region of a practical power transformer. The numerical results show that the CPU time required by the proposed method is about one third of that using conventional simulated annealing algorithm.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Pós-graduação em Engenharia Elétrica - FEIS