A method, system and device for scheduling the production of color spraying of automobile parts based on 0-1 planning

Through the method based on 0-1 planning, a single-objective optimization model was established, which solved the problems of difficult to obtain the optimal solution, low model accuracy and slow solution in the production scheduling of automobile parts, and achieved efficient and accurate production scheduling design.

CN114723105BActive Publication Date: 2024-12-03CHONGQING UNIV OF TECH +1
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202210242862.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-11
Publication Date
2024-12-03
Estimated Expiration
2042-03-11

AI Technical Summary

Technical Problem

In the existing production schedule design of automobile spare parts, it is difficult to find the optimal solution, the model accuracy is low and the solution speed is slow, mainly due to the neglect of a large number of constraints and the inefficiency of the global search algorithm.

Method used

Using a 0-1 planning method, select the most basic situation of the event as the decision variable, establish appropriate intermediate variables and objective functions, establish constraint equations based on conditional limitations, and build a single-objective optimization model to find the optimal solution and improve it. Model accuracy.

Benefits of technology

It realizes the rapid solution of high-precision production schedule, which is suitable for various constraints, not only for color spray production schedule, but also for other spare parts production schedules, improving the universality and efficiency of the model.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114723105B_ABST
    Figure CN114723105B_ABST
Patent Text Reader

Abstract

The present invention discloses a method for scheduling the production of spray painting of automobile parts based on 0-1 programming, including: obtaining spray painting equipment and spray painting color data, preprocessing the acquired data; establishing decision variables and intermediate variables; establishing constraint conditions; establishing an objective function and a single-objective optimization model; solving the single-objective optimization model. The method selects the most basic situation of the event as the decision variable, and establishes appropriate intermediate variables to meet each condition. The decision variables and intermediate variables serve as the basis of the model, establish an objective function according to actual needs, establish a constraint equation according to conditional restrictions, and establish a single-objective optimization model based on 0-1 programming, which can find the optimal solution and has high model accuracy.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of intelligent manufacturing technology, and in particular to a method, system and device for designing automobile parts color matching production scheduling based on 0-1 planning. Background Art

[0002] There are many auto parts manufacturers in my country, and it is extremely important to study the production scheduling design problem in the auto parts manufacturing industry. Parts manufacturers need to formulate better production plans based on their own production needs, combined with actual production conditions, and fully consider various constraints to achieve the goal of minimizing resource waste. To achieve this goal, various models and algorithms have been developed.

[0003] At present, the research on automobile spare parts production scheduling design problems mainly focuses on two aspects: intelligent algorithms and mathematical models. For example, based on intelligent algorithms to solve automobile spare parts production scheduling problems, according to actual needs, the objective function is divided into two layers, that is, the outer objective function represents the optimal solution for unsatisfied parts, and the inner objective function represents the optimal solution for color change, so that the model can complete the search for the optimal solution to the target optimization problem. The method based on mathematical models includes the use of Hamiltonian paths and loops to separately formulate automobile production scheduling tasks. This method can arrange the order of colors through the Hamiltonian graph model, and then combine it with manual work to finally find the optimal solution faster. At present, the following problems still exist in the production scheduling problem of automobile parts:

[0004] (1) The optimal solution is not easy to find

[0005] With the emergence of intelligent algorithms, global search algorithms can theoretically find an optimal solution. However, due to the limitations of actual constraints, the optimal solution is often not easy to find based on the established objective function.

[0006] (2) Low model accuracy

[0007] At present, some model algorithms ignore a large number of constraints in order to obtain a relatively good result. The model accuracy established in this way is low, and the result obtained can meet some conditions and the result is better, but it is not the best solution.

[0008] (3) Slow solution speed

[0009] At present, some algorithms try to search all possible situations in order to obtain the best result, which leads to slow solution speed and low efficiency of the model. Summary of the invention

[0010] In order to solve the deficiencies in the prior art, the present invention provides a method for designing automobile spare parts production scheduling based on 0-1 programming. The method selects the most basic situation of an event as a decision variable, establishes appropriate intermediate variables to meet various conditions, uses the decision variables and the intermediate variables as the basis of the model, establishes an objective function according to actual needs, establishes constraint equations according to conditional restrictions, and establishes a single-objective optimization model based on 0-1 programming. The model can obtain the optimal solution and has high model accuracy.

[0011] According to one aspect of the present invention, there is provided a method for scheduling the production of automobile parts spraying based on 0-1 programming, comprising:

[0012] Acquire the spraying equipment and spraying color data, and pre-process the acquired data;

[0013] Establish decision variables and intermediate variables;

[0014] Establish constraints;

[0015] Establish objective function and single objective optimization model;

[0016] Solve single-objective optimization models.

[0017] There are j0 kinds of topcoat colors and only one primer color. The i0 slides of the conveyor belt are numbered from 1 to i0 in sequence; different topcoat colors are numbered from 1 to j0; when it is the primer color, that is, no topcoat is sprayed, let j=0; different types of parts are numbered from 1 to k0; the brackets at different positions on the same slide are numbered from 1 to l0.

[0018] The sled numbered i is painted with color j, and the kth part is placed on the bracket at the lth position, then let X ijkl =1, otherwise X ijkl =0, that is:

[0019]

[0020] Sled-Color-Part Intermediate Variable Y ijk , if the sled numbered i is painted with color j and part k is placed on the sled, then let Y ijk =1, otherwise Y ijk =0, that is:

[0021]

[0022] and

[0023] Sled-color intermediate variable Z ij , if the i-th sled is sprayed with the j-th color, then let Z ij =1, otherwise Zij =0, that is:

[0024]

[0025] and

[0026] Sled-Part Intermediate Variable M ik , if part k is placed on the i-th sled, then let M ik =1, otherwise M ik =0, that is:

[0027]

[0028] and

[0029] The constraints include self-constraints, demand constraints, color change constraints and parts placement constraints.

[0030] The self-constraints are:

[0031]

[0032]

[0033] in, It means that only one of the k0 types of parts can be placed on any sled;

[0034] It means that only one of the j0 topcoat colors or the primer color can be placed on any sled;

[0035] The demand constraint is:

[0036]

[0037] In the formula, S jk represents the required quantity of part k to be painted with color j. The equation indicates that for any combination of color j and part k, the required quantity of the part to be painted with the same color must be met on all brackets of all sleds.

[0038] The color change constraints are:

[0039]

[0040] In the formula, because That is, in any color change process, the slider before and after the color change can only appear Z i,j (j=1,2,…,j0), in which case Z i,j =1, in other cases Z i,j =0;

[0041] The parts placement constraints are:

[0042]

[0043] because That is, only M can appear on any sled. i,k (k=1,2,…,k0), in which case M i,k =1, in other cases M i,k =0.

[0044] The objective function is:

[0045]

[0046] In the formula, Z i,0 Represents Z i,j (j=0), i.e., all skids sprayed with primer;

[0047] The single-objective optimization model is:

[0048]

[0049]

[0050] According to another aspect of the present invention, there is provided an automobile parts spraying production scheduling system based on 0-1 planning, comprising:

[0051] A data preprocessing module is configured to preprocess the acquired inkjet equipment and inkjet color data;

[0052] A variable establishment module, configured to establish decision variables and intermediate variables;

[0053] A constraint condition establishment module, configured to establish constraint conditions;

[0054] An optimization module configured to establish an objective function and a single-objective optimization model;

[0055] A solver module is configured to solve a single objective optimization model.

[0056] The constraint condition establishment module includes self-constraints, demand quantity constraints, color change constraints and parts placement constraints.

[0057] According to another aspect of the present invention, there is provided a device comprising:

[0058] one or more processors;

[0059] a memory for storing one or more programs,

[0060] When the one or more programs are executed by the one or more processors, the one or more processors are enabled to perform any of the above methods.

[0061] In order to achieve the above object, the present invention is implemented through the following technical solutions:

[0062] Compared with the prior art, the beneficial effects of the present invention are:

[0063] 1. The model established by the present invention can solve common production scheduling problems.

[0064] 2. For problems with some special constraints, such as when adjacent schedules have constraints, establishing a constraint matrix can also provide good constraints.

[0065] 3. The method adopted by the present invention has fast solution speed and high model accuracy, and is also highly applicable to similar problems.

[0066] 4. The present invention can be used not only for the production scheduling method of color spraying of spare parts, but also for the production scheduling of other spare parts. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] Attached Figure 1 It is a flow chart of the present invention;

[0068] Attached Figure 2 It is a schematic diagram of the spraying process of automobile parts;

[0069] Attached Figure 3 It is a structural schematic diagram of the device of the present invention. DETAILED DESCRIPTION

[0070] The present invention will be further described below in conjunction with specific embodiments. It should be understood that these embodiments are only used to illustrate the present invention and are not intended to limit the scope of the present invention. In addition, it should be understood that after reading the content taught by the present invention, those skilled in the art can make various changes or modifications to the present invention, and these equivalent forms fall within the scope limited by the application equally.

[0071] This embodiment provides an automobile parts spraying production scheduling system based on 0-1 planning, including a data preprocessing module configured to preprocess the acquired spraying equipment and spraying color data;

[0072] A variable establishment module, configured to establish decision variables and intermediate variables;

[0073] A constraint condition establishment module, configured to establish constraint conditions;

[0074] An optimization module configured to establish an objective function and a single-objective optimization model;

[0075] A solver module is configured to solve a single objective optimization model.

[0076] This embodiment provides a method for scheduling the production of automobile parts spraying based on 0-1 planning, including:

[0077] Step 1: Obtain the inkjet equipment and inkjet color data, and pre-process the acquired data

[0078] Auto parts manufacturers generally produce parts through processes such as suction, injection molding, spraying, warehousing and assembly. After the injection molding is completed, the spraying work will be carried out on the conveyor belt. The conveyor belt track is equipped with i0 slides, each slide is equipped with l0 identical brackets corresponding to the parts one by one, and the brackets can be disassembled and replaced, that is, one slide can be filled with 1-l0 parts of the same type. Since the brackets correspond to the parts one by one, when the number of brackets is fixed, there is an upper limit on the number of parts placed in a circle of production plan. After the corresponding parts are placed on the brackets, the topcoat will be sprayed. Before the topcoat is sprayed, all parts are primer color. If two slides with adjacent numbers on the conveyor belt track need to be sprayed with different topcoat colors, it will involve "color change", and a slide needs to be inserted between the adjacent slides to place the primer parts as a transition slide. There is no need to consider the type of primer parts here. At present, there are j0 colors of all topcoats and only one color of primer. Therefore, the i0 slides of the conveyor belt are numbered in order (1, 2, 3, ..., i0), and the different topcoat colors are numbered 1, 2, 3, ..., j0. When it is the primer color, that is, no topcoat is sprayed, let j = 0. Different types of parts are numbered 1, 2, 3, ..., k0. The brackets at different positions on the same slide are numbered 1, 2, 3, ..., l0.

[0079] Step 2: Establish decision variables and intermediate variables

[0080] First, we introduce the decision variable. If the sled numbered i is sprayed with color j and the kth part is placed on the bracket at the lth position, then let X ijkl =1, otherwise X ijkl =0, specifically expressed as follows:

[0081]

[0082] In the process of model building, variables are needed to represent the relationship between the sled, color and parts. Therefore, the following sled-color-part intermediate variable Y is defined: ijk If the sled numbered i is painted with color j and part k is placed on the sled, then let Y ijk =1, otherwise Y ijk =0, specifically expressed as follows:

[0083]

[0084] The above slider-color-part intermediate variable Y ijk In need of That is, only one type of parts can be placed on any sled. In addition, the equation equation This means that as long as you plan to place the kth part on the sled numbered i and spray the corresponding jth color, you must use more than one bracket, because if the number of brackets used is 0, it means that there are no parts on the sled, which obviously does not meet the actual requirements.

[0085] In the process of model building, it is necessary to express the relationship between the slider and the color, so the slider-color intermediate variable Z is introduced ij If the i-th sled is sprayed with the j-th color, then let Z ij =1, otherwise Z ij =0.

[0086]

[0087] In the above formula, the condition needs to be met This condition means that after the jth color is sprayed on the i-th sled, at least one bracket is used and the corresponding part is placed on the bracket. The constraint condition corresponding to the intermediate variable of sled-color is This constraint means that only one color (topcoat or primer) can be sprayed on the same sled.

[0088] In the process of model building, it is necessary to express the relationship between the slide and the parts, so the slide-part intermediate variable M is introduced. ik , if part k is placed on the i-th sled, then let M ik =1, otherwise M ik =0.

[0089]

[0090] The constraints corresponding to the intermediate variables of the sled and parts are: That is, only the same kind of parts can be placed on the same sled.

[0091] Step 3: Establishing constraints

[0092] (1) Limitations of personal conditions

[0093] Based on the above analysis, during the process of spraying the topcoat, only the same color can be sprayed on the same sled, and only the same type of parts can be placed on it. The parts and brackets are one-to-one corresponding, so the following constraints are obtained:

[0094]

[0095]

[0096] In the above formula, It means that only one of the k0 parts can be placed on any sled. It means that only one of the j0 topcoat colors or the primer color can be placed on any sled.

[0097] (2) Demand Constraints

[0098] In actual production scheduling, any part has a certain demand under any paint color, so it is necessary to establish a demand constraint equation:

[0099]

[0100] In the formula, S jk represents the demand quantity of part k painted with color j. The equation shows that for any combination of color j and part k, the demand quantity of the part painted with the color must be met on all brackets of all sleds.

[0101] (3) Color change constraints

[0102] During the spraying process, if the parts on the two adjacent front and rear sleds need to be sprayed with different topcoat colors, it means that a "color change" has occurred, and the color change requires spraying the primer color as a transition. Parts sprayed with primer color can only be used as spare parts, which is a waste of resources. At the same time, there are certain restrictions on the topcoat color before and after the color change, that is, the topcoat color cannot be changed at will after the primer color. According to the color change requirements, the color change constraint matrix B is obtained. B is a j0×j0 dimensional matrix composed of 0 and 1, and the specific meaning is: when the i-th sled is sprayed with primer color, that is, the topcoat colors of the i-1th sled and the i+1th sled are different, and a color change has occurred. If the i-1th sled is sprayed with j color, the i+1th sled can be sprayed with j' color, then the element of the corresponding position of the matrix B is 1. Otherwise it is 0. Therefore, the following constraint equation can be obtained:

[0103]

[0104] In the formula, because That is, in any color change process, the slider before and after the color change can only appear Z i,j (j=1,2,…,j0), in which case Z i,j =1, in other cases Z i,j = 0. So Z i =(Z i,1 ,Z i,2 ,…,Z i,j0) is a unit vector consisting of 0 and 1. The above constraint equation indicates that every element in the control matrix A is less than or equal to every element in the color change constraint matrix B, and the elements in A and B are both composed of 0 and 1.

[0105] (4) Parts placement constraints

[0106] When manufacturing the spraying plan, there are certain restrictions on the parts placed on the front and rear sleds. Some parts placed together will cause damage to the parts. According to the restrictions on the order of parts placement. According to the part placement requirements, the part placement constraint matrix F is obtained. F is a k0×k0 dimensional matrix composed of 0 and 1. The specific meaning is: when the i-th sled places part k, the i+1-th sled can place part k', then the element of the corresponding position of the matrix F is 1, otherwise it is 0, so the following constraint equation can be obtained:

[0107]

[0108] because That is, only M can appear on any sled. i,k (k=1,2,…,k0), in which case M i,k =1, in other cases M i,k = 0. So is a unit vector composed of 0 and 1. The above constraint equation indicates that each element in the control matrix E is less than or equal to each element in the part placement constraint matrix F, and the elements in E and F are both composed of 0 and 1.

[0109] Step 4: Establish objective function and single objective optimization model

[0110] When an auto parts manufacturer makes a production schedule, if different colors of topcoat are sprayed, primer parts are needed as a transition. Primer parts cannot be used and can only be used as spare parts. In order to reduce resource waste, the number of color changes needs to be reduced as much as possible. In other words, the number of slides with primers should be as small as possible. That is, the objective function is:

[0111]

[0112] In the formula, Z i,0 Represents Z i,j (j=0), i.e. all the skids sprayed with primer.

[0113] Combining the various constraints above, we get the single-objective optimization model:

[0114]

[0115]

[0116] The above is the single-objective optimization model for automobile parts production scheduling design based on 0-1 programming.

[0117] Step 5: Use genetic algorithm or neural network algorithm to solve the single-objective optimization model, wherein genetic algorithm and neural network algorithm are both existing technologies and will not be described in detail here.

[0118] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments:

[0119] like Figure 1 As shown, the present invention proposes a method for scheduling the production of automobile parts spraying based on 0-1 programming, comprising:

[0120] Step 1: Obtain the inkjet equipment and inkjet color data, and pre-process the acquired data

[0121] Auto parts manufacturers generally produce parts through processes such as suction, injection molding, spraying, warehousing and assembly. After injection molding, spraying will be carried out on the conveyor belt. The conveyor belt track is equipped with 303 sleds, each of which is equipped with 6 identical brackets that correspond to the parts one by one, and the brackets can be disassembled and replaced, that is, one sled can be filled with 1-6 parts of the same type. Since the brackets correspond to the parts one by one, there is an upper limit to the number of a certain type of parts placed in a production plan in a circle when the number of brackets is fixed. After the corresponding parts are placed on the brackets, the topcoat will be sprayed. Before the topcoat is sprayed, all parts are primer color. If two adjacent sleds on the conveyor belt track need to be sprayed with different topcoat colors, it will involve "color change", and a sled needs to be inserted between the adjacent sleds to place the primer parts as a transition sled. There is no need to consider the type of primer parts here. At present, there are 10 colors for all topcoats and only one color for primer. Therefore, the 303 slides of the conveyor belt are numbered in clockwise order (1, 2, 3, ..., 303), and the 10 different topcoat colors are numbered 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, respectively, to obtain: Ruby Red (1), Sapphire Blue (2), Brilliant Blue (3), Denim Blue (4), Milan Silver (5), Iridium Silver (6), Polar White (7), Diamond White (8), Obsidian Black (9), Cosmic Black (10). When no topcoat is sprayed, that is, the primer color is numbered 0. The 31 different parts are numbered 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, and we can get: upper grille A (1), upper grille B (2), middle spoiler A (3), front bumper A (4), front bumper B (5), front bumper C (6), front bumper D (7), front bumper E (8), front bumper F (9), front bumper G (10), rear Guard A (11), rear guard B (12), rear guard C (13), rear guard D (14), rear guard E (15), rear guard F (16), rear guard G (17), housing A (18), wheel opening decoration A (19), wheel opening decoration B (20), door sill A (21), door sill B (22), door sill C (23), door sill D (24), door sill E (25), door sill decoration A (26), radar bracket A (27), radar bracket B (28), radar bracket C (29), radar bracket D (30), radar bracket E (31). The brackets at different positions on the same skid are numbered 1, 2, 3, 4, 5, 6 from left to right and from top to bottom respectively;

[0122] Step 2: Establish decision variables and intermediate variables

[0123] First, we introduce the decision variables. If the i-th sled uses the j-th color spray gun and the k-th part is placed on the l-th position bracket, then let X ijkl =1, otherwise X ijkl =0, specifically expressed as follows:

[0124]

[0125] Define the intermediate variable Y of Sled-Color-Part ijk , if the i-th sled is sprayed with the j-th color and part k is placed on the sled, then let Y ijk =1, otherwise Y ijk =0, specifically expressed as follows:

[0126]

[0127] Define the slider-color intermediate variable Z ij , if the i-th sled is sprayed with the j-th color, then let Z ij =1, otherwise Z ij =0, specifically expressed as follows:

[0128]

[0129] Define the intermediate variable M between the sled and the part ik , if part k is placed on the i-th sled, then let M ik =1, otherwise M ik =0;

[0130]

[0131] Step 3: Establishing constraints

[0132] (1) Limitations of personal conditions

[0133] Based on the above analysis, during the process of spraying the topcoat, only the same color can be sprayed on the same sled, and only the same type of parts can be placed on it. The parts and brackets are one-to-one corresponding, so the following constraints are obtained:

[0134]

[0135]

[0136] In the above formula, This means that only one of the 31 parts can be placed on any sled. This means that only one of the 10 topcoat colors or the primer color can be placed on any sled.

[0137] (2) Demand Constraints

