A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Miscellaneous Applications Graph Problems Using Meta-Heuristic Algorithms
Many graph methods are nowadays using meta-heuristic algorithms. In this chapter two example problems are presented. In the first section Colliding Bodies Optimization and k-median method are utilized for finite element domain decomposition (Kaveh and Mahdavi in Finite Elem Anal Des 98:41–49, 2015 [1]), and in the second part cycle basis selection is performed by simulated annealing (Kaveh and Jafari Vafa in Int J Optim Civ Eng 12:234–243, 2022 [2]).
Miscellaneous Applications Graph Problems Using Meta-Heuristic Algorithms
Many graph methods are nowadays using meta-heuristic algorithms. In this chapter two example problems are presented. In the first section Colliding Bodies Optimization and k-median method are utilized for finite element domain decomposition (Kaveh and Mahdavi in Finite Elem Anal Des 98:41–49, 2015 [1]), and in the second part cycle basis selection is performed by simulated annealing (Kaveh and Jafari Vafa in Int J Optim Civ Eng 12:234–243, 2022 [2]).
Miscellaneous Applications Graph Problems Using Meta-Heuristic Algorithms
Kaveh, Ali (author)
Topological Transformations for Efficient Structural Analysis ; Chapter: 9 ; 165-190
2022-10-24
26 pages
Article/Chapter (Book)
Electronic Resource
English
Optimal design of labyrinth spillways using meta-heuristic algorithms
| Springer Verlag | 2016
Optimal design of labyrinth spillways using meta-heuristic algorithms
| Online Contents | 2016
Optimal design of labyrinth spillways using meta-heuristic algorithms
| Springer Verlag | 2016
Estimation of Muskingum parameter by meta-heuristic algorithms
| Online Contents | 2013
Construction Site Layout Planning Problem Using Two New Meta-heuristic Algorithms
| Springer Verlag | 2016