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

	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 اصل مقاله (2.11 M)
شناسه دیجیتال (DOI): 10.22099/ijstc.2012.644
چکیده
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
کلیدواژه‌ها
Profile reduction؛ bandwidth reduction؛ ordering؛ graphs؛ charged system search؛ Optimization

آمار تعداد مشاهده مقاله: 1,355 تعداد دریافت فایل اصل مقاله: 1,659