最佳解决方案，以适应多个容量袋中的物品

Question

I have been working on this problem ( https://github.com/alexpchung/File-Distribution-Planning/blob/master/README.pdf ) where I need to find an optimal solution to place the files in the node.

Here is my algorithm which I have used so far

• Say number of nodes is N.

• keep track of available file size for every node iterate through every file, it has N choices to go to (assuming file fits in etc)

• Recursively evaluate for every

Another solution which I have thought is to iterate through each and every node and do a knapsack 0/1. Unfortunately, i got struck because since the node sizes are not fixed it will be an incorrect solution.

If you have any pointers that would be great.

Thanks.

Answer 1

Maybe you can benchmark this:

• Sort two lists.(capacity,size, all increasing)

• Start from biggest file.

• Also start from biggest node.
• Check if it fits
  • true: put it in
  • false: put it to "failed" list since no bigger node exists.
• If selected(biggest) node is full, iterate next smaller node
• İterate to next smaller file.
• go back to checking step until either one of conditions true
  • all files assigned, empty nodes exist
  • all nodes full, unplaced files exist
• (*)sort only nodes on their empty spaces(empty nodes exist=true or both true)
  • duplicate node list with opposite order
    • check if "latest added file" on least "empty space"d can fit biggest "empty space"d node and if transition yields equal/balanced empty space on both
      • true: send file to that node
      • false: iterate on next "least empty space" node since that file can't fit others neighter
    • iterate both lists(and remove refined pairs from lists)
• if at least 1 files could be refined, go to (*)