10 Hits in 3.1 sec

Combining Metaheuristics and CSP Algorithms to Solve Sudoku

Marlos C. Machado, Luiz Chaimowicz
2011 2011 Brazilian Symposium on Games and Digital Entertainment  
In this paper, we propose the combination of metaheuristics with techniques from the Constraint Satisfaction Problem (CSP) domain that speed up the solution's search process by decreasing its search space  ...  In spite of that, it is a NP-Hard problem that can be very difficult to solve depending on the initial conditions of the board.  ...  Acknowledgements We would like to thank Rhyd Lewis that gently made his source code available. This work is partially supported by CAPES, CNPq and Fapemig.  ... 
doi:10.1109/sbgames.2011.18 dblp:conf/sbgames/MachadoC11 fatcat:ppwac62zizbp7duixg776taz6e

A Hybridalldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

Ricardo Soto, Broderick Crawford, Cristian Galleguillos, Fernando Paredes, Enrique Norero
2015 Computational Intelligence and Neuroscience  
Such a puzzle belongs to the NP-complete collection of problems, to which there exist diverse exact and approximate methods able to solve it.  ...  This ability clearly alleviates the work of the tabu search, resulting in a faster and more robust approach for solving Sudokus.  ...  Experimental Results In this section, we present a performance evaluation of the proposed algorithm to solve Sudokus.  ... 
doi:10.1155/2015/286354 pmid:26078751 pmcid:PMC4453279 fatcat:wj4yqq2jmvh7ldg557qly7xpzq

A Generic Framework for Local Search: Application to the Sudoku Problem [chapter]

T. Lambert, E. Monfroy, F. Saubion
2006 Lecture Notes in Computer Science  
In this paper, we are concerned with the design of a generic framework to model local search as the computation of a fixed point of functions and to solve the Sudoku problem.  ...  Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications. CSPs can be solved with complete methods or incomplete methods.  ...  Popular local search algorithms and strategies are then designed and applied to solve Sudoku in Section 5 before concluding in Section 6.  ... 
doi:10.1007/11758501_86 fatcat:hjjbzf6d3zfh7pbzxtnu3uvsca

A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems

Ricardo Soto, Broderick Crawford, Cristian Galleguillos, Eric Monfroy, Fernando Paredes
2014 The Scientific World Journal  
In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations.  ...  This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it.  ...  algorithms to solve Sudokus or any combinatorial problem.  ... 
doi:10.1155/2014/465359 pmid:24707205 pmcid:PMC3953653 fatcat:swqgx7vumrfodjez4kto5jqtbi

A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving [chapter]

Broderick Crawford, Carlos Castro, Eric Monfroy, Ricardo Soto, Wenceslao Palma, Fernando Paredes
2013 Advances in Intelligent Systems and Computing  
In this paper we design and evaluate a dynamic selection mechanism of enumeration strategies based on the information of the solving process.  ...  At any given time the hyperheuristic must choose which enumeration strategy to call.  ...  Tables 8 and 9 show the results related to the problems Magic square and Sudoku.  ... 
doi:10.1007/978-3-642-31519-0_11 fatcat:xaiz2iiowfbr3f3o3hm6yjdejm

Towards 40 years of constraint reasoning

Pedro Meseguer
2012 Progress in Artificial Intelligence  
We devote special attention to constraint solving, covering popular topics such as search, inference (especially arc consistency), combination of search and inference, symmetry exploitation, global constraints  ...  and extensions to the classical model.  ...  Acknowledgments The author sincerely thanks Christian Bessiere, Christian Bliek, Javier Larrosa, Carme Torras and Mateu Villaret who read previous versions of this document providing many useful comments  ... 
doi:10.1007/s13748-011-0006-2 fatcat:wwikb5uf6vbfni3okf65n4y76y

Learning Interpretable Error Functions for Combinatorial Optimization Problem Modeling [article]

Florian Richoux, Jean-François Baffier
2021 arXiv   pre-print
In Constraint Programming, constraints are usually represented as predicates allowing or forbidding combinations of values. However, some algorithms exploit a finer representation: error functions.  ...  Experiments on 5 different constraints show that our system can learn functions that scale to high dimensions, and can learn fairly good functions over incomplete spaces.  ...  To run this experiment, we used the framework GHOST from , which includes a local search algorithm able to handle both CSP and EFSP models.  ... 
arXiv:2002.09811v4 fatcat:oilv5cgmcrhzfkf4ilu6z4xugq

Multi-objective optimization in rule-based design space exploration

Hani Abdeen, Dániel Varró, Houari Sahraoui, András Szabolcs Nagy, Csaba Debreceni, Ábel Hegedüs, Ákos Horváth
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
Genetic Algorithms (GA) and meta-heuristics are widespreadly used for MOO.  ...  The selection operator is based on the Non-dominated Sorting Genetic Algorithm (NSGA-II).  ...  are used to solve CSP(R).  ... 
doi:10.1145/2642937.2643005 dblp:conf/kbse/AbdeenVSNDHH14 fatcat:qmspse37b5dcnckggftfa7k4s4

Iterated local search with Trellis-neighborhood for the partial Latin square extension problem

Kazuya Haraguchi
2016 Journal of Heuristics  
A partial Latin square (PLS) is a partial assignment of n symbols to an n x n grid such that, in each row and in each column, each symbol appears at most once.  ...  We consider the local search such that the neighborhood is defined by (p, q)-swap, i.e., the operation of dropping exactly p symbols and then assigning symbols to at most q empty cells.  ...  Acknowledgements We gratefully acknowledge very careful and detailed comments given by anonymous reviewers.  ... 
doi:10.1007/s10732-016-9317-6 fatcat:hpi7kasnc5bqtaoxdxcovcubly

Constraint Programming-based Job Dispatching for Modern HPC Applications

Cristian Alejandro Galleguillos Miccono
Therefore, HPC job dispatchers need to process large numbers of short jobs quickly and make decisions on-line while ensuring high Quality-of-Service (QoS) levels and meet demanding response times to generate  ...  The job i dispatchers we propose are able to reduce the time required for generating online dispatching decisions significantly, and are able to make effective use of job duration predictions to decrease  ...  There are dispatchers based on metaheuristics, such as Global Optimising Resource Broker and Allocator (GORBA) [125] which uses an Evolutionary Algorithm to solve the on-line job dispatching problem  ... 
doi:10.6092/unibo/amsdottorato/9497 fatcat:rwq6ihwqe5hnhkir7wefgpv6w4