CN1753008B - Method of optimization hot rolling scaduled sequence - Google Patents

Abstract

The present invention relates to a method for optimizing hot-rolling rolling program sequence. It successively includes two large steps of rolling program sequence regulation and rolling program material sequence regulation. The described rolling program sequence regulation step adopts a simulation annealing algorithm to change the rolling program order, and the described rolling program material sequence regulation step adopts a variable neighbourhood search algorithm, it includes change of main body material portion machining order in every rolling program and addition, deletion and position regulation of main body material between rolling programs.

Description

A kind of method of optimizing hot rolling scaduled sequence

Technical field

Metallurgy industry manufacturing execution system (MES, Manufacturing Execution System) hot rolling production plan field.

Background technology

Hot rolling scaduled is the instruction of indication slab rolling order.Along with the adjustment of continuous casting plan and the enforcement of production, woven rolling scaduled in slab may change break time, need realize rolling scaduled global optimization by the adjustment of rolling scaduled order adjustment and rolling scaduled material for this variation.When plan is adjusted, to consider rolling procedure, take into account many complicated factors such as contractual delivery phase, continuous casting hot rolling linking, subsequent handling requirement again.The artificial result who is difficult to obtain a global optimization that adjusts.

Summary of the invention

At the problems referred to above, the invention provides a kind of method of optimizing hot rolling scaduled sequence with model.

The optimization of rolling scaduled sequence is to make on the basis of considering many complicated factors such as contractual delivery phase, rolling procedure, continuous casting hot rolling linking, subsequent handling requirement, mainly does following consideration on handling:

Hot rolling material: because the restriction of value volume and range of product, hot rolling material does not have adjustable leeway substantially, only adjusts the main body material when adjusting material, does not relate to hot rolling material;

Optimisation strategy: rolling scaduled sequence optimization can be by adjusting rolling scaduled sequence and adjusting two kinds of realizations of material of rolling scaduled, if but adjust the rolling scaduled order and the order of material simultaneously, need the constraint of consideration simultaneously too much, and two kinds of adjustment interact, and are unfavorable for the efficient realization of algorithm.In view of this consideration, when optimizing rolling scaduled sequence, realize in two steps---rolling scaduled order adjustment and rolling scaduled material adjustment.Wherein rolling scaduled order adjustment only changes rolling scaduled precedence, the material that does not change each rolling scaduled inside and comprised; Rolling scaduled material adjustment change each rolling scaduled in main body material order of partly processing and rolling scaduled between the adjustment such as interpolation, deletion, place-exchange of main body material.By rolling scaduled order adjustment and rolling scaduled material adjustment, reach the target that improves the hot charging ratio, improves continuous cold charge and hot charging burst length.

Characteristics according to rolling scaduled order adjustment and rolling scaduled material adjustment problem: the object of processing all is (the rolling scaduled or slab) that disperses, the target of problem is adjusted hot charging ratio of maximization or the burst length that maximizes continuous cold charge/hot charging, and the technological procedure constraint is more.These two problems all belong to the combinatorial optimization problem that has complicated constraint, can set up corresponding integer programming model.

Rolling scaduled order the institute might arrange can Individual (n is a slab quantity), owing to do not break original rolling scaduled in the rolling scaduled order adjustment process, what mainly change after the adjustment is exactly the rolling time of slab, so most technological procedures all needn't be checked in the process of algorithm search, after obtaining a new rolling scaduled sequence, only need the break time and the rolling time of check slab whether to mate.The constraint that problem will satisfy is handled relatively easily, and simulated annealing is adopted in the algorithm for design decision.This algorithm has had the model of comparative maturity, and comparatively successful application is arranged on combinatorial optimization problem.

