Solving Graph Bandwidth Minimization Problem Using Imperialist Competitive Algorithm

سال انتشار: 1395
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 676

فایل این مقاله در 13 صفحه با فرمت PDF قابل دریافت می باشد

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

COMCONF04_023

تاریخ نمایه سازی: 10 تیر 1396

چکیده مقاله:

The bandwidth minimization problem can be used in data storage and VLSI design issues and saving large hypertext media, etc. The Matrix Bandwidth Minimization Problem involves finding matrix rows and columns permutation so that non-zero elements of the matrix A are located in a band that is as close as possible to the original diameter to minimize the amount of {max{|i−j|:aij≠.}. the Bandwidth Minimization Problem for Graphs (BMPG) is a complicated problem; hence the deterministic algorithms are not appropriate to solve these kinds of problems. The purpose of this research is to reduce the required computations through the use of heuristic algorithms and evolutionary algorithms, so that instead of using purely mathematical methods to find answers, we can turn the problem into an optimization problem through the use of collective intelligence and evolutionary algorithms and the concepts in this field. In the present paper, the use of meta-heuristic algorithm, Imperialist competitive algorithm is proposed in order to solve minimization problem. In this paper, the performance of presented algorithm with random samples has been evaluated compared with the results of genetic algorithms. The results of tests show that the Imperialist competitive algorithm can be considered as an efficient method to solve the bandwidth minimization problem for graphs

نویسندگان

Amir Aliabadian

faculty member at the University of shomal,

Mohammad-Rasol Ja’fari

Power Engineering student at the University of shomal,

Ali Azarbad

Electronic Engineering student at the University of shomal,

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Esmaeil Atash paz-gargare, :Swarm optimization algorithm development and a review ...
  • Liwei Fan, Sijia Pan, Zimin Li, Huiping Li, "An ICA-based ...
  • Yao Junliang, Ren Haipeng, Liu Qing, "Fixed-point ICA algorithm for ...
  • E. Pinana, I. Plana, V. Campos and R. Marti, "GRASP ...
  • A. Esposito, M. S. Catalano, F. Malucelli and L. Tarricone, ...
  • P. Chinn, J. Chavtalova, A.K.Dewdney and N.E.Gibbs, "The bandwidth problem ...
  • M. Berry, B. Hendrickson and P. Raghavan, " Sparse matrix ...
  • C. H. Papadimitriou, "The NP -completenss of the bandwidth minimization ...
  • M. Garey, R. Graham, D. Johnson and D E. Knuth, ...
  • A. Lim, B. Rodrigues and F. Xiao, "Heuristics for matrix ...
  • R. Marti, M. Laguna, F. Glover and V Campos, "Reducing ...
  • Safari Mamaghani, A. and Meybodi, M. R., "A Learning Automaton ...
  • Atashp az-Gargari , E. , Lucas, C. , .Imperialist competitive ...
  • Niknam, T. _ T aherian-Fard, E , Pourj afarian, N. ...
  • Nazari- Shirkouhi, S , Eivazy, H. , Ghodsi, R. , ...
  • Gorodilov, A. , Morozenko, V. , Genetic Algorithm For Finding ...
  • نمایش کامل مراجع