Optimization

Optimization

*Add a new Packing Algorithm called Maximal Rectangles Best Area Fit
*Optimization on Simulate Annealing Algorithm by choosing Best out of ten for each iteration.

Run parameters

• Absolute path to context file (like in test examples)
• Number of iteration of the algorithm.
• 1= Guillotine Sort Best Area Fit , 2= Maximal Rectangles Best Area Fit

Output

Output directory name : OUTPUT
Generate Log and images of different patterns.

New Packing Algorithm

New Packing Algorithm

Run parameters

• Absolute path to context file (like in test examples)
• Number of iteration of the algorithm.

Output

Output directory name : OUTPUT
Generate Log and images of different patterns.

Fixed : Image Generation

Fixed Guillotine Packing

Run parameters

• Absolute path to context file (like in test examples)
• Number of iteration of the algorithm.

Output

Output directory name : OUTPUT
Generate Log and images of different patterns.

Fixed Guillotine Packing

Fixed Guillotine Packing

Run parameters

• Absolute path to context file (like in test examples)
• Number of iteration of the algorithm.

Output

Output directory name : OUTPUT
Generate Log and images of different patterns.

First Working Solution

First working Solution for CuttingStock Problem

Run parameters

• Absolute path to context file (like in test examples)
• Number of iteration of the algorithm.