Have multiple points on a straight line (adjacent distance may often different but can make) field measurements, the need to use multiple profiles (a length specification) covered the whole line, to allow a equal parts between two adjacent regions (such as 5 portions of 2.. 3.. 4 area, close to the point 1.. 5 decorate area of danger can't butt) joint, short took traditional case, long cuts, but now I need to reduce the cutting and docking, reduce the workload and material loss) should adopt what kind of new algorithm or try to calculate the optimal solution (joint compliance case cutting and minimum)?

CodePudding user response:

Linear programming, the optimal solution to iterate through all the situation,
Feel there should be two direction, profile priority, priority, or joint is the high cost of costs (the cost of materials, workload),
The final cost may draw an intermediate value,


Iterate through all the routes, cloth cut profiles, until more cloth a route, more than

And then according to the residual length from long to short,
Traverse line, until all the line fill out
Judgment to be distributed library [there is always 1. The whole profile] whether there is a suitable material [here is likely to set the parameters, more than the percentage (or length), direct use, remaining discarded, avoid], residual volume cutting by route, the rest of the a in the library to be distributed
For distribution in the library than the entire length of profiles, retrieval matches the range line, such as accuracy, direct use,



A train of thought, don't know what wrong,