Old Dominion University
Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems
Abstract
dc:description.abstractEfficient numerical algorithms for solving structural and Shortest Path (SP) problems are proposed and explained in this study. A variant of the Differential Evolution (DE) algorithm for optimal (minimum) design of 2-D and 3-D truss structures is proposed. This proposed DE algorithm can handle size-shape-topology structural optimization. The design variables can be mixed continuous, integer/or discrete values. Constraints are nodal displacement, element stresses and buckling limitations. For dynamic (time dependent) networks, two additional algorithms are also proposed in this study. A heuristic algorithm to find the departure time (at a specified source node) for a given (or specified) arrival time (at a specified destination node) of a given dynamic network. Finally, an efficient bidirectional Dijkstra shortest path (SP) heuristic algorithm is also proposed. Extensive numerical examples have been conducted in this study to validate the effectiveness and the robustness of the proposed three numerical algorithms.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy (PhD)
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Civil & Environmental Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Sanjabi, Gelareh B.
- Contributors dc:contributor
-
- Duc T. Nguyen
- Manwo Ng
- Mecit Cetin
- Gene Hou
Subjects
dc:subject × 7Rights
dc:rights- Statement dc:rights
-
- <p>In Copyright. URI: <a href="http://rightsstatements.org/vocab/InC/1.0/">http://rightsstatements.org/vocab/InC/1.0/</a> This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).</p>
Identifiers
dc:identifier.*- Identifier
- 9780355405408