Filters








13,307 Hits in 5.9 sec

In pursuit of the holy grail

E. Freuder
1996 ACM Computing Surveys  
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling  ...  The central part of the paper is dedicated to the description of main constraint satisfaction techniques and industrial applications.  ...  Another problem is choosing the right constraint satisfaction technique for particular problem.  ... 
doi:10.1145/242224.242304 fatcat:uugoyii6vrd4jhabyqi3jw6qcu

Book review

Roman Barták
2005 Artificial Intelligence  
Chapter 7, which closes the basic part of the book, briefly describes greedy local search techniques for constraint satisfaction.  ...  Chapter 5 describes search strategies with look-ahead techniques, namely forward checking and partial and full look-ahead. Dynamic variable ordering is also discussed.  ... 
doi:10.1016/j.artint.2005.10.006 fatcat:rtpsnihyo5cwhicxvzb2337rxe

A Hybrid Search Algorithm For Solving Constraint Satisfaction Problems

Abdel-Reza Hatamlou, Mohammad Reza Meybodi
2007 Zenodo  
In this paper we present a hybrid search algorithm for solving constraint satisfaction and optimization problems.  ...  This algorithm combines ideas of two basic approaches: complete and incomplete algorithms which also known as systematic search and local search algorithms.  ...  CONCLUSION We have presented a hybrid approach for solving constraint satisfaction and optimization problems which combines ideas of local search and systematic search algorithms.  ... 
doi:10.5281/zenodo.1056264 fatcat:uttpt2jcyraaxgaguzk3jbud4a

On the Behavior and Application of Constraint Weighting [chapter]

John Thornton, Abdul Sattar
1999 Lecture Notes in Computer Science  
We extend previous results from satisfiability testing by looking at the broader domain of constraint satisfaction and test for differences in performance using randomly generated problems and problems  ...  We find constraint weighting produces fairly consistent behaviour within problem domains, and is more influenced by the number and interconnectedness of constraints than the realism or randomness of a  ...  The table 3 results put rnovelty firmly ahead for the binary CSPs and slightly ahead for both classes of timetable problem, but strongly favor constraint weighting for the nurse scheduling problems.  ... 
doi:10.1007/978-3-540-48085-3_32 fatcat:sedmnx3thvgirpbwa2lnp7anoy

Finding regions for local repair in partial constraint satisfaction [chapter]

Harald Meyer auf'm Hofe
1998 Lecture Notes in Computer Science  
This article presents a novel approach for solving partial constraint satisfaction problems exhaustively that combines advantages of local search and extended branch&bound algorithms.  ...  Yet, two classes of algorithms have been used in partial constraint satisfaction: local search methods and branch&bound search extended by the classical constraint-processing techniques like e.g. forward  ...  This paper presents a novel approach for solving partial constraint satisfaction problems that combines the advantages of local search and tree search algorithms.  ... 
doi:10.1007/bfb0095428 fatcat:i2lifqj3d5gtlgai7ftg7wuqeq

Constraint satisfaction techniques in planning and scheduling

Roman Barták, Miguel A. Salido, Francesca Rossi
2008 Journal of Intelligent Manufacturing  
solving real life planning and scheduling problems.  ...  Over the last few years constraint satisfaction, planning, and scheduling have received increased attention, and substantial effort has been invested in exploiting constraint satisfaction techniques when  ...  This section gave some examples and techniques of using constraint satisfaction for solving scheduling problems.  ... 
doi:10.1007/s10845-008-0203-4 fatcat:eqp4tuysnreobdlgwuqzsa263m

Neural Network and Local Search to Solve Binary CSP

Adil Bouhouch, Hamid Bennis, Chakir Loqman, Abderrahim El Qadi
2018 Indonesian Journal of Electrical Engineering and Computer Science  
In this paper, we propose a new hybrid approach combining CHN and min-conflict heuristic to mitigate these problems.  ...  <p>Continuous Hopfield neural Network (CHN) is one of the effective approaches to solve Constrain Satisfaction Problems (CSPs).  ...  Some other search algorithms for classical CSPs like Forward Checking, Partial Look-ahead, Full Look-ahead, and Really Full Look-ahead are introduced and their performances are studied widely in the literature  ... 
doi:10.11591/ijeecs.v10.i3.pp1319-1330 fatcat:4pxngylyg5bxddxgc67kr7r4aq

Fuzzy constraints in job-shop scheduling

Didier Dubois, H�l�ne Fargier, Henri Prade
1995 Journal of Intelligent Manufacturing  
A combinatorial search method that solves the problem is outlined, including fuzzy extensions of well-known look-ahead schemes.  ...  This paper proposes an extension of the constraint-based approach to job-shop scheduling, that accounts for the flexibility of temporal constraints and the uncertainty of operation durations.  ...  In Section 5, a solving scheme is presented, which relies on three basic procedures: consistency enforcing, tree search and look-ahead analysis.  ... 
doi:10.1007/bf00128646 fatcat:atgn4icnmrfsrlclbirpuionem

