A graph G= (V, E) is called a hyper-ring with N nodes (N-HR for short) if V = {0, ..., N-1} and E = {(u,v)| v-u modulo N is a power of 2}. In other words, a hyper-ring with N nodes is a graph in which all of the edges connect nodes that are at distances of powers of 2 from each other. Hyper-rings are a multi-machine organization that is, in a sense, a generalization of the standard hyper-cube a...

The aim of this paper is to define hyper-Leonardo hybrinomials as a generalization the Leonardo Pisano and examine some their properties such recurrence relation, summation formula generating function. Another introduce hyper hybrid-Leonardo numbers.

We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find good quality solutions to given problems. The guided mutation and crossover hyper-GA, the focus of this paper, extends that work. The aim of a guided hyper-GA is to make the dynamic removal and insertion of heuristic...

Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work has shown that selection hyper-heuristics are able to solve many combinatorial optimisation problems, including the multidimensional 0-1 knapsack problem (MKP). The traditional framework ...

Hyper-heuristics are aimed at providing a generalized solution to optimization problems rather than producing the best result for one or more problem instances. This paper examines the use of evolutionary algorithm (EA) selection hyper-heuristics to solve the offline one-dimensional bin-packing problem. Two EA hyper-heuristics are evaluated. The first (EA-HH1) searches a heuristic space of comb...