Applications of the COC algorithm in layout optimization

G. Rozvany, M. Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

69 Citations (Scopus)

Abstract

Whilst the advantages of iterative continuum-based optimality criteria (COC) methods in cross-section optimization ('sizing') were discussed elsewhere, this paper is devoted to applications of the above technique in layout optimization. Earlier studies of the latter field by others used a two-stage process consisting of separate topological and geometrical optimization and considered only a very small number of members . It will be shown here that the COC algorithm achieves a simultaneous optimization of the topology and geometry in layout problems with many thousand potential members. Moreover, some observations on shape optimization by the 'homogenization' method are offered and an alternative approach to global shape optimization is suggested.

Original languageEnglish
Title of host publicationLecture Notes in Engineering
PublisherPubl by Springer-Verlag Berlin
Pages59-70
Number of pages12
Edition63
Publication statusPublished - 1991
EventProceedings of the International Conference on Engineering Optimization in Design Process - Karlsruhe, Ger
Duration: Sep 3 1990Sep 4 1990

Other

OtherProceedings of the International Conference on Engineering Optimization in Design Process
CityKarlsruhe, Ger
Period9/3/909/4/90

Fingerprint

Shape optimization
Homogenization method
Global optimization
Topology
Geometry

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Rozvany, G., & Zhou, M. (1991). Applications of the COC algorithm in layout optimization. In Lecture Notes in Engineering (63 ed., pp. 59-70). Publ by Springer-Verlag Berlin.

Applications of the COC algorithm in layout optimization. / Rozvany, G.; Zhou, M.

Lecture Notes in Engineering. 63. ed. Publ by Springer-Verlag Berlin, 1991. p. 59-70.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rozvany, G & Zhou, M 1991, Applications of the COC algorithm in layout optimization. in Lecture Notes in Engineering. 63 edn, Publ by Springer-Verlag Berlin, pp. 59-70, Proceedings of the International Conference on Engineering Optimization in Design Process, Karlsruhe, Ger, 9/3/90.
Rozvany G, Zhou M. Applications of the COC algorithm in layout optimization. In Lecture Notes in Engineering. 63 ed. Publ by Springer-Verlag Berlin. 1991. p. 59-70
Rozvany, G. ; Zhou, M. / Applications of the COC algorithm in layout optimization. Lecture Notes in Engineering. 63. ed. Publ by Springer-Verlag Berlin, 1991. pp. 59-70
@inproceedings{94588028955f4ac4b96087a02a569cb8,
title = "Applications of the COC algorithm in layout optimization",
abstract = "Whilst the advantages of iterative continuum-based optimality criteria (COC) methods in cross-section optimization ('sizing') were discussed elsewhere, this paper is devoted to applications of the above technique in layout optimization. Earlier studies of the latter field by others used a two-stage process consisting of separate topological and geometrical optimization and considered only a very small number of members . It will be shown here that the COC algorithm achieves a simultaneous optimization of the topology and geometry in layout problems with many thousand potential members. Moreover, some observations on shape optimization by the 'homogenization' method are offered and an alternative approach to global shape optimization is suggested.",
author = "G. Rozvany and M. Zhou",
year = "1991",
language = "English",
pages = "59--70",
booktitle = "Lecture Notes in Engineering",
publisher = "Publ by Springer-Verlag Berlin",
edition = "63",

}

TY - GEN

T1 - Applications of the COC algorithm in layout optimization

AU - Rozvany, G.

AU - Zhou, M.

PY - 1991

Y1 - 1991

N2 - Whilst the advantages of iterative continuum-based optimality criteria (COC) methods in cross-section optimization ('sizing') were discussed elsewhere, this paper is devoted to applications of the above technique in layout optimization. Earlier studies of the latter field by others used a two-stage process consisting of separate topological and geometrical optimization and considered only a very small number of members . It will be shown here that the COC algorithm achieves a simultaneous optimization of the topology and geometry in layout problems with many thousand potential members. Moreover, some observations on shape optimization by the 'homogenization' method are offered and an alternative approach to global shape optimization is suggested.

AB - Whilst the advantages of iterative continuum-based optimality criteria (COC) methods in cross-section optimization ('sizing') were discussed elsewhere, this paper is devoted to applications of the above technique in layout optimization. Earlier studies of the latter field by others used a two-stage process consisting of separate topological and geometrical optimization and considered only a very small number of members . It will be shown here that the COC algorithm achieves a simultaneous optimization of the topology and geometry in layout problems with many thousand potential members. Moreover, some observations on shape optimization by the 'homogenization' method are offered and an alternative approach to global shape optimization is suggested.

UR - http://www.scopus.com/inward/record.url?scp=0025867747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025867747&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025867747

SP - 59

EP - 70

BT - Lecture Notes in Engineering

PB - Publ by Springer-Verlag Berlin

ER -