activity
20122021
most citedThe Generalized Traveling Salesman Problem solved with Ant Algorithms

58 citations · 175 across the 17 of their papers we have counts for

collaborators

18 papers

cs.AI2021★ 12 cited

Selective Survey: Most Efficient Models and Solvers for Integrative Multimodal Transport

Oliviu Matei, Erdei Rudolf, Camelia-M. Pintea

In the family of Intelligent Transportation Systems (ITS), Multimodal Transport Systems (MMTS) have placed themselves as a mainstream transportation mean of our time as a feasible…

cs.CY2020★ 7 cited

Innovative Platform for Designing Hybrid Collaborative & Context-Aware Data Mining Scenarios

Anca Avram, Oliviu Matei, Camelia Pintea +1

The process of knowledge discovery involves nowadays a major number of techniques. Context-Aware Data Mining (CADM) and Collaborative Data Mining (CDM) are some of the recent ones.…

cs.MA2018★ 5 cited

Multi-agents features on Android platforms

Camelia-M. Pintea, Andreea Camelia Tripon, Anca Avram +1

The current paper shows the multi-agents capabilities to make a valid and flexible application when using a framework. Agent-based functions were used within JADE framework to make…

cs.AI2017

A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop

Andreas Holzinger, Markus Plass, Katharina Holzinger +3

The goal of Machine Learning to automatically learn from data, extract knowledge and to make decisions without any human intervention. Such automatic (aML) approaches show impressi…

cs.NE2014★ 5 cited

On the Resilience of an Ant-based System in Fuzzy Environments. An Empirical Study

Gloria Cerasela Crisan, Camelia-M. Pintea, Petrica C. Pop

The current work describes an empirical study conducted in order to investigate the behavior of an optimization method in a fuzzy environment. MAX-MIN Ant System, an efficient impl…

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…