Rolling scaduled material is adjusted the problem relative complex, comprises in possible adjustment mode: from certain rolling scaduled deletion slab and the slab of deleting inserted change mutually in other rolling scaduled, with the slab position in rolling scaduled and the position adjustment in whole continuous cold charge/hot charging interval etc.Algorithm requires to realize the requirement of these several adjustment modes respectively, and these adjustment modes can be carried out suitable combination.The algorithm for design decision is adopted and is become the neighborhood search algorithm, and this algorithm is realized these adjustment modes by setting the corresponding different adjustment mode of different neighbour structures in the neighborhood search process.Owing to broken original rolling scaduledly in adjusting, become the neighborhood search algorithm and need differentiate in violation of rules and regulations with technology and combine application.

This inventive method is very easy to staff planners' scheduling work, and staff planners are freed from numerous and diverse artificial planning.This method provides the solution of a total optimization simultaneously, and hot rolling scaduled optimal design is had huge realistic meaning.

Further specify the present invention below in conjunction with drawings and Examples.

Description of drawings

Fig. 1 optimizes process flow diagram for rolling scaduled sequence;

Fig. 2 is that rolling scaduled order is adjusted flow process;

Fig. 3 is that rolling scaduled slab is adjusted flow process.

Embodiment

A kind of method of optimizing hot rolling scaduled sequence, realize in two steps: at first being rolling scaduled order adjustment, is the sequencing of least unit plan for adjustment with rolling scaduled, does not relate to the change of the inner material of plan; Carry out rolling scaduled material adjustment then on the basis of rolling scaduled order adjustment, this step is whole to be unit with the slab, only relates to the change of rolling scaduled inside and rolling scaduled 's material.

The overall principle of rolling scaduled sequence optimization is to do limited adjustment on the basis of the rolling scaduled unit of determining, does not do large-scale adjustment.If violate the intermediate solution of process rule, general strategy is abandoned it exactly, and does not do the adjustment at rule in the algorithm search process.Rolling scaduled sequence is optimized process flow diagram as shown in Figure 1.

(1) rolling scaduled order adjustment

Rolling scaduled order adjustment be a complexity be the factorial level (O (n! )) combinatorial optimization problem, can not solve with the method in traversal search space.Find the solution employing simulated annealing, simulated annealing is a kind of intelligent algorithm of comparative maturity, is applicable to the combinatorial optimization problem that the search volume is very big.In order to improve the performance of algorithm, in algorithm, add the data structure of a taboo table, keep several the separating of search recently.

The form of expression of separating of rolling scaduled order adjustment model is a sequence of rolling scaduled number, determines that with rolling scaduled order the corresponding hot charging in back is than weighing the quality of separating.

Model description:

$\max \frac{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{C}_{\mathrm{fi}}}{n}---\left(1\right)$

$\min \underset{i=1}{\overset{n}{\mathrm{\Σ}}}(t_{\mathrm{ri}}-t_{\mathrm{ci}})---\left(2\right)$

s.t. t _ri≥t _ci+T i∈{1，2，A，n} (3)

The total quantity of n slab wherein;

C _FiThe hot charging of i piece slab than mark (i=1,2 ..., n), 1 is hot charging, 0 is cold charge;

t _RiThe rolling time of i piece slab;

t _CiThe break time of i piece slab;

The T continuous casting is put the time to the biography of hot rolling.

The optimization aim of formula (1), the rolling scaduled order adjustment of formula (2) expression is adjusted hot charging ratio of maximization and the total residence time in the slab storehouse that minimizes all slabs.This is a multiple goal combinatorial optimization problem, and two targets have different priority, judges that in the algorithm operational process quality of feasible solution uses the value of formula (1), formula (2) to come comparison successively.The requirement that the rolling scaduled order adjustment of formula (3) expression must be observed break time and rolling time coupling, the rolling time of slab must be not less than break time and biography is put the time sum.Because it is original rolling scaduled that rolling scaduled order adjustment does not destroy, so need not to consider the technological procedure constraint in the optimizing process.

Solution procedure:

Rolling scaduled order adjustment model is separated a sequence of rolling scaduled number, with rolling scaduled order determine the corresponding hot charging in back than and the slab quality of separating in storehouse total residence time evaluation.

Solution procedure:

1) provides rolling scaduled order initial solution X0, with annealing temperature initial value T0, threshold value Tmin, annealing temperature drop coefficient α, calculate with the corresponding hot charging of X0 than R0 and slab at storehouse total residence time t, set up the empty array T1 of one dimension and show, make optimum solution Xbest=X0 as taboo, annealing temperature T=T0 upgrades the taboo table with T0;

2) 1 X of picked at random in the neighborhood of X0;

3) judge that X whether in T1, if X was relayed to for the 2nd step at T1, if X upgrades T1 with X not in T1, forwards 4 to then);

4) judge the time coupling (formula (3)) of X, if satisfy hot charging that the time coupling requires to calculate X than R and slab in the storehouse total residence time and forward 5 to), directly do not forward 2 to if match);

5) judge whether X is better than X0,, judge whether X is better than Xbest, make Xbest=X and forward 7 to if X is better than Xbest if X is better than X0), directly do not forward 7 to if X is not better than Xbest); If X is not better than X0, forward 6 to);

6) probability of acceptance of computational solution

Generate random number rand ∈ [0,1], if P 〉=rand forwards 7 to), otherwise forward 2 to);

7) make X0=X, R0=R, T=T* α

8) judge whether to reach the algorithm stop condition,, provide Xbest) as finally separating, if not forwarding 2 to if stop.Rolling scaduled order is adjusted flow process as shown in Figure 2.

Illustrate:

Neighbour structure: scope and the relationship between efficiency of separating the neighbour structure setting of X and algorithm search are very big, here neighbour structure is set at arbitrarily selected two set that the rolling scaduled all possible rolling scaduled sequences that its order exchange is formed are formed, and separates that into picked at random two are rolling scaduled to exchange its order for one of picked at random in this neighborhood.

Initial solution: initial solution can adopt heuritic approach to generate, the summation that adds up the break time that each is rolling scaduled, with rolling scaduled according to break time and series arrangement from small to large, as the initial solution of rolling scaduled order adjustment.What also rolling scaduled establishment can be formed is rolling scaduled as initial solution.

The acceptance probability of separating: though the validity of simulated annealing be embodied in algorithm search to feasible solution be inferior to current separating, algorithm will be accepted it according to certain probability and separate as current.This mechanism makes simulated annealing have to jump out the ability of locally optimal solution.Acceptance probability is relevant with annealing temperature with the hot charging ratio of separating in this algorithm, along with this probability of running time of algorithm reduces gradually.

(2) rolling scaduled material order is adjusted

The material adjustment is to carry out under the prerequisite that rolling scaduled order adjustment has been finished, and is that unit adjusts order and position with the slab in rolling scaduled, mainly is rolling scaduled slab position adjustment.Target is to reduce cold and hot base to load in mixture number of times as far as possible, improves the quantity of continuous cold base, Continuous Heat base.

The goal-setting of material adjustment model is the slab number that minimizes continuum number and the maximum continuum of maximization; The constraint condition that will satisfy in the adjustment process is that technological procedure constraint and rolling time---mate break time.

According to the continuum indefinite length, material should allow the characteristics of monolithic slab or whole continuum shift position when adjusting, need to set the adjustment effect that reaches different by different neighborhoods in the search procedure of algorithm.Adopt to become the neighborhood search algorithm, this algorithm is set multiple neighbour structure, is used for the different material of respective material adjustment and moves or the exchange state.

The form of expression of separating of rolling scaduled material adjustment model is carries out adjusted rolling scaduled sequence, the quality of separating is differentiated according to the order of continuum number, maximum continuum slab number relatively, the number of more maximum continuum again under the two situation about all equating.

Adopt three kinds of neighbour structures: single slab inserts, slab exchanges, the continuum exchange.

Model description:

