ILOG SOLVER Reference Manual Version 3.2,ILOG,1996  Home/Search   Document Not in Database   Summary   Related Articles   Check

....do not post bids but entire intervals of free resource capacities. Planning is also an application field of pure constraint techniques. Most approaches use either constraint logic programming (CLP) languages [cf. e.g. 6, 8] or special purpose constraint libraries for standard programming languages [5]. In both cases underlying algorithms are standard constraint solving methods as for example propagation of known values or intervals [cf. 4] These algorithms are limited in case of over constraint problems, where conflict set detecting and constraint relaxation are required. CLP approaches are ....

ILOG Solver Reference Manual Version 1.2, 1993, ILOG S.A., Gentilly Cedex 1993

....2. Last but not least, we use an implication constraint to ensure that handling of jobs assigned to the same worker must not overlap. The disjunction constraint and the implication constraint used in the definition of predicates workers 1 and nonOverlapJobs 2 respectively are similar to those from [7]. Posing the query schedule(Jobs) to our system generates twenty four different valuations. Many of these valuations are symmetrical variants of one another since worker assignment is taken into account. If we are concerned only with the start time of each job, we can replace the head of the ....

ILOG. ILOG: Solver Reference Manual Version 3.0, 1995.

....a rich set of constraintsolving functions and routines, and greatly facilitates the implementation process. The expressiveness and efficiency of constraint programming in solving such kind of scheduling problem are described in [24] In this project, we adopt ILOG SOLVER, a C class library [37, 17], as our tool. We encounter two major difficulties in the development process. First, shift pre set requests adversely affect the efficiency of the rostering system in two ways. They cause the choices for remaining shifts to become tight and limited, and break the regularity of some wanted and ....

....of other constraints are similar. Interested readers are referred to [7] Slot Model In the slot model, we have Rule 1 satisfied for free since the rule is implicitly satisfied by requiring each constrained variable to take on exactly one value. Rule 2 can be modeled using a counting constraint [17] as follows: For each nurse Nurse, the number of variables in fNurse Mon; Nurse Sung assigned with the O shift must be equal to one. Rule 3 is expressed using a boolean implication constraint ) 17] which is a reflection of a boolean implication logical relation between two ....

[Article contains additional citation context not shown here]

ILOG. ILOG: Solver Reference Manual Version 3.0, 1995.

....to demonstrate the feasibility of our algorithms, we have re constructed and enhanced the PRaCoSy running map tool prototype [7] with rescheduling capability. The prototype consists of a constraint based scheduler and a userinterface. The former is implemented in C with ILOG Solver library 2. 0 [4] while the latter is built using Microsoft Visual Basic 3.0. In the following, an overview of the running map tool is presented. We then give a sample session of our tool using a segment (from Nanjingxi to Shanghai) of the China railway which amounts to 3005 constraints and 596 variables. The ....

ILOG. ILOG: Solver Reference Manual Version 2.0, 1994.

....single value to constraint node(s) 3 A Comprehensive Constraint Library The constraint library for E GENET consists of two kinds of constraints. Elementary constraints are simple constraints whereas global constraints are complex constraints found in such commercial systems as CHIP [22] and ILOG [9]. Benchmarking results in this section are median of 10 runs obtained on a SUN SPARCstation 10 model 30. Statistical averages with the best and worst runs removed are given in brackets. 3.1 Elementary Constraints The design and implementation of elementary constraints, including linear arithmetic ....

ILOG. ILOG SOLVER: Reference Manual Version 4.0, 1997.

....value to constraint node(s) 3 A Comprehensive Constraint Library The constraint library for E GENET consists of two kinds of constraints. Elementary constraints are simple constraints whereas global constraints are complex constraints found in such commercial systems as CHIP [22] and ILOG [9]. Benchmarking results in this section are median of 10 runs obtained on a SUN SPARCstation 10 model 30. Statistical averages with the best and worst runs removed are given in brackets. 3.1 Elementary Constraints The design and implementation of elementary constraints, including linear arithmetic ....

