The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...