According to a one-dimensional multi-objective profile cutting machine tool and based on the principle of 0-1 knapsack algorithm and MATLAB software programming, the length of the two kinds of type and a limited number of profiles are processed to solve the maximum utilization of the profile cutting scheme, and optimize the programming algorithm for solving profile maximum cutting length, from two aspects of time complexity and space complexity analysis and comparison. Firstly, the principle of the 0-1 knapsack algorithm is used to design the algorithm to get the maximum cutting length of the corresponding two lengths. Secondly, according to the number of profiles, cutting margin and other parameters are used to select the length type of profiles. Then, the cutting size sequence of each selected profile is introduced, and the length type, quantity, cutting size sequence group, total cutting margin, profile utilization rate, and other parameters are calculated when the processing contract is completed. Finally, based on the recursive formula of jump point sequence, the algorithm is optimized to eliminate the restriction of 0-1 knapsack algorithm by integer constraints, reduce the time and space complexity of the algorithm, reduce the calculation amount and storage space of the algorithm, and improve the efficiency of the programming algorithm.
Read full abstract