Skip to main content

Hi, i have a question which i think should be solvable with fme but i don't know the right transformer(s) to get the solution.

Maxithlon

 

 

I have this table with points and id's. I would like to know the best way to calculate the highest score (1+2+3) but without using one id twice.

Do you have any id how to solve this?

 

***

 

Some extra info:

 

Maxithlon 2

Calculation 1 is not valid, here the sheet pics just the highest values (but picks A twice (not allowed)

 

Calculation 2 Here it picks the value of A (10) because it is the highest value in the table, but overall it is not the highest accumulation of points.

 

Calculation 3 is what i am looking for, Here it picks the value's which calculates the heighest overall points for the table

 

Jan

Hi @jan_van_prooije​ 

Did you try to use the transformer StatisticCalculator?

 

Thanks in Advance,

Danilo


Hi @jan_van_prooije​ 

Did you try to use the transformer StatisticCalculator?

 

Thanks in Advance,

Danilo

Thanks for the advice! i tried to use it, but i'm not getting the results i want. (added some more info in the question).


Perhaps https://hub.safe.com/publishers/pacific-spatial-solutions/transformers/listsubsetenumerator could help solving this?

(I'm not sure exactly HOW though).


It's not actually something that's easily solvable in FME in my opinion

 

You could use an inlinequerier to create all possible permutations then add up the scores and sort and keep the highest. If you have lots of data then python is probably going to be a better option

Capture

 

 

 


It's not actually something that's easily solvable in FME in my opinion

 

You could use an inlinequerier to create all possible permutations then add up the scores and sort and keep the highest. If you have lots of data then python is probably going to be a better option

Capture

 

 

 

Thanks a lot! The InlineQuerier, didn't know that transformer😅


Reply