On Feb 23, 2014, at 1:46 PM, Raymond Shpeley <[log in to unmask]> wrote:
> All of these constraints are hard. Over a week the timeslots should be
> maximally filled, but in any possible combination. For example; 1, 3, 4, 5, 6, 8,
> 9, 10, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26 satisfies the constraints. And so
> does, 2, 4, 5, 6, 8, 9, 10, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26. I could go
> with a set of permutations which define all possible valid weekly timeslot
> combinations, or I could define 26 GP functions and let GP handle the
> My problem is I should be able to read in this file to create the functions. So
> far, from what I see in the example files, functions are created in code like
> terminals. I haven't seen a means to create them from a param file.
Nope. You'll have to invent your own way of reading them in. What I'd do is create a single special kind of ERC, a terminal, which at setup() time loads all the constraints in, and then at reset() time sets itself up as one of your 26 possibilities.
> I could apply the timeslot constraints in the selection process with suitable
> terminals to generate the timeslot functions, but do I do this with ADF and
> progressively remove these selection constraints?
This I can't help you with. You've got your work cut out for you.
If you're exercising the GE code, we have a new version coming in in just a bit, which will include code to convert GP trees into GE individuals (don't ask). If you're interested, contact Khaled Talukder ([log in to unmask]).