$\max \frac{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{C}_{\mathrm{fi}}}{n}---\left(4\right)$

$\min \underset{i=1}{\overset{n}{\mathrm{\Σ}}}(t_{\mathrm{ri}}-t_{\mathrm{ci}})---\left(5\right)$

s.t. t _ri≥t _ci+T (6)

Adjacent slab maximum rolling width jump value constraint (7)

Adjacent slab maximum rolling thickness jump value constraint (8)

Adjacent slab highest hardness jump value constraint (9)

$\begin{array}{ccc}s.t.& \underset{k=1}{\overset{m}{\mathrm{\Σ}}}{y}_{\mathrm{ik}}=1& i=\mathrm{1,2,3},\mathrm{\Λ},n---\left(10\right)\end{array}$

$\begin{array}{ccc}\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{z}_{\mathrm{ijk}}{q}_j{y}_{\mathrm{jk}}\≤A& k=\mathrm{1,2,3},...,m,& i=\mathrm{1,2},...,n_{\mathrm{zk}}---\left(11\right)\end{array}$

$\begin{array}{ccc}{\mathrm{BMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{B}_{\mathrm{ijk}}{q}_j{y}_{\mathrm{jk}}\≤{\mathrm{BMax}}_j& k=\mathrm{1,2,3},...,m,& i=\mathrm{1,2},...,n_{\mathrm{zk}}---\left(12\right)\end{array}$

$\begin{array}{ccc}{\mathrm{GMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{G_{\mathrm{ijk}}q}_j{y}_{\mathrm{jk}}\≤{\mathrm{GMax}}_j& k=\mathrm{1,2,3},...,m,& i=\mathrm{1,2},...,n_{\mathrm{zk}}---\left(13\right)\end{array}$

$\begin{array}{ccc}{\mathrm{TMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{T_{\mathrm{ijk}}q}_j{y}_{\mathrm{jk}}\≤{\mathrm{TMax}}_j& k=\mathrm{1,2,3},...,m,& i=\mathrm{1,2},...,n_{\mathrm{zk}}---\left(14\right)\end{array}$

$\begin{array}{ccc}{\mathrm{LMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{L_{\mathrm{ijk}}w}_j{y}_{\mathrm{jk}}\≤{\mathrm{LMax}}_j& k=\mathrm{1,2,3},...,m,& i=\mathrm{1,2},...,n_{\mathrm{zk}}---\left(15\right)\end{array}$

The total quantity of n slab wherein;

C _FiThe hot charging of i piece slab than mark (i=1,2 ..., n) 1 is hot charging, 0 is cold charge;

t _RiThe rolling time of i piece slab;

t _CiThe break time of i piece slab;

The T continuous casting is put the time to the biography of hot rolling.

The rolling scaduled number of m

n _ZkMain body material slab number in the rolling scaduled k;

q _jThe mill length of slab j;

w _jThe weight of slab j;

The rolling length constraint of A with the width slab;

BMin _j, BMax _jThe length constraint of rolling slab with surface grade

GMin _j, GMax _jThe length constraint of rolling slab with steel grade

TMin _j, TMax _jThe length constraint of rolling slab with cold and hot base type

LMin _j, LMax _jRolling weight constraints with the slab that flows to

The optimization aim of formula (4), the rolling scaduled material adjustment of formula (5) expression is respectively the adjusted hot charging ratio of maximization and minimizes the total residence time in the slab storehouse of all slabs.This is a combinatorial optimization problem, and two targets have different priority, judges that in the algorithm operational process quality of feasible solution uses the value of formula (4), formula (5) to come comparison successively.The rolling scaduled material adjustment of formula (6) expression also needs to satisfy the coupling of break time and rolling time, and formula (7)-(15) the rolling scaduled material adjustment of expression need be satisfied the constraint of all production technology rules.

Solution procedure

The form of expression of separating of rolling scaduled material adjustment model is rolling scaduled sequence, and the quality differentiation of separating is always compared in the order of the storehouse residence time (formula (5)) than (formula (4)), slab according to hot charging.

Adopt three kinds of neighbour structures: single slab inserts, slab exchanges, the continuum exchange.

Solution procedure

1) initialization procedure: the Nk that determines in the algorithm to use (k=1,2 ..., kmax) plant neighbour structure; Determine initial solution x; Set up historical optimum solution P, upgrade P with x;

2) make k=1, the iterative process of beginning algorithm;

3) 1 x ' of picked at random in the k class neighborhood of x;

4) judge that whether x ' satisfies the rules constraint, does not forward 3 to if do not satisfy), continue execution in step 5 if satisfy);

5) be better than x if satisfy x ', make x=x ' forward 3 then to) with x ' renewal P;

6) judge whether to satisfy k=kmax,, then make k=1, forward 3 to) if k has reached maximal value; If reaching maximal value, k do not forward 7 to);

7) judge whether to satisfy stop condition, stop, export historical optimum solution P, do not make k=k+1 forward 3 to) if do not satisfy if satisfy algorithm.

Rolling scaduled slab is adjusted flow process as shown in Figure 3.

Illustrate:

Neighborhood is set: adopt three kinds of neighbour structures---slab insertion, slab place-exchange and continuum exchange.Wherein the slab insertion is to select a certain block of slab to insert assigned address, and the slab place-exchange is the location swap with the two boards base of appointment, and the continuum exchange is the location swap with two continuums of appointment.

Rules constraint qualification: for the adjusted rolling scaduled rules verification (mostly be most two rolling scaduled) of doing, check the situation that satisfies of rule successively, violate situation and just be judged to be and do not satisfy rule constrain as long as rules occur according to formula (7)-(15).In algorithm is realized in order to improve the operational efficiency of algorithm, the rules check divides two parts to carry out, and retrains the rules (hop limit of rolling width, rolling thickness, rolling hardness, temperature etc.) that must observe between the rolling scaduled middle slab and is carrying out mobile (insertion, exchange, the exchange of polylith slab) preceding testing of slab; Carry out the slab move operation again under the prerequisite of the constraint more than satisfying, carry out other technological procedure checks then.

Upgrade historical optimum solution: after obtaining an intermediate solution in the algorithm, itself and historical optimum solution are made comparisons, keep a more excellent historical optimum solution of conduct.

The sign continuum: judge successively each rolling scaduled in the cold and hot dress state of each slab, the slab of cold charge or hot charging distributes same unique continuum identification number continuously, identifies the sequence number of slab in continuum simultaneously.

Claims (3)

1. a method of optimizing hot rolling scaduled sequence comprises rolling scaduled order adjustment and rolling scaduled material order adjustment two big steps successively, and described rolling scaduled order set-up procedure adopts simulated annealing to change rolling scaduled precedence; Described rolling scaduled material order set-up procedure adopts and becomes the neighborhood search algorithm, it comprise change each rolling scaduled in main body material order of partly processing and rolling scaduled between interpolation, deletion, the place-exchange adjustment of main body material; Described rolling scaduled order set-up procedure comprises sets up first model, it separates the sequence into rolling scaduled number, determine the quality that corresponding hot charging ratio in back and slab are separated in storehouse total residence time evaluation with rolling scaduled order, in the simulated annealing of described rolling scaduled order set-up procedure, have additional the data structure of a taboo table, separate to keep the several of nearest search; Described rolling scaduled material order set-up procedure comprises sets up second model, is that unit adjusts order and position with the slab in rolling scaduled; Adopt and become three kinds of neighbour structures of neighborhood search algorithm setting: single slab inserts, slab exchanges, the continuum exchange;

Described first model comprises following formula:

$\max =\frac{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{C}_{\mathrm{fi}}}{n}---\left(1\right)$

$\min \underset{i=1}{\overset{n}{\mathrm{\Σ}}}(t_{\mathrm{ri}}-t_{\mathrm{ci}})---\left(2\right)$

