CN101751621A - Recovering method for disturbed route of carrying tool - Google Patents

Abstract

The invention discloses a recovering method for disturbed route of carrying tool which is as follows: 1, forming the route pair of neighbourhood carrying tools; 2, adopting an optimization method to select a proper route pair of carrying tools. The recovering method for disturbed route of carrying tool adopts a local amendment method, which only changes a plurality of routes of the carrying tools in the whole conveying system. The recovering method for disturbed route of carrying tool has the advantages of quick speed, high precision and strong maneuverability, can obtain a plurality of more optimal receiving schemes in a plurality of minutes, which can completely meet the requirement of real-time decision of conveying enterprises, and is effective to the situations of a plurality of carrying tools, large carrying task as well as being heavily disturbed in particular.

Description

Recovering method for disturbed route of carrying tool

Technical field

The present invention relates to a kind of recovering method for disturbed route of carrying tool, be used to solve disturbed route of carrying tool and recover problem, produce the movement plan recovery scheme, belong to movement plan recovery technology field.

Background technology

At present in the implementation of movement plan, when running into reasons such as apparatus of transport temporary derangement, traffic route flow control, transportation base Temporarily Closed, movement plan can't normally be carried out, and the operation control personnel of transport enterprise generally adjust movement plan by manual method.

The essence of adjusting movement plan is to assign apparatus of transport and driver and crew again for all still uncompleted transport tasks.Because apparatus of transport is the most rare controlled source of raising wages of transport enterprise, therefore adjusting movement plan at first is the running route that recovers apparatus of transport.The adjustment strategy comprises: the transposing of the cancellation of transport task, the delay of transport task, apparatus of transport, the merging of transport task and the class of benefit etc.Because the technical conditions complexity that transport task relates to, continuous expansion along with transport enterprise's scale, the apparatus of transport One's name is legion, range of operation is extensive, transport task quantity is many, time span is long, significance level is different, therefore manual type is difficult in and considers various factors in the global scope, formulates optimum recovery plan.In the real work, transport enterprise will transport control personnel grouping, and each group is responsible for the operation control of apparatus of transport in certain hour, the spatial dimension.Operation control personnel only recover the undesired transport task that runs in its range of management.Under such administrative mechanism, each control group is only considered local interest, and the recovery that work out early stage plans to cause bigger difficulty to the execution of follow-up transport task, and follow-up transport task may be had to long-time the delay even cancellation.Bring transport enterprise's operation cost significantly to rise thus, passenger or goods delay time at stop increase, and customer satisfaction descends.

Developed country's (mainly being the U.S.) owing to following reason, needs research and development to have the apparatus of transport recovery technology and the decision support system (DSS) of China's independent intellectual property right although had the aircraft route to recover the computer decision-making back-up system in the air transportation field:

1, this system very expensive (buy and take more than ten million yuan, annual maintenance expense is about 2,000,000 yuan).

2, because national conditions and market different, this system is not exclusively suitable in China.

3, because technical sophistication is grasped difficulty, China is still blank in this technical field.

Summary of the invention

Technical matters: the present invention seeks to provides a kind of movement plan recovery scheme that optimization is provided at the defective that prior art exists, and reduces the transportation cost of transport enterprise, reduces passenger or the recovering method for disturbed route of carrying tool of freight transportation delay time at stop.

Technical scheme: the present invention adopts following technical scheme for achieving the above object:

Recovering method for disturbed route of carrying tool of the present invention is characterized in that comprising the steps:

Steps A: read in the data of the apparatus of transport route of system, the data of apparatus of transport route are made of apparatus of transport and transport task string;

Step B: form initial apparatus of transport route recovery scheme by the method that postpones;

Step C: determine to surpass curfew apparatus of transport route formation constantly;

Step D: structure neighborhood apparatus of transport route is right;

Step e: neighborhood apparatus of transport route is set out constantly and the expectation due in to recomputating the transport task expectation;

Step F: check neighborhood apparatus of transport route to whether meeting the technological constraint restriction, it is right that the neighborhood apparatus of transport route of constrained is not satisfied in deletion;

Step G: the desired value incremental computations that neighborhood apparatus of transport route is right: store in alternative pond or the alternative pond of negative value according to the positive and negative of desired value increment;

Step H: the right selection of candidate's neighborhood apparatus of transport route: right from the neighborhood apparatus of transport route of on the occasion of alternative pond or the alternative pond of negative value, selecting some, deposit candidate's neighborhood apparatus of transport route in in the tabulation;

Step I: make up new apparatus of transport route recovery scheme: replace corresponding apparatus of transport route in the former scheme with the apparatus of transport route of neighborhood apparatus of transport route centering, obtain new movement plan, as the initial apparatus of transport route recovery scheme of next iteration;

Step J: call the condition that the apparatus of transport route flows uneven module if the new apparatus of transport route recovery scheme that produces satisfies, go to step K, otherwise go to step L;

Step K: flow uneven processing module: through the several times iteration, in the time of still can not obtaining a feasible apparatus of transport route recovery scheme, the apparatus of transport route of super curfew is taked to flow uneven the processing operate, go to step L;

Step L: estimate the new apparatus of transport route recovery scheme that produces, and store in the recovery scheme tabulation, go to step M;

Step M: judge whether system reaches end condition, goes to step N if reach, otherwise go to step C;

Step N: output recovery scheme: a plurality of recovery scheme outputs that will in calculating process, store.

Beneficial effect: the beneficial effect of recovering method for disturbed route of carrying tool provided by the invention is: the operational efficiency height of algorithm, be example for example with air transportation enterprise, large aircraft for 800 flights of 200 airplanes recovers problem, the time of generally finding the solution has fully been satisfied airline's requirement of decision-making in real time in 5 minutes; Algorithm optimization is effective, recovers problem for 800 flights of 200 airplanes with interior undesired flight aircraft route, generally can reduce total aircraft delay cost 14-19%; Practicality is strong, and 5 more excellent (satisfaction) aircraft route recovery schemes can be provided, and for fortune control personnel selection, these schemes are less to the disturbance of former flight planning, is easy to airline and carries out unit recovery and passenger's recovery; The reliability height, no matter how complicated and huge apparatus of transport route recovers problem, total energy provides (being feasible at least) recovery scheme of optimization within a short period of time.

Description of drawings

Fig. 1: the inventive method process flow diagram.

Fig. 2: carrying route exemplary plot.

Fig. 3: neighborhood carrying route exemplary plot.

Embodiment

Be elaborated below in conjunction with the technical scheme of accompanying drawing to invention:

Apparatus of transport route restoration methods of the present invention is optimized modeling technique according to systems engineering, adopts computer software technology and network technology, data communication technology, provides a cover complete route recovery scheme.Comprise the right memory technology of formation method, the neighborhood apparatus of transport route of initial recovery plan right formation technology, neighborhood apparatus of transport route right constraint check method, neighborhood apparatus of transport route, utilize greedy stochastic search methods and simulated annealing method treatment technology the right optimization technique of apparatus of transport route, the uneven apparatus of transport route of stream.

