The use of restarts techniques associated with learning nogoods in solving Constraint Satisfaction Problems (CSPs) is starting to be considered of major importance for backtrack search algorithms. Recent developments show how to learn nogoods from restarts and that those nogoods are essential when using restarts. Using a backtracking search algorithm, with 2-way branching, generalized nogoods a...

Real-time heuristic search algorithms are suitable for situated agents that need to make their decisions in constant time. Since the original work by Korf nearly two decades ago, numerous extensions have been suggested. One of the most intriguing extensions is the idea of backtracking wherein the agent decides to return to a previously visited state as opposed to moving forward greedily. This i...

This paper extends Escardó and Oliva’s selection monad to the selection monad transformer, a general monadic framework for expressing backtracking search algorithms in Haskell. The use of the closely related continuation monad transformer for similar purposes is also discussed, including an implementation of a DPLL-like SAT solver with no explicit recursion. Continuing a line of work exploring ...

This paper presents a solution method based on column generation for the Inventory Location Routing Problem. It chooses simultaneously the location of a set of depots to decide upon the inventory management and the set of routes to satisfy customers’ demands, in order to minimize the total system cost. The original problem is decomposed into a Master Problem (Location Problem) and an Auxiliary ...

This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniques and facilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the augmentation of basic backtracking sear...

The paper proposes an algorithm for solving the configuration-optimization coloring problem square (0,1)-matrices, which is based on method of selection their structural features. belongs to method's backtracking, however, construction optimal solution carried out among options that provide a certain configuration, due size search tree significantly reduced. A detailed scheme its operation give...

In a satellite network, the inter-satellite link can facilitate information transmission and exchange between satellites, packet routing of is key development direction communication systems. Aiming at complex topology dynamic change in LEO networks, traditional single shortest path algorithm no longer meet optimal requirement. Therefore, this paper proposes multi-path based on an improved brea...

Warehouse is one of the important aspects of a company. Therefore, it is necessary to improve Warehouse Management System (WMS) to have a simple function that can determine the layout of the storage goods. In this paper we propose an improved warehouse layout method based on ant colony algorithm and backtracking algorithm. The method works on two steps. First, it generates a solutions parameter...

In practice, an available testing budget limits the number of test cases that can be executed over particular software. This paper presents a ―Tabu‖ search algorithm for the automatic generation of software test cases and their prioritization through clustering technique of data mining. The developed test case generator has a cost function for intensifying the search and another for diversifyin...