s.t. t _ri≥t _ci+T i∈{1，2，…，n} (3)

The total quantity of n slab wherein;

C _FiThe hot charging of i piece slab is than mark, i=1 wherein, and 2 ..., n; 1 is hot charging, and 0 is cold charge;

t _RiThe rolling time of i piece slab;

t _CiThe break time of i piece slab;

The T continuous casting is put the time to the biography of hot rolling;

The optimization aim of formula (1), the rolling scaduled order adjustment of formula (2) expression is adjusted hot charging ratio of maximization and the total residence time in the slab storehouse that minimizes all slabs; The quality of judging feasible solution in the algorithm operational process uses the value of formula (1), formula (2) to come comparison successively; The rolling scaduled order adjustment of formula (3) expression must be observed the requirement that break time and rolling time mate, and promptly the rolling time of slab must be not less than break time and biography is put the time sum;

Concrete solution procedure is:

1) provides rolling scaduled order initial solution X0, with annealing temperature initial value T0, threshold value Tmin, annealing temperature drop coefficient α, calculate with the corresponding hot charging of X0 than R0 and slab at storehouse total residence time t, set up the empty array T1 of one dimension and show, make optimum solution Xbest=X0 as taboo, annealing temperature T=T0 upgrades the taboo table with T0;

2) 1 X of picked at random in the neighborhood of X0;

3) judge that X is whether in T1, if X is relayed to the 2nd at T1) step, if X upgrades T1 with X not in T1, forward 4 then to);

4) application of formula (3) is judged the time coupling of X, if satisfy hot charging that the time coupling requires to calculate X than R and slab in the storehouse total residence time and forward 5 to), directly do not forward 2 to if match);

5) judge whether X is better than X0,, judge whether X is better than Xbest, make Xbest=X and forward 7 to if X is better than Xbest if X is better than X0), directly do not forward 7 to if X is not better than Xbest); If X is not better than X0, forward 6 to);

6) probability of acceptance of computational solution

Generate random number rand ∈ [0,1], if P 〉=rand forwards 7 to), otherwise forward 2 to);

7) make X0=X, R0=R, T=T* α;

8) judge whether to reach the algorithm stop condition,, provide Xbest) as finally separating, if not forwarding 2 to if stop; The neighbour structure of separating X is set at selected arbitrarily two set that the rolling scaduled all possible rolling scaduled sequences that its order exchange is formed are formed, and separates that into picked at random two are rolling scaduled to exchange its order for one of picked at random in this neighborhood; Initial solution adopts heuritic approach to generate, summation adds up the break time that each is rolling scaduled, according to break time and series arrangement from small to large, as the initial solution that rolling scaduled order is adjusted, what perhaps rolling scaduled establishment is formed is rolling scaduled as initial solution with rolling scaduled;

Described second model comprises following formula:

$\max \frac{\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{C}_{\mathrm{fi}}}{n}---\left(4\right)$

$\min \underset{i=1}{\overset{n}{\mathrm{\Σ}}}(t_{\mathrm{ri}}-t_{\mathrm{ci}})---\left(5\right)$

s.t. t _ri≥t _ci+T (6)

Adjacent slab maximum rolling width jump value constraint (7)

Adjacent slab maximum rolling thickness jump value constraint (8)

Adjacent slab highest hardness jump value constraint (9)

s.t. $\underset{k=1}{\overset{m}{\mathrm{\Σ}}}{y}_{\mathrm{ik}}=1$ i＝1，2，3，…，n (10)

$\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{z}_{\mathrm{ijk}}{q}_j{y}_{\mathrm{jk}}\≤A$ k＝1，2，3，...，m，i＝1，2，...，n _zk (11)