The uneven apparatus of transport route of so-called stream is meant and can't realizes that movement plan reaches in the original plan in the needed apparatus of transport quantity of each website when finishing by the reconstruct of apparatus of transport route.This stream imbalance is congested by long apparatus of transport fault, haulage track often, website is closed caused.Can farthest reduce of the influence of apparatus of transport imbalance by flowing uneven processing to the movement plan of following one-period.

Mathematical model: according to systematic approach, produce actual needs, set up the Optimization Model of apparatus of transport route recovery problem in conjunction with transportation.This model is to incur loss through delay cost minimum etc. as objective function:

The symbol definition of using in the model is as follows:

Set:

F: the transport task set in the original plan;

P: feasible apparatus of transport route set;

Q: available apparatus of transport set;

T: apparatus of transport type set;

S: transportation base set.

Subscript:

I: transport task subscript, i ∈ F;

J: apparatus of transport route subscript, j ∈ P;

K: apparatus of transport label, k ∈ Q;

T: transportation base label, t ∈ S;

N, apparatus of transport type label.

Parameter:

a _Ij: if transport task i then equals 1 in apparatus of transport route j, otherwise equals 0;

b _Jt: if the website that runs abort that apparatus of transport route j is last is t, then equals 1, otherwise equals 0;

c _i: the cancellation cost of transport task i;

g _n ^k: if the type of apparatus of transport k is n, then is 1, otherwise is 0;

u _i ^k: the delay cost that apparatus of transport k is assigned to transport task i;

v _i ^k: apparatus of transport k replaces the apparatus of transport exchange cost of apparatus of transport i;

m _i ^k: whether the employed apparatus of transport type of transport task i changes, and changes into 1, otherwise is 0;

Com _i: the fringe cost (being integrated into the delay cost of subsequent transportation task) that is merged transport task i;

N: do not satisfy the penalty coefficient of apparatus of transport mobile equilibrium, can set by transportation operation control center;

h _t ⁿ: require transportation base t to park the apparatus of transport quantity that the apparatus of transport type is n when finished the same day;

N (j): the performed transport task number of j bar apparatus of transport route;

F _{J, s} ^Departure: if the website that sets out of s transport task of j bar apparatus of transport route is departure, then be 1; Otherwise be 0;

F _{J, s} ^Arrival: if the arrival website of s transport task of j bar apparatus of transport route is arrival, then be 1; Otherwise be 0;

F _{J, s} ^ETD: the expectation of s transport task of j bar apparatus of transport route is set out constantly;

F _{J, s} ^STD: the plan of s transport task of j bar apparatus of transport route is set out constantly;

F _{J, s} ^ETA: the expectation due in of s transport task of j bar apparatus of transport route;

F _{J, s} ^STA: the plan due in of s transport task of j bar apparatus of transport route;

TR _j ^k: the minimum of apparatus of transport k when carrying out apparatus of transport route j missed the stop the time;

T _j ^k: the earliest ready moment of apparatus of transport k when carrying out apparatus of transport route j;

l _n ^k: if the type of apparatus of transport k and type n are commutative, then equal 1, otherwise equal 0;

h _t ⁿ: convalescence is when finishing, for carrying out the apparatus of transport number that the plan website t of normal transport class apparatus of transport type n needs.

Decision variable:

x _j ^kIf: apparatus of transport k is assigned to apparatus of transport route j, then equals 1, otherwise be 0;

z _i: if transport task i is merged, and then equals 1, otherwise equals 0;

δ _t ⁿ: if in website t apparatus of transport type is the satisfied quantitative requirement of stopping the field of apparatus of transport of n, then equals 0, otherwise equals 1;

y _i: if transport task i is cancelled, and then equals 1, otherwise is 0.

According to above definition, when structure apparatus of transport route, at first must satisfy suc as formula (1)--the apparatus of transport route space-time convergence condition of (3):

$\begin{array}{cc}{F}_{j,s}^{\mathrm{arrival}}=F_{j,s+1}^{\mathrm{departure}}& \∀j\∈P,s\∈\{\mathrm{1,2},...N\left(j\right)\}---\end{array}\left(1\right)$

$\begin{array}{cc}{F}_{j,s}^{\mathrm{ETA}}+{\mathrm{TR}}_j^k\≤F_{j,s+1}^{\mathrm{ETD}}& \∀j\∈P,s\∈\{\mathrm{1,2},...N\left(j\right)\}---\left(2\right)\end{array}$

$\begin{array}{cc}{F}_{j,1}^{\mathrm{ETD}}\≤T_j^k& \∀j\∈P,s\∈\{\mathrm{1,2},...N\left(j\right)\}---\left(3\right)\end{array}$

$\begin{array}{cc}{F}_{j,s}^{\mathrm{ETD}}\≥F_{j,s}^{\mathrm{STD}}& \∀j\∈P,s\∈\{\mathrm{1,2},...N\left(j\right)\}---\left(4\right)\end{array}$

Secondly, the mathematical model of structure apparatus of transport route recovery problem is suc as formula shown in (5)-(11):

$\min [\underset{k\∈Q}{\mathrm{\Σ}}\underset{j\∈P}{\mathrm{\Σ}}\underset{i\∈F}{\mathrm{\Σ}}(u_i^k{x}_j^k{a}_{\mathrm{ij}}+v_i^k{x}_j^k{m}_i^k{a}_{\mathrm{ij}})+\underset{i\∈F}{\mathrm{\Σ}}{c}_i{y}_i+\underset{t\∈S}{\mathrm{\Σ}}\underset{n\∈T}{\mathrm{\Σ}}N{\mathrm{\δ}}_t^n+(\underset{i\∈F}{\mathrm{\Σ}}{\mathrm{com}}_i{z}_i-\underset{i\∈F}{\mathrm{\Σ}}{c}_i{z}_i)]---\left(5\right)$

$\begin{array}{cc}s.t.\underset{k\∈Q}{\mathrm{\Σ}}\underset{j\∈P}{\mathrm{\Σ}}{a}_{\mathrm{ij}}{x}_j^k+y_i=1& \∀i\∈F---\left(6\right)\end{array}$

$\begin{array}{cc}{\mathrm{\δ}}_t^n\≤|h_t^n-\underset{k\∈Q}{\mathrm{\Σ}}\underset{j\∈P}{\mathrm{\Σ}}{b}_{\mathrm{jt}}{x}_j^k{g}_n^k|& \∀t\∈S,\∀n\∈T---\left(7\right)\end{array}$

$\begin{array}{cc}({\mathrm{\δ}}_t^n-1)|h_t^n-\underset{k\∈Q}{\mathrm{\Σ}}\underset{j\∈P}{\mathrm{\Σ}}{b}_{\mathrm{jt}}{x}_j^k{g}_n^k|\≥0& \∀t\∈S,\∀n\∈T---\left(8\right)\end{array}$

$\begin{array}{cc}\underset{j\∈P}{\mathrm{\Σ}}\underset{n\∈T}{\mathrm{\Σ}}{x}_j^k{l}_n^k\≤1& \∀k\∈Q---\left(9\right)\end{array}$

$\begin{array}{cc}\left\{i\right|z_i=1\}\⋐\{i|y_i=1\}& \∀i\∈F---\left(10\right)\end{array}$

$x_j^k,y_i,z_i,{\mathrm{\δ}}_t^n\∈\left\{\mathrm{0,1}\right\},\∀k\∈Q,\∀j\∈P,\∀i\∈F,\∀t\∈S,\∀n\∈T---\left(11\right)$

Formula (5) is an objective function, has considered apparatus of transport stream unbalanced factor and merged transport task strategy total aircraft delay cost afterwards to be made of four parts: first is to incur loss through delay cost and exchange cost; Second cancellation cost; The 3rd is the unbalanced punishment cost of stream; The the 4th and the 5th is that the transport task that is cancelled of part is merged to cost on the subsequent transportation task, because second as calculated the cancellation cost, for fear of double counting, deduct the cost of cancellation earlier, add the extra cost that is integrated on the subsequent transportation task.

Formula (6) is that transport task covers constraint, and promptly all transport tasks all should have apparatus of transport to carry out.

Formula (7) and (8) are one group of constraints, and co expression allows apparatus of transport stream uneven.

Formula (9) is the aircraft utilization constraint, and an apparatus of transport can only be assigned to an apparatus of transport route at most.

Formula (10) is that transport task merges constraint, and merged transport task is the subclass of cancellation transport task set.

Formula (11) is the value constraint of variable.

Above-mentioned model is assigned to apparatus of transport to the transport task string, if assign after generating all feasible transport task strings, along with the increase of scale, task string number and the time of finding the solution are exponential growth again, can not satisfy transport enterprise's requirement of decision-making in real time.The present invention is directed to this problem and designed derivation algorithm efficiently.

Derivation algorithm: the method for solving of the present invention's design is divided into two processes:

Process 1 is that to construct neighborhood apparatus of transport route right, and process 2 is that to adopt optimization method to select appropriate apparatus of transport route right.Owing to comprising numerous apparatus of transport routes in a movement plan, consider that simultaneously the recovery of all apparatus of transport routes is very difficult, therefore adopt the method for local modification, promptly only change several apparatus of transport routes in the whole movement plan at every turn.Process 1 is to produce these routes, the method for employing be combined to form the apparatus of transport route to and to construct its all neighborhood apparatus of transport route right.Because the neighborhood apparatus of transport route of structure is to a lot, it is right therefrom to select the neighborhood apparatus of transport route that can effectively reduce objective function, is used for substituting the apparatus of transport route of former movement plan.Designed the right optimized choice method of neighborhood apparatus of transport route in the process 2, this method greedy method at random is harmonious with simulated annealing method, improves the efficient of computing on the one hand, has avoided being absorbed in locally optimal solution on the other hand again.Just can change part carrying instrument route in the former movement plan by finishing a process 1 with process 2.For progressively optimizing, need be on newly-generated scheme basis, repetitive process 1 and process 2 finally reach whole movement plan recovery and optimization.

The concrete derivation algorithm step of the present invention's design comprises (the algorithm general flow chart is seen Fig. 1):

Steps A: the input data of reading in system;

Step B: strategy forms initial apparatus of transport route recovery scheme by postponing;

Step C: determine to surpass curfew apparatus of transport route formation constantly;

Step D: structure neighborhood apparatus of transport route is right;

Step e: neighborhood apparatus of transport route is set out constantly and the expectation due in to recomputating the transport task expectation;

Step F: check neighborhood apparatus of transport route to whether meeting the technological constraint restriction, it is right that the neighborhood apparatus of transport route of constraint condition is not satisfied in deletion;

Step G: the desired value incremental computations that neighborhood apparatus of transport route is right, store in alternative pond or the alternative pond of negative value according to the positive and negative of desired value increment;

Step H: the right selection of candidate's neighborhood apparatus of transport route: right from the neighborhood apparatus of transport route of on the occasion of alternative pond or the alternative pond of negative value, selecting some, deposit candidate's neighborhood apparatus of transport route in in the tabulation;

Step I: make up new apparatus of transport route recovery scheme: replace corresponding apparatus of transport route in the former scheme with the apparatus of transport route of neighborhood apparatus of transport route centering, obtain new movement plan, as the initial apparatus of transport route recovery scheme of next iteration;

Step J: call the condition that the apparatus of transport route flows uneven module if the new aircraft route recovery scheme that produces satisfies, go to step K, otherwise go to step L;

Step K: flow uneven processing module: through the several times iteration, in the time of still can not obtaining a feasible apparatus of transport route recovery scheme, the apparatus of transport route of super curfew is taked to flow uneven the processing operate, go to step L;

Step L: estimate the new apparatus of transport route recovery scheme that produces, and store in the recovery scheme tabulation, go to step M;

Step M: judge whether system reaches end condition, goes to step N if reach, otherwise go to step C;

Step N: output recovery scheme: a plurality of recovery scheme outputs that will in calculating process, store.

Above-mentioned steps B has comprised initially recovery plan formation method of the present invention, and concrete grammar is:

In movement plan, each apparatus of transport and the transport task carried out of order form an apparatus of transport route, under the situation that does not change the apparatus of transport route, utilize the ready moment of apparatus of transport and transportation base constantly the transportation base close moment in the file determine that transport task in the apparatus of transport route estimates to set out constantly and estimate due in;

Above-mentioned steps D neighborhood apparatus of transport route is to building method, finish by 6 kinds of apparatus of transport route reconstructed operations, concrete grammar can list of references [1] Michael F.A, Jonathan F.B.A Grasp for Aircraft Routing in Responseto Grounding and Delays[J] .Journal of Combinatorial Optimization, 1997,1 (3): 211-228;

Above-mentioned steps F has comprised the right constraint check method of neighborhood apparatus of transport route, and these are constrained to the restrictive condition that must consider in the actual shipment production, comprising:

Constraint F1: apparatus of transport operation constraint: check that whether each transport task in the non-cancellation route of neighborhood apparatus of transport route centering is to allow the transport task carried out in the apparatus of transport technical conditions scope: if when transport task can be carried out by apparatus of transport, carry out the inspection of next transport task, when all transport tasks can be carried out by apparatus of transport, it was right then to keep this neighborhood apparatus of transport route; If any one transport task cannot be carried out by apparatus of transport in the checking process, it is right then directly to delete this neighborhood apparatus of transport route;

Constraint F2: apparatus of transport is examined surely and must be reached constraint: whether therewith the current plan of apparatus of transport of the arrival website of checking last transport task in the non-cancellation route of neighborhood apparatus of transport route centering at the apparatus of transport place that current needs are examined surely examines the website unanimity surely: if consistent, it is right then to keep this neighborhood apparatus of transport route, if inconsistent, it is right then to delete this neighborhood apparatus of transport route;

