Juan Martín Carpio Valadez

Learn More
Course timetabling is an important and recurring administrative activity in most educational institutions. This article combines a general modeling methodology with effective learning hyper-heuristics to solve this problem. The proposed hyper-heuristics are based on an iterated local search procedure that autonomously combines a set of move operators. Two(More)
The Knapsack Problem is a classical combinatorial problem which can be solved in many ways. One of these ways is the Greedy Algorithm which gives us an approximated solution to the problem. Another way to solve it is using the Swarm Intelligence approach, based on the study of actions of individuals in various decentralized systems. Optimization algorithms(More)
Evolvability metrics gauge the potential for fitness of an individual rather than fitness itself. They measure the local characteristics of the fitness landscape surrounding a solution. In adaptive operator selection the goal is to dynamically select from a given pool the operator to apply next during the search process. An important component of these(More)