Generates optimised locations to cut a set of custom-length aluminium extrusions from a stock of extrusion bars. The program will also generate A4 cut templates that can be placed on the extrusion to guide cuts.
I wrote a basic python script to run the best-fit-decreasing bin packing algorithm on each cut on all bars. Since the algorithm operates on the assumption that there are infinite bins and that all bins are equal length, I made it so it ran with every permutation of bar length in the bar list, and removed the result if any errors occurred.
Time to implement it into TypeScript and get the web demo done!
Log in to leave a comment
I set up a Svelte project and started work on a proof of concept for the packing algorithm I’d need to save as many bars as possible.
My idea was to figure out the maximum amount of potential cuts could be in 1 bar, and to place them into a bar. Attached is my stupid comment ramblings (unfortunately in a code editor, sorry) of my expected results.
Then my friend told me an algorithm for this already exists… it’s called first-fit-decreasing bin packing, which is a online (takes a serial input) algorithm to figure out a fit for all cuts that saves on bins (bars). I’m planning on running it multiple times with different orders and finding the best fit out of them.
I’ll probably delete the proof of concept and stick with bin-packing algorithms.
Log in to leave a comment