Tubular truss optimization using heuristic algorithms
Jalkanen, J. (2007)
Jalkanen, J.
Tampere University of Technology
2007
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tty-200903101039
https://urn.fi/URN:NBN:fi:tty-200903101039
Tiivistelmä
The topic of this thesis is discrete tubular truss optimization using heuristic multipurpose algorithms. The multicriteria topology, shape and sizing optimization problem has been formulated based on practical real life needs. This means that in addition the material cost also the manufacturing cost has been taken into account, design constraints satisfy the demands of steel design rules (Eurocode 3) and the selection of available tubular profiles does not have to be in a special way limited. Mass, cost or displacement have been used as the objective function criteria in the example problems. The design constraints ensure that truss members and joints are strong enough, single members or the whole truss do not buckle, certain displacements are small and natural frequencies do not locate in forbidden intervals.
The tubular truss optimization problem has been solved using four multipurpose heuristic algorithms. Two of them are local search algorithms simulated annealing (SA) and tabu search (TS) and two of them population based methods genetic algorithm (GA) and particle swarm optimization (PSO). The efficiency of heuristic algorithms has been studied empirically in several example problems. In the first academic ten-bar truss example problem heuristic algorithms have also been compared to a different type of branch&bound algorithm. The rest of the example problems deal with tubular plane and space trusses. Also the conflict of mass and cost and the effect of the number of different design variables to the final solution have been studied.
The tubular truss optimization problem has been solved using four multipurpose heuristic algorithms. Two of them are local search algorithms simulated annealing (SA) and tabu search (TS) and two of them population based methods genetic algorithm (GA) and particle swarm optimization (PSO). The efficiency of heuristic algorithms has been studied empirically in several example problems. In the first academic ten-bar truss example problem heuristic algorithms have also been compared to a different type of branch&bound algorithm. The rest of the example problems deal with tubular plane and space trusses. Also the conflict of mass and cost and the effect of the number of different design variables to the final solution have been studied.
Kokoelmat
- Väitöskirjat [4848]