Add to ORKGIn 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
In this paper, the problem of reducing the bandwidth of sparse matrices by permuting rows and column...
Abstract Most research in algorithm design relies on worstcase analysis for performance com parison...
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix ban...
In this paper, the recently developed meta-heuristic optimization algorithm, known as the charged sy...
A charged system search algorithm (CSS) is applied to the optimal cost design of water distribution ...
Colloque avec actes et comité de lecture. internationale.International audience"Bandwidth minimizati...
In this paper two recently developed meta-heuristic optimization methods, known as Colliding Bodies ...
The problem of sparse matrix bandwidth reduction is addressed and solved with two approaches suitabl...
The Charged System Search (CSS) metaheuristic algorithm is introduced to the field of water resource...
AbstractComputational and storage costs of resolution of large sparse linear systems Ax=b can be per...
This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computat...
This paper presents a new optimization algorithm called Adaptive Charged System Search Algorithm (AC...
Most research in algorithm design relies on worst-case analysis for performance comparisons. Unfortu...
In this paper the Magnetic Charged System Search algorithm is applied to structural optimization. Th...
Abstract — In this article we develop a greedy randomized adaptive search procedure (GRASP) for the ...
In this paper, the problem of reducing the bandwidth of sparse matrices by permuting rows and column...
Abstract Most research in algorithm design relies on worstcase analysis for performance com parison...
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix ban...
In this paper, the recently developed meta-heuristic optimization algorithm, known as the charged sy...
A charged system search algorithm (CSS) is applied to the optimal cost design of water distribution ...
Colloque avec actes et comité de lecture. internationale.International audience"Bandwidth minimizati...
In this paper two recently developed meta-heuristic optimization methods, known as Colliding Bodies ...
The problem of sparse matrix bandwidth reduction is addressed and solved with two approaches suitabl...
The Charged System Search (CSS) metaheuristic algorithm is introduced to the field of water resource...
AbstractComputational and storage costs of resolution of large sparse linear systems Ax=b can be per...
This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computat...
This paper presents a new optimization algorithm called Adaptive Charged System Search Algorithm (AC...
Most research in algorithm design relies on worst-case analysis for performance comparisons. Unfortu...
In this paper the Magnetic Charged System Search algorithm is applied to structural optimization. Th...
Abstract — In this article we develop a greedy randomized adaptive search procedure (GRASP) for the ...
In this paper, the problem of reducing the bandwidth of sparse matrices by permuting rows and column...
Abstract Most research in algorithm design relies on worstcase analysis for performance com parison...
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix ban...