Ordering for bandwidth and profile minimization problems via charged system search algorithm
Editorial
10.22099/ijstc.2012.644
Abstract
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
(2012). Ordering for bandwidth and profile minimization problems via charged system search algorithm. Iranian Journal of Science and Technology Transactions of Civil Engineering, 36(1), 39-52. doi: 10.22099/ijstc.2012.644
MLA
. "Ordering for bandwidth and profile minimization problems via charged system search algorithm", Iranian Journal of Science and Technology Transactions of Civil Engineering, 36, 1, 2012, 39-52. doi: 10.22099/ijstc.2012.644
HARVARD
(2012). 'Ordering for bandwidth and profile minimization problems via charged system search algorithm', Iranian Journal of Science and Technology Transactions of Civil Engineering, 36(1), pp. 39-52. doi: 10.22099/ijstc.2012.644
VANCOUVER
Ordering for bandwidth and profile minimization problems via charged system search algorithm. Iranian Journal of Science and Technology Transactions of Civil Engineering, 2012; 36(1): 39-52. doi: 10.22099/ijstc.2012.644
)