We present two heuristic optimisation methods for generating N -variable boolean functions which exhibit particular cryptographic properties. Each method targets one or more properties and consistently produces a large number of N -variable boolean functions with those properties. The first method presented is shown to outperform any other heuristic technique previously reported, in terms of ge...

Hyper-heuristics are proposed as a higher level of abstraction as compared to the metaheuristics. Hyper-heuristic methods deploy a set of simple heuristics and use only nonproblem-specific data, such as, fitness change or heuristic execution time. A typical iteration of a hyper-heuristic algorithm consists of two phases: heuristic selection method and move acceptance. In this paper, heuristic s...

The use of heuristic search techniques for network optimisation problems has long been noted for its merits. It often requires both a significant understanding of both the heuristic methods themselves and the specific network problem domain. This precludes many network domain experts from effectively using heuristic search paradigms in building solutions. Solutions to network problems using heu...