58 citations · 175 across the 17 of their papers we have counts for
7 papers · 2 filters
A hybrid ACO approach to the Matrix Bandwidth Minimization Problem
Camelia-M. Pintea, Camelia Chira, Gloria-C. Crisan
The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matri…
Soft Computing approaches on the Bandwidth Problem
Gabriela Czibula, Gloria Cerasela Crisan, Camelia-M. Pintea +1
The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous reordering of the rows and the columns of a square matrix such that the nonzero entries are collected with…
Distributed Pharaoh System for Network Routing
Camelia-M. Pintea, D. Dumitrescu
In this paper it is introduced a biobjective ant algorithm for constructing low cost routing networks. The new algorithm is called the Distributed Pharaoh System (DPS). DPS is base…
Sensitive Ants in Solving the Generalized Vehicle Routing Problem
Camelia-M. Pintea, Camelia Chira, D. Dumitrescu +1
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is in…
New results of ant algorithms for the Linear Ordering Problem
Camelia-M. Pintea, Camelia Chira, D. Dumitrescu
Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instance…
Parallel ACO with a Ring Neighborhood for Dynamic TSP
Camelia-M. Pintea, Gloria Cerasela Crisan, Mihai Manea
The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distan…