ORDERING FOR BANDWIDTH AND PROFILE MINIMIZATION PROBLEMS VIA CHARGED SYSTEM SEARCH ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KAVEH A.; SHARAFI -

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING Year:2012 | Volume:36 | Issue:C1 Page(s): 39-52

Download Full-Text

View:

363

Download:

196

Cites:

Information Journal Paper

Title

ORDERING FOR BANDWIDTH AND PROFILE MINIMIZATION PROBLEMS VIA CHARGED SYSTEM SEARCH ALGORITHM

Author(s)

KAVEH A. | SHARAFI - | Issue Writer Certificate

Keywords

PROFILE REDUCTION

BANDWIDTH REDUCTION

ORDERING

GRAPHS

CHARGED SYSTEM SEARCH

OPTIMIZATION

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

KAVEH, A., & SHARAFI, -. (2012). ORDERING FOR BANDWIDTH AND PROFILE MINIMIZATION PROBLEMS VIA CHARGED SYSTEM SEARCH ALGORITHM. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, 36(C1), 39-52. SID. https://sid.ir/paper/587463/en

Vancouver: Copy

KAVEH A., SHARAFI -. ORDERING FOR BANDWIDTH AND PROFILE MINIMIZATION PROBLEMS VIA CHARGED SYSTEM SEARCH ALGORITHM. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING[Internet]. 2012;36(C1):39-52. Available from: https://sid.ir/paper/587463/en

IEEE: Copy

A. KAVEH, and - SHARAFI, “ORDERING FOR BANDWIDTH AND PROFILE MINIMIZATION PROBLEMS VIA CHARGED SYSTEM SEARCH ALGORITHM,” IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, vol. 36, no. C1, pp. 39–52, 2012, [Online]. Available: https://sid.ir/paper/587463/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops