theratburger
Member
I am currently trying to figure out a routine to find the most economic cutting sequence for a group of pipes of multiple lengths. I have pretty much designed it in quick basic to prove concept using a brute force tactic but was wondering if there was a common formula floating around out there for this.
Here is the scenario. I group together anywhere from 1 to 16 pieces of pipe and call it a batch. The multiple of cuts is anywhere from 1 to 6. The information I am given is the length of each piece of pipe and an acceptable minimum and maximum cut length. They are run together in parallel down a conveyor until they come to a stop that they butt up against, are clampled and then cut.
I want to find based on the length of each pipe, when cut in together as a batch, the most efficient/best bang for the buck, how many cuts and at what lengths to use to get the most overall sellable footage.
Like I said I brute forced it. I divide each pipe by each number 1 to 6, store the results and if they fall between min and max allowable, then take the number that is generated with each division that is between the allowable and divide each individual piece with it, add the good pieces together and decide on cut from there but I keep thinking there might might be some other solution. Let me know what you think.
Sorry my first post is such a big one!!
Thanks,
The Ratburger
Here is the scenario. I group together anywhere from 1 to 16 pieces of pipe and call it a batch. The multiple of cuts is anywhere from 1 to 6. The information I am given is the length of each piece of pipe and an acceptable minimum and maximum cut length. They are run together in parallel down a conveyor until they come to a stop that they butt up against, are clampled and then cut.
I want to find based on the length of each pipe, when cut in together as a batch, the most efficient/best bang for the buck, how many cuts and at what lengths to use to get the most overall sellable footage.
Like I said I brute forced it. I divide each pipe by each number 1 to 6, store the results and if they fall between min and max allowable, then take the number that is generated with each division that is between the allowable and divide each individual piece with it, add the good pieces together and decide on cut from there but I keep thinking there might might be some other solution. Let me know what you think.
Sorry my first post is such a big one!!
Thanks,
The Ratburger