CN109840615A - The optimization method of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm - Google Patents
The optimization method of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm Download PDFInfo
- Publication number
- CN109840615A CN109840615A CN201811599696.9A CN201811599696A CN109840615A CN 109840615 A CN109840615 A CN 109840615A CN 201811599696 A CN201811599696 A CN 201811599696A CN 109840615 A CN109840615 A CN 109840615A
- Authority
- CN
- China
- Prior art keywords
- antibody
- entrucking
- formula
- empty wagons
- wagon flow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Abstract
The optimization method of the present invention provides a kind of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm.This method comprises: analyzing the tissue signature of semi-enclosed heavy haul railway entrucking area bare weight wagon flow, with bare weight vehicle in entrucking area residence time minimum target, the Integrated Optimization Model of heavy haul railway entrucking sound zone system bare weight wagon flow is established；Each variable involved in operation process using entrucking area wagon flow establishes the one-dimensional vector for indicating the encoding scheme of entrucking area wagon flow；Using the objective function of one-dimensional vector and Integrated Optimization Model as antibody, using the constraint condition in Integrated Optimization Model as antigen, the affinity representation based on comentropy is constructed using immune clone algorithm, and carries out mutation operation according to affinity, obtains the optimal solution of Integrated Optimization Model.The search efficiency of immune clone algorithm in the present invention is higher than other algorithms, can effectively solve extensive vehicle flow optimization problem, obtain making the smallest comprehensive wagon flow organization scheme of all vehicle dwell times of load terminal.
Description
Technical field
The present invention relates to railway transportation technology field more particularly to a kind of heavy haul railway entruckings based on immune clone algorithm
The optimization method of wagon flow organizing, area.
Background technique
The advantage that heavy haul railway has capacity big, at low cost, high-efficient, has become Chinese coal, the resources such as ore
Prevailing traffic channel, is of great significance to industrial expansion.According to the operating condition of heavy haul railway route and net rail connection strap
Part, enterprise schema can be divided into totally-enclosed mode, standard-sized sheet mode playback and semiclosed mode.Semiclosed mode heavy haul railway be between
Heavy haul railway mode between first two mode, this kind of heavy haul railway are relatively independent, both ends linking road network in the railway network
In line related, wagon flow source and whereabouts are more complicated, and most of wagon flow need to carry out solution volume or group in route both ends technical station
Dismantling operation is closed, to form semi-enclosed transit organization pattern.Semi-enclosed heavy haul railway is generally used as ground section object
Provide the big channel of transport, route one end is the source of goods in the attractived region, and cargo entrucking point is distributed in be connected with route
On transporting something containerized Heavenly Stems and Earthly Branches line, the other end is the cargo area of consumption or transhipment node in route downstream.Cargo in the source of goods entrucking, passes through heavy duty
Route transit reaches the end of unloading for being located at cargo area of consumption or transporting node, and a complete heavy haul railway fortune is consequently formed
Defeated inland transport system.
A kind of semi-enclosed heavy haul railway transportation system in the prior art is as shown in Figure 1.It is each that satisfaction starts heavy haul train
The adjacent region for originating station composition, referred to as heavy haul railway entrucking area.With the continuous improvement of heavy haul railway freight volume, heavily loaded iron
The vehicle flowrate in road entrucking area is also being significantly increased, this just needs to reinforce grinding to wagon flow organizing's scheme of entrucking area inland transport system
Study carefully.
The sky of entrucking area inland transport system, heavy vehicle flow direction are significantly different, and the form that empty wagons is arranged greatly by unloading area returns
Marshalling yard, entrucking area, car type needed for foundation entrucking ground, vehicle number resolve into small column and send to entrucking after marshalling yard decomposes.Entrucking area
The main task of wagon flow organizing's scheme is to plan the heavy vehicle flow and empty wagons stream in entrucking area, i.e., in each entrucking point empty wagons demand known
In the case of, consider route transportation capability constraint and the constraint of entrucking point handling capacity, the empty wagons for reaching marshalling yard, entrucking area is reasonable
It is assigned to each entrucking point, and the loaded vehicle that entrucking point installs is fetched into marshalling yard.
In entrucking area inland transport system, empty wagons is the wagon flow source of loaded vehicle, and wagon flow organizing's scheme should be according to each entrucking point
Demand, empty wagons is rationally sent to each entrucking point entrucking on time, to guarantee the continuity of wagon flow organizing, entrucking area.Due to each entrucking
Empty wagons demand of standing has lack of uniformity on space-time, if empty wagons, which can not reach, will affect the normal car loading operation of entrucking point, no on time
But waste loading station handling capacity also will affect the loading station loaded vehicle departure time, upset driving order；If empty wagons, which is concentrated, reaches dress
Station, will make entrucking point can not timely entrucking, increase empty wagons in the residence time of loading station, reduce empty wagons turnover rate.So
In the daily wagon flow organizing's work of inland transport system, dispatcher needs to arrange this regular bus stream organizer according to on-site actual situations
Case uninterruptedly to unloading issues required train, guarantees the continuity and stability of heavy haul railway transport.By wagon flow organizing side
Case shortens vehicle in the entrucking area residence time to greatest extent, improves lorry turnover rate, ensures the daily of heavy haul railway transportation system
Traffic control smooth sequential carries out, and improves heavy haul railway whole capability.
Currently, there are no one kind effectively to make the shortest integrated car of all vehicle dwell times in entrucking area in the prior art
Flow organization scheme.
Summary of the invention
The embodiment provides a kind of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm it is excellent
Change method, to overcome problem of the prior art.
To achieve the goals above, this invention takes following technical solutions.
A kind of optimization method of the wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm, comprising:
The tissue signature of semi-enclosed heavy haul railway entrucking area bare weight wagon flow is analyzed, with bare weight vehicle when entrucking area stops
Between minimum target, establish the Integrated Optimization Model of heavy haul railway entrucking sound zone system bare weight wagon flow；
Each variable involved in operation process to entrucking area wagon flow carries out causality analysis, establishes table using each variable
Show the one-dimensional vector of the encoding scheme of entrucking area wagon flow；
Using the objective function of the one-dimensional vector and the Integrated Optimization Model as antibody, in the Integrated Optimization Model
Constraint condition be antigen, the affinity representation based on comentropy is constructed using immune clone algorithm, and according to affinity
Mutation operation is carried out, the optimal solution of the Integrated Optimization Model is obtained, using the optimal solution as heavy haul railway entrucking area wagon flow
The prioritization scheme of tissue.
Further, the parameter in the Integrated Optimization Model of the heavy haul railway entrucking sound zone system bare weight wagon flow includes:
O indicates inland transport system marshalling yard, is the destination of big column empty wagons；The set of the D expression each entrucking point in entrucking area；K
Indicate type of train, K={ 2,1,0.5 }；mjIndicate that the jth column of central station O reach empty wagons columns, type of trainmj′It indicates
Central station O jth ' list hair loaded vehicle columns, type of trainmiIndicate that central station O i-th lists hair empty wagons columns, type of train
FortodIndicate the Train Schedule of marshalling yard O to entrucking point d；tdoIndicate the train operation of entrucking point d to marshalling yard O
Time；Indicate the K-type empty wagons resolving time of marshalling yard O；Indicate the K-type empty wagons loading time of loading station d；Indicate marshalling
It stands jth column empty wagons arrival time of O；Indicate the jth column loaded vehicle departure time of marshalling yard O；Indicate that depot d is needed daily
Seek K-type empty wagons columns or the K-type loaded vehicle columns that sets out；γkIndicate the tracking time interval of K-type empty wagons and preceding train；
ηj={ 1,2,4 } indicates the decomposition coefficient of empty wagons, that is, the quantity that empty column j is broken down into i small column is reached, if value
It indicates for 1 without decomposing, if value indicates that the empty column by 1 20,000 tons are decomposed into 2 10,000 tons of empty column for 2, if value is
4 indicate for 1 20,000 tons of empty wagons to be decomposed into 4 0.5 ten thousand tons of empty column；
ηi={ 4,2,1 } indicate combination coefficient, the i.e. quantity of unit car j ' required arrival loaded vehicle i；
Indicate that marshalling yard O goes the k type empty wagons i of entrucking point d to set out the moment, with departure time sequence i=1,2, L,
i,L}；At the time of indicating to reach entrucking point d by the K-type empty wagons i marshalling yard O, it is denoted as
Expression is finished by entrucking point d entrucking, goes setting out the moment for the K-type loaded vehicle i of marshalling yard O；It indicates by entrucking point
At the time of the K-type loaded vehicle i that d sets out reaches marshalling yard O, it is denoted as:
Indicating willIt successively resequences according to arrival time, wherein i '={ 1,2, L, i ', L }；It indicates from volume
Group station O is actually reached the k type empty wagons columns of entrucking point d；
The objective function of the Integrated Optimization Model of the heavy haul railway entrucking sound zone system bare weight wagon flow includes:
Min Z=Z1+Z2+Z3 (3)
Formula (3) indicates vehicle in entrucking area total residence time；Formula (4) indicates to reach empty wagons in total stop of marshalling yard
Between；Formula (5) expression sets out empty wagons in entrucking click-through luggage vehicle and returns to the time required for marshalling yard, and formula (6) indicates to reach weight
Total residence time of the vehicle in marshalling yard.
Further, the constraint condition packet in the Integrated Optimization Model of the heavy haul railway entrucking sound zone system bare weight wagon flow
It includes:
(1) entrucking point capacity consistency:
Formula (7) indicates the car loading capacity that must not exceed entrucking point from the train number that marshalling yard is sent to loading station；Formula (8) indicates
Each entrucking point is only a column empty wagons in the same period and carries out car loading operation, and the departure time meets loading time standard and chases after
Track time interval；
(2) Capacity at Marshalling Yard constrains:
Formula (9) indicate marshalling yard set out all types of empty wagons aggregate tonnage be equal to return marshalling yard loaded vehicle aggregate tonnage；Formula
(10) indicate set out empty wagons total columns be equal to reach empty wagons decompose after total train number；Formula (11) indicates the total column of loaded vehicle of setting out
Number is equal to total train number after reaching loaded vehicle combination；Formula (12) is if the empty wagons i that indicates to set out must be expired by arrival empty wagons j decomposition
Sufficient resolving time constraint；Formula (13) is if the loaded vehicle j ' that indicates to set out must satisfy marshalling time-constrain comprising reaching loaded vehicle i；
(3) line capacity constrains:
Formula (14) is indicated from needing to meet tracking time interval between the train of central station；During formula (15) expression returns to
It needs to meet tracking time interval between the loaded vehicle of center station.
Further, each variable involved in the operation process to entrucking area wagon flow carries out causality analysis, utilizes
Each variable establishes the one-dimensional vector for indicating the encoding scheme of entrucking area wagon flow, comprising:
Variable involved in the operation process of entrucking area wagon flow includes: decomposition coefficient ηj；When empty wagons is listed in marshalling yard and sets out
Between, destination and typeAt the time of with loaded vehicle Lie Hui marshalling yardEach variable is expressed as X using cartesian product:
The one-dimensional vector of the encoding scheme of entrucking area wagon flow indicates are as follows:
D=d1,d2,L,di,L,dD (17)。
Further, the affinity is the combination degree of antibody e Yu antigen Z, is denoted as:
Further, described using the objective function of the one-dimensional vector and the Integrated Optimization Model as antibody, with institute
Stating the constraint condition in Integrated Optimization Model is antigen, constructs the affinity expression side based on comentropy using immune clone algorithm
Formula, and mutation operation is carried out according to affinity, the optimal solution of the Integrated Optimization Model is obtained, using the optimal solution as heavy duty
The prioritization scheme of wagon flow organizing, railway entrucking area, comprising:
The step of derivation algorithm of the objective function of the Integrated Optimization Model, is as follows:
Step1 initializes antibody v, constrains according to Capacity at Marshalling Yard, is set out the empty wagons time using formula (12), formula (14) solution
Vector
Step2 is constrained according to line capacity, is solved loading station using formula (1) and is reached empty wagons time arrow
Step3 solves entrucking point using formula (8) and sets out loaded vehicle time arrow according to loading station capacity consistency
Step4 is constrained according to line capacity, is solved marshalling yard using formula (15) and is reached loaded vehicle time arrow
Step5 is constrained according to Capacity at Marshalling Yard, is solved marshalling yard using formula (13) and is set out loaded vehicle time arrow
Step6 calculating target function obtains vehicle in entrucking area residence time Z；
The derivation algorithm using the affinity size between antibody as foundation, is obtained during evolution using mutation operation
The treatment process of next-generation population, the mutation operation includes:
Initial population collection is combined into N, and antibody number is n, the affinity α between antibody e and e 'ee′It indicates between each antibody
Similarity degree, by each gene x in antibodyiReferred to as allele, i={ 1,2, L, i, L m }, exists according to information entropy theory
Gene e in set NiComentropy are as follows:
In formula (19), pe(i) it is mutation probability, indicates that allele appears in e in set EiThe probability at place, if in place
Set eiUpper all allele is all identical, then Φi(N)=0, the average information entropy in set N are as follows:
The affinity of two antibody e and e ' with allele is obtained according to the definition of entropy are as follows:
αee′=[1- Φ (ee ')]-1 (21)
In formula (21), αee′Value range be (0,1], αee′Two antibody gene similarities of bigger expression are higher, work as Φ
(N)=1 it indicates identical between antibody；
With antibody concentration CeIndicate the similarity degree of -1 antibody of other N (e) in antibody e and population:
Antibody concentration is bigger, and the similitude for indicating antibody and other antibody is bigger；
The immune clone algorithm is when cloning parent antibody population, population scale and antibody concentration and affinity
Correlation takes the method integrally cloned, and carries out N (e) times to the advantage antibody population of parent and clones.
In formula 23, int () is bracket function, and N (e) is the clone sizes of e-th of antibody, after indicating the antibody cloning
Quantity, affinity is higher, and the smaller antibody of antibody concentration, the antibody cloned is more, after competition clone, originally excellent
Elegant antibody e is just expanded for a antibody of N (e)；
Using calculate population average fitness determine the Integrated Optimization Model objective function derivation algorithm whether
It terminates, the calculation formula of the convergence precision σ of the average fitness of population are as follows:
When the convergence precision σ is not less than preset value, then the solution of the objective function of the Integrated Optimization Model is judged
Algorithm is not restrained, and is reset to the parameter of derivation algorithm, and the objective function of the Integrated Optimization Model is continued to run
Derivation algorithm；
When the convergence precision σ is less than preset value, then judge that the solution of the objective function of the Integrated Optimization Model is calculated
Method convergence, terminates the derivation algorithm of the objective function of the Integrated Optimization Model, and the highest antibody of affinity is denoted as output
The optimal solution of the Integrated Optimization Model, using the optimal solution as the prioritization scheme of wagon flow organizing, heavy haul railway entrucking area.
As can be seen from the technical scheme provided by the above-mentioned embodiment of the present invention, the embodiment of the present invention is calculated using immune clone
Method has the characteristics that higher solution efficiency to one-dimensional variable, for heavy haul railway entrucking sound zone system empty and load Integrated Optimization Model,
Using objective function as antibody, constraint condition is antigen, constructs the affinity representation based on comentropy, is calculated finally by clone
Son realizes breeding, is inhibited using antibody concentration to antibody, prevents Premature Convergence, to obtain stopping all vehicles of load terminal
Stay time the smallest comprehensive wagon flow organization scheme.
The additional aspect of the present invention and advantage will be set forth in part in the description, these will become from the following description
Obviously, or practice through the invention is recognized.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill of field, without creative efforts, it can also be obtained according to these attached drawings others
Attached drawing.
Fig. 1 is a kind of semi-enclosed heavy haul railway transportation system schematic diagram in the prior art；
Fig. 2 is a kind of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm provided in an embodiment of the present invention
The flow chart of optimization method；
Fig. 3 is a kind of flow chart of immune clone algorithm provided in an embodiment of the present invention；
Fig. 4 is a kind of convergence rate comparable situation schematic diagram provided in an embodiment of the present invention.
Specific embodiment
Embodiments of the present invention are described below in detail, the example of the embodiment is shown in the accompanying drawings, wherein from beginning
Same or similar element or element with the same or similar functions are indicated to same or similar label eventually.Below by ginseng
The embodiment for examining attached drawing description is exemplary, and for explaining only the invention, and is not construed as limiting the claims.
Those skilled in the art of the present technique are appreciated that unless expressly stated, singular " one " used herein, " one
It is a ", " described " and "the" may also comprise plural form.It is to be further understood that being arranged used in specification of the invention
Diction " comprising " refer to that there are the feature, integer, step, operation, element and/or component, but it is not excluded that in the presence of or addition
Other one or more features, integer, step, operation, element, component and/or their group.It should be understood that when we claim member
Part is " connected " or when " coupled " to another element, it can be directly connected or coupled to other elements, or there may also be
Intermediary element.In addition, " connection " used herein or " coupling " may include being wirelessly connected or coupling.Wording used herein
"and/or" includes one or more associated any cells for listing item and all combinations.
Those skilled in the art of the present technique are appreciated that unless otherwise defined, all terms used herein (including technology art
Language and scientific term) there is meaning identical with the general understanding of those of ordinary skill in fields of the present invention.Should also
Understand, those terms such as defined in the general dictionary, which should be understood that, to be had and the meaning in the context of the prior art
The consistent meaning of justice, and unless defined as here, it will not be explained in an idealized or overly formal meaning.
In order to facilitate understanding of embodiments of the present invention, it is done by taking several specific embodiments as an example below in conjunction with attached drawing further
Explanation, and each embodiment does not constitute the restriction to the embodiment of the present invention.
Make the shortest comprehensive wagon flow organization scheme of all vehicle dwell times in entrucking area in order to obtain.The embodiment of the present invention is first
First bare weight wagon flow tissue signature, semi-enclosed heavy haul railway entrucking area is analyzed, with bare weight vehicle in the entrucking area residence time
Minimum target establishes heavy haul railway entrucking sound zone system empty and load Integrated Optimization Model.First by problem in solution procedure
Solution be converted to one-dimensional vector and as antibody, be secondly that antigen calculates affinity using objective function, building is based on comentropy
Affinity representation, and mutation operation is carried out according to affinity, population scale is controlled finally by antibody concentration, is reached
To optimal solution is faster acquired at the appointed time, the purpose of Premature Convergence is prevented.
The optimization of the embodiment of the invention provides a kind of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm
Method has the characteristics that higher solution efficiency to one-dimensional variable using immune clone algorithm, for heavy haul railway entrucking sound zone system
Empty and load Integrated Optimization Model, using objective function as antibody, constraint condition is antigen, and constructing the affinity based on comentropy indicates
Mode is realized finally by Clone cells and is bred, inhibited using antibody concentration to antibody, prevent Premature Convergence, to obtain
To making the smallest comprehensive wagon flow organization scheme of all vehicle dwell times of load terminal.
Embodiment one
The optimization method of heavy haul railway entrucking area wagon flow organizing provided in an embodiment of the present invention based on immune clone algorithm
Immune clone algorithm search efficiency be higher than other algorithms, can effectively solve extensive vehicle flow optimization problem, the party
The process flow of method is as shown in Figure 2, comprising the following steps:
Step S210, the tissue signature for analyzing semi-enclosed heavy haul railway entrucking area bare weight wagon flow, is being filled with bare weight vehicle
Vehicle area residence time minimum target establishes the Integrated Optimization Model of heavy haul railway entrucking sound zone system bare weight wagon flow.The model is examined
Entrucking point capacity consistency, Capacity at Marshalling Yard constraint, line capacity constraint are considered, have been the model with universality, are suitable for difference
Heavy haul railway system.
Step S220, vehicle is analyzed in the operation process in entrucking area, to above-mentioned heavy haul railway entrucking sound zone system bare weight wagon flow
Integrated Optimization Model in each variable carry out causality analysis, obtain the one-dimensional vector that can indicate wagon flow organizing's scheme.
Using immune clone algorithm, using objective function as antibody, constraint condition is antigen, constructs the affinity expression side based on comentropy
Formula, and mutation operation is carried out according to affinity；
The search efficiency of immune clone algorithm is higher than other algorithms, can effectively solve extensive vehicle flow optimization and ask
Topic.
Step S230, antibody is inhibited using antibody concentration, reaches and faster acquires optimal solution at the appointed time, prevented
The only purpose of Premature Convergence.
The Integrated Optimization Model of heavy haul railway entrucking sound zone system bare weight wagon flow in above-mentioned steps S210 considers entrucking point
Capacity consistency, Capacity at Marshalling Yard constraint and line capacity constraint, are the models with universality, suitable for different heavy haul railways
System.The construction process of the model is as follows:
Model parameter and variable declaration
O indicates inland transport system marshalling yard, is the destination of big column empty wagons；The set of the D expression each entrucking point in entrucking area；K
Indicate type of train, K={ 2,1,0.5 }；mjIndicate that the jth column of central station O reach empty wagons columns, type of trainmj′It indicates
Central station O jth ' list hair loaded vehicle columns, type of trainmiIndicate that central station O i-th lists hair empty wagons columns, type of train
FortodIndicate the Train Schedule of marshalling yard O to entrucking point d；tdoIndicate the train operation of entrucking point d to marshalling yard O
Time；Indicate the K-type empty wagons resolving time of marshalling yard O；Indicate the K-type empty wagons loading time of loading station d；Indicate marshalling
It stands jth column empty wagons arrival time of O；Indicate the jth column loaded vehicle departure time of marshalling yard O；Indicate that depot d is needed daily
Seek K-type empty wagons columns or the K-type loaded vehicle columns that sets out；γkIndicate the tracking time interval of K-type empty wagons and preceding train.
Heavy haul railway inland transport scheduling problem can be described as: send the empty wagons m in entrucking area back to by the Qu great Lie that unloadsjIt needs
Marshalling yard is decomposed into small column miAfterwards, each entrucking point D, arrival time t, quantity n, type k of each entrucking point to empty wagons are redistributed to
There is certain requirement, is meeting entrucking point demand and transport capacity limitation (tod, td, γ) in the case of obtain reasonable day shift scheduling
Scheme keeps vehicle most short in the entrucking area residence time.
Since the resolving time for not having to type empty wagons is different, if ηj={ 1,2,4 } indicates decomposition coefficient, that is, reaches empty column j
It is broken down into the quantity of i small column, if value is 1 expression without decomposition, if value indicates that empty arrange by 1 20,000 tons is divided for 2
The empty column that solution is 2 10,000 tons, if value indicates that the sky that 1 20,000 tons of empty wagons is decomposed into 4 0.5 ten thousand tons arranges for 4.ηi=
{ 4,2,1 } combination coefficient, the i.e. quantity of unit car j ' required arrival loaded vehicle i are indicated.
Indicate that marshalling yard O goes the k type empty wagons i of entrucking point d to set out the moment, with departure time sequence i=1,2, L,
i,L}；At the time of indicating to reach entrucking point d by the K-type empty wagons i marshalling yard O, it is denoted as
Expression is finished by entrucking point d entrucking, goes setting out the moment for the K-type loaded vehicle i of marshalling yard O；It indicates by entrucking point
The K-type loaded vehicle i that d sets out is denoted as at the time of reaching marshalling yard O:
Indicating willIt successively resequences according to arrival time, wherein i '={ 1,2, L, i ', L }；It indicates from volume
Group station O is actually reached the k type empty wagons columns of entrucking point d.
Model foundation, objective function:
When establishing the Integrated Optimization Model of heavy haul railway entrucking sound zone system bare weight wagon flow, mainly consider how to make central station
The empty wagons of sending can complete entrucking as early as possible and return to central station, improve empty wagons utilization rate.Objective function includes three parts:
Min Z=Z1+Z2+Z3 (3)
Formula (3) indicates vehicle in entrucking area total residence time；Formula (4) indicates to reach empty wagons in total stop of marshalling yard
Between；Formula (5) expression sets out empty wagons in entrucking click-through luggage vehicle and returns to the time required for marshalling yard, and formula (6) indicates to reach weight
Total residence time of the vehicle in marshalling yard.
Constraint condition is as follows:
(1) entrucking point capacity consistency:
Formula (7) indicates the car loading capacity that must not exceed entrucking point from the train number that marshalling yard is sent to loading station；Formula (8) indicates
Each entrucking point is only a column empty wagons in the same period and carries out car loading operation, and the departure time meets loading time standard and chases after
Track time interval.
(2) Capacity at Marshalling Yard constrains:
Formula (9) indicate marshalling yard set out all types of empty wagons aggregate tonnage be equal to return marshalling yard loaded vehicle aggregate tonnage；Formula
(10) indicate set out empty wagons total columns be equal to reach empty wagons decompose after total train number；Formula (11) indicates the total column of loaded vehicle of setting out
Number is equal to total train number after reaching loaded vehicle combination；Formula (12) is if the empty wagons i that indicates to set out must be expired by arrival empty wagons j decomposition
Sufficient resolving time constraint；Formula (13) is if the loaded vehicle j ' that indicates to set out must satisfy marshalling time-constrain comprising reaching loaded vehicle i.
(3) line capacity constrains:
Formula (14) is indicated from needing to meet tracking time interval between the train of central station；During formula (15) expression returns to
It needs to meet tracking time interval between the loaded vehicle of center station.
In above-mentioned steps S220, using immune clone algorithm, the affinity representation based on comentropy is constructed, and according to
Mutation operation is carried out according to affinity.
Immune clone algorithm
Encoding scheme
The organization scheme of entrucking area wagon flow is related to multiple variables, these variables include decomposition coefficient ηj；Empty wagons is listed in marshalling
It stands departure time, destination and typeAt the time of loaded vehicle Lie Hui marshalling yardDeng.It can be by each change using cartesian product
Amount is expressed as:
The variable as involved in X is more, solves more difficulty, and immune clone algorithm uses one-dimensional vector coding mode energy
It is enough preferably to play its advantage.It is found through analysis, when the entrucking for determining outbound train diAnd its after starting order, other in X
Information can also be determined accordingly.So encoding scheme can actually be expressed as one-dimensional vector:
D=d1,d2,L,di,L,dD (17)
What vector D was indicated is the set of each entrucking point in entrucking area；As long as vector D has been determined, it will be able to according to above
Formula (16) solves X to come.
Antibody e is solution, actually vector D, it is determined that vector D has also just determined that antibody e, antibody v are initial substantially
Change antibody, antigen Z is the objective function of Integrated Optimization Model, and different antibody is just different solution vector D, and initialization antibody is
It include inside antibody e.
At this point, the solution of wagon flow organizing's scheme optimization problem translate into for marshalling yard set out empty wagons column be ranked up.
Affinity calculates:
Affinity is exactly the combination degree of antibody e Yu antigen Z, is denoted as:
Model needs are optimal objective function when meeting constraint condition, directly adopt the target of optimization problem
Functional value can accelerate the solving speed of algorithm as antigen.The solution procedure of objective function is as follows:
Step1 initializes antibody v, constrains according to Capacity at Marshalling Yard, is set out the empty wagons time using formula (12), formula (14) solution
Vector
Step2 is constrained according to line capacity, is solved loading station using formula (1) and is reached empty wagons time arrow
Step3 solves entrucking point using formula (8) and sets out loaded vehicle time arrow according to loading station capacity consistency
Step4 is constrained according to line capacity, is solved marshalling yard using formula (15) and is reached loaded vehicle time arrow
Step5 is constrained according to Capacity at Marshalling Yard, is solved marshalling yard using formula (13) and is set out loaded vehicle time arrow
Step6 calculating target function obtains vehicle in entrucking area residence time Z.
Mutation operation
In order to guarantee the feasibility of solution, algorithm uses during evolution using the affinity size between antibody as foundation
Mutation operation obtains next-generation population, and initial population collection is combined into N, and antibody number is n.Affinity α between antibody e and e 'ee′Table
Show the similarity degree between each antibody, by each gene x in antibodyiReferred to as allele, i={ 1,2, L, i, L m }.Root
According to information entropy theory, the gene e in set NiComentropy are as follows:
In formula (19), pe(i) it is mutation probability, indicates that allele appears in e in set EiThe probability at place.If in place
Set eiUpper all allele is all identical, then Φi(N)=0, the average information entropy in set N are as follows:
According to the definition of entropy, the affinity for obtaining two antibody e and e ' with allele is,
αee′=[1- Φ (ee ')]-1 (21)
In formula (21), αee′Value range be (0,1], αee′Two antibody gene similarities of bigger expression are higher, work as Φ
(N)=1 it indicates identical between antibody.The pseudocode of mutation operation is as follows:
1.3.4 antibody concentration
In order to avoid algorithm Premature Convergence, guarantee the diversity of population, the gene x with antibody e in populationiSimilar antibody
More, the affinity of the antibody and antigen is lower after being cloned.With antibody concentration CeIndicate other N in antibody e and population
(e) similarity degree of -1 antibody:
Antibody concentration is bigger, and the similitude for indicating antibody and other antibody is bigger, needs when carrying out cell Proliferation to this portion
Point antibody is inhibited, and selects the antibody of efficient evolution gene to can effectively ensure that the multiplicity of next-generation antibody according to antibody concentration
Property.
1.3.5 competitive strategy is cloned
Clone cells play an important role to the Distribution center of solution and Approximation in algorithm of the embodiment of the present invention.It calculates
For method when cloning to parent antibody population, population scale is related to antibody concentration and affinity, takes the side integrally cloned
Method carries out N (e) times to the advantage antibody population of parent and clones.
In formula 23, int () is bracket function, and N (e) is the clone sizes of e-th of antibody, after indicating the antibody cloning
Quantity, affinity is higher, the smaller antibody of antibody concentration, and the antibody cloned is more.After competition clone, originally excellent
Elegant antibody e is just expanded for a antibody of N (e).Clone and option program are as follows.
Usual immune clone algorithm uses termination condition of the evolutionary generation as algorithm, but determining for evolutionary generation needs
It is tested repeatedly according to the scale of problem, robustness is poor.The embodiment of the present invention is determined using the average fitness for calculating population and is calculated
Whether method terminates, and when the variation of the average fitness of population is small, illustrates algorithmic statement, has found satisfactory solution.Convergence precision σ can
To be expressed as,
When convergence precision is less than preset value, algorithm is terminated.Otherwise illustrate that algorithm is not restrained, need to carry out algorithm parameter
It resets.
1.3.7 Fig. 3 is a kind of process flow diagram of immune clone algorithm provided in an embodiment of the present invention, including following place
Manage step:
Start
Antibody population N (v) is randomly generated in Step1 initiation parameter, and iterative parameter v=1 is arranged；
Step2 calculates the affinity of population antibody and antigen according to formula (18)
Step3 is according to formula (21), the affinity α of calculating antibody eee′And mutation operation is carried out to mutation operator；
Step4 is according to formula (22), the concentration C of calculating antibodyv.It is anti-to will acquire the clone with high-affinity and low concentration
The antibody population that body e and scale are N (v).
Step5 is arranged the antibody concentration of all antibody is ascending, deletes the higher antibody of concentration, guarantees population
Scale is N.
V=v+1
As σ≤σ*
The highest antibody of affinity is denoted as optimal solution by Step6, judges whether to meet algorithm termination condition, if meeting output
Optimal solution；If being unsatisfactory for returning to step2.Above-mentioned optimal solution is exactly the prioritization scheme of wagon flow organizing, heavy haul railway entrucking area.
Terminate
Terminate
5, it calculates and acquires optimal solution.
6, optimizing ability is carried out based on ICA algorithm to compare with based on GA and PSO algorithm progress optimizing ability.
Seeking affinity is a kind of calculating process, does not need iteration.Immune clone algorithm is to need to iterate to calculate to solve.Parent
It is included in inside immune clone algorithm with power calculating.
Embodiment two
In order to verify the validity of algorithm of the embodiment of the present invention, experiment utilizes Qun Dynasty's heavy haul railway entrucking area inland transport system
Data, simplified entrucking point information such as table 1, technical operation time such as table 2.
The embodiment of the present invention assumes that marshalling yard reaches 1 column, 20,000 tons of empty wagons every 20min, and the 1st column empty wagons arrival time was denoted as
12 column empty wagons are reached in 0,4 hour altogether, loaded vehicle is 30min the marshalling time in marshalling yard.Purpose is to calculate these empty wagons column
Total residence time in entrucking area.
2 results and analysis
The operating parameter of immune clone algorithm is arranged are as follows: initial population scale V=50, maximum evolutionary generation are 100, convergence
Precision σ=0.03.In order to preferably verify the validity and superiority of algorithm of the embodiment of the present invention, using genetic algorithm (GA) and
Particle swarm algorithm (POS) is used as reference experiments.
Genetic algorithm is that the adaptive probability randomization iteration that a kind of evolution laws for using for reference living nature develop is searched
Rope algorithm.GA algorithm is the pumping of a kind of gene strand with fixed population (Population) scale, individual regular length
As model.It is randomly chosen parents according to fitness (Fitness), and by intersection (Crossover) and makes a variation
(Mutation) operator generates new population.Intersect (Crossover) to refer to, sexual biology when breeding next-generation two it is same
It is recombinated between source chromosome by intersecting, that is, DNA is cut off at a certain same position of two chromosome, front and back two
Combined crosswise forms two new chromosomes to string respectively.This process is also known as genetic recombination recombination,.Variation
(Mutation) certain copy errors may be generated when cell is replicated with the probability of very little by referring to, to make DNA
Certain variation, produces new chromosome, these new chromosomes show new character.Algorithm parameter is as shown in table 3.Standard
The speed renewal equation of particle swarm algorithm are as follows:
W is inertia weight, it determines particle previous velocity to the influence degree of present speed, to play balanced algorithm
The effect of global search and local search ability, for the effect of test, when the range of weight fixed value is, when, optimize meeting
A good result is obtained, globally optimal solution can be preferably found.One big inertia weight is conducive to global detectivity and searches
The region of Suo Xin, and a small inertia tends to local exploration, the current zonule of fine search.Therefore, weight is one
Decreasing function rather than a changeless value at any time.Start to be assigned to be worth greatly, be then linearly reduced to certain value, one good
Decrement value range be from 1 to 0.4.Therefore, algorithm parameter is as shown in table 3.
All experiments are in cpu frequency 2.8GHz, memory 2G, under operating system Windows XP, Matlab7 environment into
Row.It in order to evaluate algorithms of different, is usually assessed, is had using average value and average calculation times evaluation index
Body is defined as follows:
(1) it average value: tests to obtain the arithmetic mean of instantaneous value of fitness function value by n times.
(2) average value of successful times time average calculation times: is found in carrying out n times test.
In order to eliminate random bring contingency, to each function optimizing experiment progress 100 times, i.e. N=100, in fact
It tests and the results are shown in Table 4.
As can be seen that three kinds of algorithms can find optimal value well from test result, ICA algorithm is effectively overcomed
Algorithm premature convergence problem has preferable global optimizing ability.ICA algorithm can jump out locally optimal solution compared with GA and PSO algorithm, tool
There are stronger ability of searching optimum and stability.Moreover, the mean value and average calculation times of the optimal value of algorithm are also significantly better than
GA and PSO algorithm, wherein average calculation times reduce 36%, 51% compared with other two kinds of algorithms, and effect of optimization is obvious.By 100
After secondary solution, convergence rate comparable situation is shown in Fig. 4.
As can be seen from Figure 4, the immune clone algorithm that the embodiment of the present invention proposes can guarantee to acquire at the appointed time optimal
Solution 4629 (column min).Wagon flow organizing's scheme key parameter is shown in Table 5.
1 entrucking point information table of table
Removal time, loading time and the tracking interval (min) of 2 different type vehicle of table
3 GA/PSO algorithm parameter of table
The optimization efficiency of 4 algorithms of different of table compares
5 wagon flow organizing, entrucking area scheme of table
In order to verify the wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm that the embodiment of the present invention is proposed
Optimization method application effect in a practical situation, carried out answering for model using wagon flow organizing, heavy haul railway entrucking area, the Qun Dynasty
With analysis, the total residence time minimum that these empty wagons are listed in heavy duty Te Lu entrucking area, the Qun Dynasty is calculated.The result shows that the present invention is implemented
Example propose algorithm can guarantee to acquire optimal solution at the appointed time, algorithm effectively overcomes algorithm premature convergence problem, compares
There is preferable global optimizing ability in GA and PSO algorithm, average calculation times reduce 36%, 51% compared with other two kinds of algorithms,
Effect of optimization is obvious.
In conclusion the embodiment of the present invention has the spy of higher solution efficiency using immune clone algorithm to one-dimensional variable
Point, for heavy haul railway entrucking sound zone system empty and load Integrated Optimization Model, using objective function as antibody, constraint condition is antigen,
Construct the affinity representation based on comentropy, finally by Clone cells realize breed, using antibody concentration to antibody into
Row inhibits, and Premature Convergence is prevented, to obtain making the smallest comprehensive wagon flow organization scheme of all vehicle dwell times of load terminal.
The search efficiency of immune clone algorithm in the method for the embodiment of the present invention is higher than other algorithms, can effectively solve
Extensive vehicle flow optimization problem.The algorithm can guarantee to acquire optimal solution at the appointed time, and this method can have
Effect ground overcome algorithm routinely implement in premature convergence problem, search efficiency be higher than other algorithms, average calculation times compared with other two
Kind algorithm is more compared to reducing, and can effectively solve extensive vehicle flow optimization problem.
Those of ordinary skill in the art will appreciate that: attached drawing is the schematic diagram of one embodiment, module in attached drawing or
Process is not necessarily implemented necessary to the present invention.
As seen through the above description of the embodiments, those skilled in the art can be understood that the present invention can
It realizes by means of software and necessary general hardware platform.Based on this understanding, technical solution of the present invention essence
On in other words the part that contributes to existing technology can be embodied in the form of software products, the computer software product
It can store in storage medium, such as ROM/RAM, magnetic disk, CD, including some instructions are used so that a computer equipment
(can be personal computer, server or the network equipment etc.) executes the certain of each embodiment or embodiment of the invention
Method described in part.
All the embodiments in this specification are described in a progressive manner, same and similar portion between each embodiment
Dividing may refer to each other, and each embodiment focuses on the differences from other embodiments.Especially for device or
For system embodiment, since it is substantially similar to the method embodiment, so describing fairly simple, related place is referring to method
The part of embodiment illustrates.Apparatus and system embodiment described above is only schematical, wherein the conduct
The unit of separate part description may or may not be physically separated, component shown as a unit can be or
Person may not be physical unit, it can and it is in one place, or may be distributed over multiple network units.It can root
According to actual need that some or all of the modules therein is selected to achieve the purpose of the solution of this embodiment.Ordinary skill
Personnel can understand and implement without creative efforts.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
In the technical scope disclosed by the present invention, any changes or substitutions that can be easily thought of by anyone skilled in the art,
It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with scope of protection of the claims
Subject to.
Claims (6)
1. a kind of optimization method of the wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm characterized by comprising
Analyze the tissue signature of semi-enclosed heavy haul railway entrucking area bare weight wagon flow, with bare weight vehicle the entrucking area residence time most
Small is target, establishes the Integrated Optimization Model of heavy haul railway entrucking sound zone system bare weight wagon flow；
Each variable involved in operation process to entrucking area wagon flow carries out causality analysis, and being established using each variable indicates dress
The one-dimensional vector of the encoding scheme of vehicle area wagon flow；
Using the objective function of the one-dimensional vector and the Integrated Optimization Model as antibody, with the pact in the Integrated Optimization Model
Beam condition is antigen, constructs the affinity representation based on comentropy using immune clone algorithm, and carry out according to affinity
Mutation operation obtains the optimal solution of the Integrated Optimization Model, using the optimal solution as wagon flow organizing, heavy haul railway entrucking area
Prioritization scheme.
2. according to the method described in claim 1, it is characterized by:
Parameter in the Integrated Optimization Model of the heavy haul railway entrucking sound zone system bare weight wagon flow includes:
O indicates inland transport system marshalling yard, is the destination of big column empty wagons；The set of the D expression each entrucking point in entrucking area；K is indicated
Type of train, K={ 2,1,0.5 }；mjIndicate that the jth column of central station O reach empty wagons columns, type of trainmj′Expression center
The O jth ' list of standing hair loaded vehicle columns, type of trainmiIndicate that central station O i-th lists hair empty wagons columns, type of train istodIndicate the Train Schedule of marshalling yard O to entrucking point d；tdoWhen indicating the train operation of entrucking point d to marshalling yard O
Between；Indicate the K-type empty wagons resolving time of marshalling yard O；Indicate the K-type empty wagons loading time of loading station d；Indicate marshalling yard
The jth column empty wagons arrival time of O；Indicate the jth column loaded vehicle departure time of marshalling yard O；Indicate the daily demand k of depot d
Type empty wagons columns or the K-type loaded vehicle columns that sets out；γkIndicate the tracking time interval of K-type empty wagons and preceding train；
ηj={ 1,2,4 } indicates the decomposition coefficient of empty wagons, that is, the quantity that empty column j is broken down into i small column is reached, if value is 1 table
Show without decomposing, if value indicates that the sky column by 1 20,000 tons are decomposed into 2 10,000 tons of empty column for 2, if value is 4 expressions
1 20,000 tons of empty wagons is decomposed into 4 0.5 ten thousand tons of empty column；
ηi={ 4,2,1 } indicate combination coefficient, the i.e. quantity of unit car j ' required arrival loaded vehicle i；
Indicate that marshalling yard O goes the k type empty wagons i of entrucking point d to set out the moment, with departure time sequence i=1,2, L, i,
L}；At the time of indicating to reach entrucking point d by the K-type empty wagons i marshalling yard O, it is denoted as
Expression is finished by entrucking point d entrucking, goes setting out the moment for the K-type loaded vehicle i of marshalling yard O；It indicates by entrucking point d
K-type loaded vehicle i reach marshalling yard O at the time of, be denoted as:
Indicating willIt successively resequences according to arrival time, wherein i '={ 1,2, L, i ', L }；It indicates from marshalling yard O
It is actually reached the k type empty wagons columns of entrucking point d；
The objective function of the Integrated Optimization Model of the heavy haul railway entrucking sound zone system bare weight wagon flow includes:
MinZ=Z1+Z2+Z3 (3)
Formula (3) indicates vehicle in entrucking area total residence time；Formula (4) indicates to reach empty wagons in the total residence time of marshalling yard；Formula
(5) it indicates to set out empty wagons in entrucking click-through luggage vehicle and returns to the time required for marshalling yard, formula (6) indicates that reaching loaded vehicle is compiling
The total residence time at group station.
3. according to the method described in claim 2, it is characterized by:
Constraint condition in the Integrated Optimization Model of the heavy haul railway entrucking sound zone system bare weight wagon flow includes:
(1) entrucking point capacity consistency:
Formula (7) indicates the car loading capacity that must not exceed entrucking point from the train number that marshalling yard is sent to loading station；Formula (8) indicates each dress
Vehicle point the same period be only a column empty wagons carry out car loading operation, and the departure time meet loading time standard and tracking when
Between be spaced；
(2) Capacity at Marshalling Yard constrains:
Formula (9) indicate marshalling yard set out all types of empty wagons aggregate tonnage be equal to return marshalling yard loaded vehicle aggregate tonnage；Formula (10) table
The total columns for showing hair empty wagons, which is equal to, reaches total train number after empty wagons decomposes；Formula (11) indicate to set out total columns of loaded vehicle is equal to
Total train number after reaching loaded vehicle combination；Formula (12) is if the empty wagons i that indicates to set out must satisfy decomposition by arrival empty wagons j decomposition
Time-constrain；Formula (13) is if the loaded vehicle j ' that indicates to set out must satisfy marshalling time-constrain comprising reaching loaded vehicle i；
(3) line capacity constrains:
Formula (14) is indicated from needing to meet tracking time interval between the train of central station；Formula (15) expression returns to central station
Loaded vehicle between need to meet tracking time interval.
4. according to the method described in claim 3, it is characterized in that, involved in the operation process to entrucking area wagon flow
Each variable carries out causality analysis, and the one-dimensional vector for indicating the encoding scheme of entrucking area wagon flow is established using each variable, comprising:
Variable involved in the operation process of entrucking area wagon flow includes: decomposition coefficient ηj；Empty wagons is listed in marshalling yard's departure time, mesh
Ground and typeAt the time of with loaded vehicle Lie Hui marshalling yardEach variable is expressed as X using cartesian product:
The one-dimensional vector of the encoding scheme of entrucking area wagon flow indicates are as follows:
D=d1,d2,L,di,L,dD (17)。
5. according to the method described in claim 4, it is characterized in that, the affinity is the combination degree of antibody e Yu antigen Z,
It is denoted as:
6. according to the method described in claim 5, it is characterized in that, described with the one-dimensional vector and the complex optimum mould
The objective function of type is that antibody is constructed using the constraint condition in the Integrated Optimization Model as antigen using immune clone algorithm
Affinity representation based on comentropy, and mutation operation is carried out according to affinity, obtain the Integrated Optimization Model most
Excellent solution, using the optimal solution as the prioritization scheme of wagon flow organizing, heavy haul railway entrucking area, comprising:
The step of derivation algorithm of the objective function of the Integrated Optimization Model, is as follows:
Step1 initializes antibody v, constrains according to Capacity at Marshalling Yard, solves the empty wagons time arrow that sets out using formula (12), formula (14)
Step2 is constrained according to line capacity, is solved loading station using formula (1) and is reached empty wagons time arrow
Step3 solves entrucking point using formula (8) and sets out loaded vehicle time arrow according to loading station capacity consistency
Step4 is constrained according to line capacity, is solved marshalling yard using formula (15) and is reached loaded vehicle time arrow
Step5 is constrained according to Capacity at Marshalling Yard, is solved marshalling yard using formula (13) and is set out loaded vehicle time arrow
Step6 calculating target function obtains vehicle in entrucking area residence time Z；
The derivation algorithm is obtained next during evolution using the affinity size between antibody as foundation using mutation operation
For population, the treatment process of the mutation operation includes:
Initial population collection is combined into N, and antibody number is n, the affinity α between antibody e and e 'ee′Indicate similar between each antibody
Degree, by each gene x in antibodyiReferred to as allele, i={ 1,2, L, i, L m }, is gathering according to information entropy theory
Gene e in NiComentropy are as follows:
In formula (19), pe(i) it is mutation probability, indicates that allele appears in e in set EiThe probability at place, if in position ei
Upper all allele is all identical, then Φi(N)=0, the average information entropy in set N are as follows:
The affinity of two antibody e and e ' with allele is obtained according to the definition of entropy are as follows:
αee′=[1- Φ (ee ')]-1 (21)
In formula (21), αee′Value range be (0,1], αee′Two antibody gene similarities of bigger expression are higher, when Φ (N)=
1 indicates identical between antibody；
With antibody concentration CeIndicate the similarity degree of -1 antibody of other N (e) in antibody e and population:
Antibody concentration is bigger, and the similitude for indicating antibody and other antibody is bigger；
The immune clone algorithm is when cloning parent antibody population, population scale and antibody concentration and affinity phase
It closes, takes the method integrally cloned, N (e) times is carried out to the advantage antibody population of parent and is cloned.
In formula 23, int () is bracket function, and N (e) is the clone sizes of e-th of antibody, the number after indicating the antibody cloning
Amount, affinity is higher, and the smaller antibody of antibody concentration, the antibody cloned is more, after competition clone, originally outstanding
Antibody e is just expanded for a antibody of N (e)；
Determine whether the derivation algorithm of the objective function of the Integrated Optimization Model terminates using the average fitness for calculating population,
The calculation formula of the convergence precision σ of the average fitness of population are as follows:
When the convergence precision σ is not less than preset value, then the derivation algorithm of the objective function of the Integrated Optimization Model is judged
It does not restrain, the parameter of derivation algorithm is reset, continue to run the solution of the objective function of the Integrated Optimization Model
Algorithm；
When the convergence precision σ is less than preset value, then judge that the derivation algorithm of the objective function of the Integrated Optimization Model is received
It holds back, terminates the derivation algorithm of the objective function of the Integrated Optimization Model, the highest antibody of affinity is denoted as described in output
The optimal solution of Integrated Optimization Model, using the optimal solution as the prioritization scheme of wagon flow organizing, heavy haul railway entrucking area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811599696.9A CN109840615B (en) | 2018-12-26 | 2018-12-26 | Method for optimizing traffic flow organization of loading area of heavy haul railway based on immune clone algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811599696.9A CN109840615B (en) | 2018-12-26 | 2018-12-26 | Method for optimizing traffic flow organization of loading area of heavy haul railway based on immune clone algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109840615A true CN109840615A (en) | 2019-06-04 |
| CN109840615B CN109840615B (en) | 2021-11-30 |
Family
ID=66883392
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811599696.9A Active CN109840615B (en) | 2018-12-26 | 2018-12-26 | Method for optimizing traffic flow organization of loading area of heavy haul railway based on immune clone algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109840615B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112381255A (en) * | 2020-11-13 | 2021-02-19 | 天津矿山工程有限公司 | Digital mine mining and transporting equipment scheduling method and system, intelligent terminal and storage medium |
| CN113928342A (en) * | 2021-11-03 | 2022-01-14 | 交控科技股份有限公司 | Train operation method based on virtual marshalling, electronic device and storage medium |
| CN113959453A (en) * | 2021-09-28 | 2022-01-21 | 青岛慧拓智能机器有限公司 | Mining area road network map generation method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040177394A1 (en) * | 2002-09-09 | 2004-09-09 | Latif Zuhair A. | Adoptive transfer and uses thereof |
| CN106709510A (en) * | 2016-12-06 | 2017-05-24 | 南阳师范学院 | Gaussian mixture model searching method based on immune clonal selection algorithm |
-
2018
- 2018-12-26 CN CN201811599696.9A patent/CN109840615B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040177394A1 (en) * | 2002-09-09 | 2004-09-09 | Latif Zuhair A. | Adoptive transfer and uses thereof |
| CN106709510A (en) * | 2016-12-06 | 2017-05-24 | 南阳师范学院 | Gaussian mixture model searching method based on immune clonal selection algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 景云: "《重载铁路集疏运调度系统空重车流协同优化研究》", 《交通运输系统工程与信息》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112381255A (en) * | 2020-11-13 | 2021-02-19 | 天津矿山工程有限公司 | Digital mine mining and transporting equipment scheduling method and system, intelligent terminal and storage medium |
| CN113959453A (en) * | 2021-09-28 | 2022-01-21 | 青岛慧拓智能机器有限公司 | Mining area road network map generation method, device, equipment and storage medium |
| CN113928342A (en) * | 2021-11-03 | 2022-01-14 | 交控科技股份有限公司 | Train operation method based on virtual marshalling, electronic device and storage medium |
| CN113928342B (en) * | 2021-11-03 | 2022-11-25 | 交控科技股份有限公司 | Train operation method based on virtual marshalling, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109840615B (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Routing optimization of emergency grain distribution vehicles using the immune ant colony optimization algorithm | |
| Cheng et al. | Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm | |
| CN109840615A (en) | The optimization method of wagon flow organizing, heavy haul railway entrucking area based on immune clone algorithm | |
| CN105976030A (en) | Multi-agent-based platform scheduling intelligent sorting model structure | |
| Almasi et al. | Optimization of a transit services model with a feeder bus and rail system using metaheuristic algorithms | |
| Afandizadeh et al. | Bus fleet optimization using genetic algorithm a case study of Mashhad | |
| CN110163544A (en) | A method of the genetic algorithm based on optimization carries out goods delivery | |
| Ting et al. | Multi-vehicle selective pickup and delivery using metaheuristic algorithms | |
| CN109934382A (en) | A kind of multistage subway freight transport network system and constructing method based on axis width formula layout | |
| Wang et al. | Carbon reduction in the location routing problem with heterogeneous fleet, simultaneous pickup-delivery and time windows | |
| CN105825303A (en) | Drop and pull transport task allocation method | |
| Liang et al. | A cooperative coevolutionary optimization design of urban transit network and operating frequencies | |
| Hani et al. | Simulation based optimization of a train maintenance facility | |
| Nguyen et al. | Pareto routing and scheduling of dynamic urban rail transit services with multi-objective cross entropy method | |
| Özoğlu et al. | Clarke & Wright's savings algorithm and genetic algorithms based hybrid approach for flying sidekick traveling salesman problem | |
| CN115577833A (en) | Particle swarm optimization method and system applied to solving path planning of cooperative delivery | |
| Eydi et al. | A bi-objective vehicle routing problem with time windows and multiple demands | |
| CN116882883A (en) | Power grid material distribution path planning method utilizing big data | |
| Chouaki et al. | Implementing reinforcement learning for on-demand vehicle rebalancing in MATSim | |
| Jing et al. | A study on car flow organization in the loading end of heavy haul railway based on immune clonal selection algorithm | |
| Khakbaz et al. | Urban bus fleet routing in transportation network equipped with park-and-ride: a case study of Babol, Iran | |
| Zhou et al. | Optimization for service routes of pallet service center based on the pallet pool mode | |
| CN116739213A (en) | Subway connection bus optimization method based on agent model auxiliary algorithm | |
| Li et al. | Distribution fairness in emergency material vehicle scheduling based on uncertain time and demand | |
| CN115965172A (en) | Path optimization algorithm, system and equipment of finished oil secondary distribution vehicle |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |