Abstract
Efficient 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have