• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.3.1987.tde-11042024-135304
Document
Author
Full name
Carlos Alberto Campagner
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 1987
Supervisor
Committee
Tu, Carlos Chien Ching (President)
Brinati, Marco Antonio
Plaza, Joao
Title in Portuguese
Projeto otimizado de suportes de caminhos de rolamento metálicos para pontes rolantes.
Keywords in Portuguese
Algoritmos
Colunas
Rolamentos
Vigas
Abstract in Portuguese
Este trabalho apresenta um algorítmo simples, que minimize a seção transversal de vigas e colunas I usadas como suporte estrutural de caminhos de rolamentos de pontes rolantes. Devido à natureza altamente não-linear das restrições com variáveis discretas (como a bitola e larguras das chapas), os únicos métodos viáveis são baseados na busca exaustiva. A pesquisa de todas as possíveis combinações dessas variáveis (oito) foi evitada dividindo o processo de otimização em dois. As seções da viga e das colunas foram minimizadas separadamente (para busca sistemática sobre quatro variáveis de cada vez), sem considerar as interações (ou esforços) entre elas. Em seguida, esses esforços são obtidos pela análise matricial de nova estrutura combinada (problema hiperestático). Usando esses novos esforços, a viga e as colunas são otimizadas outra vez. Isto é repetido até obter a convergência. Essa convergência pode ser grandemente acelerada através de uma boa escolha dos pontos de partida. Nesse trabalho, os esforços são inicialmente estimados usando um modelo simplificado (isostático) dos suportes. Isto provou ser altamente eficaz pois, nos exemplos considerados, o número de interações necessárias para convergência não ultrapassou quatro.
Title in English
Untitled in english
Keywords in English
Algorithms
Beams
Bearings
Columns
Abstract in English
This paper describes a simple algorithm that finds the minimun cross sectional area of I shaped columns and beam used as structural supports for the rails of travelling overhead cranes. Due to the highly non-linear nature of the constraints of discrete variables (like sheet metal gages and widths), the only viable methods are based on exhaustive searches. The examination of all the possible combinations of these variables (eight) was avoided by dividing the optimization process into two. The cross sections of the beam and columns were minimized separately (by systematic search over four variables at a time) without considering the interactions (or forces) between them. Next, these forces are obtained by matrix analysis of the whole (new) structure (a statically indeterminate problem). Based on these forces, the beam and colums are optimized again. This is repeated until convergence is achieved. This convergence can be greatly accelerated by the proper choice of initial conditions. In this work, these forces are estimated, at first, based on a simplified (statically determinate) model of the supports. This proved to be highly effective since in the examples considered, the number of iterations necessary for convergence was less than four.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2024-04-11
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2024. All rights reserved.