Constraint F3: transportation base curfew constraint: the expectation of checking each transport task in the non-cancellation route of neighborhood apparatus of transport route centering is set out constantly and is estimated that curfew that whether due in surpasses respective site constantly: if transport task is not during super curfew, carry out the inspection of next transport task, when all transport tasks not during super curfew, it is right then to keep this neighborhood apparatus of transport route; If the super curfew of any one transport task in the checking process, it is right then directly to delete this neighborhood apparatus of transport route;

Constraint F4: transport task importance constraint:, often limited its delay time at stop and can be cancelled for some important transport tasks.Therefore check whether the important transportation task of neighborhood apparatus of transport route centering all satisfies this class specific (special) requirements: if the important transportation task meets the demands, then carry out the inspection of next important transportation task, then to keep this neighborhood apparatus of transport route right when all important transportation tasks all meet the demands, if any one important transportation task does not satisfy in the checking process, it is right then to delete this neighborhood apparatus of transport route;

Constraint F5: transport task and the constraint of apparatus of transport relevance grade: whether each the transport task freight volume in the non-cancellation route of inspection neighborhood apparatus of transport route centering and the carrying capacity of apparatus of transport mate: if transport task freight volume and apparatus of transport carrying capacity coupling, then carry out the inspection of next transport task, then to keep this neighborhood apparatus of transport route right when all transport tasks and apparatus of transport carrying capacity are all mated, if any one transport task and apparatus of transport carrying capacity do not match in the checking process, it is right then to delete this neighborhood apparatus of transport route.

The optimization aim of above-mentioned steps G is:

Delayed transportation total cost minimum comprises: transport task is incured loss through delay cost, transport task cancellation cost and apparatus of transport exchange cost.

The present invention has also comprised following 3 kinds of optimization aim:

Target 1: the transport task delay time at stop is minimum, i.e. the expectation of all transport tasks is set out constantly minimum with the set out summation of difference constantly of plan.For the transport task of cancellation, use certain equivalent delay time at stop of setting in advance to represent its delay time at stop.

Target 2: it is minimum that transport task is incured loss through delay number: promptly estimate to set out constantly and the plan summation of difference constantly greater than the transport task number of certain limits value (for example 15 minutes) of setting out.For the transport task of cancellation, it incurs loss through delay quantity to incur loss through delay quantitaes with certain equivalent of setting in advance.

Target 3: it is the shortest that passenger's (or goods) incurs loss through delay T.T.: i.e. the expectation of all transport tasks is set out constantly and the set out summation minimum of number of passengers's (or goods poll) product that difference constantly and transport task carry of plan.For the transport task of cancellation, use certain equivalent delay time at stop of setting in advance to represent its delay time at stop.

Above-mentioned steps G has comprised apparatus of transport route of the present invention to alternative pond using method, and concrete grammar is as follows:

According to optimization aim calculate respectively neighborhood apparatus of transport route to and source-right desired value of target apparatus of transport route, apparatus of transport route for super curfew, on its desired value, add one abundant big on the occasion of, and two desired values are subtracted each other obtain the desired value increment, the neighborhood apparatus of transport route of select target value increment minimum is right, store in alternative pond or the alternative pond of negative value according to the positive and negative of desired value increment, described value at cost when all transport tasks of apparatus of transport route for transport task amount maximum in according to original plan all are cancelled is set.

Above-mentioned steps H comprised the present invention utilize greedy stochastic search methods and simulated annealing method to the apparatus of transport route right select excellent method, concrete grammar:

Situation H1: the alternative pond of negative value is not empty:

If the apparatus of transport route formation of super curfew is not empty, adopt the optimal selection method, promptly from the alternative pond of negative value, select the neighborhood apparatus of transport route of increment minimum right, if this neighborhood apparatus of transport route is to being included in the formation of super curfew apparatus of transport route, then select this neighborhood apparatus of transport route right, and put into candidate field apparatus of transport route to tabulation, it is right by all routes of arbitrary apparatus of transport operation in this neighborhood apparatus of transport route to delete then in the alternative pond of negative value, delete route corresponding in the formation of super curfew apparatus of transport route simultaneously, repeating last action is empty until the formation of super curfew apparatus of transport route, and perhaps selected neighborhood apparatus of transport route centering is not included in the formation of super curfew apparatus of transport route;

If the apparatus of transport route formation of super curfew is empty, adopt random choice method, the right quantity of neighborhood apparatus of transport route that comprises according to the alternative pond of negative value determines to choose the upper limit as selecting the right maximum quantity of neighborhood apparatus of transport route earlier.From the alternative pond of negative value, select a neighborhood apparatus of transport route to putting into candidate's apparatus of transport route at random to tabulation.It is right to delete all neighborhood apparatus of transport routes that comprise the arbitrary apparatus of transport of this neighborhood apparatus of transport route centering then in alternative pond.Repeating aforesaid operations is sky or the maximum quantity that reaches setting until the alternative pond of desired value increment negative value.

Situation H2: the alternative pond of negative value is empty:

Adopt random choice method, promptly from the occasion of alternative pond, selecting a neighborhood apparatus of transport route that satisfies Metropolis criterion 2 at random to putting into candidate's apparatus of transport route to tabulation.Judged earlier that before selecting at random whether the neighborhood apparatus of transport route that satisfies Metropolis criterion 2 in alternative pond to reaching the proportion requirement that sets.This ratio generally is made as the neighborhood apparatus of transport route that satisfies Metropolis criterion 2 to accounting in alternative pond neighborhood apparatus of transport route to 5% of total amount.

Metropolis criterion 2 is:

exp(-Δ/temperture)≥U(0，1)

Wherein: Δ is the desired value increment; Temperature be in for the first time initial apparatus of transport route recovery scheme neighborhood apparatus of transport route to the absolute value of maximum target increment and minimum target incremental difference.There is a descending factors in temperature, is defined as 10%, promptly temperature each descend 10%, experienced above-mentioned steps C and be called once-through operation to the process of step H; U (0,1) is the uniform random number between [0,1].

Above-mentioned steps K comprises the disposal route that flows uneven apparatus of transport route recovery scheme, and the concrete operations step is as follows:

Step K 1: order is selected an apparatus of transport route in the apparatus of transport route formation of super curfew;

Step K 2: determine the transport task of the first violation website of this apparatus of transport route curfew, the transport task of first violation website curfew is taken off from this apparatus of transport route until the transport task string of tail transport task put into a virtual apparatus of transport route; This virtual apparatus of transport has identical apparatus of transport type with former carrying instrument, can make up and construct 6 kinds of operations of neighborhood apparatus of transport route with other carrying aircraft route;

Step K 3: the virtual apparatus of transport route that will produce joins in the current apparatus of transport route recovery scheme, the super curfew apparatus of transport route of correspondence is deleted from current apparatus of transport route recovery scheme, going to step K 1, is empty until the apparatus of transport route formation of super curfew.

Aforesaid operations step L evaluation content comprises:

Estimating L1: whether be feasible scheme, all the apparatus of transport routes in the recovery scheme are surpassed the curfew inspection if estimating recovery scheme, if there is the apparatus of transport route of super curfew, then the recovery plan is not a feasible program;

Estimate L2: the passenger's (or goods) who is cancelled in the recovery scheme on the transport task is transferred on the transport task of follow-up identical haulage track as far as possible;

Estimate L3; Estimate optimization target values and other every economic and technical norms of recovery scheme, as incur loss through delay the transport task total quantity and in distribution, cancellation transport task quantity, cancellation passenger's (or goods) quantity in delay time at stop interval, incur loss through delay passenger's (or goods) quantity total amount and in distribution, the apparatus of transport route change rate in delay time at stop interval.

The end condition of described operation steps M has:

Condition M1: reach restriction operation time of setting operation time;

Condition M2: iterations reaches the iterations restriction of setting;

Condition M3: the alternative pond of negative value is empty, and the neighborhood apparatus of transport route that satisfies Metropolis criterion 2 in alternative pond does not reach the proportion requirement that sets (this ratio be defined as in alternative pond neighborhood apparatus of transport route to 5% of sum) and the formation of super curfew apparatus of transport route for empty yet.

The present invention relies on computer technology to finish the computation process of algorithm.According to above-mentioned algorithm design unique data structure corresponding operating with adaptive algorithm.Content comprises:

The data structure of apparatus of transport route.The apparatus of transport route is made of apparatus of transport and transport task string, adopts the data structure of single-track link table, and a node of chained list is that apparatus of transport, other node are the transport task nodes, sees shown in Figure 2.

Apparatus of transport comprises: apparatus of transport numbering, apparatus of transport type, apparatus of transport pot life, apparatus of transport are examined website, apparatus of transport route type, apparatus of transport route change sign, transport task pointer, next apparatus of transport route pointer surely.The apparatus of transport route type is divided into three kinds of A, B, C.Type A represents that this route is to being the actual apparatus of transport route of carrying out.Type B and C do not carry out.But type B is produced by the uneven operation of stream, and Type C is produced by the cancellation operation.Whether apparatus of transport route change sign is used to identify newly-generated apparatus of transport route identical with former carrying instrument route.If the apparatus of transport route all is former carrying instrument route, then do not need to carry out combined route to structure neighborhood route to operation.Can remove unnecessary operation by this sign, reduce operation time.

