Questions as follows:

1, each steel pipe raw material is 6 meters long and raw materials
2, need finished steel pipe length between 0.12 m to 2 m, need 2300 root, the root of the number can be seen as the identified conditions
3, can end waste remaining after cut, the remaining end waste as short as possible
4, finished steel pipe can't splice
Objective
1, using the algorithm, to distribute the length of the finished steel pipe need to 6 meters long finished steel pipe, make every 6 meters of steel pipe produced by waste, at least,



Mathematical problem description
Chosen from a finite set, m element, make m element and close to 6 meters, select remove elements from the collection, until no element in the set position,



Whether can use combination algorithm, and then calculation is close to 6 meters length,

Great god can you give the thinking of a solution, or what kind of algorithm and the combination algorithm

CodePudding user response:

Didn't understand demand, according to the description are cut into 1 meter, there is no waste,
Whether your 2300 and length is known

CodePudding user response:

Some thought for a moment, is known to have 2300 steel conduit, and know that how long is each of the 2300 steel pipe,

CodePudding user response:

If according to my understanding of the length of the 2300 steel pipe is a known this major premise, can use genetic algorithm to calculate, 2300 tube number 1-2300, and then generated using natural encoding gene, according to the gene sequence of generated cut pipe, namely a few pipe after accumulation under the coupled with a just over six meters when cut open (not a pipe), can also get waste, length, evaluation function with the amount of waste, crossover and mutation in traditional way, this should be easy to achieve using genetic algorithm, the effect should be also very good,

CodePudding user response:

Can use greedy algorithm, each time to find the most close to the combination of 6 meters to eliminate,

CodePudding user response:

To be done by genetic algorithm, randomly generated a set of number, utilization ratio to 93%, computing time about 30 seconds

CodePudding user response:

Knapsack problem, a greedy method,

CodePudding user response:

Typical knapsack problem, search,

CodePudding user response:

The group manager to solve?

CodePudding user response:

One dimension knapsack problem, is not difficult,

CodePudding user response:

Typical cutting stock problem, integer programming model is established to solve directly, large-scale try column generation algorithm, a small branch and bound method and cutting plane method can,