A novel agent-based approach to Meta-Heuristics self-configuration is proposed in this work. Meta-heuristics are examples of algorithms where parameters need to be set up as efficient as possible in order to unsure its performance. This paper presents a learning module for self-parameterization of Meta-heuristics (MHs) in a Multi-Agent System (MAS) for resolution of scheduling problems. The lea...

Recent research has proved the beneets of using an ensemble of diverse and accurate base classiiers for classiication problems. In this paper the focus is on producing diverse ensembles with the aid of three feature selection heuristics based on two approaches: correlation and contextual merit-based ones. We have developed an algorithm and experimented with it to evaluate and compare the three ...

The current investigations on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. In the latter, the goal is to develop a problem-domain independent strategy to automatically generate a good performing heuristic for the problem at hand. This can be done, for example, by automatically selecting and combining...

A major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). In recent years, adaptive approaches for solving CSPs have attracted the interest of many researchers. General speaking, a strategy that uses the results of its own search experience to modify its subsequent behavior does adaptive search. In thi...

Flexible manufacturing systems as technological and automated structures have a high complexity for scheduling. The decision-making process is made difficult with interruptions that may occur in the system these problems increase to define an optimal schedule. research proposes three-stage hybrid algorithm allows rescheduling of operations FMS. novelty presented two approaches: first integratio...

In this paper we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of the matheuristics: decomposition approaches, im...

This paper investigates the performance of several hyperheuristics applied to a real-world personnel scheduling problem. A hyperheuristic is a high-level search method which manages the choice of low level heuristics, making it a robust and easy to implement approach for complex real-world problems. We need only to develop new low level heuristics and objective functions to apply a hyperheurist...

Motivated by the natural immune system’s ability to defend the body by generating and maintaining a repertoire of antibodies that collectively cover the potential pathogen space, we describe an artificial system that discovers and maintains a repertoire of heuristics that collectively provide methods for solving problems within a problem space. Using bin-packing as an example domain, the system...