Third ILOG International Users Meeting, 9 & 10 July 1997, Paris, France 1. Michel Lema^tre, Gerard Verfaillie ONERA/CERT
|
|
- Griselda Stafford
- 5 years ago
- Views:
Transcription
1 Third ILOG International Users Meeting, 9 & 10 July 1997, Paris, France 1 Daily management of an earth observation satellite : comparison of ILOG Solver with dedicated algorithms for Valued Constraint Satisfaction Problems Michel Lema^tre, Gerard Verfaillie ONERA/CERT 2, avenue Edouard Belin { BP 4025 { Toulouse cedex 4 { France fmichel.lemaitre,gerard.verfaillieg@cert.fr Abstract The daily management of an earth observation satellite like Spot is a dicult combinatorial optimization problem. A simplied form of this problem can be stated as follows : given (1) a set of candidate photographs for the next day, each one associated with a weight reecting its importance, (2) a set of imperative constraints expressing physical limitations (non overlapping of photographs, respect of camera transition times, limitation of the instantaneous data ow), select a subset of candidates which meets all the constraints and which maximizes the sum of the weights of the selected candidates. This problem can be stated as a Valued Constraint Satisfaction Problem, a general framework for which our team has developed a powerful set of algorithms. This paper reports an experiment the aim of which was (1) to evaluate the ease with which this problem can be expressed with ILOG Solver, and (2) to compare the resolution performances obtained with ILOG Solver and with dedicated VCSP complete algorithms. The main conclusions are (1) a relative ease of expression of this problem with ILOG classes, in spite of a lack for expressing constraints given in extension, and (2) a relatively good performance of ILOG Solver when compared to classical VCSP algorithms. 1 Introduction Earth Observation Satellite Scheduling Problems (EOSSPs) consists in selecting, among a set of desired photographs, a maximal subset which satises imperative constraints expressing inescapable physical limitations. In the form that will be set more precisely below, this problem is NP-complete, which means that probably no algorithm can solve all EOSSP instances in polynomial time. In actual practice, computation times tend to grow exponentially with the size of the instances to be solved. ILOG Solver is a powerful tool for constraint programming, packaged as a C++ library. It provides a set of predened generic constraints and so-called
2 meta-constraints, widely open to extensions. It allows a clear separation of problem statement from problem resolution. Valued Constraint Satisfaction Problem formulation (VCSP) is a general framework which captures a large number of discrete constrained optimization problems, and for which we have developed a library of complete and approximate algorithms. EOSSPs can be casted in this general framework. The aim of the work reported in this paper is twofold : 1. to evaluate the facility of expressing EOSSPs with commercial available tools like ILOG Solver 2. to check the performance level of our algorithms, by comparison with a standard tool in discrete optimization. We choose ILOG Solver as a yardstick. This paper is organized as follows. The rst section sets the daily management EOSSP. The second one describes the VCSP framework, explains how EOSSPs can be casted into this framework, and succinctly describes our library of algorithms. The third section explains the modeling of EOSSPs using Solver. The next section presents the compared performances, and the last one concludes. 2 Earth Observation Satellite Scheduling Problems Earth Observation Satellite Scheduling Problems and, more precisely, the daily management problem for an earth observation satellite like the future satellite Spot5, is described as follows [1] : data we are given a set S of photographs which could be taken the next day from at least one of the instruments, with respect to the satellite trajectory for each photograph, a weight expressing its importance (aggregation of several criteria like the client importance, the demand urgency, the meteorological forecasts...) for each photograph, a set of dierent ways of taking it : up to three for a mono photograph (because of the three instruments on the satellite) and only one for a stereo (because such photographs require two trials : one with the front instrument and one with the rear one) a set of imperative constraints : non overlapping and minimal transition time between two successive photographs on the same instrument, limitation on the instantaneous data ow through the satellite telemetry for simultaneous photographs on dierent instruments, 2
3 question nd an admissible subset S 0 of S (imperative constraints met) which maximizes the sum of the weights of the photographs in S 0. 3 Valued Constraint Satisfaction Problems General Framework A Constraint Satisfaction Problem (CSP) instance is dened by a triple (X; D; C), where X = fx 1 ; : : : ; x n g is a set of variables, D = fd 1 ; : : :; d n g is a set of nite domains for the variables, and C is a set of constraints. A constraint c = (X c ; R c ) is dened by a subset of variables X c X on which it holds, and a subset R c Q x i 2X c d i of allowed tuples of values. A solution of an instance is an assignment of values to all the variables which satises all the constraints. Many CSP instances are so constrained that no solution exists. In this case, one can search for a solution minimizing the number of unsatised constraints. This is the partial CSP model, introduced by [2]. This model can be further generalized by giving a weight or a valuation to each constraint, mirroring the importance one gives to its satisfaction, and by considering aggregation operators other than the sum operator. We then search for a solution minimizing an aggregation of the valuations of the unsatised constraints. This extension of the CSP model is called the Valued Constraint Satisfaction Problem framework and was introduced by [5]. A VCSP instance is a quintuple (X; D; C; S; ') where (X; D; C) is a classical CSP instance, S = (E; ; ) is a valuation structure, and ' : C! E is a valuation function, giving the valuation of each constraint. E is the set of possible valuations; is a total order on E; > 2 E is the valuation corresponding to a maximal dissatisfaction, and?2 E is the valuation corresponding to a maximal satisfaction;, the aggregation operator, allows one to aggregate valuations. In order to have a sensible behavior, must satisfy some properties : commutativity, associativity, monotonicity w.r.t. ;? must be the identity element, and > an absorbing element. Let A be an assignment of values to all of the variables, namely a complete assignment. We dene the valuation of A for the constraint c by (? if c is satised by A '(A; c) = '(c) otherwise and the overall valuation of A by '(A) = c2c '(A; c): By instantiating the valuation structure S one can dene specic frameworks such as : { classical CSP, where E is ftrue; falseg, false true,? is true, > is false, 8c 2 C; '(c) = false and is ^ (boolean and) { additive VCSP, where E is N [ f+1g, is > (natural order),? is 0, > is +1 and is + 3
4 { max VCSP, or possibilistic VCSP, where E is [0; 1], is >,? is 0, > is 1 and is max { lexicographic CSP, providing a combination of additive and max CSP. It sometimes happens that a partial assignment of the variables is a meaningful solution of the problem instance. In this case, we will have to pay a penalty for the unassigned variables. This is exactly the case with EOSSPs, for which a solution is a collection of assignments of instruments to photographs, rejected photographs corresponding to unassigned variables. It is easy to express this situation into the general VCSP framework (in which we search for a complete assignment) : just add to each original domain a special value called the rejection value, and associate to each variable a soft (non imperative) unary constraint expressing the cost of assigning it the rejection value. We call this subset of the VCSP framework the Variable Valued CSPs (VVCSPs). The standard objective is to nd a complete assignment with minimal valuation. Two kinds of algorithm can be used for this purpose : { complete algorithms, based on Branch-and-Bound schemes, which explore systematically and completely the solution space; they nd an optimal solution, provided they are given enough time { incomplete or approximate algorithms which, leaving out completeness, try to nd quickly good solutions in an opportunistic way; these methods are generally based on greedy repair schemes and randomization techniques [7, 6]; although they often produce very good quality results, they cannot guarantee a distance to the optimal valuation. Earth Observation Satellite Scheduling Problems as VCSPs These problems can be casted as additive VVCSPs by : associating a variable v with each photograph p; associating with v a domain d to express the dierent ways of achieving p and adding to d a rejection value, to express the possibility of not selecting p; then associating with v a non imperative unary constraint, setting a penalty for using the rejection value, with a valuation equal to the weight of p translating as imperative constraints the constraints of non overlapping and minimal transition time between two photographs on the same instrument, and of limitation on the instantaneous data ow; in our EOSSP instances, imperative constraints are binary and ternary looking for a complete assignment of values to variables with minimum valuation, which is equivalent to maximizing the sum of the weights of the selected photographs. As a matter of fact, the data encoded as VCSP instances is the result of a preprocessing, which computes all the variables with their associated domain 4
5 and all the binary and ternary imperative constraints with their explicitly de- ned associated relation, expressed as lists of forbidden tuples of values. It should be noticed that the rejection value cannot appear in any forbidden tuple. A xed format has been dened for this data, and a le is produced for each EOSSP instance, using this format 1. A Library of VCSP Algorithms We have developed a library 2 of complete and approximate algorithms for solving VCSP instances. This library includes : complete algorithms based upon variations of Best First Branch-and- Bound search, with well known features such as Forward-Checking, and new ones such as Directed Arc Consistency [3] and Russian Doll Search [8] approximate algorithms based on local search techniques, especially Simulated Annealing. Complete algorithms of the library may be easily associated with variable and value ordering heuristics. A careful compromise between eciency and generality has been searched for. As far as generality is concerned, the implementation closely follows the mathematical (V)CSP model stated above. In particular, algorithms are fully parameterized by the valuation structure. Constraints can be dened either explicitly (by enumeration of allowed or rejected tuples) or implicitly (by mean of boolean functions). Special variants of complete algorithms have been built for the VVCSP sub-framework, in order to improve eciency. This software in written in Common Lisp. 4 Using ILOG Solver to solve EOSSPs The modeling of Spot5 daily management problem with ILOG Solver was entrusted to one of our student, as a last term engineer project, under our supervision [4]. When he started his work, he knew nothing about ILOG Solver. He took four months to achieve his work, including study of ILOG, trying several Solver models and heuristics, and conducting experiments. Input data for ILOG Solver were the data les resulting from the aforementioned preprocessing phase. Recall that a le denes for each EOSSP instance : { a list of variables with their domain and weight { a list of imperative constraints, each one dened as a list of explicitly forbidden tuples of values. ILOG Solver does not provide a predened class for a straightforward expression of explicit constraints (given by a list of forbidden or allowed tuples). 1 Some of these Spot5 instances can be down-loaded from ftp://ftp/cert.fr/pub/ lemaitre/lvcsp/pbs/spot5/. 2 Accessible from ftp://ftp/cert.fr/pub/lemaitre/lvcsp. 5
6 We have tried several models to circumvent this diculty. The most ecient seems to use the predened IlcIfThen constraint class. Suppose we want to forbid the tuple of values (2,3) for variables x1 and x2. This can be expressed by the instruction IlcIfThen(x1 = 2, x2!= 3). We must generate one such instruction for each forbidden tuple. This works also for ternary constraints. For example, IlcIfThen(x1 = 2, (x2!= 3 x3!= 1)) expresses that the tuple of values (2,3,1) is forbidden for the variables x1, x2, x3. The goal to be reached is just to minimize the expression P i w ir i over allowed complete assignments (that is : including no forbidden tuple), with w i being the weight of the variable number i and r i = 1 if this variable is assigned to the rejection value, r i = 0 elsewhere. This criterion is expressed using the \scalar product" IlcScalProd generic constraint. As said before, several trials have been done to express EOSSPs with Solver, and no particular diculty did arise during this modeling task. The report [4] gives more details about modeling EOSSPs using ILOG Solver. 5 Comparison of Performances Three complete algorithms, searching for optimal solutions, have been tested on some Spot5 daily management EOSSP instances : IS is our ILOG Solver version with the most ecient ordering heuristics we experimented. Here are some details about these heuristics : { trying the rejection value in the last place always improves computation time signicantly (typically divided by a factor of 4) { the best static ordering of variables seems to be the following : among the variables of minimum domain size, choose one involved in the greatest number of imperative constraints, and in case of a tie, choose one with maximum weight (the computation time is typically divided by 2 with respect to the initial ordering of variables) { choosing a variable having the smallest remaining domain size (dynamic order) surprisingly does not result in a signicant reduction of computation time. BB, from our VCSP library, is a classical Branch-and-Bound with Forward-Checking, associated with the following heuristics : { as with IS, try last the rejection value { dynamically choose a variable having the smallest remaining domain size; in case of a tie, choose one involved in the greatest number of imperative constraints. RDS (for Russian Doll Search) is an original algorithm [8] included in our library, which seems particularly well suited for small bandwidth constraint graphs like those of Spot5 daily management EOSSP instances; 6
7 instance IS BB RDS mean Table 1: Performance comparison on some Spot5 EOSSP instances. this algorithm replaces one backtrack search by n successive searches on nested subproblems (n being the number of variables), records the results of each search and uses them later, when solving larger subproblems, in order to improve the lower bound on the global valuation of any partial assignment. In this comparison, we use specialized versions of BB and RDS for VVC- SPs (soft unary constraints on variables, all other constraints being imperative ones). Table 1 shows the results obtained on 15 relatively small EOSSP instances, with the three algorithms. IS and BB are within the same order of performance, with a relatively small advantage for BB. Recall that IS is built from a very rich framework for Discrete Optimization Problems, whereas BB is a classical Branch-and-Bound algorithm, specialized for VVCSPs. RDS surpasses clearly the two other competing algorithms, probably because it exploits the small bandwidth structure of the constraint graphs. The results reported above concern comparatively small instances, ranging from 25 to 30 variables. Instances to be solved in practice may have more than 900 variables. When the size of the instances increases, it can be observed that computation time increases very rapidly. The BB algorithm cannot be reasonably used on instances having more than 60 variables, and RDS is generally overwhelmed by instances having more than 300 variables. For greater instances, we must abandon the search for optimality and turn towards approximate algorithms. 7
8 6 Conclusion We have presented the daily management scheduling problem of an earth observation satellite, a real-life combinatorial optimization problem of great economical importance. In this context, two opposite approaches for combinatorial optimization problem solving have been compared. The rst one, call it the language approach, is represented by ILOG Solver. It rests on a rich set of predened constructs for the expression of problems (generic constraints and search procedures) harmoniously included in the same ground language, providing the user with possibilities of extensions. The second approach, name it the model approach, is illustrated by our library of algorithms. It is built on a sound and general mathematical model, oering only basic and rather \at" constructs, but able to capture most (if not theoretically all) discrete combinatorial optimization problems. In this framework, a range of algorithms is proposed, some of them fully general, others being able to exploit particular features of problem instances. Undoubtedly, the language approach provides the user with easier ways of tackling problems : often, the user will nd easily a construct or a combination of constructs directly expressing his/her problem. On the other hand, the model approach will force the user towards a deeper understanding of his/her problem, possibly discovering the particular features of it. Once the modeling work is done, better performances may be expected. The performance comparison reported in this paper shows that the language approach is not much penalized by the rich set of constructs it provides, as far as general algorithms are used, and instances are small. Nevertheless, sophisticated algorithms exploiting the particular structure of problem instances are probably easier to bring into play within the model approach. We conclude by suggesting the following extensions to Solver : { the encapsulated expression of explicit constraints { the ability to use approximate algorithms, replacing systematic search by opportunistic local search. Acknowledgments This work was supported in part by the French space agency (Centre National d' Etudes Spatiales). We are indebted to Mustapha El Masbahi who conducted the ILOG experimentation, and to Denis Blumstein and Jean-Claude Agnese, from CNES, who rst conceived and experimented the Russian Doll Search method for EOSSPs. References [1] J.C. Agnese, N. Bataille, E. Bensana, D. Blumstein, and G. Verfaillie. Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. In Proc. of the 5th ESA Workshop on Articial Intelli- 8
9 gence and Knowledge Based Systems for Space, Noordwijk, The Netherlands, [2] E. Freuder and R. Wallace. Partial Constraint Satisfaction. Articial Intelligence, 58:21{70, [3] J. Larrosa and P. Meseguer. Expoiting the Use of DAC in MAX-CSP. In Proc. of the 2nd International Conference on Principles and Practice of Constraint Programming (CP-96, LNCS 1118), pages 308{322, Cambridge, MA, USA, [4] M. El Masbahi. Optimisation de la programmation journaliere des prises de vue du satellite SPOT5 avec Ilog Solver. Technical Report Projet de n d'etudes, INSA, Toulouse, France, [5] T. Schiex, H. Fargier, and G. Verfaillie. Valued Constraint Satisfaction Problems : Hard and Easy Problems. In Proc. of the 14th International Joint Conference on Articial Intelligence (IJCAI-95), pages 631{637, Montreal, Canada, [6] B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisability Problems. In Proc. of the 10th National Conference on Articial Intelligence (AAAI-92), pages 440{446, San Jose, CA, USA, [7] P. J. M. van Laarhoven and E. H. L. Aarts. Simulated Annealing : Theory and Applications. D. Reidel Publishing Company, [8] G. Verfaillie, M. Lema^tre, and T. Schiex. Russian Doll Search for Solving Constraint Optimization Problems. In Proc. of the 13th National Conference on Articial Intelligence (AAAI-96), pages 181{187, Portland, OR, USA,
Nogood Recording for Valued Constraint Satisfaction Problems.
Nogood Recording for Valued Constraint Satisfaction Problems. Pierre DAGO and Gérard VERFAIIE ONERA-CERT 2, avenue Edouard Belin, BP 4025 31055 Toulouse Cedex, France fdago, verfaillieg@cert.fr Abstract
More informationA "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite Michel Vasquez and Jin-Kao Hao * (Submitted to Journal of Computational
More informationMulti-Objective Russian Doll Search
Multi-Objective Russian Doll Search Emma Rollon and Javier Larrosa Universitat Politecnica de Catalunya Jordi Girona 1-3, 08034 Barcelona, Spain erollon@lsi.upc.edu, larrosa@lsi.upc.edu Abstract Russian
More informationPropagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving Christian Bessiere Anais Fabre* LIRMM-CNRS (UMR 5506) 161, rue Ada F-34392 Montpellier Cedex 5 (bessiere,fabre}@lirmm.fr Ulrich
More informationExample: Bioinformatics. Soft Constraint Processing. From Optimal CSP to Soft CSP. Overview. From Optimal CSP to Soft CSP.
Example: Bioinformatics Soft Constraint Processing 16.412J/6.834J Cognitive Robotics Martin Sachenbacher (Using material from Thomas Schiex) RNA is single-strand molecule, composed of A,U,G,C Function
More informationLocal Consistency in Weighted CSPs and Inference in Max-SAT
Local Consistency in Weighted CSPs and Inference in Max-SAT Student name: Federico Heras Supervisor name: Javier Larrosa Universitat Politecnica de Catalunya, Barcelona, Spain fheras@lsi.upc.edu,larrosa@lsi.upc.edu
More informationGeneral Methods and Search Algorithms
DM811 HEURISTICS AND LOCAL SEARCH ALGORITHMS FOR COMBINATORIAL OPTIMZATION Lecture 3 General Methods and Search Algorithms Marco Chiarandini 2 Methods and Algorithms A Method is a general framework for
More informationKalev Kask and Rina Dechter. Department of Information and Computer Science. University of California, Irvine, CA
GSAT and Local Consistency 3 Kalev Kask and Rina Dechter Department of Information and Computer Science University of California, Irvine, CA 92717-3425 fkkask,dechterg@ics.uci.edu Abstract It has been
More informationA Graph-Based Method for Improving GSAT. Kalev Kask and Rina Dechter. fkkask,
A Graph-Based Method for Improving GSAT Kalev Kask and Rina Dechter Department of Information and Computer Science University of California, Irvine, CA 92717 fkkask, dechterg@ics.uci.edu Abstract GSAT
More informationGSAT and Local Consistency
GSAT and Local Consistency Kalev Kask Computer Science Department University of California at Irvine Irvine, CA 92717 USA Rina Dechter Computer Science Department University of California at Irvine Irvine,
More informationConstraint Optimisation Problems. Constraint Optimisation. Cost Networks. Branch and Bound. Dynamic Programming
Summary Network Search Bucket Elimination Soft Soft s express preferences over variable assignments Preferences give dierent values over variable assignment A student can follow only one class at a time
More informationKalev Kask. Abstract. This paper evaluates the power of a new scheme that generates
New Search Heuristics for Max-CSP.? Kalev Kask Department of Information and Computer Science University of California, Irvine, CA 92697-3425 kkask@ics.uci.edu Abstract. This paper evaluates the power
More informationis a kind of generalization of AC-3 to non-binary constraints. As AC-3, that algorithm has a bad worst-case time complexity (O(er 2 d r+1 ), with e th
Arc consistency for general constraint networks: preliminary results Christian Bessiere LIRMM{CNRS (UMR 5506) 161 rue Ada 34392 Montpellier cedex 5, France Email: bessiere@lirmm.fr Jean-Charles Regin ILOG
More informationDesigning and Evaluating an On-line On-board Autonomous Earth Observation Satellite Scheduling System
Designing and Evaluating an On-line On-board Autonomous Earth Observation Satellite Scheduling System Gerard Verfaillie ONERAIDCSD, Toulouse Center 2, avo Edouard Belin, BP 4025 31055 Toulouse Cedex 4,
More informationA Fast Arc Consistency Algorithm for n-ary Constraints
A Fast Arc Consistency Algorithm for n-ary Constraints Olivier Lhomme 1 and Jean-Charles Régin 2 1 ILOG, 1681, route des Dolines, 06560 Valbonne, FRANCE 2 Computing and Information Science, Cornell University,
More informationArc Consistency for Dynamic CSPs
Arc Consistency for Dynamic CSPs Malek Mouhoub mouhoubm@cs.uregina.ca Department of Computer Science, University of Regina 3737 Waskana Parkway, Regina SK, Canada, S4S 0A2 ABSTRACT Constraint Satisfaction
More informationDynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs
Dynamic heuristics for branch and bound search on tree-decomposition of Weighted CSPs Philippe Jégou, Samba Ndojh Ndiaye, and Cyril Terrioux LSIS - UMR CNRS 6168 Université Paul Cézanne (Aix-Marseille
More informationPart 2: Algorithms. CP-2001 Tutorial - Cyprus November 2001 Algorithms 1
Part 2: Algorithms CP-2001 Tutorial - Cyprus November 2001 Algorithms 1 CP-2001 Tutorial - Cyprus November 2001 Algorithms 2 Overview Problem formulation: Optimization task Exact algorithms: Branch and
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Chapter 6 of Russell & Norvig] Constraint satisfaction problems (CSPs) Standard search problem:
More informationConstraint (Logic) Programming
Constraint (Logic) Programming Roman Barták Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic bartak@ktiml.mff.cuni.cz Sudoku Combinatorial puzzle, whose goal is to enter
More informationIn search of the best constraint satisfaction search 3. Daniel Frost and Rina Dechter.
In search of the best constraint satisfaction search 3 Daniel Frost and Rina Dechter Dept. of Information and Computer Science University of California, Irvine, CA 92717 fdfrost,dechterg@ics.uci.edu Abstract
More informationBranch and Bound Algorithm Selection by Performance Prediction
From: AAAI-98 Proceedings. Copyright 1998, AAAI (www.aaai.org). All rights reserved. Branch and Bound Algorithm Selection by Performance Prediction Lionel Lobjois and Michel Lemaitre ONERA-CERT/DCSD- ENSAE
More informationConstraint-Based Scheduling: An Introduction for Newcomers
Constraint-Based Scheduling: An Introduction for Newcomers Roman Barták * Charles University in Prague, Faculty of Mathematics and Physics Malostranské námestí 2/25, 118 00, Praha 1, Czech Republic bartak@kti.mff.cuni.cz
More information2 [Ben96]. However, this study was limited to a single mapping. Since the choice of mapping can have a very large impact on our ability to solve probl
Reformulating propositional satisability as constraint satisfaction Toby Walsh University of York, York, England. tw@cs.york.ac.uk Abstract. We study how propositional satisability (SAT) problems can be
More informationConstraint Satisfaction Problems. Chapter 6
Constraint Satisfaction Problems Chapter 6 Constraint Satisfaction Problems A constraint satisfaction problem consists of three components, X, D, and C: X is a set of variables, {X 1,..., X n }. D is a
More informationSoft constraints: Polynomial classes, Applications
Soft constraints: Polynomial classes, Applications T. Schiex INRA - Toulouse, France Padova 2004 - Soft constraints p. 1 Polynomial classes structural classes: when the constraint (hyper)-graph has good
More informationHybrid Algorithms for SAT. Irina Rish and Rina Dechter.
To Guess or to Think? Hybrid Algorithms for SAT Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine fdechter,irinarg@ics.uci.edu http://www.ics.uci.edu/f~irinar,~dechterg
More informationConflict based Backjumping for Constraints Optimization Problems
Conflict based Backjumping for Constraints Optimization Problems Roie Zivan and Amnon Meisels {zivanr,am}@cs.bgu.ac.il Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105,
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Constraint Optimization Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg July 17, 2012 Nebel, Hué and Wölfl (Universität Freiburg) Constraint
More informationSemi-Independent Partitioning: A Method for Bounding the Solution to COP s
Semi-Independent Partitioning: A Method for Bounding the Solution to COP s David Larkin University of California, Irvine Abstract. In this paper we introduce a new method for bounding the solution to constraint
More informationDiscrete Lagrangian-Based Search for Solving MAX-SAT Problems. Benjamin W. Wah and Yi Shang West Main Street. Urbana, IL 61801, USA
To appear: 15th International Joint Conference on Articial Intelligence, 1997 Discrete Lagrangian-Based Search for Solving MAX-SAT Problems Abstract Weighted maximum satisability problems (MAX-SAT) are
More information2 Keywords Backtracking Algorithms, Constraint Satisfaction Problem, Distributed Articial Intelligence, Iterative Improvement Algorithm, Multiagent Sy
1 The Distributed Constraint Satisfaction Problem: Formalization and Algorithms IEEE Trans. on Knowledge and DATA Engineering, vol.10, No.5 September 1998 Makoto Yokoo, Edmund H. Durfee, Toru Ishida, and
More informationLocal consistency for ternary numeric constraints. Boi Faltings and Esther Gelle. Articial Intelligence Laboratory (LIA)
Local consistency for ternary numeric constraints Boi Faltings and Esther Gelle Articial Intelligence Laboratory (LIA) Swiss Federal Institute of Technology (EPFL) IN-Ecublens, 1015 Lausanne, Switzerland
More informationConstraint-Directed Backtracking Algorithm. Wanlin Pang. Scott D. Goodwin. May 1996
Constraint-Directed Backtracking Algorithm for Constraint-Satisfaction Problems Wanlin Pang Scott D. Goodwin Technical Report CS-96-05 May 1996 cwanlin Pang and Scott D. Goodwin Department of Computer
More informationspace. We will apply the idea of enforcing local consistency to GSAT with the hope that its performance can
GSAT and Local Consistency 3 Kalev Kask Computer Science Department University of California at Irvine Irvine, CA 92717 USA Rina Dechter Computer Science Department University of California at Irvine Irvine,
More informationMathematical Programming Formulations, Constraint Programming
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Mathematical Programming Formulations, Constraint Programming 1. Special Purpose Algorithms 2. Constraint Programming Marco Chiarandini DM87 Scheduling,
More informationThe Objective Sum Constraint
The Objective Sum Constraint Jean-Charles Régin 1 and Thierry Petit 2 jcregin@gmail.com; thierry.petit@mines-nantes.fr 1 Université de Nice-Sophia Antipolis, I3S, CNRS. 2 École des Mines de Nantes, LINA,
More information6. Tabu Search. 6.3 Minimum k-tree Problem. Fall 2010 Instructor: Dr. Masoud Yaghini
6. Tabu Search 6.3 Minimum k-tree Problem Fall 2010 Instructor: Dr. Masoud Yaghini Outline Definition Initial Solution Neighborhood Structure and Move Mechanism Tabu Structure Illustrative Tabu Structure
More informationUsing Constraint Programming to Solve the Maximum Clique Problem
Using Constraint Programming to Solve the Maximum Clique Problem Jean-Charles Régin ILOG Sophia Antipolis Les Taissounières HB, 1681 route des Dolines, 06560 Valbonne, France regin@ilog.fr Abstract. This
More informationJavier Larrosa. Dep. Llenguatges i Sistemes Informatics. Universitat Politecnica de Catalunya, Barcelona, Spain.
Boosting Search with Variable Elimination.? Javier Larrosa Dep. Llenguatges i Sistemes Informatics Universitat Politecnica de Catalunya, Barcelona, Spain larrosa@lsi.upc.es Abstract. Variable elimination
More informationRina Dechter. Irvine, California, USA A constraint satisfaction problem (csp) dened over a constraint network
Constraint Satisfaction Rina Dechter Department of Computer and Information Science University of California, Irvine Irvine, California, USA 92717 dechter@@ics.uci.edu A constraint satisfaction problem
More informationarxiv: v1 [cs.dm] 6 May 2009
Solving the 0 1 Multidimensional Knapsack Problem with Resolution Search Sylvain Boussier a, Michel Vasquez a, Yannick Vimont a, Saïd Hanafi b and Philippe Michelon c arxiv:0905.0848v1 [cs.dm] 6 May 2009
More informationModelling Combinatorial Problems for CLP(FD+R) Henk Vandecasteele. Department of Computer Science, K. U. Leuven
Modelling Combinatorial Problems for CLP(FD+R) Henk Vandecasteele Department of Computer Science, K. U. Leuven Celestijnenlaan 200A, B-3001 Heverlee, Belgium henk.vandecasteele@cs.kuleuven.ac.be Robert
More informationSolving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts
, 23-25 October, 2013, San Francisco, USA Solving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts Yuko Aratsu, Kazunori Mizuno, Hitoshi Sasaki, Seiichi Nishihara Abstract In
More informationalgorithms, i.e., they attempt to construct a solution piece by piece and are not able to offer a complete solution until the end. The FM algorithm, l
The FMSAT Satisfiability Solver: Hypergraph Partitioning meets Boolean Satisfiability Arathi Ramani, Igor Markov framania, imarkovg@eecs.umich.edu February 6, 2002 Abstract This report is intended to present
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition,
More informationConstraint Satisfaction Problems Chapter 3, Section 7 and Chapter 4, Section 4.4 AIMA Slides cstuart Russell and Peter Norvig, 1998 Chapter 3, Section
Constraint Satisfaction Problems Chapter 3, Section 7 and Chapter 4, Section 4.4 AIMA Slides cstuart Russell and Peter Norvig, 1998 Chapter 3, Section 7 and Chapter 4, Section 4.4 1 Outline } CSP examples
More informationValidating Plans with Durative Actions via Integrating Boolean and Numerical Constraints
Validating Plans with Durative Actions via Integrating Boolean and Numerical Constraints Roman Barták Charles University in Prague, Faculty of Mathematics and Physics Institute for Theoretical Computer
More informationConflict Directed Backjumping for Max-CSPs
Conflict Directed Backjumping for Max-CSPs Roie Zivan and Amnon Meisels, Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel Abstract Max-CSPs are Constraint
More informationSoft arc consistency revisited
Soft arc consistency revisited M. C. Cooper IRIT, University of Toulouse III, 06 Toulouse, France S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki UBIA, UR-875, INRA, F-0 Castanet Tolosan, France T. Werner
More informationSome Applications of Graph Bandwidth to Constraint Satisfaction Problems
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems Ramin Zabih Computer Science Department Stanford University Stanford, California 94305 Abstract Bandwidth is a fundamental concept
More informationANIMATION OF ALGORITHMS ON GRAPHS
Master Informatique 1 ère année 2008 2009 MASTER 1 ENGLISH REPORT YEAR 2008 2009 ANIMATION OF ALGORITHMS ON GRAPHS AUTHORS : TUTOR : MICKAEL PONTON FREDERIC SPADE JEAN MARC NICOD ABSTRACT Among the units
More informationSearch. Krzysztof Kuchcinski. Department of Computer Science Lund Institute of Technology Sweden.
Search Krzysztof Kuchcinski Krzysztof.Kuchcinski@cs.lth.se Department of Computer Science Lund Institute of Technology Sweden January 12, 2015 Kris Kuchcinski (LTH) Search January 12, 2015 1 / 46 Search
More informationIncremental Breakout Algorithm with Variable Ordering
Incremental Breaout Algorithm with Variable Ordering Carlos Eisenberg and Boi Faltings Artificial Intelligence Laboratory (LIA) Swiss Federal Institute of Technology (EPFL) IN-Ecublens, Lausanne, Switzerland
More informationJournal of Global Optimization, 10, 1{40 (1997) A Discrete Lagrangian-Based Global-Search. Method for Solving Satisability Problems *
Journal of Global Optimization, 10, 1{40 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A Discrete Lagrangian-Based Global-Search Method for Solving Satisability Problems
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems In which we see how treating states as more than just little black boxes leads to the invention of a range of powerful new search methods and a deeper understanding of
More informationThe Scaling of Search Cost. Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh.
The Scaling of Search Cost Ian P. Gent and Ewan MacIntyre and Patrick Prosser and Toby Walsh Apes Research Group, Department of Computer Science, University of Strathclyde, Glasgow G XH, Scotland Email:
More informationCS 771 Artificial Intelligence. Constraint Satisfaction Problem
CS 771 Artificial Intelligence Constraint Satisfaction Problem Constraint Satisfaction Problems So far we have seen a problem can be solved by searching in space of states These states can be evaluated
More informationA strong local consistency for constraint satisfaction
A strong local consistency for constraint satisfaction Romuald Debruyne Ecole des Mines de Nantes 4, rue Alfred Kastler, La Chantrerie 4437 Nantes cedex 3 - France Email: debruyne@lirmm.fr Abstract Filtering
More informationAlgebraic Properties of CSP Model Operators? Y.C. Law and J.H.M. Lee. The Chinese University of Hong Kong.
Algebraic Properties of CSP Model Operators? Y.C. Law and J.H.M. Lee Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong SAR, China fyclaw,jleeg@cse.cuhk.edu.hk
More informationin conjunction with algorithms which check forwards, the Fail-First (FF) and Brelaz (Bz) heuristics are cheap to evaluate and are generally considered
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem? Ian P. Gent 1, Ewan MacIntyre 1, Patrick Prosser 1, Barbara M. Smith 2 and Toby Walsh 3 1 Department
More informationConstraint Programming
Depth-first search Let us go back to foundations: DFS = Depth First Search Constraint Programming Roman Barták Department of Theoretical Computer Science and Mathematical Logic 2 3 4 5 6 7 8 9 Observation:
More informationTwo Problems - Two Solutions: One System - ECLiPSe. Mark Wallace and Andre Veron. April 1993
Two Problems - Two Solutions: One System - ECLiPSe Mark Wallace and Andre Veron April 1993 1 Introduction The constraint logic programming system ECL i PS e [4] is the successor to the CHIP system [1].
More informationSet 5: Constraint Satisfaction Problems Chapter 6 R&N
Set 5: Constraint Satisfaction Problems Chapter 6 R&N ICS 271 Fall 2017 Kalev Kask ICS-271:Notes 5: 1 The constraint network model Outline Variables, domains, constraints, constraint graph, solutions Examples:
More informationA fuzzy constraint assigns every possible tuple in a relation a membership degree. The function
Scribe Notes: 2/13/2013 Presenter: Tony Schnider Scribe: Nate Stender Topic: Soft Constraints (Ch. 9 of CP handbook) Soft Constraints Motivation Soft constraints are used: 1. When we seek to find the best
More informationA Simplied NP-complete MAXSAT Problem. Abstract. It is shown that the MAX2SAT problem is NP-complete even if every variable
A Simplied NP-complete MAXSAT Problem Venkatesh Raman 1, B. Ravikumar 2 and S. Srinivasa Rao 1 1 The Institute of Mathematical Sciences, C. I. T. Campus, Chennai 600 113. India 2 Department of Computer
More informationA Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology
A Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology Carlos A. S. OLIVEIRA CAO Lab, Dept. of ISE, University of Florida Gainesville, FL 32611, USA David PAOLINI
More informationA Constraint Programming Based Approach to Detect Ontology Inconsistencies
The International Arab Journal of Information Technology, Vol. 8, No. 1, January 2011 1 A Constraint Programming Based Approach to Detect Ontology Inconsistencies Moussa Benaissa and Yahia Lebbah Faculté
More informationAndrew Davenport and Edward Tsang. fdaveat,edwardgessex.ac.uk. mostly soluble problems and regions of overconstrained, mostly insoluble problems as
An empirical investigation into the exceptionally hard problems Andrew Davenport and Edward Tsang Department of Computer Science, University of Essex, Colchester, Essex CO SQ, United Kingdom. fdaveat,edwardgessex.ac.uk
More informationKalev Kask and Rina Dechter
From: AAAI-96 Proceedings. Copyright 1996, AAAI (www.aaai.org). All rights reserved. A Graph-Based Method for Improving GSAT Kalev Kask and Rina Dechter Department of Information and Computer Science University
More informationTitle of Publication: Encyclopedia of Cognitive Science. Article title: Constraint Satisfaction. Article code: 26. Authors: Rina Dechter
Title of Publication: Encyclopedia of Cognitive Science. Article title: Constraint Satisfaction. Article code: 26. Authors: Rina Dechter Department of Computer and Information Science University of California,
More informationInterleaved Depth-First Search *
Interleaved Depth-First Search * Pedro Meseguer Institut d'investigacio en Intel.ligencia Artificial Consejo Superior de Investigaciones Cientificas Campus UAB, 08193 Bellaterra, Spain Abstract In tree
More informationCombining constraint programming and local search to design new powerful heuristics
MIC2003: The Fifth Metaheuristics International Conference 028-1 Combining constraint programming and local search to design new powerful heuristics Narendra Jussien Olivier Lhomme École des Mines de Nantes
More informationof m clauses, each containing the disjunction of boolean variables from a nite set V = fv 1 ; : : : ; vng of size n [8]. Each variable occurrence with
A Hybridised 3-SAT Algorithm Andrew Slater Automated Reasoning Project, Computer Sciences Laboratory, RSISE, Australian National University, 0200, Canberra Andrew.Slater@anu.edu.au April 9, 1999 1 Introduction
More informationAssign auniquecodeto each state to produce a. Given jsj states, needed at least dlog jsje state bits. (minimum width encoding), at most jsj state bits
State Assignment The problem: Assign auniquecodeto each state to produce a logic level description. Given jsj states, needed at least dlog jsje state bits (minimum width encoding), at most jsj state bits
More informationcoordinates ([6]); it turns out that this language is also useful for ecient scanning of the relevant part of the backtracking tree. The idea of learn
Designing algorithms by sampling Mark K. Goldberg, 1 Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180 U.S.A. goldberg@cs.rpi.edu David L. Hollinger Department of Computer
More informationLecture 18. Questions? Monday, February 20 CS 430 Artificial Intelligence - Lecture 18 1
Lecture 18 Questions? Monday, February 20 CS 430 Artificial Intelligence - Lecture 18 1 Outline Chapter 6 - Constraint Satisfaction Problems Path Consistency & Global Constraints Sudoku Example Backtracking
More informationConstraint Optimization Techniques for MultiObjective Branch and Bound Search
Constraint Optimization Techniques for MultiObjective Branch and Bound Search Emma Rollon 1 and Javier Larrosa 1 Universitat Politècnica de Catalunya Jordi Girona 1-3, Edificio Omega 08034 Barcelona, Spain
More informationA Parameterized Local Consistency for Redundant Modeling in Weighted CSPs
A Parameterized Local Consistency for Redundant Modeling in Weighted CSPs Y.C. Law, J.H.M. Lee, and M.H.C. Woo Department of Computer Science and Engineering The Chinese University of Hong Kong, Shatin,
More informationCONSTRAINT-BASED SCHEDULING: AN INTRODUCTION FOR NEWCOMERS. Roman Barták
In Proceedings of 7th IFAC Workshop on Intelligent Manufacturing Systems (IMS 2003), Elsevier Science, 2003 (to appear). CONSTRAINT-BASED SCHEDULING: AN INTRODUCTION FOR NEWCOMERS Roman Barták Charles
More informationMulti-Objective Propagation in Constraint Programming
Multi-Objective Propagation in Constraint Programming Emma Rollon and Javier Larrosa Abstract. Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. tandard
More informationPPS : A Pipeline Path-based Scheduler. 46, Avenue Felix Viallet, Grenoble Cedex, France.
: A Pipeline Path-based Scheduler Maher Rahmouni Ahmed A. Jerraya Laboratoire TIMA/lNPG,, Avenue Felix Viallet, 80 Grenoble Cedex, France Email:rahmouni@verdon.imag.fr Abstract This paper presents a scheduling
More informationAbstract. This paper shows how parallelism has been integrated into
Parallel Optimisation in the SCOOP Library Per Kristian Nilsen 1 and Nicolas Prcovic 2 1 SINTEF Applied Mathematics, Box 124 Blindern, 0314 Oslo, NORWAY E-mail: pkn@math.sintef.no 2 CERMICS-INRIA Sophia
More informationVALCSP solver : a combination of Multi-Level Dynamic Variable Ordering with Constraint Weighting
VALCS solver : a combination of Multi-Level Dynamic Variable Ordering with Constraint Weighting Assef Chmeiss, Lakdar Saïs, Vincent Krawczyk CRIL - University of Artois - IUT de Lens Rue Jean Souvraz -
More informationExample: Map coloring
Today s s lecture Local Search Lecture 7: Search - 6 Heuristic Repair CSP and 3-SAT Solving CSPs using Systematic Search. Victor Lesser CMPSCI 683 Fall 2004 The relationship between problem structure and
More informationSpeeding Up the ESG Algorithm
Speeding Up the ESG Algorithm Yousef Kilani 1 and Abdullah. Mohdzin 2 1 Prince Hussein bin Abdullah Information Technology College, Al Al-Bayt University, Jordan 2 Faculty of Information Science and Technology,
More informationRajiv Chopra, Rohini Srihari and Anthony Ralston. labeling problem. However, these are dicult to
Expensive Constraints and HyperArc-Consistency Rajiv Chopra, Rohini Srihari and Anthony Ralston Dept. of Computer Science, SUNY at Bualo 224 Bell Hall, Amherst NY 14214 frchopra,rohini,ralstong@cs.buffalo.edu
More informationA generic framework for solving CSPs integrating decomposition methods
A generic framework for solving CSPs integrating decomposition methods L. Blet 1,3, S. N. Ndiaye 1,2, and C. Solnon 1,3 1 Université de Lyon - LIRIS 2 Université Lyon 1, LIRIS, UMR5205, F-69622 France
More informationMAX-PLANCK-INSTITUT F UR. Ordered Semantic Hyper-Linking. David A. Plaisted. MPI{I{94{235 August 1994 INFORMATIK. Im Stadtwald. D Saarbrucken
MAX-PLANCK-INSTITUT F UR INFORMATIK Ordered Semantic Hyper-Linking David A. Plaisted MPI{I{94{235 August 1994 k I N F O R M A T I K Im Stadtwald D 66123 Saarbrucken Germany Authors' Addresses David Plaisted
More informationThe Branch & Move algorithm: Improving Global Constraints Support by Local Search
Branch and Move 1 The Branch & Move algorithm: Improving Global Constraints Support by Local Search Thierry Benoist Bouygues e-lab, 1 av. Eugène Freyssinet, 78061 St Quentin en Yvelines Cedex, France tbenoist@bouygues.com
More informationOn Constraint Problems with Incomplete or Erroneous Data
On Constraint Problems with Incomplete or Erroneous Data Neil Yorke-Smith and Carmen Gervet IC Parc, Imperial College, London, SW7 2AZ, U.K. nys,cg6 @icparc.ic.ac.uk Abstract. Real-world constraint problems
More informationConstraint Satisfaction Problems. Chapter 6
Constraint Satisfaction Problems Chapter 6 Office hours Office hours for Assignment 1 (ASB9810 in CSIL): Sep 29th(Fri) 12:00 to 13:30 Oct 3rd(Tue) 11:30 to 13:00 Late homework policy You get four late
More information7. Decision or classification trees
7. Decision or classification trees Next we are going to consider a rather different approach from those presented so far to machine learning that use one of the most common and important data structure,
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Berlin Chen Department of Computer Science & Information Engineering National Taiwan Normal University References: 1. S. Russell and P. Norvig. Artificial Intelligence:
More information2 The Service Provision Problem The formulation given here can also be found in Tomasgard et al. [6]. That paper also details the background of the mo
Two-Stage Service Provision by Branch and Bound Shane Dye Department ofmanagement University of Canterbury Christchurch, New Zealand s.dye@mang.canterbury.ac.nz Asgeir Tomasgard SINTEF, Trondheim, Norway
More informationTowards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP D. Allouche, S. de Givry, and T. Schiex Unité de Biométrie et Intelligence Artificielle, UR 875, INRA, F-31320 Castanet Tolosan,
More informationv b) Λ (a v b) Λ (a v b) AND a v b a _ v b v b
A NN Algorithm for Boolean Satisability Problems William M. Spears AI Center - Code 5514 Naval Research Laboratory Washington, D.C. 20375-5320 202-767-9006 (W) 202-767-3172 (Fax) spears@aic.nrl.navy.mil
More informationWhat is Search For? CSE 473: Artificial Intelligence. Example: N-Queens. Example: N-Queens. Example: Map-Coloring 4/7/17
CSE 473: Artificial Intelligence Constraint Satisfaction Dieter Fox What is Search For? Models of the world: single agent, deterministic actions, fully observed state, discrete state space Planning: sequences
More informationConstraint Programming
Constraint In Pursuit of The Holly Grail Roman Barták Charles University in Prague Constraint programming represents one of the closest approaches computer science has yet made to the Holy Grail of programming:
More informationNP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.
CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT
More information