This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a
problem of curriculum-based course timetabling. The proposed algorithm follows a general …

The quadratic assignment problem (QAP) is one of the most studied combinatorial
optimization problems with various practical applications. In this paper, we present breakout …

The quadratic assignment problem (QAP) is one of the most studied NP-hard problems with
various practical applications. In this work, we propose a powerful population-based …

This paper is on a graph clustering scheme inspired by ensemble learning. In short, the idea
of ensemble learning is to learn several weak classifiers and use these weak classifiers to …

Inspired by the idea of interacting intelligent agents of a multi-agent system, we introduce a
multi-agent based optimization method applied to the quadratic assignment problem (MAOM …

In this paper, we propose a heuristic algorithm to solve a new variant of the partial set
covering problem. In this variant, each element e_i ei has a gain g_i gi (ie, a positive profit) …

= åå Page 1 Cybernetics and Systems Analysis, Vol. 53, No. 2, March, 2017 SOLVING THE
QUADRATIC ASSIGNMENT PROBLEM BY THE REPEATED ITERATED TABU SEARCH …

This paper presents a learnable tabu search (TS) guided by estimation of distribution
algorithm (EDA), called LTS-EDA, for maximum diversity problem. The LTS-EDA introduces …

Metaheuristic algorithms are an important area of research that provides significant
advances in solving complex optimization problems within acceptable time periods. Since …

This paper introduces a Multi-Agent based Optimization Method for Combinatorial
Optimization Problems named MAOM-COP. In this method, a set of agents are cooperatively …