${\mathrm{BMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{B}_{\mathrm{ijk}}{q}_j{y}_{\mathrm{jk}}\≤{\mathrm{BMax}}_j$ k＝1，2，3，...，m，i＝1，2，...，n _zk (12)

${\mathrm{GMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{G}_{\mathrm{ijk}}{q}_j{y}_{\mathrm{jk}}\≤{\mathrm{GMax}}_j$ k＝1，2，3，...，m，i＝1，2，...，n _zk (13)

${\mathrm{TMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{T}_{\mathrm{ijk}}{q}_j{y}_{\mathrm{jk}}\≤{\mathrm{TMax}}_j$ k＝1，2，3，...，m，i＝1，2，...，n _zk (14)

${\mathrm{LMin}}_j\≤\underset{j=1}{\overset{n_{\mathrm{zk}}}{\mathrm{\Σ}}}{L}_{\mathrm{ijk}}{w}_j{y}_{\mathrm{jk}}\≤{\mathrm{LMax}}_j$ k＝1，2，3，...，m，i＝1，2，...，n _zk (15)

The total quantity of n slab wherein;

C _FiThe hot charging of i piece slab is than mark, i=1 wherein, and 2 ..., n; 1 is hot charging, and 0 is cold charge;

t _RiThe rolling time of i piece slab;

t _CiThe break time of i piece slab;

The T continuous casting is put the time to the biography of hot rolling;

The rolling scaduled number of m;

n _ZkMain body material slab number in the rolling scaduled k;

q _jThe mill length of slab j;

w _jThe weight of slab j;

The rolling length constraint of A with the width slab;

BMin _j, BMax _jThe length constraint of rolling slab with surface grade

GMin _j, GMax _jThe length constraint of rolling slab with steel grade

TMin _j, TMax _jThe length constraint of rolling slab with cold and hot base type

LMin _j, LMax _jRolling weight constraints with the slab that flows to

The optimization aim of formula (4), the adjustment of the rolling scaduled material order of formula (5) expression is respectively the adjusted hot charging ratio of maximization and minimizes the total residence time in the slab storehouse of all slabs; Two targets have different priority, judge that in the algorithm operational process quality of feasible solution uses the value of formula (4), formula (5) to come comparison successively; The rolling scaduled material adjustment of formula (6) expression also needs to satisfy the coupling of break time and rolling time, and the adjustment of the rolling scaduled material order of formula (7)-(15) expression need be satisfied the constraint of all production technology rules;

Concrete solution procedure is:

A) initialization procedure: determine in the algorithm the Nk kind neighbour structure of using, k=1 wherein, 2 ..., kmax; Determine initial solution x; Set up historical optimum solution P, upgrade P with x;

B) make k=1, the iterative process of beginning algorithm;

C) 1 x ' of picked at random in the k class neighborhood of x;

D) judge that whether x ' satisfies the constraint of production technology rules, does not forward c to if do not satisfy), continue execution in step e if satisfy);

E) be better than x if satisfy x ', make x=x ' forward c then to) with x ' renewal P; Otherwise, continue execution in step f);

F) judge whether to satisfy k=kmax,, then make k=1, forward c to) if k has reached maximal value; If reaching maximal value, k do not forward g to);

G) judge whether to satisfy stop condition, stop, export historical optimum solution P, do not make k=k+1 forward c to) if do not satisfy if satisfy algorithm.

2. a kind of method of optimizing hot rolling scaduled sequence according to claim 1, it is characterized in that: for the adjusted rolling scaduled production technology rules verification of doing, check the situation that satisfies of production technology rules successively according to formula (7)-(15), violate situation and just be judged to be and do not satisfy the constraint of production technology rules as long as production technology rules occur.

3. a kind of method of optimizing hot rolling scaduled sequence according to claim 2, it is characterized in that: the verification of described production technology rules divides two parts to carry out, retrain rolling width, rolling thickness, the rolling hardness that to observe between the slab in rolling scaduled, before carrying out the moving of slab, test; Carry out the slab move operation again under the prerequisite of the constraint more than satisfying, carry out other technological procedure checks then.

Images