The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
In this paper, we present a novel segmentationinsensitive approach for mining common patterns from 2 images. We develop an algorithm using the Earth Movers Distance (EMD) framewor...
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...