Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Multiobjective optimal topology design of structures (1998)
    Springer
    Computational mechanics 21 (1998), S. 483-492 
    Details
    ISSN: 1432-0924
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The multiobjective topology optimization designs have been tried in this paper. The minimum compliance and the maximum fundamental eigenvalue are the two objectives pursued. The constraint is the amount of material which is allowed to use in a specified design space. The design variables are the normalized densities of the finite elements in the design space. To minimize the number of elements whose design variables have values between 0 and 1, penalties are added to those design variables to force them to be either 0 (nonexistence) or 1 (existence). The timing of adding the penalty is also studied. Topologies obtained in two dimensional design space with or without penalty and using different timing approaches are compared and discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004660050327
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Optimum design of structures with both natural frequency and frequency response constraints (1992)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 33 (1992), S. 1927-1940 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An efficient method is developed to compute the sensitivities of eigenvalues, eigenvectors and frequency responses in a reduced approximate rnodel. The reanalyses of a modified structure for those dynamic responses are also derived in the approximate model. An optimization process utilizing the efficiently calculated sensitivities and reanalyses of the modified structure is formed. The difficulties of finding eigenvector sensitivities for repeated modes have also been addressed and averted in the approximate model. Two numerical examples show satisfactory outcomes by using this proposed approach.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620330910
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Calculation of the move limits for the sequential linear programming method (1993)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 36 (1993), S. 2661-2679 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The sequential linear programming (SLP) method is one of the easiest optimization techniques used to treat non-linear optimization problems. The successful application of the method is based on the proper choice of the move limits, which are unfortunately uncertain in the SLP algorithm. To enhance the efficiency and reliability of the SLP algorithm, six methods are proposed to calculate the move limits. The first three methods use the constraint equations to compute the minimum variations needed from the current design point to reach the constraint boundaries. The fourth method incorporates the cost function information as well as the constraints to figure out the move limits. The last two methods form a quadratic programming (QP) subproblem and solve for the change of the quadratic cost function. The move limits used in SLP are then computed from the estimated change of the linear cost function from the QP solution. Four numerical examples are employed to demonstrate the solution process by the methods proposed. The advantages and disadvantages of these methods are discussed.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620361510
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    IMPROVEMENTS OF SIMPLE GENETIC ALGORITHM IN STRUCTURAL DESIGN (1997)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 1323-1334 
    Details
    ISSN: 0029-5981
    Keywords: genetic algorithm ; improvements ; structures ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The efficiency of Simple Genetic Algorithm (SGA) can be improved by some strategies. They are elitest strategy, multi-point crossover, identification of passive design variables, gradual increase of penalty parameter, and bit-wise local search. Topology optimization using GA is also discussed in this paper and examples are given. Five numerical examples show the efficiency and the optimum solutions of GA are greatly improved by these strategies. © 1997 John Wiley & sons, Ltd.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...