Production plan scheduling optimization method and system for polyester chip products
The production planning model of polyester slice products is constructed through a whale optimization algorithm based on the cross-selecting strategy, which solves the problems of long production schedule and poor optimization in the existing technology, and maximizes the economic benefits of polyester products.
Patent Information
- Application Number
- CN202410957209.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-17
- Publication Date
- 2024-11-08
AI Technical Summary
In the prior art, the grade switching strategy of polyester slice products depends on the operator's experience, resulting in a long production schedule, poor optimization, lack of theoretical guidance, and ineffective optimization of the production process, resulting in economic losses and low efficiency.
Using a whale optimization algorithm based on cross-select strategy, an optimization model is constructed to optimize the production plan of polyester slice products, taking into account production line allocation, product switching, time constraints, material balance and inventory constraints, and the optimal production scheduling is achieved through a computer system.
It reduces the economic losses caused by brand switching during the production process, improves the comprehensive economic benefits of the polyester product production process, and maximizes the benefits of the polyester product.
Smart Images

Figure BDA0004949210060000061 
Figure BDA0004949210060000062 
Figure BDA0004949210060000071
Abstract
Description
[0001] This invention is funded by the National Key R&D Program Project (2022YFB3305900). Technical Field
[0002] The present invention relates to the field of chemical fiber production, and in particular to a production planning and scheduling optimization method for polyester chip products, a production planning and scheduling optimization system for polyester chip products, and a computer-readable storage medium. Background Art
[0003] Polyester products account for more than 80% of the output of the entire chemical fiber industry and are important basic raw materials. There are two main production processes for polyester fiber products, direct spinning and chip spinning. The two processes have their own advantages and disadvantages and can adapt to different production modes. Direct spinning is to directly melt the polymer at high temperature for spinning, which is more convenient than chip spinning. Direct spinning equipment requires less investment and lower raw material loss, but the product flexibility is not high, which is suitable for large-scale continuous production when the product changes little. The polymerization process and spinning process of chip spinning are two independent parts. Therefore, under the chip spinning process, it can be flexibly designed according to the actual production situation, which is suitable for the development and production of a variety of products.
[0004] The production process of chip spinning involves many brands of polyester chip products, a large number of production equipment, and many brand switching times. In addition, the production process of chip spinning requires the production of polyester chip products of different specifications and brands on the same set of production equipment. Therefore, there is a product switching problem in the production process of polyester chip products.
[0005] In the prior art, the traditional brand switching strategy is usually based on the operator's production experience. However, the production plan obtained by manual calculation will have the problems of long production scheduling time and poor optimality, and lack of optimal brand switching strategy with theoretical guidance and practical operation value.
[0006] In order to overcome the above-mentioned defects of the prior art, the art is in urgent need of a production planning and scheduling optimization technology for polyester chip products, which can optimize the production plan, reduce the economic losses caused by the brand switching process in the production process, improve the comprehensive economic benefits of the polyester product production process, and maximize the benefits of polyester products. Summary of the invention
[0007] A brief summary of one or more aspects is given below to provide a basic understanding of these aspects. This summary is not an exhaustive overview of all conceived aspects, and is neither intended to identify the key or critical elements of all aspects nor to define the scope of any or all aspects. Its only purpose is to give some concepts of one or more aspects in a simplified form as a prelude to a more detailed description that will be given later.
[0008] In order to overcome the above-mentioned defects of the prior art, the present invention provides a production plan scheduling optimization method for polyester chip products, a production plan scheduling optimization system for polyester chip products, and a computer-readable storage medium, which optimize the production plan, reduce the economic losses caused by the brand switching process in the production process, improve the comprehensive economic benefits of the polyester product production process, and maximize the benefits of polyester products.
[0009] Specifically, the above-mentioned production planning and scheduling optimization method for polyester chip products provided according to the first aspect of the present invention includes the steps of: constructing an optimization model according to the optimization objectives and constraints of the production process of the polyester chip products, the input data of the optimization model being the actual production process data information of the polyester chip products; and solving the optimization model using a whale optimization algorithm based on a cross selection strategy to determine the optimized production planning and scheduling scheme for the polyester chip products.
[0010] Preferably, in one embodiment of the present invention, the constraints of the production process of the polyester chip product include production allocation constraints between different production lines and different products, switching constraints between different products, time constraints of the product production process, material balance constraints between raw materials and products, demand and sales balance constraints and / or inventory constraints.
[0011] Preferably, in an embodiment of the present invention, the actual production process data information includes actual production process information, order information, price information and inventory information.
[0012] Preferably, in one embodiment of the present invention, the step of solving the optimization model using the whale optimization algorithm based on the crossover selection strategy includes: S1: setting algorithm parameters to initialize the population; S2: calculating the fitness of each individual in the population and sorting the individuals according to the fitness to determine the optimal individual; S3: in response to not meeting the termination condition, determining the traversal method of the individual according to the size of the coefficient matrix and the probability of the predation mechanism, and forming an iterative population after traversing the population, and applying a crossover selection operation to the iterative population to determine the position of each individual in the new population; S4: calculating the fitness of each individual in the new population and sorting the individuals according to the fitness to determine the optimal individual of the new population and update the global optimal solution; and S5: repeating S3 to S4 until the termination condition is met and outputting the global optimal solution.
[0013] Preferably, in an embodiment of the present invention, the traversal method includes a spiral search method or a random search method.
[0014] Preferably, in one embodiment of the present invention, the step of using a crossover selection operation on the iterative population to determine the position of each individual in the new population includes: sorting the iterative population after iteration from low to high according to fitness, and dividing it into two parts: high-quality individuals and relatively inferior individuals; performing arithmetic crossover on the high-quality individuals and the relatively inferior individuals to form an intermediate population; and merging the iterative population and the intermediate population and sorting them from low to high according to fitness, removing the relatively inferior individuals after the merger and retaining the high-quality individuals to form the new population.
[0015] In addition, the production planning and scheduling optimization system for polyester chip products provided according to the second aspect of the present invention includes a memory and a processor. The memory stores computer instructions. The processor is connected to the memory and is configured to execute the computer instructions stored in the memory to implement the production planning and scheduling optimization method for polyester chip products provided in any one of the above embodiments.
[0016] In addition, the computer-readable storage medium provided according to the third aspect of the present invention stores computer instructions. When the computer instructions are executed by the processor, the production planning and scheduling optimization method for polyester chip products provided by any one of the above embodiments is implemented. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The above features and advantages of the present invention can be better understood after reading the detailed description of the embodiments of the present disclosure in conjunction with the following drawings. In the drawings, the components are not necessarily drawn to scale, and components with similar related properties or features may have the same or similar reference numerals.
[0018] Figure 1 A flowchart of a production planning and scheduling optimization method for polyester chip products provided in accordance with some embodiments of the present invention is shown;
[0019] Figure 2 A flowchart of solving an optimization model provided according to some embodiments of the present invention is shown; and
[0020] Figure 3 A Gantt chart of an optimized production planning and scheduling solution provided according to an example of the present invention is shown.
[0021] Reference numerals:
[0022] 100: Production planning and scheduling optimization method for polyester chip products;
[0023] S110-S120: steps; and
[0024] S1~S4: steps. DETAILED DESCRIPTION
[0025] The present invention is described in detail below in conjunction with the accompanying drawings and specific embodiments. Note that the aspects described below in conjunction with the accompanying drawings and specific embodiments are only exemplary and should not be construed as limiting the scope of protection of the present invention in any way.
[0026] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0027] In addition, the terms "upper", "lower", "left", "right", "top", "bottom", "horizontal" and "vertical" used in the following description should be understood as the directions shown in the paragraph and the related drawings. Such relative terms are only used for the convenience of description and do not mean that the device described therein must be manufactured or operated in a specific direction, and therefore should not be understood as limiting the present invention.
[0028] It is understood that although the terms "first", "second", "third", etc. may be used herein to describe various components, regions, layers and / or parts, these components, regions, layers and / or parts should not be limited by these terms, and these terms are only used to distinguish different components, regions, layers and / or parts. Therefore, the first component, region, layer and / or part discussed below may be referred to as a second component, region, layer and / or part without departing from some embodiments of the present invention.
[0029] As mentioned above, in the prior art, the traditional brand switching strategy is usually based on the operator's production experience. However, the production plan obtained by manual calculation will have the problems of long production scheduling time and poor optimality, and lack of optimal brand switching strategy with theoretical guidance and practical operation value.
[0030] In order to overcome the above-mentioned defects of the prior art, the present invention provides a production plan scheduling optimization method for polyester chip products, a production plan scheduling optimization system for polyester chip products, and a computer-readable storage medium, which optimize the production plan, reduce the economic losses caused by the brand switching process in the production process, improve the comprehensive economic benefits of the polyester product production process, and maximize the benefits of polyester products.
[0031] In some non-limiting embodiments, the above-mentioned production plan scheduling optimization method for polyester chip products provided in the first aspect of the present invention can be implemented via the above-mentioned production plan scheduling optimization system for polyester chip products provided in the second aspect of the present invention. Specifically, the production plan scheduling optimization system for polyester chip products can be configured with a memory and a processor. The memory includes but is not limited to the above-mentioned computer-readable storage medium provided in the third aspect of the present invention, on which computer instructions are stored. The processor is connected to the memory and is configured to execute the computer instructions stored on the memory to implement the production plan scheduling optimization method for polyester chip products provided in the first aspect of the present invention.
[0032] The following will first describe the working principle of the above-mentioned production plan scheduling optimization system for polyester chip products in conjunction with some embodiments of the production plan scheduling optimization method for polyester chip products. Those skilled in the art will understand that these embodiments of the production plan scheduling optimization method for polyester chip products are only some non-restrictive implementation methods provided by the present invention, which are intended to clearly demonstrate the main concept of the present invention and provide some specific solutions that are convenient for the public to implement, rather than to limit all functions or all working methods of the system. Similarly, the production plan scheduling optimization system for polyester chip products is also only a non-restrictive implementation method provided by the present invention, and does not constitute a limitation on the execution subject and execution order of each step in these production plan scheduling optimization methods for polyester chip products.
[0033] Please refer to Figure 1 , Figure 1 A flow chart of a production planning and scheduling optimization method for polyester chip products provided according to some embodiments of the present invention is shown.
[0034] like Figure 1 As shown, the production planning and scheduling optimization method 100 for polyester chip products may include step S110: constructing an optimization model according to the optimization objectives and constraints of the production process of the polyester chip products, and the input data of the optimization model is the actual production process data information of the polyester chip products.
[0035] The production planning and scheduling optimization system can determine the optimization objective function according to the actual situation, and further construct the optimization model according to the constraints of the production process of polyester chip products.
[0036] The production process of polyester chip products may include multiple products and multiple production lines. Production planning and scheduling need to consider the production time, raw material prices, demand and sales volume of each product in the production process, as well as how to allocate each product to each production line.
[0037] The production planning and scheduling optimization system can choose to maximize product benefits as the optimization objective function. In a non-limiting embodiment, the optimization objective function with the goal of maximizing product benefits can be:
[0038]
[0039] Among them, P_sale i is the sales price of product i, FP i,j,w is the quantity of product i produced on production line j in week w, P_sale ii is the sales price of product ii, rate j is the production rate of production line j, tau i,ii is the switching time (i.e., production changeover time) required to switch from product i to product ii, Z i,ii,j,w Indicates whether product ii in production line j is produced immediately after product i in week w, ZF i,ii,j,w Indicates whether the product i is switched to product ii on production line j between week w-1 and week w, P_raw r is the price of raw material r, FR u,r,w is the mass flow rate of raw material r in production unit u in week w, ECU u is the energy cost of PET melt in production unit u, FM u,w is the mass flow rate of PET melt in production unit u in week w, H represents the span of production plan, ECJ j is the energy cost of the final product in production line j, thetaU is the upper limit of the processing time within a week, P_pac is the cost of unit product packaging, am i It is the cost of the auxiliary materials consumed to produce a unit mass of product. Here, when product ii is produced immediately after product i, Z i,ii,j,w The value of can be 1, otherwise Z i,ii,j,w The value of is 0. When the product i is switched to product ii on production line j between week w-1 and week w, ZF i,ii,j,w The value of can be 1, otherwise ZF i,ii,j,w The value of is 0.
[0040] Furthermore, the constraints of the production process of polyester chip products may include production allocation constraints between different production lines and different products, switching constraints between different products, time constraints of the product production process, material balance constraints between raw materials and products, demand and sales balance constraints and inventory constraints, etc.
[0041] Specifically, the production allocation constraints between different production lines and different products refer to the constraint relationship that each production line only produces certain products. In a non-limiting embodiment, the production allocation constraints between different production lines and different products can be shown as formulas (2), (3), and (4):
[0042]
[0043] L i,j,w +F i,j,w ≤2E i,j,w (4)
[0044] Among them, F i,j,w Indicates whether product i is the first to be produced on production line j in week w. When product i is the first to be produced, F i,j,w The value of can be 1, otherwise, F i,j,w The value of L is 0. i,j,w Indicates whether product i is the last one produced on production line j in week w. When product i is the last one produced, Lx ,j,w The value of can be 1, otherwise, L i,j,w The value of E is 0. i,j,w Indicates whether product i is produced on production line j in week w. When product i is produced, E i,j,w The value of can be 1, otherwise, E i,j,w The value of is 0.
[0045] The constraint conditions may also include switching constraints between different products, that is, whether there is a transition product when switching between products. In a non-limiting embodiment, the switching constraints between different products may be shown as formulas (5), (6), (7), and (8):
[0046] ∑ i,ii,j,w (Z i,ii,j,w +L i,j,w )=E i,j,w (5)
[0047] ∑ i,ii,j,w (Z i,ii,j,w +F i,j,w )=E i,j,w (6)
[0048] ∑ i,ii,j,w (ZF ii,ii,j,w )=F ii,j,w (w≥2) (7)
[0049] ∑ i,ii,j,w (ZF i,ii,j,w )=L i,j,w-1 (w≥2) (8)
[0050] Among them, F i,j,wIndicates whether product i is the first to be produced on production line j in week w, L i,j,w Indicates whether product i on production line j is the last one produced in week w, E i,j,w Indicates whether product i is produced on production line j in week w, Z i,ii,j,w Indicates whether product ii in production line j is produced immediately after product i in week w, ZF i,ii,j,w Indicates whether the product i is switched to the product ii on production line j between week w-1 and week w, where w is the number of weeks.
[0051] In addition, the time constraints of the product production process in the constraint conditions may specifically include the upper and lower limits of the production time within a week, the product production and processing time, the production start time, and the production end time.
[0052] Specifically, in a preferred embodiment, the time constraint of the product production process can be shown as formulas (9) to (19):
[0053]
[0054] Ts ii,j,w ≥Tf i,j,w +tau i,ii ·Z i,ii,j,w -M·(1-Z i,ii,j,w ) (11)
[0055] Ts ii,j,w ≥Te_cha+tau i,ii ·ZF i,ii,j,w -M·(1-ZF i,ii,j,w )(w≥2) (12)
[0056] Tf i,j,w =Ts i,jw +T i,j,w (13)
[0057] Ts i,j,w ≥Te_cha·E i,j,w (14)
[0058] Tf i,j,w ≤(thetaU+Te_cha)·E i,j,w (15)
[0059] ∑ i,j,w T i,j,w +∑ i,ii,j,w (tau i,ii ·(Z i,ii,j,w +ZF i,ii,j,w ))=thetaU(w≥2) (16)
[0060] ∑i,jw T i,j,w +∑ i,ii,j,w (tau i,ii ·Z i,ii,j,w )=thetaU(w=1) (17)
[0061] T i,j,w ≥thetaL·E i,j,w (18)
[0062] T i,j,w ≤thetaU·E i,j,w (19)
[0063] Among them, Tf i,j,w Indicates the time when product i on production line j is completed in week w, date_index day Indicates the day when the production task is completed, K i,j,day,w Indicates whether product i is produced on production line j on the day of week w, Te_cha indicates the earliest switching time of the day, M indicates a large constant, delta i represents the worker's operation time when product i is switched, Tl_cha represents the latest switching time of the day, Ts ii,j,w Ts is the time when the production of product ii on production line j starts in week w. i,j,w represents the time when production of product i on production line j starts in week w, tau i,ii is the switching time required for product i to switch to product ii, T i,j,w is the processing time of product i on production line j in week w, E i,j,w It indicates whether product i is produced on production line j in week w, thetaU represents the upper limit of production time in a week, and thetaL represents the lower limit of production time in a week.
[0064] In one example, the material balance constraint between raw materials and products in the constraint condition can be shown as formulas (20) to (22):
[0065] FR u,r,w =YM u,r ·FM u,w (20)
[0066] FM u,w =∑ i,j,w (YP i FP i,j,w )+∑ i,ii,j,w (YP i ·rate j tau i,ii ·Z i,ii,j,w ) (w=1)(21)
[0067] FM u,w =∑ i,j,w (YP i FP i,j,w )+∑ i,i,j,w (YP i ·rate j tau i,ii ·(Z i,ii,j,w +ZF i,iij,w ))(w≥2) (22)
[0068] Among them, FR u,r,w is the mass flow rate of raw material r in production unit u in week w, YM u,r FM is the output of PET melt per unit mass of raw materials in production unit u. u,w is the mass flow rate of PET melt in production unit u in week w, YP i It is the output of product i produced by unit mass of PET melt on production line j.
[0069] In addition, as mentioned above, FP i,j,w is the output of product i produced on production line j in week w, FP i,j,w It can be constrained by the output constraint formula (23):
[0070] FP i,j,w =rate j ·T i,j,w (twenty three)
[0071] Among them, rate j is the production rate of production line j, T i,j,w is the processing time of product i on production line j in week w.
[0072] The demand and sales balance constraints in the constraint conditions can be expressed as formula (24):
[0073] S i,w =D i,w (twenty four)
[0074] Among them, S i,w is the sales volume of product i in week w, Dx ,w is the demand for product i in week w.
[0075] The inventory constraints in the constraint conditions may specifically include upper and lower limits of inventory, product initial inventory, and product final inventory. In one example, the inventory constraints may be as shown in formulas (25) to (29):
[0076] V i,′1′ =Vini i +∑ i,j,′1′(FP i,j,′1′ -S i,′1′ ) (25 )
[0077]
[0078] V_final i =V i,′4′ (27)
[0079] V min i ≤V i,w (28)
[0080] Vmax i ≥V i,w (29)
[0081] Among them, V i,w is the inventory of product i at the end of week w, and accordingly, V i,′1′ is the inventory of product i at the end of week 1; Vini i is the initial inventory of product i, Vini i,w-1 V_final is the initial inventory of product i in week w-1 (w is greater than or equal to 2), i is the ending inventory of product i, Vmin i is the lower limit of inventory for product i, Vmax i is the upper limit of inventory for product i.
[0082] The constraint conditions may also be set according to actual conditions. For example, in a preferred embodiment, the constraint conditions may also include other constraints as shown in formula (30):
[0083]
[0084] K i,j,day,w Indicates whether product i is produced on production line j on day of week w, Z i,ii,j,w Indicates whether product ii is produced immediately after product i in production line j in week w. Formula (30) constrains that whether product i is produced on production line j on day day of week w must be consistent with whether product ii is produced immediately after product i.
[0085] According to the optimization objective function and constraint conditions determined by the production planning and scheduling optimization system, an optimization model is constructed. The input data of the optimization model is the actual production process data information of the polyester chip product. Here, the actual production process data information may include actual production process information, order information, price information and inventory information.
[0086] Please continue to refer to Figure 1The production planning and scheduling optimization method 100 for polyester chip products may include step S120: using a whale optimization algorithm based on a crossover selection strategy to solve an optimization model to determine an optimized production planning and scheduling solution for polyester chip products.
[0087] Please refer to Figure 2 , Figure 2 A flowchart for solving an optimization model provided according to some embodiments of the present invention is shown.
[0088] like Figure 2 As shown, the production planning and scheduling optimization system first executes step S1: setting algorithm parameters, including the population number NP and the maximum number of iterations t max , to initialize the population.
[0089] Afterwards, step S2 is executed: the fitness of individuals in the population is calculated and the individuals in the population are sorted according to the fitness, so as to determine the current optimal individual and then determine whether the termination condition is met.
[0090] In response to the termination condition not being met, step S3 is executed: the production planning and scheduling optimization system can determine the traversal method of the individuals according to the coefficient matrix and the size of the probability of the predation mechanism, and form an iterative population after traversing the population, and then use a crossover selection operation on the iterative population to determine the position of each individual in the new population.
[0091] Specifically, the production planning and scheduling optimization system can first calculate the value of the convergence factor a according to formula (31):
[0092] a=2-2·t / t max (31)
[0093] Where t is the number of iterations, t max is the maximum number of iterations, and the convergence factor a decreases linearly from 2 to 0.
[0094] Then, the coefficient matrix A and the value of the distance vector D between the current position of the whale and the prey (the current optimal solution) are determined according to formulas (32) and (33):
[0095] A=2·a·r 1 -a (32)
[0096] D=|C·x best (t)-x(t)| (33)
[0097] Among them, x(t) is the current position of the individual whale, x best (t) is the position of the best individual in the current population, that is, the global optimal position of the whale individual, and C is the coefficient matrix, which can be determined by formula (34):
[0098] C=2·r2 (34)
[0099] The above 1 and r 2 is a random number uniformly distributed between [0,1].
[0100] Afterwards, the traversal method of the population is determined according to the coefficient matrix A and the predation mechanism probability p, where the value range of the predation mechanism probability p is a random number in [0,1]. When the predation mechanism probability p ≥ 0.5, the spiral search method shown in formula (35) is used for traversal:
[0101] x(t+1)=x best (t)+D·e,b ll ·cos2πl (35)
[0102] Wherein, x(t+1) is the new position of the current whale individual after one traversal. In this preferred embodiment, b is a constant 1, and l is a random number uniformly distributed between [-1, 1].
[0103] When the probability of predation mechanism p<0.5 and |A|≥1, the random search method shown in formula (36) is used to traverse:
[0104] x(t+1))=r rand (t)-A·|C·x rand (t)-x(t)| (36)
[0105] Among them, x rand (t) is a random individual whale position.
[0106] When the probability of predation mechanism p<0.5 and |A|<1, the spiral search method shown in formula (37) is used for traversal:
[0107] x(t+1)=x best (t)-A·D (37)
[0108] After traversing each individual dimension of the individual according to the determined traversal method, the production planning and scheduling optimization system redefines the parameters (convergence factor a, coefficient matrix A, distance vector D, predation mechanism probability p, etc.), and continues to traverse other individuals in the population according to the redetermined parameters until the population is traversed, thereby forming an iterative population after iteration.
[0109] The production planning and scheduling optimization system can use crossover selection operation on the iterative population to determine the position of each individual in the new population. The crossover selection operation can be shown as formula (38) and (39):
[0110]
[0111] Among them, p 1 and p 2 is a random number uniformly distributed between [0,1], x 1 and x 2 To iterate the population, the positions of high-quality individuals and relatively inferior individuals are divided into two parts after being sorted from low to high in terms of fitness. and are the positions of individuals in the intermediate population after crossover selection, respectively. The iterated population is merged with the intermediate population to form a new population.
[0112] Specifically, the steps of the crossover selection operation include: first, sorting the iteration population after iteration from low to high according to fitness. Then, dividing the sorted iteration population into two parts, namely, high-quality individuals x and 1 and relatively inferior individuals x 2 . Then, for the high-quality individuals x 1 and relatively inferior individuals x 2 Perform arithmetic crossover to generate an intermediate population after crossover selection. Here, the arithmetic crossover can use the above formulas (38) and (39). Merge the iterative population with the intermediate population and sort them from low to high according to fitness, remove the relatively inferior individuals after the merger, and retain the high-quality individuals to form a new population.
[0113] After that, please continue to refer to Figure 2 , the production planning and scheduling optimization system executes S4: calculates the fitness of each individual in the new population and sorts the individuals according to the fitness to determine the best individual of the new population and update the global optimal solution. Here, when the best individual of the new population is greater than the current global optimal solution, the global optimal solution is updated to the best individual of the new population.
[0114] The production planning and scheduling optimization system repeatedly executes S3 to S4 until the termination condition is met. Preferably, when the number of iterations t reaches the maximum number of iterations t max When , it can be regarded as meeting the termination condition. When the termination condition is met, the global optimal solution is output.
[0115] The following is a specific non-limiting preferred embodiment, which is used to explain the production planning and scheduling optimization method provided by the present invention.
[0116] The production planning and scheduling optimization system can determine the optimization objective function according to the above formula (1), determine the constraint conditions according to the above formulas (2) to (30), and construct the optimization model of the preferred embodiment according to the optimization objective function and the constraint conditions.
[0117] In this preferred embodiment, the earliest switching time Te_cha in a day can be 8 am, the constant M can be 200, and the worker's operating time delta when product i is switched can bei The value of can be 2 hours, the value of the latest switching time Tl_cha in a day can be 17:00 in the afternoon, the value of the upper limit of the production time in a week thetaU can be 168 hours, and the value of the lower limit of the production time in a week thetaL can be 24 hours. The output of PET melt per ton of raw material PTA in each production unit is 0.865 tons, and the output of PET melt per ton of raw material EG in each production unit is 0.333 tons. The output of each product per ton of PET melt on each production line is 1.002 tons.
[0118] Afterwards, the production planning and scheduling optimization system can determine the actual production process data information. Specifically, the production planning and scheduling optimization system can first obtain the actual production process information, which includes the corresponding relationship between the product and the production line and the production unit, the production rate of the production line, the load information of the production line and the production unit, and the switching time between products.
[0119] In this preferred example, the correspondence between products, production lines and production units can be: production units U1 to U6 correspond to production lines L1 to L6 respectively; production line L1 can produce products C1, C11, C12, C13, C14, C16, production line L2 can produce products C1, C4, C5, C10, production line L3 can produce products C1, C2, C9, C15, production line L4 can produce products C1 and C3, production line L5 can produce products C1, C6, C7, C8, and production line L6 can produce products C6 and C10.
[0120] The production rate of each production line can be: the production rate of production line L1 is 2.9 ton / h, the production rate of production line L2 is 21.7 ton / h, the production rate of production line L3 is 22.9 ton / h, the production rate of production line L4 is 28.3 ton / h, the production rate of production line L5 is 25.8 ton / h, and the production rate of production line L6 is 1.25 ton / h. Here, the switching time (transfer time) between products is 8 hours.
[0121] Afterwards, the production planning and scheduling optimization system can obtain the actual order information. In this preferred embodiment, the order information can be shown in Table 1:
[0122]
[0123]
[0124] Table 1
[0125] The order information may specifically include product brand, product demand and product delivery date information. In the order information shown in Table 1, product C1 with brand C1 needs to deliver 7,250 tons of products in the first week, the second week, the third week and the fourth week respectively; product C2 with brand C2 needs to deliver 3,700 tons of products in the first week, the second week, the third week and the fourth week respectively; and so on, product C3 with brand C3 needs to deliver 2,875 tons of products in the first week, the second week, the third week and the fourth week respectively; product C4 with brand C4 needs to deliver 2,875 tons of products in the first week, the second week, the third week and the fourth week respectively; Each of the following products must be delivered: 2,750 tons of products; product C5 with brand name C5 must deliver 1,250 tons of products in the 1st, 2nd, 3rd and 4th weeks; product C6 with brand name C6 must deliver 900 tons of products in the 1st, 2nd, 3rd and 4th weeks; product C7 with brand name C7 must deliver 550 tons of products in the 1st, 2nd, 3rd and 4th weeks; product C8 with brand name C8 must deliver 450 tons of products in the 1st, 2nd, 3rd and 4th weeks. Tons of products; product C9 with brand C9 needs to deliver 375 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively; product C10 with brand C10 needs to deliver 225 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively; product C11 with brand C11 needs to deliver 225 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively; product C12 with brand C12 needs to deliver 338 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively. products; product C13 with brand name C13 needs to deliver 300 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively; product C14 with brand name C14 needs to deliver 200 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively; product C15 with brand name C15 needs to deliver 225 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively; product C16 with brand name C16 needs to deliver 13 tons of products in the 1st week, 2nd week, 3rd week and 4th week respectively.
[0126] Afterwards, the production planning and scheduling optimization system can obtain actual price information, which may include raw material prices, product selling prices, and energy consumption price information of each production unit and production line.
[0127] In this preferred embodiment, the price of raw material PTA is 5062 yuan / ton, and the price of raw material EG is 3700 yuan / ton. The product prices are: product C1 is priced at 6,330 yuan / ton, product C2 is priced at 6,355 yuan / ton, product C3 is priced at 6,282 yuan / ton, product C4 is priced at 6,654 yuan / ton, product C5 is priced at 6,373 yuan / ton, product C6 is priced at 6,886 yuan / ton, product C7 is priced at 6,410 yuan / ton, product C8 is priced at 6,413 yuan / ton, product C9 is priced at 6,366 yuan / ton, product C10 is priced at 7,196 yuan / ton, product C11 is priced at 9,130 yuan / ton, product C12 is priced at 7,095 yuan / ton, product C13 is priced at 7,215 yuan / ton, product C14 is priced at 7,075 yuan / ton, product C15 is priced at 6,274 yuan / ton and product C16 is priced at 6,569 yuan / ton. The energy consumption price information of each production unit is 630 yuan / ton, and the energy consumption price information of each production line is 50 yuan / ton.
[0128] Then, the production planning and scheduling optimization system can obtain the actual inventory information. The inventory information may include the upper and lower limits of inventory for each product, as well as the initial inventory of each product.
[0129] In this preferred embodiment, the inventory information may be as shown in Table 2:
[0130]
[0131]
[0132] Table 2
[0133] In the inventory information shown in Table 2, the initial inventory of product C1 is 387 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C2 is 1047 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C3 is 210 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C4 is 4719 tons, the lower limit of inventory is 500 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C5 is 2762 tons, the lower limit of inventory is 500 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C6 is 3800 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C7 is 2783 tons, the lower limit of inventory is 500 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C8 is 2627 tons, the lower limit of inventory is 500 tons, and the upper limit of inventory is 50 00 tons; the initial inventory of product C9 is 2000 tons, the lower limit of inventory is 500 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C10 is 2109 tons, the lower limit of inventory is 500 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C11 is 847 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5000 tons; the initial inventory of product C12 is 700 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5000 tons. Tons; the initial inventory of product C13 is 389 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5,000 tons; the initial inventory of product C14 is 1,392 tons, the lower limit of inventory is 200 tons, and the upper limit of inventory is 5,000 tons; the initial inventory of product C15 is 600 tons, the lower limit of inventory is 200 tons, and the upper limit of inventory is 5,000 tons; the initial inventory of product C16 is 100 tons, the lower limit of inventory is 0 tons, and the upper limit of inventory is 5,000 tons.
[0134] Please refer to Figure 3 , Figure 3 A Gantt chart of an optimized production planning and scheduling solution provided according to an example of the present invention is shown.
[0135] The production planning and scheduling optimization system uses the whale optimization algorithm based on the crossover selection strategy to solve the optimization model. Figure 2 The steps shown in the figure are used to solve the problem. When the population is initialized, the population size set by the production planning and scheduling optimization system is 10, and the maximum number of iterations is 100. The optimized production planning and scheduling solution is as follows: Figure 3As shown. The optimized production plan scheduling scheme is: production line L1 produces product C13 from 8:00 on the first day of the first week to 8:00 on the third day of the second week, with a transition time of 8 hours, and produces product C11 from 16:00 on the third day of the second week to 24:00 on the second day of the third week; after a transition time of 8 hours, it produces product C12 from 8:00 on the third day of the third week to 20:00 on the fifth day of the fourth week, with a transition time of 8 hours, and produces product C13 from 4:00 on the sixth day of the fourth week to the end of the fourth week. Production line L2 produces product C5 from 8:00 on the first day of the first week to 16:00 on the third day, with a transition time of 8 hours, and produces product C1 from 24:00 on the third day of the first week to 16:00 on the first day of the second week, then produces product C4 from 24:00 on the first day of the second week to 16:00 on the second day of the fourth week, and finally produces product C10 from 8:00 on the third day of the fourth week to 8:00 on the first day of the next week. Line L3 produces product C2 from 8:00 on the first day of the first week to 16:00 on the first day of the second week, and produces product C15 from 24:00 on the first day of the second week to 10:00 on the third day of the second week, and then produces product C2 from 24:00 on the third day of the second week to the end of the fourth week. Line L4 produces product C3 from 8:00 on the first day of the first week to 16:00 on the fourth day of the second week, and then produces product C1 from 22:00 on the fourth day of the second week to 24:00 on the third day of the third week, and produces product C3 from 8:00 on the fourth day of the third week to 8:00 on the sixth day, and then produces product C1 from 16:00 on the sixth day of the fourth week to the end of the fourth week. Line L5 is used to produce product C1 from the first week to the fourth week, and line L6 is used to produce product C10 from the first week to the fourth week.
[0136] In summary, the production planning and scheduling optimization method for polyester chip products provided by the present invention can optimize the production plan, thereby reducing the economic losses caused by the brand switching process during the production process, improving the comprehensive economic benefits of the polyester product production process, and maximizing the benefits of polyester products.
[0137] Although the above methods are illustrated and described as a series of actions for simplicity of explanation, it should be understood and appreciated that these methods are not limited by the order of the actions, because according to one or more embodiments, some actions may occur in a different order and / or concurrently with other actions from those illustrated and described herein or not illustrated and described herein but understandable to those skilled in the art.
[0138] Those skilled in the art will appreciate that information, signals, and data may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips cited throughout the above description may be represented by voltage, current, electromagnetic waves, magnetic fields or magnetic particles, optical fields or optical particles, or any combination thereof.
[0139] Those skilled in the art will further appreciate that the various illustrative logic blocks, modules, circuits, and algorithm steps described in conjunction with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or a combination of the two. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps are generally described above in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. The technician may implement the described functionality in different ways for each specific application, but such implementation decisions should not be interpreted as resulting in a departure from the scope of the present invention.
[0140] The various illustrative logic modules and circuits described in conjunction with the embodiments disclosed herein may be implemented or executed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in cooperation with a DSP core, or any other such configuration.
[0141] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software module may reside in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor so that the processor can read and write information from / to the storage medium. In an alternative, a storage medium may be integrated into a processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In an alternative, the processor and the storage medium may reside in a user terminal as discrete components.
[0142] In one or more exemplary embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented as a computer program product in software, each function may be stored on or transmitted by a computer-readable medium as one or more instructions or codes. Computer-readable media include both computer storage media and communication media, including any medium that facilitates the transfer of a computer program from one place to another. Storage media may be any available medium that can be accessed by a computer. As an example and not limitation, such a computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of an instruction or data structure and can be accessed by a computer. Any connection is also properly referred to as a computer-readable medium. For example, if the software is transmitted from a website, a server, or other remote source using a coaxial cable, a fiber optic cable, a twisted pair, a digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwaves, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwaves are included in the definition of the medium. Disk and disc as used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, wherein disk often reproduces data magnetically, while disc reproduces data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
[0143] The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and designs described herein, but should be granted the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A production planning and scheduling optimization method for polyester chip products, characterized in that: Includes steps: An optimization model is constructed according to the optimization objectives and constraints of the production process of the polyester chip product, wherein the input data of the optimization model is the actual production process data information of the polyester chip product; as well as The optimization model is solved by a whale optimization algorithm based on a crossover selection strategy to determine an optimized production plan scheduling scheme for the polyester chip product.
2. The production planning and scheduling optimization method according to claim 1, characterized in that: The constraints of the production process of the polyester chip product include production allocation constraints between different production lines and different products, switching constraints between different products, time constraints of the product production process, material balance constraints between raw materials and products, demand and sales balance constraints and / or inventory constraints.
3. The production planning and scheduling optimization method according to claim 1, characterized in that: The actual production process data information includes actual production process information, order information, price information and inventory information.
4. The production planning and scheduling optimization method according to claim 1, characterized in that: The step of solving the optimization model by using the whale optimization algorithm based on the crossover selection strategy includes: S1: Set algorithm parameters to initialize the population; S2: Calculate the fitness of each individual in the population and sort the individuals according to the fitness to determine the optimal individual; S3: In response to the termination condition not being met, determining the traversal mode of the individuals according to the coefficient matrix and the size of the probability of the predation mechanism, and forming an iterative population after traversing the population, and performing a crossover selection operation on the iterative population to determine the position of each individual in the new population; S4: calculating the fitness of each individual in the new population and sorting the individuals according to the fitness, so as to determine the best individual of the new population and update the global optimal solution; and S5: Repeat S3 to S4 until the termination condition is met, and output the global optimal solution.
5. The production planning and scheduling optimization method according to claim 4, characterized in that: The traversal method includes a spiral search method or a random search method.
6. The production planning and scheduling optimization method according to claim 4, characterized in that: The step of using a crossover selection operation on the iterative population to determine the position of each individual in the new population comprises: The iterated population after iteration is sorted from low to high according to fitness, and is divided into two parts: high-quality individuals and relatively low-quality individuals; Performing arithmetic crossover on the high-quality individuals and the relatively low-quality individuals to form an intermediate population; and After merging the iterative population and the intermediate population, they are sorted from low to high according to fitness, relatively inferior individuals after merging are removed and high-quality individuals are retained to form the new population.
7. A production planning and scheduling optimization system for polyester chip products, characterized in that: include: a memory having computer instructions stored thereon; as well as A processor is connected to the memory and is configured to execute computer instructions stored in the memory to implement the production planning and scheduling optimization method for polyester chip products as described in any one of claims 1 to 6.
8. A computer-readable storage medium having computer instructions stored thereon, characterized in that: When the computer instructions are executed by the processor, the production planning and scheduling optimization method for polyester chip products according to any one of claims 1 to 6 is implemented.
