Print Page - ALgorithm recursive Swaping

Title: ALgorithm recursive Swaping
Post by: HamzaHachimi on May 19, 2015, 05:25:35 PM

Hello !
input :
times[max_activities]
rooms[max_activities]
suppose that you placing Ai in times[] , you directly placing Ai in rooms[] .
or affter the last choice of timeSlot, you choose room
thanks.

Title: Re: ALgorithm recursive Swaping
Post by: Volker Dirr on May 19, 2015, 05:41:15 PM

see generate.cpp line 8973 (FET 5.27.2 - "getRoom"). So first of all all time constraints are checked. Only if it is possible to place time constraint it try room constraints.
Maybe Liviu will answer more detailed as soon as he is back.

Title: Re: ALgorithm recursive Swaping
Post by: Liviu Lalescu on May 24, 2015, 07:53:59 PM

Sorry for the delayed answer. I was away from my computer.

I choose firstly the times[MAX_ACTIVITIES] for an activity. Then for this time slot I choose a possible rooms[MAX_ACTIVITIES].

FET Forum

FET Support (English) => Programming Help => Topic started by: HamzaHachimi on May 19, 2015, 05:25:35 PM