The use of a policy and heuristic function for guiding search can be quite effective in adversarial problems, as demonstrated by AlphaGo its successors, which are based on the PUCT algorithm. While also used to solve single-agent deterministic it lacks guarantees effort computationally inefficient practice. Combining A* algorithm with learned tends work better these domains, but variants do not...

Abstract Matheuristics are heuristic algorithms based on mathematical tools such as the ones provided by programming, that structurally general enough to be applied different problems with little adaptations their abstract structure. The result can metaheuristic hybrids having components derived from model of interest, but techniques themselves define solution frameworks. In this paper, we focu...

The assessment of bidirectional heuristic search has been incorrect since it was rst published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there is still wide-spread belief that bidirectional heuristic search is a icted by the problem of search...

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...