Hello! My problem is relatively simple, but I can't find a way to make it. I have 14 parts of type A and 14 parts of type B and their weights. I need to group they in 7 sets containing 2 of each (each part can be used only once). I want to group in two different ways: Sort the parts so Set1 is in total the lightest one, Set2 the second lightest one and so on; Sort the parts so all sets are as close as possible in weight. Would mean targeting the smallest StdDev of the total weight of each set; Anyone can help? Regards,

Optimization Problem with Fixed Discreet Variables

Flatfoot

2020 2 月 26

1 回答

回答採用済み

5 ビュー (30 日間)

0 投票

Hello!

My problem is relatively simple, but I can't find a way to make it.

I have 14 parts of type A and 14 parts of type B and their weights. I need to group they in 7 sets containing 2 of each (each part can be used only once). I want to group in two different ways:

Sort the parts so Set1 is in total the lightest one, Set2 the second lightest one and so on;
Sort the parts so all sets are as close as possible in weight. Would mean targeting the smallest StdDev of the total weight of each set;

Anyone can help?

Regards,