In this paper we introduce a two phase hyper-heuristic search method for solving the Eternity II puzzle. Eternity II is a challenging money prized edge matching puzzle. Solving the puzzle has been shown to be NP-complete [2]. Hyper-heuristics [1] are a recent trend in heuristic algorithms. They tend to be more general methods than meta-heuristics for solving optimization problems. Hyper-heurist...

This paper describes an approach for reasoning about the repairability of workflows at design time. We propose a heuristic-based analysis of a workflow that aims at evaluating its definition, considering different design aspects and characteristics that affect its repairability (called repairability factors), in order to determine if the workflow schema supports repairable executions of its act...

This paper presents an efficient meta-heuristic algorithm for optimization of double-layer scallop domes subjected to earthquake loading. The optimization is performed by a combination of harmony search (HS) and firefly algorithm (FA). This new algorithm is called harmony search firefly algorithm (HSFA). The optimization task is achieved by taking into account geometrical and material nonlinear...

We illustrate the use of phase transition behavior in the study of heuristics. Using an “annealed” theory, we define a parameter that measures the “constrainedness” of an ensemble of number partitioning problems. We identify a phase transition at a critical value of constrainedness. We then show that constrainedness can be used to analyze and compare algorithms and heuristics for number partiti...

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedu...

The Big Bang-Big Crunch (BB–BC) method is a relatively new meta-heuristic algorithm which inspired by one of the theories of the evolution of universe. In the BB–BC optimization algorithm, firstly random points are produced in the Big Bang phase then these points are shrunk to a single representative point via a center of mass or minimal cost approach in the Big Crunch phase. In this paper, the...

The capacitated vehicle routing problem is to find a routing schedule describing the order in which geographically dispersed customers are visited to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized. In many practical applications, a long term routing schedule has to be made for operational purposes, often based on average demand estimates. When...