Towards interactive Machine Learning (iML): applying ant colony algorithms to solve the traveling salesman problem with the human-in-the-loop approach A Holzinger, M Plass, K Holzinger, GC Crişan, CM Pintea, V Palade International Conference on Availability, Reliability, and Security, 81-95, 2016 | 86 | 2016 |

A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop A Holzinger, M Plass, K Holzinger, GC Crisan, CM Pintea, V Palade arXiv preprint arXiv:1708.01104, 2017 | 61 | 2017 |

Advances in Bio-inspired Computing for Combinatorial Optimization Problems CM Pintea Springer Berlin Heidelberg, 2014 | 58* | 2014 |

Interactive machine learning: experimental evidence for the human in the algorithmic loop A Holzinger, M Plass, M Kickmeier-Rust, K Holzinger, GC Crişan, ... Applied Intelligence 49 (7), 2401-2414, 2019 | 53 | 2019 |

The generalized traveling salesman problem solved with ant algorithms CM Pintea, PC Pop, C Chira Complex Adaptive Systems Modeling 5 (1), 8, 2017 | 44* | 2017 |

Improving ant systems using a local updating rule CM Pintea, D Dumitrescu SYNASC 2005, 295-299, 2005 | 42 | 2005 |

An efficient Reverse Distribution System for solving sustainable supply chain network design problem PC Pop, CM Pintea, CP Sitar, M Hajdu-Măcelaru Journal of Applied Logic 13 (2), 105-113, 2015 | 33 | 2015 |

Solving the Generalized Vehicle Routing Problem with an ACS‐based Algorithm PC Pop, C Pintea, I Zelina, D Dumitrescu BICS 2008, AIP Springer Conference Proceedings 1117 (1), 157-162, 2009 | 26 | 2009 |

A hybrid ant-based system for gate Assignment Problem CM Pintea, P Pop, C Chira, D Dumitrescu HAIS 2008, Lecture Notes in Computer Science 5271, 273-280, 2008 | 23 | 2008 |

Emergency management using geographic information systems: application to the first romanian traveling salesman problem instance GC Crişan, CM Pintea, V Palade Knowledge and Information Systems 50 (1), 265-285, 2017 | 22 | 2017 |

A Hybrid Classical Approach to a Fixed-Charged Transportation Problem CM Pintea, C Sitar, M Hajdu-Macelaru, P Petrica HAIS 2012, Lecture Notes in Computer Science 7208, 557-566, 2012 | 22 | 2012 |

Sensitive Ants in Solving the Generalized Vehicle Routing Problem CM Pintea, C Chira, D Dumitrescu, PC Pop Int J Comput Commun 6 (4), 734-741, 2011 | 22 | 2011 |

A hybrid ACO approach to the Matrix Bandwidth Minimization Problem CM Pintea, GC Crişan, C Chira HAIS 2010, Lecture Notes in Computer Science 6076, 405-412, 2010 | 21 | 2010 |

Learning sensitive stigmergic agents for solving complex problems C Chira, D Dumitrescu, CM Pintea Computing and Informatics 29 (3), 337-356, 2012 | 20 | 2012 |

Solving the linear ordering problem using ant models C Chira, CM Pintea, GC Crisan, D Dumitrescu GECCO 2009, 1803-1804, 2009 | 20 | 2009 |

Combining heuristics and modifying local information to guide ant-based search CM Pintea, D Dumitrescu, PC Pop Carpathian Journal of Mathematics, 94-103, 2008 | 20 | 2008 |

Hybrid ant models with a transition policy for solving a complex problem CM Pintea, GC Crişan, C Chira Logic Journal of IGPL 20 (3), 560-569, 2012 | 19 | 2012 |

Heterogeneous sensitive ant model for combinatorial optimization C Chira, D Dumitrescu, CM Pintea GECCO 2008, 163-164, 2008 | 18 | 2008 |

An ant-based heuristic for the railway traveling salesman problem P Pop, C Pintea, C Sitar Applications of Evolutionary Computing. EvoWorkshops 2007, LNCS 4448, 702-711, 2007 | 18 | 2007 |

Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem CM Pintea, PC Pop, C Chira BIC-TA, Wuhan, China. Evolutionary Computing Section, 245-252, 2006 | 18 | 2006 |