2d Individual

[Christian]

Hi there,

I'm new to DEAP and I have a problem what is based on an individual  n X 5 array with binary 0/1 values and only one is allowed to be 1. 

Simple example:

m = np.array([[0,0,0,0,1], [1,0,0,0,0], [0,0,0,0,0]])

As a template I use: https://github.com/PacktPublishing/Hands-On-Genetic-Algorithms-with-Python/blob/master/Chapter04/knapsack.py

My getValue function calculates the fitness with constrain penalties based

on m. The mutation with mutFlipBit will not work because of the 2d challenge and results in ValueError: The truth value of an array with more than one element is ambiguous. Use a.any() or a.all()

Using my own mutation function what considers the 2d problem is running into 

an exception: too many values to unpack  in varAnd / eaSimple.

Question: Shall I express my individual as 1d array, what gives me a little headache according to the fitness function or is it possible with another simple modification?

Thanks in advance,

Christian

 

[Christian]

I changed the individual to integer 1-5 values and it's fine . Anyway might be interesting how or if the 2d solution works in case  I haven't excludability.

[Fadlu Hasen]

Im also new for DEAP who can clearly describe about identical fitness? I need your help on this area 

--
You received this message because you are subscribed to the Google Groups "deap-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to deap-users+...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/deap-users/8938873c-69c2-40c9-acc6-fe9f3571c507n%40googlegroups.com.

[Christian]

Can you please elaborate your probably and maybe I can help?

[Christian]

Can you please elaborate your problem and maybe I can help?