TY - JOUR
T1 - Ordering for bandwidth and profile minimization problems via charged system search algorithm
AU - Kaveh, A.
AU - Sharafi, Pezhman
PY - 2012
Y1 - 2012
N2 - In this paper the recently developed meta-heuristic optimization method, known as charged system search (CSS), is utilized for optimum nodal ordering to minimize bandwidth and profile of sparse matrices. The CSS is an optimization algorithm, which is based on the governing laws of Coulomb and Gauss from electrostatics and the Newtonian mechanics of motion. The bandwidth and profile of some graph matrices, which are pattern equivalent to structural matrices, are minimized using this approach. This shows the applicability of the meta-heuristic algorithms in bandwidth and profile optimization. Comparison of the results with those of some existing methods, confirms the robustness of the new algorithm.
AB - In this paper the recently developed meta-heuristic optimization method, known as charged system search (CSS), is utilized for optimum nodal ordering to minimize bandwidth and profile of sparse matrices. The CSS is an optimization algorithm, which is based on the governing laws of Coulomb and Gauss from electrostatics and the Newtonian mechanics of motion. The bandwidth and profile of some graph matrices, which are pattern equivalent to structural matrices, are minimized using this approach. This shows the applicability of the meta-heuristic algorithms in bandwidth and profile optimization. Comparison of the results with those of some existing methods, confirms the robustness of the new algorithm.
UR - http://handle.uws.edu.au:8081/1959.7/548491
UR - http://ijstc.shirazu.ac.ir/issue_77_173_Volume+36%2C+Issue+1%2C+Winter+2012.html
M3 - Article
SN - 1028-6284
VL - 36
SP - 39
EP - 52
JO - Iranian Journal of Science and Technology: Transactions of Civil Engineering
JF - Iranian Journal of Science and Technology: Transactions of Civil Engineering
IS - C1
ER -