OmniOptimizer A Procedure for Single and Multiobjective全方位优化程序的单和多目标.pptVIP

Multi-objective Optimization of Two-Dimensional Sheet Cutting Problem using Genetic Algorithms Santosh Tiwari Sheet Cutting Frameworks Guillotine Cutting – (cutting from edge to edge, Detached parts treated as separate entities) – Applicable to metallic sheets Non-guillotine Cutting – (cutting from edge to edge not mandatory, Detached parts treated as same entity) – Applicable to piles of paper Guillotine cutting is of practical importance to industry Sheet Cutting formulated as an optimization problem for Industry Optimization Problem Objective 1: Minimize the length of mother-sheet required (Trim loss) Objective 2: Minimize the number of cuts required (Tool life) Non-guillotine Cutting: Both real and binary formulations Guillotine Cutting: Only binary formulation Binary formulation greatly outperforms real variable formulation Real variable formulation Representation of an Individual Let number of parts be ‘n’ Length of gene of real variables = ‘2n’ (x1, y1, x2, y2, .., .., .., ..) Length of gene of binary variables = ‘n’ (‘0’, ‘1’, ., ., ., .) Objective Functions Objective 1: Objective 2: (Non-guillotine cutting) Objective 2 contd… Number of cuts (Non-guillotine cutting) 1. Number of cuts = 4*n. 2. For every rectangle ‘i’ do the following 3. For every edge of rectangle ‘i’ that lies on the boundary decrease the number of cuts by one and mark that edge using a flag. 4. For every rectangle ‘j’ from ‘i+1’ to ‘n’ do the following 5. For every unmarked edge of rectangle ‘i’ compare it with all the (suitable) edges of rectangle ‘j’ to find out if they are aligned. 6. If they are aligned then find out if they are touching or not, if they are touching, then decrease the number of cuts by one and mark the corresponding edge of rectangle ‘j’. 7. If the rectangles are not touching then find out the line joining the aligning edges and for every rectangle ‘k’ ≠ ‘i’ and ≠ ‘j’ find out whether the line and rectangle ‘k’ interfere or not. If none