Ordering for bandwidth and profile minimization problems via charged system search algorithm

A. Kaveh, Pezhman Sharafi

    Research output: Contribution to journalArticlepeer-review

    22 Citations (Scopus)

    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.
    Original languageEnglish
    Pages (from-to)39-52
    Number of pages14
    JournalIranian Journal of Science and Technology: Transactions of Civil Engineering
    Volume36
    Issue numberC1
    Publication statusPublished - 2012

    Fingerprint

    Dive into the research topics of 'Ordering for bandwidth and profile minimization problems via charged system search algorithm'. Together they form a unique fingerprint.

    Cite this