The h (m = 1, . . .) family of admissible heuristics for STRIPS planning with additive costs generalise the h heuristic, which results when m = 1. We show that the step from h to h can be made by changing the planning problem instead of the heuristic function. This furthers our understanding of the h heuristic, and may inspire application of the same generalisation to admissible heuristics stro...

In general terms some situations are described which require the exploitation of heuristics either to solve a mathematical optimization problem or to analyse results. A possibility to implement heuristic knowledge for selecting a suitable algorithm depending on available problem data and information retrieved from the user, is investigated in detail. We describe some inference strategies and kn...

This paper presents a biased random-keys genetic algorithm for the Resource Constrained Project Scheduling Problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are de ned by the genetic algorithm. A forward-backward improvement procedure is applied to all solution...

Water conservancy project scheduling is an extension to the classic resource-constrained problem (RCPSP). It limited by special time constraints called “forbidden windows” during which certain activities cannot be executed. To address this issue, a specific RCPSP model proposed, and approach designated for it incorporates both priority rule-based heuristic algorithm obtain acceptable solution, ...

We study a resource constrained assembly line balancing problem (RCALBP) presented by Ağpak and Gökçen, who developed a 0-1 integer programming model to find the optimal solution. However, this model is inefficient in solving large-scale problems. In this paper, we propose a simple efficient heuristic that is based on the widely-used ranked positional weight (RPW) rule. The example given by Ağp...

System MEMORI automatically detects and recognizes rotated and/or rescaled versions of the objects of a database within digital color images with cluttered background. This task is accomplished by means of a region grouping algorithm guided by heuristic rules, whose parameters concern some geometrical properties and the recognition score of the database objects. This paper focuses on the strate...

One challenge for cognitive architectures is to effectively use different forms of knowledge and learning. We present a case study of Soar agents that play a multiplayer dice game, in which probabilistic reasoning and heuristic symbolic knowledge appear to play a central role. We develop and evaluate a collection of agents that use different combinations of probabilistic decision making, heuris...

Extracting titles from a PDF’s full text is an important task in information retrieval to identify PDFs. Existing approaches apply complicated and expensive (in terms of calculating power) machine learning algorithms such as Support Vector Machines and Conditional Random Fields. In this paper we present a simple rule based heuristic, which considers style information (font size) to identify a P...

Demographic disparities between the rates of occurrence of an adverse economic outcome can be observed to be increasing even as general social improvements supposedly lead towards the elimination of the adverse outcome in question. Scanlan (2006) noticed this tendency and developed a ‘heuristic rule’ to explain it. In this paper, we explore the issue analytically, providing a criterion from sto...

The General Assembly Line Balancing Problem with Setups (GALBPS) was recently defined in the literature. It adds sequence-dependent setup time considerations to the classical Simple Assembly Line Balancing Problem (SALBP) as follows: whenever a task is assigned next to another at the same workstation, a setup time must be added to compute the global workstation time, thereby providing the task ...