Volumetric topology optimization under redundancy constraints

With ever-increasing pollution and scarcity of resources, structural optimization, the science of finding the optimal structural arrangements under equilibrium constraints, is becoming an increasing necessity in engineering practice. However, designers are hesitant to adopt a method that is by nature a limit state and thus potentially unreliable. This thesis embeds a level of safety, namely redundancy, within the structural optimization process. Redundancy is the ability to remove a certain number of elements from the structure without losing stability. The thesis translates this constraint into a linear mathematical optimization problem. Then, a topology optimization algorithm is developed that identifies the least volume structure with the ability to remove any element(s) while maintaining stability under the initial loading. Besides the developed algorithm, this thesis shows the relation between the internal forces of redundant structures and their substructures, and in fact shows that it can be expressed linearly when only 1 level of redundancy is provided, and polynomial for higher levels. The algorithm is eventually implemented and extensively analyzed for a series of configurations, showing that redundant optimal shapes have considerably less volume than twice that of the pure volumetric optimal, and hence effectively combine safety with material efficiency. Overall, this thesis constitutes the early stage of a novel structural optimization algorithm that is unique to its volumetric optimization objectives.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Civil and Environmental Engineering

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Pagonakis, Dimitrios

Advisor dc:contributor.advisor

• Corentin Fivet and John Ochsendorf.

• Civil and Environmental Engineering.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/104242

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/104242