in the science of operation research and decision theory, selection is the most important process. selection is a process that studies multiple qualitative and quantitative criteria, related to the science of management, which are mostly incompatible with each other. the multi criteria selection of a renewable energy portfolio is one of the main issues considered in multi criteria literature. i...

Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this di culty. The technique developed is a variant of dependency-directed backtracking that use...

The most advanced implementation of adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP). This presentation compares an improved version of conflict-directed backjumping and two variants of dynamic backtracking with respect to chronological backtracking on some of the AIM insta...

The snake-in-the-box problem is concerned with finding a longest induced path in a hypercube Qn. Similarly, the coil-in-the-box problem is concerned with finding a longest induced cycle in Qn. We consider a generalization of these problems that considers paths and cycles where each pair of vertices at distance at least k in the path or cycle are also at distance at least k in Qn. We call these ...

This paper is concerned with the development of intelligent decision support methodologies for nurse rostering problems in large modern hospital environments. We present an approach which hybridises heuristic ordering with variable neighbourhood search. We show that the search can be extended and the solution quality can be significantly improved by the careful combination and repeated use of h...

Recently, the classical backtracking-search satis ability algorithm of Davis, Putnam, Loveland and Logemann (DPLL) has been enhanced in two distinct directions: with more advanced reasoning methods, or with con ict-directed back-jumping (CBJ). Previous methods used one idea or the other, but not both (except that CBJ has been combined with the unit-clause rule). The diÆculty is that more advanc...

There has been substantial recent interest in two new families of search techniques. One family consists of systematic approaches, which use the idea of dependency directed backtracking (DDB) and dynamic backtracking (DB) as an antidote for the inefficiencies of chronological backtracking. Based on backtracking, systematic approaches are able to produce an optimal assignment, when no time limit...

This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Prop-ositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques, some of which are specific to SAT, whereas others find equivalent in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during search and its most dis...

Here we show how the idea of dynamic backtracking can be applied to branch and bound optimization. This is done by exploiting the concept of valued nogood introduced in [6, 16, 17]. However, simple replacement of nogoods with valued nogoods does not lead to a correct algorithm. We show that a way to achieve correctness is to use at each variable a separate nogood storage for each position that ...