[0138] In actual production scheduling, any part has a certain demand under any paint color, so it is necessary to establish a demand constraint equation:

[0139]

[0140] In the formula, S jk The equation indicates the required quantity of part k to be painted with color j. For any combination of color j and part k, the required quantity of the part to be painted with the color must be met on all brackets of all sleds. For example, the required quantity of the front E (k = 8) with the color ruby ​​red (j = 1) is 99, that is, S 1,8 =99, we can get the constraint condition The demand for the back-protected A (k = 11) with the color of ruby ​​red (j = 1) is 372, that is, S 1,11 =372, we can get the constraint condition The remaining demand constraints are similar.

[0141] (3) Color change constraints

[0142] During the spraying process, if the parts on the two adjacent front and rear sleds need to be sprayed with different topcoat colors, it means that a "color change" has occurred, and the color change requires spraying the primer color as a transition. Parts sprayed with primer color can only be used as spare parts, which is a waste of resources. At the same time, there are certain restrictions on the topcoat color before and after the color change, that is, the topcoat color cannot be changed at will after the primer color. According to the color change requirements, the color change constraint matrix B is obtained. B is a 10×10 dimensional matrix composed of 0 and 1. The specific meaning is: when the i-th sled is sprayed with primer color, that is, the topcoat colors of the i-1th sled and the i+1th sled are different, and a color change has occurred. If the i-1th sled is sprayed with j color, the i+1th sled can be sprayed with j' color, then the element of the corresponding position of the matrix B is 1. Otherwise, it is 0. Therefore, the following constraint equation can be obtained:

[0143]

[0144] In the formula, because That is, in any color change process, the slider before and after the color change can only appear Z i,j (j=1,2,…,10), in which case Z i,j =1, in other cases Z i,j = 0. So Z i =(Z i,1 ,Z i,2 ,…,Z i,10) is a unit vector consisting of 0 and 1. The above constraint equation indicates that each element in the control matrix A is less than or equal to each element in the color change constraint matrix B, and the elements in A and B are both composed of 0 and 1. According to the order restriction rules for the color change of the topcoat: any red and any blue cannot be followed by any white, any black cannot be arranged after polar white, and polar white must be arranged before diamond white. Therefore, according to the above description, the color change control matrix B is constructed. The specific method is, for example, polar white must be arranged before diamond white, then for b mn For example, when n=8 (the i+1th sled is painted with diamond white), only when m=7 (the i-1th sled is painted with polar white) b mn =1, when m≠7, b mn = 0. The constraint methods of other restriction rules are similar. mn Then the color change constraint matrix B can be obtained.

[0145] (4) Parts placement constraints

[0146] When manufacturing the spraying plan, there are certain restrictions on the parts placed on the front and rear sleds. Some parts placed together will cause damage to the parts. According to the restrictions on the order of parts placement. According to the part placement requirements, the part placement constraint matrix F is obtained. F is a 31×31 dimensional matrix composed of 0 and 1. The specific meaning is: when the i-th sled places part k, the i+1 sled can place part k', then the element of the corresponding position of the matrix F is 1, otherwise it is 0. Therefore, the following constraint equation can be obtained:

[0147]

[0148] because That is, only M can appear on any sled. i,k (k=1,2,…,31), in this case M i,k =1, in other cases M i,k = 0. So M i =(M i,1 ,M i,2 ,…,M i,31) is a unit vector consisting of 0 and 1. The above constraint equation indicates that each element in the control matrix E is less than or equal to each element in the parts placement constraint matrix F, and the elements in E and F are both composed of 0 and 1. The parts placement restriction rules are: (threshold B), (threshold C), (threshold A, threshold D, rear bumper A, threshold trim A), the three brackets correspond to three projects, and the sleds of any two products from different projects cannot be arranged together (such as threshold C and threshold D), otherwise the products will be bumped and scratched. The products in the brackets belong to the same project, and there are no placement restrictions for products of the same project (such as threshold A and threshold D). In addition, thresholds B and thresholds C cannot be arranged together for spraying with all types of radar brackets, otherwise the two ends of the thresholds will be bumped and scratched. Therefore, according to the above description, the parts placement control matrix F is constructed. The specific method is, for example, thresholds C and thresholds D cannot be arranged together, then for f mn For example, when m = 23 (the i-th sled sprays the parts at the threshold C), when n = 24 (the i+1-th sled sprays the parts at the threshold D), f mn =0; when n≠24, f mn =1. Similarly, when m=24 (threshold D for spraying parts on the i-th sled), when n=23 (threshold C for spraying parts on the i+1-th sled), f mn =0; when n≠23, f mn =1. The constraint methods of other restriction rules are similar. mn Then the color change constraint matrix F can be obtained.

[0149] Step 4: Establish objective function and single objective optimization model

[0150] When an auto parts manufacturer makes a production schedule, if different colors of topcoat are sprayed, primer parts are needed as a transition. Primer parts cannot be used and can only be used as spare parts. In order to reduce resource waste, the number of color changes needs to be reduced as much as possible. In other words, the number of slides with primers should be as small as possible, that is, the objective function is:

[0151]

[0152] In the formula, Z i,0 Represents Z i,j (j=0), i.e. all the skids sprayed with primer.

[0153] Combining the various constraints above, we get the single-objective optimization model:

[0154]

[0155]

[0156] The above is the single-objective optimization model for automobile parts production scheduling design based on 0-1 programming.

[0157] Step 5: Use genetic algorithm or neural network algorithm to solve the single objective optimization model.

[0158] A device according to this embodiment includes: one or more processors;

[0159] a memory for storing one or more programs,

[0160] When the one or more programs are executed by the one or more processors, the one or more processors execute any of the methods described above, aiming that the established model can solve common production scheduling problems.

[0161] A computer-readable storage medium of this embodiment stores a computer program, which, when executed by a processor, implements any of the above methods, and stores a model that, when executed by a processor, can solve common production scheduling problems. Further description is as follows:

[0162] The computer system includes a central processing unit (CPU) 101, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 102 or a program loaded from a storage portion into a random access memory (RAM) 103. In the RAM 103, various programs and data required for system operation are also stored. The CPU 101, the ROM 102, and the RAM 103 are connected to each other via a bus 104. An input / output (I / O) interface 105 is also connected to the bus 104.

[0163] The following components are connected to the I / O interface 105: an input section 106 including a keyboard, a mouse, etc.; an output section including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 108 including a hard disk, etc.; and a communication section 109 including a network interface card such as a LAN card, a modem, etc. The communication section 109 performs communication processing via a network such as the Internet. A drive is also connected to the I / O interface 105 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 510 as needed, so that a computer program read therefrom is installed into the storage section 108 as needed.

[0164] In particular, according to an embodiment of the present invention, the above reference process Figure 1The described process can be implemented as a computer software program. For example, embodiment 1 of the present invention includes a computer program product, which includes a computer program carried on a computer readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication part, and / or installed from a removable medium. When the computer program is executed by a central processing unit (CPU) 101, the above-mentioned functions defined in the system of the present application are executed.

[0165] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0166] Frames in the attached figure Figure 3, illustrates the possible implementation architecture, functions and operations of the system, method and computer program product according to various embodiments 1 of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, program segment, or a part of the code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of boxes in the block diagram or flow chart, can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0167] The units involved in the embodiments of the present invention may be implemented by software or hardware, and the modules described may also be set in a processor. The names of these module elements do not, in some cases, limit the units themselves. The units or modules described may also be set in a processor,

[0168] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the marine organism detection method described in the above embodiment.

[0169] For example, the electronic device can implement: step S1: obtain the spraying equipment and spraying color data, and preprocess the obtained data; step S2: establish decision variables and intermediate variables; step S3: establish constraints; step S4: establish objective function and single objective optimization model; step S5: solve the single objective optimization model.

[0170] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0171] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0172] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the inventive concept. For example, the above features have similar functions to those disclosed in the present application (but not limited to).

[0173] The above data illustrate that the present invention is based on the 0-1 planning of the automobile parts production scheduling design method, by selecting the most basic situation of the event as the decision variable, to establish appropriate intermediate variables to meet various conditions, the decision variables and intermediate variables as the basis of the model, according to the actual needs to establish the objective function, according to the conditional restrictions to establish the constraint equation, to establish a single objective optimization model based on 0-1 planning, the model can find the optimal solution and the model accuracy is high. Since the present invention has been described through the above embodiments, any equivalent substitution is obvious to the present invention and is included in the present invention.

