120 likes | 227 Vues
This text explores the application of the First-Fit Decreasing algorithm in solving the bin packing problem. In this algorithm, we first sort the blocks into descending order based on their sizes. Starting from the largest block, we then use the First-Fit approach to allocate the blocks into bins. The process involves iterating through the blocks and filling the bins until all blocks are accommodated, resulting in the effective use of space, ultimately packing the items into five bins.
E N D
Bin PackingFirst fit decreasing algorithm A B C D E F With the first fit decreasing algorithm we sort the blocks into descending order first. 6 5 4 3 3 3 2 2 1
Bin PackingFirst fit decreasing algorithm A B C D E F Now we use the first fit algorithm 6 5 4 3 3 3 2 2 1
Bin PackingFirst fit decreasing algorithm 6 A B C D E F Now we use the first fit algorithm 5 4 3 3 3 2 2 1
5 Bin PackingFirst fit decreasing algorithm 6 5 A B C D E F Now we use the first fit algorithm 4 3 3 3 2 2 1
4 Bin PackingFirst fit decreasing algorithm 4 6 5 4 A B C D E F Now we use the first fit algorithm 3 3 3 2 2 1
Bin PackingFirst fit decreasing algorithm 3 3 3 6 5 4 3 A B C D E F Now we use the first fit algorithm 3 3 2 2 1
Bin PackingFirst fit decreasing algorithm 3 3 3 6 3 5 4 3 A B C D E F Now we use the first fit algorithm 3 2 2 1
Bin PackingFirst fit decreasing algorithm 3 3 3 3 6 3 5 4 3 3 A B C D E F Now we use the first fit algorithm 2 2 1
Bin PackingFirst fit decreasing algorithm 2 2 6 2 3 5 4 3 3 A B C D E F Now we use the first fit algorithm 2 1
Bin PackingFirst fit decreasing algorithm 2 2 2 2 6 2 3 5 2 4 3 3 A B C D E F Now we use the first fit algorithm 1
Bin PackingFirst fit decreasing algorithm 1 6 1 2 3 5 2 4 3 3 A B C D E F Now we use the first fit algorithm We have packed them into 5 bins.