New trends in constraint satisfaction, planning, and scheduling: a survey

Roman Barták, Miguel A. Salido, Francesca Rossi
2010 Knowledge engineering review (Print)  
SALIDO, FRANCESCA ROSSI very useful to prune the search space. We then present three families of search techniques: Look-Back, Look-Ahead, and local search.  ...  In this section we present some examples of constraint models for finding plans. and some examples and techniques of using constraint satisfaction for solving scheduling problems.  ...  Role of Constraint Satisfaction in Scheduling Scheduling is a "killing application" for constraint satisfaction.  ... 
doi:10.1017/s0269888910000202 fatcat:4n7bn7rnyjbifi3nkignhwe5uy

Backjump-based backtracking for constraint satisfaction problems

Rina Dechter, Daniel Frost
2002 Artificial Intelligence  
The performance of backtracking algorithms for solving finite-domain constraint satisfaction problems can be improved substantially by look-back and look-ahead methods.  ...  This paper describes a number of look-back variants including backjumping and constraint recording which recognize and avoid some unnecessary explorations of the search space.  ...  perceptive comments; to Irina Rish for some of the figures; and lastly, to Michelle Bonnice and Nira Brand for dedicated editing of various stages of the manuscript.  ... 
doi:10.1016/s0004-3702(02)00120-0 fatcat:3ocjtqraqrf4rgsgiwyxak37xm

The Hybrid Flow Shop Scheduling With Special Time Constraints

Xiaobing Cheng, Mingping Xia, Xiuying Wang, Yongjun Xiao
2014 TELKOMNIKA Indonesian Journal of Electrical Engineering  
A constraint satisfaction optimization model is established for just-in-time HFS scheduling problem with limited waiting time.  ...  During the process of solving the MCFS problem, a local search is embedded into the procedure of constraint satisfaction optimization so as to improve the convergence of the algorithm.  ...  So, we embed Local Search (LS) replacing the neighborhood search base on forward in the constraint satisfaction optimization process, and the pseudo-code is: Procedure LS (sch,  sch =sch){ generate a  ... 
doi:10.11591/telkomnika.v12i5.5093 fatcat:4jntks4p5zan5m6ipso5byx6ay

Intelligent scheduling: past, present and future

Patrick Prosser, Iain Buchanan
1994 Intelligent Systems Engineering  
This paper summarises achievements in intelligent scheduling over the decade and takes a brief look forward.  ...  Numerous intelligent scheduling systems have been developed since then, in the USA and in Europe, new search techniques have been invented, new theoretical results are emerging, and scheduling applications  ...  The paper was fist received 12 November 1993 and in revised form 22 April 1994. The authors are with the Department of Computer Science, University of Strathclyde, Glasgow G1 IXH, UK.  ... 
doi:10.1049/ise.1994.0010 fatcat:u2xygepflzgxtguqrguwxax4oq

Local search with constraint propagation and conflict-based heuristics

Narendra Jussien, Olivier Lhomme
2002 Artificial Intelligence  
Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms.  ...  It performs a local search over partial assignments instead of complete assignments, and uses filtering techniques and conflict-based techniques to efficiently guide the search.  ...  Acknowledgements We would like to thank Christian Bliek, Ulrich Junker and Paul Shaw, for their constructive comments on an early draft of the paper.  ... 
doi:10.1016/s0004-3702(02)00221-7 fatcat:w26aqhsw5bfd5gymibpigjwxiu

Solving Employee Timetabling Problems by Generalized Local Search [chapter]

Andrea Schaerf, Amnon Meisels
2000 Lecture Notes in Computer Science  
We present a general definition of employee timetabling problems (ETPs) that captures many real world problem formulations and includes complex constraints.  ...  We investigate the use of several local search techniques for solving ETPs.  ...  The cost function is now composed of three components: missings, strict constraints, and look-ahead. The weights assigned to these three components are crucial for the effectiveness of the search.  ... 
doi:10.1007/3-540-46238-4_33 fatcat:trf6jdpl6zfm7gbocneczx3dgi

Histogram Arc Consistency as a Value Ordering Heuristic [chapter]

Wei Liu, William S. Havens
2004 Lecture Notes in Computer Science  
The Constraint Satisfaction Problem (CSP:I is NP-hard. Finding solutions requires searching in an exponential space of possible variable assignments.  ...  . . 45 Total CPU taken to find first solutions for problems with numOfVar = 60, domSize = 30, pl (constraint density) = 0.3, p2 (constraint tightness) E [0.1,0.3] 45  ...  Problems such as workshop scheduling, resource allocation and visual image interpretation, etc., can be formulated as constraint satisfaction problems and different constraint solving techniques can be  ... 
doi:10.1007/978-3-540-24840-8_46 fatcat:uqq2slomtndofnasumx56fbdrq
« Previous Showing results 1 — 15 out of 13,307 results