Dtjytyk

How to chmod files that have a specific set of permissions

Effect of "wrong" driver with slightly long RS-485 stubs

Should we avoid writing fiction about historical events without extensive research?

Remove object from array based on array of some property of that object

Difference between 'stomach' and 'uterus'

How to mitigate "bandwagon attacking" from players?

Is there a full canon version of Tyrion's jackass/honeycomb joke?

Is there a way to find out the age of climbing ropes?

Label layer as symbol colors with QGIS 3

Are there other characters in the Star Wars universe who had damaged bodies and needed to wear an outfit like Darth Vader?

How do we objectively assess if a dialogue sounds unnatural or cringy?

Can a space-faring robot still function over a billion years?

Why should we still use form element in html?

Where is the fallacy here?

3.5% Interest Student Loan or use all of my savings on Tuition?

Are Wave equations equivalent to Maxwell equations?

Why are special aircraft used for the carriers in the United States Navy?

Why is it "take a leak?"

Did Amazon pay $0 in taxes last year?

Being asked to review a paper in conference one has submitted to

Why won't the strings command stop?

What kind of inflection is occuring in passive vb + かかった?

Script that counts quarters, dimes, nickels, and pennies

Misplaced tyre lever - alternatives?

Bin packing with variable bin sizes, initial state and “move penalty”?

Keeping consistency in subjective rankingAllocate items to an unknown number of resourcesCombinatorics and bin packingRandomized packing of itemsProbability of a number of weighted items being allocated to the same binEqual probabilities in each count in stars and bars$n$ distinguishable items into $b$ distinguishable bins (there's more to elaborate…)Knapsack or bin packing problem?Number of ways to assign $n$ objects into $k$ bins, each of a given sizeNP-hardness of bin packing problem for fixed bin size

0

$begingroup$

I'm dealing with a variation of the bin packing problem:

• Variable sized bins


• Variable number of bins


• Currently 1D, might become 2D


• There is a defined initial state - items have been already distributed to bins


• There is a penalty for each move of an item to another bin


• Goal: The number of used bins should be reduced as much as possible

I'm thinking this boils down to an combinatorics problem optimizing a target function with the number of used bins in the final state and the moves needed to reach that state, each appropriately weighted.

I didn't find any resource dealing with this particular problem. Especially the penalty seems an unknown variant.

Could you point me in the right direction, or give some advice?

Thanks,
Greg

combinatorics optimization

share|cite|improve this question

asked 5 hours ago

user3240855user3240855

1

New contributor

user3240855 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

I'm dealing with a variation of the bin packing problem:

• Variable sized bins


• Variable number of bins


• Currently 1D, might become 2D


• There is a defined initial state - items have been already distributed to bins


• There is a penalty for each move of an item to another bin


• Goal: The number of used bins should be reduced as much as possible

I'm thinking this boils down to an combinatorics problem optimizing a target function with the number of used bins in the final state and the moves needed to reach that state, each appropriately weighted.

I didn't find any resource dealing with this particular problem. Especially the penalty seems an unknown variant.

Could you point me in the right direction, or give some advice?

Thanks,
Greg

combinatorics optimization

share|cite|improve this question

asked 5 hours ago

user3240855user3240855

1

New contributor

user3240855 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

I'm dealing with a variation of the bin packing problem:

• Variable sized bins


• Variable number of bins


• Currently 1D, might become 2D


• There is a defined initial state - items have been already distributed to bins


• There is a penalty for each move of an item to another bin


• Goal: The number of used bins should be reduced as much as possible

I'm thinking this boils down to an combinatorics problem optimizing a target function with the number of used bins in the final state and the moves needed to reach that state, each appropriately weighted.

I didn't find any resource dealing with this particular problem. Especially the penalty seems an unknown variant.

Could you point me in the right direction, or give some advice?

Thanks,
Greg

combinatorics optimization

share|cite|improve this question

asked 5 hours ago

user3240855user3240855

1

New contributor

user3240855 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

share|cite|improve this question

asked 5 hours ago

user3240855user3240855

1

New contributor

user3240855 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

asked 5 hours ago

user3240855user3240855

1

New contributor

user3240855 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 hours ago

user3240855user3240855

1

New contributor

user3240855 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 hours ago

user3240855user3240855

1