Messages

hello!
I am trying to program your algorithm for an university project  i fellow your description of the algorithm ,
but I want to know when to break a constraint and how will the weight will affect this operation,
I thought to do the following:
Never break any constraint unless we tried all possible swaps and return with out success and if we are at level 0 I scan all slots with 'soft conflicts' (i mean slots with constraints violated) then i place the activity in the slot with the less number of violated constraint and if two or more are equal in the number of violated constraints i choose the slot with the less sum of weight  of the violated constraint.
-----------------------------------------------
It worked but i had some problems:
1)too much time for generation as no constraints are spiked testing during the swap level.
2)I am not sure that the best slot with violated constraints which was chosen in level 0 is the best practically for example :
if we have (MinDayBetWeenASetOfAcivities 2 ) some times the best slot chosen will be with 0 days between activities but some other slots are with 1 day so logically its better to put the activity at the second slot.
--------------------------------------------------------
what i am thinking to do is to find a way to break constraint during swap respecting the weight can you help me please.

can you explain this please?

2 g) If we are at level 0, and we had no success in placing A_i, place it like in steps 2 b) and 2 c), but without recursion. We have now 3 - 1 = 2 more activities to place. Go to step 2) (some methods to avoid cycling are used here).

what is 3 - 1 = 2
and what is cycle and how do you prevent it?

hello!
I have some questions
first of all where can I find the part of code in which you test if a constraint is valid for an activity for a  time slot
for example if some activity have the constraint :
MindaysPerWeekForAStudentSet 
then where is the part of code that checks for example that (Monday/08-09) is An valid slot??

The second Question is when do you check the constraint that include Min(days/hour /etc.)
because it depends on  future data ,so how could you decide whether this slot is valid if you haven't placed all activities yet ,I working on a project for our university and I am thinking about checking this constraint after fishing placing all the activities related to the (student set/teacher) mentioned in the constraint

yes thanks a lot

do you mean by The maximum depth (level) of recursion like this:
{swap(x,y)
   swap(x,y)
      swap(x,y)
         swap(x,y)
            swap(x,y)
              ....
               ........14 times}
and do you mean by The maximum number of recursive calls {calls to the function that lead to recursion}

please tell me about the difference between
The maximum depth (level) of recursion is 14.
and
The maximum number of recursive calls is 2*nInternalActivities

and what dose you mean by nInternalActivities
thank you

Hello I'd like to ask if this is a valid documentation of FET or not?
http://fet.sourcearchive.com/documentation/5.14.3-1/inherits.html

please help me because I am going to use it as reference in our University graduation project thanks a lot

thanks you was right
but do make rooms have a table or make them appear to the students table do I have to add a set of students have a set of home rooms?

hello
i have generated a table after adding some building and room but rooms' timetable is always empty however I added the constraint subject has a preferred room with a weight 100%
please help me :-/

hi what is this line means in sortActivities
--------------------------------------------------------
for(int i=0; i<gt.rules.nInternalActivities; i++)
           permutation=i;
--------------------------------------------------------
i can not understand where the sort is?

hi Mr Lalescu I tried to draw this flow chart depending on your description please tell me is it a valid flow chart please show me if there are error?

ok i will try to initiate a flowchart then i hope that you help me in correcting it

hello
I want to ask if we can draw a flow chart for the algorithm  used in FET program
thanks a lot

excuse me what does this variable means internalStructureComputed

hello
please tell me  what is the function of this frequently used line
assert(----------);
example:
assert(gt.rules.initialized);