ILOG. ILOG SOLVER: Reference Manual Version 4.0, 1997.

....language. Although our method does not rely on any particular programming language feature, appropriate language constructs can help expressing channeling constraints more succinctly. For example, the element constraint [31] its usage discussed in section 4. 2) and the IlcInverse function [33] provided in the ILOG Solver library serve this purpose. In particular, the latter, available only in version 3.2 or above, allows concise expression of channeling constraints relating models that are inverse of each other. Unfortunately, the IlcInverse function was not yet available during our ....

ILOG. ILOG SOLVER: Reference Manual Version 4.0, 1997.

....problem size in the worst case. One widely adopted approach in solving CSPs features various degrees of combinations of backtracking tree search and constraint propagation [47, 37] This framework is realized in the constraint logic programming language CHIP [18] and C class library ILOG SOLVER [31], which have been applied successfully to real life industrial applications [16, 17, 48, 39, 2, 38] There are at least six approaches to increase the efficiency of constraint solving. The first approach amounts to incorporating variable and value ordering heuristics [6, 30] in the labeling ....

....programming language, whereas our method should work in any constraint based language. Although our method does not rely on any particular programming language feature, appropriate language constructs can help expressing channeling constraints more succinctly. For example, the element constraint [31] (its usage discussed in section 4.2) and the IlcInverse function [33] provided in the ILOG Solver library serve this purpose. In particular, the latter, available only in version 3.2 or above, allows concise expression of channeling constraints relating models that are inverse of each other. ....

[Article contains additional citation context not shown here]

ILOG. ILOG SOLVER: Reference Manual Version 3.0, 1995.

....the complexity of the ILP. The aim of the work described in this paper is to develop a pre scheduling step for TRACS II which selects a subset of the bus workings relief opportunities which TRACS II will be permitted to use. This pre processing method has been implemented using ILOG Solver 3. 2 [ILO96a, ILO96b]. 2 Relief Opportunity Selection The hypothesis that is used as the basis for the approach of the relief point selection method is that a good driver schedule must contain good relief opportunities. One feature often found in good driver schedules, upon which the relief point selection method is ....

ILOG Solver reference manual -- version 3.2, July 1996.

....to demonstrate the feasibility of our algorithms, we have re constructed and enhanced the PRaCoSy running map tool prototype [8] with rescheduling capability. The prototype consists of a constraint based scheduler and a userinterface. The former is implemented in C with ILOG Solver library 2. 0 [5] while the latter is built using Microsoft Visual Basic 3.0. In the following, an overview of the running map tool is presented. We then give a sample session of our tool using a segment of the China railway. The rescheduled timetables generated by the two heuristics are explained. Two examples, ....

ILOG. ILOG: Solver Reference Manual Version 2.0, 1994.

....problem size in the worst case. One widely adopted approach in solving CSP s features various degrees of combinations of backtracking tree search and constraint propagation [19, 12] This framework is realized in the constraint logic programming languages CHIP [8] and C class library ILOG SOLVER [11], which have been applied successfully to real life industrial applications [6, 7, 20, 14, 1, 13] There are at least four approaches to increase the efficiency of constraintsolving. The first approach amounts to incorporating variable and value ordering heuristics [3, 10] in the labeling ....

....are n nurses in the AEU, then there will be 7n variables in the rostering system. Under this formulation, we have rule 1 satisfied for free since the rule is implicitly satisfied by requiring each constrained variable to take on exactly one value. Rule 2 can be modeled using a counting constraint [11] as follows: For each nurse Nurse, the number of variables in the set fNurse Mon; Nurse Tue; Nurse Sung assigned with the day off (O) shift must be equal to one. Preference planning rules, or soft constraints, are expressed in the same manner as imperative planning rules. There is, ....

[Article contains additional citation context not shown here]

ILOG. ILOG: Solver Reference Manual Version 3.0, 1995.

No context found.

ILOG SOLVER Reference Manual Version 3.2,ILOG,1996

No context found.

ILOG Solver: Reference Manual --- Version 3.0, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC