Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Ant Colony Optimization
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
GRAPE: an expert review assignment component for scientific conference management systems
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Coalition formation mechanism in multi-agent systems based on genetic algorithms
Applied Soft Computing
Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment
Applied Soft Computing
A capabilities-based model for adaptive organizations
Autonomous Agents and Multi-Agent Systems
Rescheduling and optimization of logistic processes using GA and ACO
Engineering Applications of Artificial Intelligence
A novel ACO-GA hybrid algorithm for feature selection in protein function prediction
Expert Systems with Applications: An International Journal
Recommender systems for the conference paper assignment problem
Proceedings of the third ACM conference on Recommender systems
| Hi-index | 0.00 |
Conference management that requires proper coordination and international communication, is a complex task. There are many Conference Management Systems (CMS), which can be used to carry out the conference. A convenient to use, free and effective module for automatic paper-reviewer assignment is still not available. Searching for the best assignments relying only on common paper-reviewer topics not always will give good solutions. This paper proposes an approach, that uses the reviewers responses information, to tune the solution up. Proposed algorithm combines genetic algorithm (GA) and ant colony optimization (ACO), to quickly find good solutions. The experiment results confirm the superiority of proposed algorithm.