[0174] In the description of this specification, the description with reference to the terms "one embodiment", "example", "specific example", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

[0175] The preferred embodiments of the present invention disclosed above are only used to help illustrate the present invention. The preferred embodiments do not describe all the details in detail, nor do they limit the invention to the specific implementation methods described. Obviously, many modifications and changes can be made according to the content of this specification. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the present invention, so that those skilled in the art can understand and use the present invention well. The present invention is limited only by the claims and their full scope and equivalents.

Claims

1. A production scheduling method for color spraying of automobile parts based on 0-1 planning. It is characterized in that include: Acquire the spraying equipment and spraying color data, and pre-process the acquired data; Establish decision variables and intermediate variables; Establish constraints; Establish objective function and single objective optimization model; Solve single-objective optimization models; The intermediate variables include: Sled-Color-Part Intermediate Variable Y ijk , if the sled numbered i is painted with color j and part k is placed on the sled, then let Y ijk =1, otherwise Y ijk =0, that is: and Sled-color intermediate variable Z ij , if the i-th sled is sprayed with the j-th color, then let Z ij =1, otherwise Z ij =0, that is: and Sled-Part Intermediate Variable M ik , if part k is placed on the i-th sled, then let M ik =1, otherwise M ik =0, that is: and The constraints include self-constraints, demand constraints, color change constraints and parts placement constraints; The objective function is: In the formula, Z i,0 Represents Z i,j (j=0), i.e., all skids sprayed with primer; The single-objective optimization model is:

2. According to claim 1, a method for scheduling the production of automobile parts spray painting based on 0-1 programming, It is characterized in that The data preprocessing is as follows: Total paint colors 0 There is only one primer color for the conveyor belt. 0 The sleds are numbered sequentially from 1 to i. 0 , number different topcoat colors from 1 to j 0 ; When it is the primer color, that is, no topcoat is sprayed, let j = 0; different types of parts are numbered from 1 to k 0 ; The brackets at different positions on the same sled are numbered from 1 to 1 0 .

3. According to claim 2, a method for scheduling the production of automobile parts spraying based on 0-1 programming, It is characterized in that The decision variables are: The sled numbered i is painted with color j, and the kth part is placed on the bracket at the lth position, then let X ijkl =1, otherwise X ijkl =0, that is:

4. The method for scheduling the production of automobile parts spray painting based on 0-1 programming according to claim 1, It is characterized in that The self-constraints are: in, Indicates that only k can be placed on any sled 0 A kind of part; Indicates that only j can be placed on any sled 0 A topcoat color or a basecoat color; The demand constraint is: In the formula, S jk represents the required quantity of part k to be painted with color j. The equation indicates that for any combination of color j and part k, the required quantity of the part to be painted with the color must be met on all brackets of all sleds. The color change constraints are: In the formula, because That is, in any color change process, the slider before and after the color change can only appear Z i,j (j=1,2,…,j 0 ), in which case Z i,j =1, in other cases Z i,j =0; The parts placement constraints are: because That is, only M can appear on any sled. i,k (k=1,2,…,k 0 ), in which case M i,k =1, in other cases M i,k =0.

5. The automotive parts spray painting production scheduling system based on 0-1 programming according to claim 1, Features: A data preprocessing module is configured to preprocess the acquired inkjet equipment and inkjet color data; A variable establishment module, configured to establish decision variables and intermediate variables; A constraint condition establishment module, configured to establish constraint conditions; An optimization module configured to establish an objective function and a single-objective optimization model; A solver module is configured to solve a single objective optimization model.

6. The automobile parts spraying production scheduling system based on 0-1 programming according to claim 5, Features: The constraint condition establishment module includes self-constraints, demand quantity constraints, color change constraints and parts placement constraints.

7. A device, include: one or more processors; a memory for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors are enabled to perform the method according to any one of claims 1 to 4.

Citation Information

Cited By

  • A curtain rod production process scheduling method and system based on intelligent manufacturing

    CN123032097A