58 citations · 109 across the 6 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2013★ 58 cited
The Generalized Traveling Salesman Problem solved with Ant Algorithms
Camelia-M. Pintea, Petrica C. Pop, Camelia Chira
A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters…
cs.AI2012★ 22 cited
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…