A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...