Hello , can i have help for all those familiar with using gravitational search algorithm
im using it on 01 multidimensional knapsack,
any ideas how im gonna deal with calculating the euclidian distance between two agents?

I have some idea like to get the distance, of course i would calculate their differences but it can always be 0 or 1
so e.g.
agent 1 0111010
agent 2 1011010
distance 1100010

so i have to use it in the following formula, this is really vital since distance is needed to find
velocity, then acceleration, then the next position of the agent (which is basically the another solution agent)..
so shall i add it up, the total difference? if so how.. ? by simply really add up like in exmple there is 3?:confused:

i dont know if this is a good idea.. help please... any suggestions?