The transport task string is made of several transport tasks, and transport task comprises: the arrival website of the website that sets out of the numbering of transport task, transport task, the plan of transport task are set out constantly, the expectation of transport task the is set out moment, transport task, the expectation due in of transport task, the carrying capacity (passenger's amount or car loading) of transport task, the significance level of transport task, the pointer of next transport task.

The data structure that neighborhood apparatus of transport route is right.Neighborhood apparatus of transport route is respectively source apparatus of transport route, target apparatus of transport route, the first apparatus of transport route, the second apparatus of transport route to being made of four apparatus of transport routes.Source apparatus of transport route, target apparatus of transport route are the two lines of selecting from original plan, and the first apparatus of transport route, the second apparatus of transport route are a pair of apparatus of transport routes that is produced by step D by source apparatus of transport route and target apparatus of transport route.Neighborhood apparatus of transport route is to also having comprised the target increment size and having pointed to the right pointer of next neighborhood apparatus of transport route.Neighborhood apparatus of transport route is to adopting the data structure of single-track link table, and a node of chained list is that neighborhood is separated quantity, pointed to the right pointer of next neighborhood apparatus of transport route, referring to shown in Figure 3.

The data structure in alternative pond.Alternative pond is to adopting the data structure of single-track link table, and a node of chained list is that neighborhood is separated quantity and pointed to the right pointer of next neighborhood apparatus of transport route, and structure is similar to Fig. 3.

Algorithmic procedure has adopted above-mentioned data structure, makes program have good stable.

The constraint checked operation.Right for the neighborhood carrying route that produces, must could guarantee that the new route that produces is executable through the constraint checked operation.The technology of the present invention will retrain inspection and be divided into the two large divisions, and a part is the rule that all transport enterprise all should observe, and check F1--F5 referring to constraint; For the constraint rule of personalization, then be designed to a dynamic link library.Algorithm calls the inspection that dynamic link library is finished personalized rule finishing constraint F1 after retraining the F5 inspection.The reliability and the extensibility of algorithm have been guaranteed.

Be to strengthen the robustness of program, it all is feasible that the present invention allows some parameter (for example airport curfew hours etc.) of constraint condition to change within the specific limits.

Specific embodiment:

1, read in associated documents, the flight planning file is as shown in table 1, and file is as shown in table 2 constantly on the airport, only uses two airplanes, and the machine tail number is 2498 and 2570, and other tables of data is listed no longer one by one.

Table 1 flight planning file

Aircraft number	Type	The airport, place	The route type	First-class cabin	Business class	Economy class	The available moment	Miss the stop the time	Surely examine the airport
										??2498	??B767	??ZBAA	??A	??15	??31	??214	??1600	??50	??0
Flight number	The airport of starting	Start constantly	Arrive at the airport	Due in	First-class cabin	Business class	Economy class	Importance
										??FM9110	??ZBAA	??815	??ZSSS	??1005	??6	??0	??220	??1
??FM9103	??ZSSS	??1115	??ZBAA	??1325	??2	??0	??216	??0

Aircraft number	Type	The airport, place	The route type	First-class cabin	Business class	Economy class	The available moment	Miss the stop the time	Surely examine the airport
										??FM9104	??ZBAA	??1430	??ZSSS	??1625	??4	??0	??213	??0
??FM9309	??ZSSS	??1735	??ZGGG	??1935	??1	??0	??80	??0
										??FM9310	??ZGGG	??2030	??ZSSS	??2230	??4	??0	??229	??0
Aircraft number	Type	The airport, place	The route type	First-class cabin	Business class	Economy class	Pot life	Miss the stop the time	Surely examine the airport
										??2570	??B767	??ZSSS	??A	??15	??31	??214	??600	??50	??0
Flight number	The airport of starting	Start constantly	Due in	Time of arrival	First-class cabin	Business class	Economy class	Importance
										??FM9373	??ZSSS	??810	??ZGSZ	??1035	??6	??0	??189	??0
??FM9374	??ZGSZ	??1140	??ZSSS	??1335	??1	??0	??257	??0
										??FM9305	??ZSSS	??1430	??ZGGG	??1635	??1	??0	??130	??0
??FM9306	??ZGGG	??1730	??ZSSS	??1935	??0	??0	??208	??0

Table 2 airport is file constantly

The airport	Curfew constantly	Close the zero hour	Close the finish time
				??ZGSZ	??2420	??/	??/
??ZGGG	??/	??/	??/
				??ZBAA	??/	??/	??/
??ZSSS	??/	??/	??/

2, the method according to step B forms initial aircraft route recovery scheme, and as current aircraft route recovery scheme, as shown in table 3:

Table 3 initial aircraft route recovery scheme

The aircraft tail number	Aircraft type	The route type	Route changes	First-class cabin	Business class	Economy class
									??2498	??B767	??A	??1	??15	??31	??214
Flight number	The departure from port airport	The plan departure from port constantly	Arrive at the airport	Estimate to set out constantly	Estimate due in	First-class cabin	Business class	Economy class
									??FM9110	??ZBAA	??815	??ZSSS	??1600	??1750	??6	??0	??220
??FM9103	??ZSSS	??1115	??ZBAA	??1840	??2050	??2	??0	??216
									??FM9104	??ZBAA	??1430	??ZSSS	??2140	??2335	??4	??0	??213
??FM9309	??ZSSS	??1735	??ZGGG	??2425	??2625	??1	??0	??80
									??FM9310	??ZGGG	??2030	??ZSSS	??2715	??2915	??4	??0	??229
The aircraft tail number	Aircraft type	The route type	Route changes	First-class cabin	Business class	Economy class
									??2570	??B767	??A	??0	??15	??31	??214
Flight number	The departure from port airport	The plan departure from port constantly	Arrive at the airport	Estimate to set out constantly	Estimate due in	First-class cabin	Business class	Economy class
									??FM9373	??ZSSS	??810	??ZGSZ	??810	??1035	??6	??0	??189
??FM9374	??ZGSZ	??1140	??ZSSS	??1140	??1335	??1	??0	??257
									??FM9305	??ZSSS	??1430	??ZGGG	??1430	??1635	??1	??0	??130
??FM9306	??ZGGG	??1730	??ZSSS	??1730	??1935	??0	??0	??208

3, in the table 3 initial aircraft route recovery scheme, all flights are not violated the curfew constraint on corresponding airport, are empty so surpass curfew aircraft route formation constantly this moment.

4, select two aircraft routes composition aircraft routes in the current scheme right, right by 6 kinds of operation generation neighborhood aircraft routes among the step D, it is right to obtain 25 groups of neighborhood aircraft routes altogether, rearrange the flight of the neighborhood route centering of generation simultaneously according to the method in the step e, here only list wherein one group, as shown in table 4:

Table 4 neighborhood aircraft route is to example

The aircraft tail number	Aircraft type	The route type	Route changes	First-class cabin	Business class	Economy class
									??2498	??B767	??A	??1	??15	??31	??214
Flight number	The departure from port airport	The plan departure from port constantly	Arrive at the airport	Estimate to set out constantly	Estimate due in	First-class cabin	Business class	Economy class
									??FM9104	??ZBAA	??1430	??ZSSS	??1600	??1755	??4	??0	??213
??FM9309	??ZSSS	??1735	??ZGGG	??1845	??2045	??1	??0	??80
									??FM9310	??ZGGG	??2030	??ZSSS	??2135	??2335	??4	??0	??229
The aircraft tail number	Aircraft type	The route type	Route changes	First-class cabin	Business class	Economy class
									??V1	??/	??C	??1	??/	??/	??/
Flight number	The departure from port airport	The plan departure from port constantly	Arrive at the airport	Estimate to set out constantly	Estimate due in	First-class cabin	Business class	Economy class
									??FM9110	??ZBAA	??815	??ZSSS	??/	??/	??6	??0	??220
??FM9103	??ZSSS	??1115	??ZBAA	??/	??/	??2	??0	??216

Annotate: the aircraft tail number with the V beginning shows that this aircraft is a virtual aircraft, and promptly the flight that comprised of this aircraft route all will be cancelled.

5, check that according to the method in the step F whether neighborhood aircraft route to meeting the technological constraint restriction, it is right that deletion does not meet the neighborhood aircraft route of constrained, 25 groups of neighborhood aircraft route centerings that produce have 6 groups not satisfy constraint, remaining 19 groups, and calculate their target increment size with the method for step G, the neighborhood aircraft route of select target value increment minimum is right, the neighborhood aircraft route of the desired value increment minimum of selecting in this case is to as shown in table 4, its target increment is-970, stores in the alternative pond of negative value.

6, have only two aircraft routes in the current aircraft route plan, in this iteration, all satisfactory aircraft routes are to having selected.At this moment, on the occasion of alternative pond is empty, have one group of aircraft route right in the alternative pond of negative value, first iteration system be provided with system's initial temperature=| the right minimum target increment size of neighborhood aircraft route in the right alternative pond of maximum target increment size-negative value of neighborhood aircraft route in the honest alternative pond |=| 0-(970) |=970.

7, select candidate's aircraft route right according to the method for step H, that unique neighborhood aircraft route is to selected in the alternative pond of negative value this moment, deposit candidate's aircraft route in to tabulation, and make up new aircraft route recovery scheme according to the method for step I, new departure is as shown in table 5.In this method, the condition of calling the uneven processing module of K is that iteration still exists super curfew route in the current aircraft route recovery scheme later on 6 times.In the iteration this time of present case, the formation of super curfew route is empty, and step J and step K are omitted.

The aircraft route recovery scheme that table 5 is new

The aircraft tail number	Aircraft type	Route type	Route changes	First-class cabin	Business class	Economy class
									??2498	??B767	??A	??1	??15	??31	??214
Flight number	The departure from port airport	The plan Departure airport	Arrive at the airport	E. T. D.	Estimated time of arrival (ETA)	First-class cabin	Business class	Economy class
									??FM9104	??ZBAA	??1430	??ZSSS	??1600	??1755	??15	??31	??214
??FM9309	??ZSSS	??1735	??ZGGG	??1845	??2045	??1	??0	??80
									??FM9310	??ZGGG	??2030	??ZSSS	??2135	??2335	??4	??0	??229
The aircraft tail number	Aircraft type	The route type	Route changes	First-class cabin	Business class	Economy class
									??2570	??B767	??A	??0	??15	??31	??214
Flight number	The departure from port airport	The plan Departure airport	Arrive at the airport	E. T. D.	Estimated time of arrival (ETA)	First-class cabin	Business class	Economy class
									??FM9373	??ZSSS	??810	??ZGSZ	??810	??1035	??6	??0	??189
??FM9374	??ZGSZ	??1140	??ZSSS	??1140	??1335	??1	??0	??257
									??FM9305	??ZSSS	??1430	??ZGGG	??1430	??1635	??1	??0	??130
??FM9306	??ZGGG	??1730	??ZSSS	??1730	??1935	??0	??0	??208
									The aircraft tail number	Aircraft type	The route type	Route changes	First-class cabin	Business class	Economy class
??v1	??0	??C	??1	??0	??0	??0
									Flight number	The departure from port airport	The plan Departure airport	Arrive at the airport	E. T. D.	Estimated time of arrival (ETA)	First-class cabin	Business class	Economy class

The aircraft tail number	Aircraft type	Route type	Route changes	First-class cabin	Business class	Economy class
									??FM9110	??ZBAA	??815	??ZSSS	??/	??/	??0	??0	??183
??FM9103	??ZSSS	??1115	??ZBAA	??/	??/	??2	??0	??216

8, estimate and preserve the new aircraft route recovery scheme that produces, as the current aircraft route recovery scheme of next round, the temperature that reduces system simultaneously is 873 (amplitude of cooling is 10%).All aircraft routes of the new recovery scheme that produces constraint that do not break the curfew is feasible aircraft route; Flight FM9110 is cancelled, and the passenger of this flight can be transferred on other flights, and according to the remaining seat number of FM9104, transferable 43 people of flight FM9110 are to flight FM9104, and are as shown in table 5; Estimate optimization target values and other every economic and technical norms of recovery scheme, as shown in table 6:

Table 6 evaluation index value list

	Program aircraft	The cancellations of flights number	The Flights Delayed number	Incur loss through delay cost	?＜＝0.5?h	＜＝1h	＜＝2h	＜＝3h	＜＝4h	??＞4h
											Prioritization scheme	??2	??2	??3	??1185	?0	0	3	0	0	??0
Scheme postpones	??2	??0	??5	??2155	?0	0	0	0	0	??5

9, do not reach end condition, continue the next round iteration, the scheme of table 5 is the original plan of next round.It is right to select three groups of aircraft routes---and 2498 and 2570,2498 and v1,2570 and v1, it is right to produce neighborhood aircraft route, selects every group of optimum neighborhood aircraft route that produces right, and their target increment size is all for just, and quilt is deposited on the occasion of alternative pond.

10, judge that according to the method for step H2 whether aircraft route in alternative pond to satisfying Metropolis criterion 2, it is right that the aircraft route of this criterion is not satisfied in deletion, wherein have only 1 group to satisfy, ratio is 1/3, greater than the ratio value of setting (5%), and then in alternative pond, selecting the aircraft route at random to depositing candidate's aircraft route in to tabulation.

11, select candidate's aircraft route right to the aircraft route in the tabulation, according to the new aircraft route recovery scheme of method structure of step I, and storage.Loop iteration until reaching the condition of convergence, is exported aircraft route recovery scheme, and wherein Zui You scheme is the scheme of table 5.

The above only is less embodiment of the present invention; only be used to illustrate the specific implementation process of the technology of the present invention; within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (9)

1. a recovering method for disturbed route of carrying tool is characterized in that comprising the steps:

Steps A: read in the data of the apparatus of transport route of system, the data of apparatus of transport route are made of apparatus of transport and transport task string;

Step B: form initial apparatus of transport route recovery scheme by the method that postpones;

Step C: determine to surpass curfew apparatus of transport route formation constantly;

Step D: structure neighborhood apparatus of transport route is right;

Step e: neighborhood apparatus of transport route is set out constantly and the expectation due in to recomputating the transport task expectation;

Step F: check neighborhood apparatus of transport route to whether meeting the technological constraint restriction, it is right that the neighborhood apparatus of transport route of constrained is not satisfied in deletion;

Step G: the desired value incremental computations that neighborhood apparatus of transport route is right: store in alternative pond or the alternative pond of negative value according to the positive and negative of desired value increment;

Step H: the right selection of candidate's neighborhood apparatus of transport route: right from the neighborhood apparatus of transport route of on the occasion of alternative pond or the alternative pond of negative value, selecting some, deposit candidate's neighborhood apparatus of transport route in in the tabulation;

Step I: make up new apparatus of transport route recovery scheme: replace corresponding apparatus of transport route in the former scheme with the apparatus of transport route of neighborhood apparatus of transport route centering, obtain new movement plan, as the initial apparatus of transport route recovery scheme of next iteration;

Step J: call the condition that the apparatus of transport route flows uneven module if the new apparatus of transport route recovery scheme that produces satisfies, go to step K, otherwise go to step L;

Step K: flow uneven processing module: through the several times iteration, in the time of still can not obtaining a feasible apparatus of transport route recovery scheme, the apparatus of transport route of super curfew is taked to flow uneven the processing operate, go to step L;

Step L: estimate the new apparatus of transport route recovery scheme that produces, and store in the recovery scheme tabulation, go to step M;

Step M: judge whether system reaches end condition, goes to step N if reach, otherwise go to step C;

Step N: output recovery scheme: a plurality of recovery scheme outputs that will in calculating process, store.

2. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: the method for the initial apparatus of transport route of the described formation of step B recovery scheme, and concrete grammar is as follows:

In movement plan, each apparatus of transport and the transport task carried out of order form an apparatus of transport route, under the situation that does not change the apparatus of transport route, utilize the ready moment of apparatus of transport and transportation base constantly the transportation base close moment in the file determine that transport task in the apparatus of transport route estimates to set out constantly and estimate due in;

3. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: the described technological constraint restriction of step F comprises:

Constraint F1: apparatus of transport operation constraint: check that whether each transport task in the non-cancellation route of neighborhood apparatus of transport route centering is to allow the transport task carried out in the apparatus of transport technical conditions scope: if when transport task can be carried out by apparatus of transport, carry out the inspection of next transport task, when all transport tasks can be carried out by apparatus of transport, it was right then to keep this neighborhood apparatus of transport route; If any one transport task cannot be carried out by apparatus of transport in the checking process, it is right then directly to delete this neighborhood apparatus of transport route;

Constraint F2: apparatus of transport is examined surely and must be reached constraint: whether therewith the current plan of apparatus of transport of the arrival website of checking last transport task in the non-cancellation route of neighborhood apparatus of transport route centering at the apparatus of transport place that current needs are examined surely examines the website unanimity surely: if consistent, it is right then to keep this neighborhood apparatus of transport route, if inconsistent, it is right then to delete this neighborhood apparatus of transport route;

Constraint F3: transportation base curfew constraint: the expectation of checking each transport task in the non-cancellation route of neighborhood apparatus of transport route centering is set out constantly and is estimated that curfew that whether due in surpasses respective site constantly: if transport task is not during super curfew, carry out the inspection of next transport task, when all transport tasks not during super curfew, it is right then to keep this neighborhood apparatus of transport route; If the super curfew of any one transport task in the checking process, it is right then directly to delete this neighborhood apparatus of transport route;

Constraint F4: transport task importance constraint:, often limited its delay time at stop and can be cancelled for some important transport tasks.Therefore check whether the important transportation task of neighborhood apparatus of transport route centering all satisfies this class specific (special) requirements: if the important transportation task meets the demands, then carry out the inspection of next important transportation task, then to keep this neighborhood apparatus of transport route right when all important transportation tasks all meet the demands, if any one important transportation task does not satisfy in the checking process, it is right then to delete this neighborhood apparatus of transport route;

Constraint F5: transport task and the constraint of apparatus of transport relevance grade: whether each the transport task freight volume in the non-cancellation route of inspection neighborhood apparatus of transport route centering and the carrying capacity of apparatus of transport mate: if transport task freight volume and apparatus of transport carrying capacity coupling, then carry out the inspection of next transport task, then to keep this neighborhood apparatus of transport route right when all transport tasks and apparatus of transport carrying capacity are all mated, if any one transport task and apparatus of transport carrying capacity do not match in the checking process, it is right then to delete this neighborhood apparatus of transport route.

4. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: the described target of step G is as follows:

Delayed transportation total cost minimum comprises: transport task is incured loss through delay cost, transport task cancellation cost and apparatus of transport exchange cost:

The transport task delay time at stop is minimum: i.e. the expectation of all transport tasks is set out constantly minimum with the set out summation of difference constantly of plan; For the transport task of cancellation, use certain equivalent delay time at stop of setting in advance to represent its delay time at stop;

It is minimum that transport task is incured loss through delay number: promptly estimate to set out constantly and the plan summation of difference constantly greater than the transport task number of the limits value of setting of setting out; For the transport task of cancellation, it incurs loss through delay quantity to incur loss through delay quantitaes with certain equivalent of setting in advance;

It is the shortest that passenger or goods are incured loss through delay T.T.: i.e. the expectation of all transport tasks is set out constantly and plan set out the number of passengers that difference constantly and transport task carry or the summation minimum of goods poll product; For the transport task of cancellation, use certain equivalent delay time at stop of setting in advance to represent its delay time at stop.

5. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: the described alternative pond of step G using method is as follows:

According to optimization aim calculate respectively neighborhood apparatus of transport route to and source-right desired value of target apparatus of transport route, apparatus of transport route for super curfew, on its desired value, add one abundant big on the occasion of, and two desired values are subtracted each other obtain the desired value increment, the neighborhood apparatus of transport route of select target value increment minimum is right, store in alternative pond or the alternative pond of negative value according to the positive and negative of desired value increment, described value at cost when all transport tasks of apparatus of transport route for transport task amount maximum in according to original plan all are cancelled is set.

6. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: it is right that greedy stochastic search methods of the described employing of step H and simulated annealing method are chosen the apparatus of transport route, and concrete grammar is as follows:

Situation H1: the alternative pond of negative value is not empty:

If the apparatus of transport route formation of super curfew is not empty, adopt the optimal selection method, promptly from the alternative pond of negative value, select the neighborhood apparatus of transport route of increment minimum right, if this neighborhood apparatus of transport route is to being included in the formation of super curfew apparatus of transport route, then select this neighborhood apparatus of transport route right, and put into candidate field apparatus of transport route to tabulation, it is right by all routes of arbitrary apparatus of transport operation in this neighborhood apparatus of transport route to delete then in the alternative pond of negative value, delete route corresponding in the formation of super curfew apparatus of transport route simultaneously, repeating last action is empty until the formation of super curfew apparatus of transport route, and perhaps selected neighborhood apparatus of transport route centering is not included in the formation of super curfew apparatus of transport route;

If the apparatus of transport route formation of super curfew is empty, adopt random choice method, the right quantity of neighborhood apparatus of transport route that comprises according to the alternative pond of negative value determines to choose the upper limit as selecting the right maximum quantity of neighborhood apparatus of transport route earlier, from the alternative pond of negative value, select a neighborhood apparatus of transport route to putting into candidate's apparatus of transport route at random to tabulation, it is right to delete all neighborhood apparatus of transport routes that comprise the arbitrary apparatus of transport of this neighborhood apparatus of transport route centering then in alternative pond, and repeating aforesaid operations is sky or the maximum quantity that reaches setting until the alternative pond of desired value increment negative value;

Situation H2: the alternative pond of negative value is empty:

Adopt random choice method, promptly from the occasion of alternative pond, selecting a neighborhood apparatus of transport route that satisfies Metropolis criterion 2 at random to putting into candidate's apparatus of transport route to tabulation, judged earlier the neighborhood apparatus of transport route that satisfies Metropolis criterion 2 in alternative pond to whether reaching the proportion requirement that sets before selecting at random, described ratio is the neighborhood apparatus of transport route that satisfies Metropolis criterion 2 to accounting in alternative pond neighborhood apparatus of transport route to 5% of total amount;

Metropolis criterion 2 is:

exp(-Δ/temperture)≥U(0，1)

Wherein: Δ is the desired value increment; Temperature be in for the first time initial apparatus of transport route recovery scheme neighborhood apparatus of transport route to the absolute value of maximum target increment and minimum target incremental difference; There is a descending factors in temperature, is 10%, promptly temperature each descend 10%, experienced above-mentioned steps C and be called once-through operation to the process of step H; U (0,1) is the uniform random number between [0,1].

7. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: step K comprises the disposal route that flows uneven apparatus of transport route recovery scheme, and the concrete operations step is as follows:

Step K 1: order is selected an apparatus of transport route in the apparatus of transport route formation of super curfew;

Step K 2: determine the transport task of the first violation website of this apparatus of transport route curfew, the transport task of first violation website curfew is taken off from this apparatus of transport route until the transport task string of tail transport task put into a virtual apparatus of transport route; This virtual apparatus of transport has identical apparatus of transport type with former carrying instrument, can make up and construct 6 kinds of operations of neighborhood apparatus of transport route with other carrying aircraft route;

Step K 3: the virtual apparatus of transport route that will produce joins in the current apparatus of transport route recovery scheme, the super curfew apparatus of transport route of correspondence is deleted from current apparatus of transport route recovery scheme, going to step K 1, is empty until the apparatus of transport route formation of super curfew.

8. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: the described evaluation content of step L comprises:

Estimating L1: whether be feasible scheme, all the apparatus of transport routes in the recovery scheme are surpassed the curfew inspection if estimating recovery scheme, if there is the apparatus of transport route of super curfew, then the recovery plan is not a feasible program;

Estimate L2: will be cancelled in the recovery scheme on the transport task that passenger on the transport task or goods transfer to follow-up identical haulage track as far as possible;

Estimate L3: estimate optimization target values and other every economic and technical norms of recovery scheme, as incuring loss through delay the transport task total quantity and in distribution, cancellation transport task quantity, cancellation passenger or quantity of goods, delay passenger or the quantity of goods total amount in delay time at stop interval and in distribution, the apparatus of transport route change rate in delay time at stop interval.

9. recovering method for disturbed route of carrying tool according to claim 1 is characterized in that: the described end condition of step M has:

Condition M1: reach restriction operation time of setting operation time;

Condition M2: iterations reaches the iterations restriction of setting;

Condition M3: the alternative pond of negative value is empty, the neighborhood apparatus of transport route that satisfies Metropolis criterion 2 in alternative pond does not reach the proportion requirement that sets, described ratio is that neighborhood apparatus of transport route is to 5% of sum in alternative pond, and the formation of super curfew apparatus of transport route also is empty.

Images