Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search framework. At each step, the solution in hand is modified after applying a selected heuristic and a...

Cost partitioning is a general method for adding multiple heuristic values admissibly. In the setting of optimal classical planning, saturated cost partitioning has recently been shown to be the cost partitioning algorithm of choice for pattern database heuristics found by hill climbing, systematic pattern database heuristics and Cartesian abstraction heuristics. To evaluate the synergy of the ...

Vehicle routing problems have been extensively studied using a variety of search methods and meta-heuristics. However, most search methods are carried out using only a single improvement heuristic. Here, we report on a study using four improvement heuristics embedded in a simple steepest descent search engine. We conclude that reasonable results can be produced quickly by this simple method. A ...

This paper presents a heuristic method for evaluating virtual environment (VE) user interfaces. The method is based on Nielsen’s [Usability Inspection Methods, 1994] usability heuristics, extended by VE-specific principles proposed by Sutcliffe and Kaur [Behaviour and Information Technology 19 (2000) 415–426]. Twelve heuristics are presented which address usability and presence issues. An inspe...

In the Göttinger minipig, the reference values of 18 parameters in whole blood or plasma were determined. The results are expressed both as the mean value and +/- 2 SD presuming a symmetrical normal distribution and as the median value with the corresponding range. For most blood constituents, the results of the two modes of calculation were similar. Comparison of the values from young minipigs...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

All algorithms that generate optimal solutions to the transportation problem require a starting feasible solution that is determined heuristically. A number of empirical studies have compared the solution quality obtained by some of these heuristics. The better the starting heuristic solution is, the less work that needs to be done by the algorithm that generates an optimal solution. In this ar...

In Constraint Satisfaction Problems (CSP), variable ordering heuristics help to increase efficiency. Applying an appropriate heuristic can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics for similar CSPs, CSP solver performance could be further improved. Similar CSPs can be grouped into same clusters. For each cluster, appropriate heuristics can be fo...