CN109902866A - The cooperative optimization method of railway fast freight class column starting scheme and rolling stock - Google Patents
The cooperative optimization method of railway fast freight class column starting scheme and rolling stock Download PDFInfo
- Publication number
- CN109902866A CN109902866A CN201910130434.6A CN201910130434A CN109902866A CN 109902866 A CN109902866 A CN 109902866A CN 201910130434 A CN201910130434 A CN 201910130434A CN 109902866 A CN109902866 A CN 109902866A
- Authority
- CN
- China
- Prior art keywords
- flow
- service
- goods
- segmental arc
- vehicle
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides a kind of cooperative optimization methods of railway fast freight class column starting scheme and rolling stock, comprising: establishes the collaboration Optimized model and parameter constraints connected based on freight traffic volume distribution and class's train bottom；The given data of fast freight class column is obtained, and according to the given data, the collaboration Optimized model and the parameter constraints settling time-space-Ban Lie three-dimensional service network；The three-dimensional service network is carried out to decompose the minimum cost path for generating multiple three-dimensional services sub-network networks and determining each three-dimensional services sub-network network, class's column starting scheme and rolling stock plan are generated according to minimum cost path information.The present invention can reduce empty wagons traveling, improve the utilization rate of vehicle bottom resource, reduce the operation cost of railway department, ensure the smooth development of the normal Transportation Organization work in fast freight class Liege；And consider that collaboration optimum results obtained from the organic connections of the two can provide more structurally sound input information for the establishment of fast freight class column running schedule.
Description
Technical field
The present embodiments relate to railway transportation technology fields, and in particular to a kind of railway fast freight class column starting scheme and vehicle
The cooperative optimization method that bottom uses.
Background technique
With the fast development of logistic industry, railway fast freight class arrange towards the source of goods show small lot, multiple batches of, Gao Shi
The characteristics of effect, to starting scheme, more stringent requirements are proposed.To adapt to source of goods feature, and in face of increasingly sophisticated Transportation Organization
Work, how to formulate reasonable Transportation Organization mode becomes the problem for being worth quantization fastidious.In addition, railway fast freight class arrange due to when
Reasons, the available vehicle bottom resources such as effect property, delivery cargo particularity show state in short supply.Vehicle bottom resource is that class's column are started
Scheme fulfils the guarantee of quality, and the quality of starting scheme embodies the matching degree of freight demand, and the directly class of determining arranges
Operation benefits, therefore how under the resource constraint of limited vehicle bottom, realize that the maximizing the benefits of starting scheme is needed as another
The problem of inquiring into.
Starting scheme and two problems of rolling stock are usually isolated consideration by existing optimal way, have broken top layer plan
With being associated with for underlying resource, optimum results is caused to be difficult to implement to reality.Therefore, it is urgent to provide a kind of railway fast freight class column to start
The cooperative optimization method of scheme and rolling stock improves the universality of optimization method and the practicability of optimum results.
Summary of the invention
For the problems of the prior art, the present invention provides a kind of association of railway fast freight class column starting scheme and rolling stock
Same optimization method improves the universality of optimization method and the practicability of optimum results.
To achieve the above object, the present invention the following technical schemes are provided:
On the one hand, the present invention provides a kind of cooperative optimization method of railway fast freight class column starting scheme and rolling stock,
Include:
Establish the collaboration Optimized model and parameter constraints connected based on freight traffic volume distribution and class's train bottom；
The given data of fast freight class column is obtained, and according to the given data, the collaboration Optimized model and the parameter
Constraint condition settling time-space-Ban Lie three-dimensional service network；
The three-dimensional service network decompose and generates multiple three-dimensional services sub-network networks and determines each three-dimensional service
The minimum cost path of network generates class's column starting scheme and rolling stock plan according to minimum cost path information.
On the other hand, the present invention also provides a kind of electronic equipment, comprising: processor, memory, communication interface and communication
Bus；Wherein,
Processor, communication interface and memory complete mutual communication by communication bus；
Processor is used to call the logical order in memory, to execute above-mentioned railway fast freight class column starting scheme and vehicle bottom
The cooperative optimization method of utilization.
On the other hand, the present invention also provides a kind of non-transient computer readable storage medium, the non-transient computers
Readable storage medium storing program for executing stores computer instruction, and the computer instruction starts the computer execution above-mentioned railway fast freight class column
The cooperative optimization method of scheme and rolling stock.
The cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock of the present invention, on the one hand may be used
To reduce empty wagons traveling, the utilization rate of vehicle bottom resource is improved, the operation cost of railway department is reduced；On the other hand ensure that railway is fast
The smooth development of the normal Transportation Organization work in class Liege is transported, and considers that collaboration optimum results can obtained from the organic connections of the two
Establishment for railway fast freight class column running schedule provides more structurally sound input information.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is the present invention
Some embodiments for those of ordinary skill in the art without creative efforts, can also basis
These attached drawings obtain other attached drawings.
Fig. 1, which is a kind of railway fast freight class provided in an embodiment of the present invention column starting scheme, cooperates with optimization side with rolling stock
The flow diagram of method；
Fig. 2, which is a kind of railway fast freight class provided in an embodiment of the present invention column starting scheme, cooperates with optimization side with rolling stock
The specific flow chart of method；
Fig. 3 is the structural schematic diagram of electronic equipment provided in an embodiment of the present invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, the technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
The embodiment of the invention provides a kind of cooperative optimization method of railway fast freight class column starting scheme and rolling stock, ginsengs
See Fig. 1, comprising:
S101: the collaboration Optimized model and parameter constraints connected based on freight traffic volume distribution and class's train bottom is established；
In this step, freight traffic volume data and class's train truth of a matter evidence are acquired by data acquisition facility, is based on cargo stream
Amount distribution and class's train bottom connect, and establish collaboration Optimized model and cooperate with the restriction on the parameters that parameter should meet in Optimized model
Condition；
Wherein pre-recorded freight traffic volume data and class's train truth of a matter evidence, pre-recorded number in the data acquisition facility
According to being preparatory acquisition or input.
Further, the optimization aim of the collaboration Optimized model is running income maximum, wherein collaboration Optimized model
Are as follows:
Wherein, f is flow of goods, and F is flow of goods set, and a is service segmental arc, and A is service segmental arc set, AvFor Virtual Service arc collection
It closes, oaFor the start node for servicing segmental arc a, ofFor the origination node of flow of goods f, rfFor the revenue from transportation of flow of goods f,It is 0 or 1
Variable, flow of goods f is via service segmental arc a, thenOtherwise, For flow of goods f by service segmental arc a transport at
This, v is vehicle flow, and V is vehicle flow set,Pass through the operating cost of service segmental arc a for vehicle flow v,For 0 or 1 variable,
If vehicle flow v via service segmental arc a,Otherwise,
Further, the parameter constraints include:
Freight traffic volume constraint, the constraint of flow of goods flow equilibrium, the constraint of vehicle flow flow equilibrium, rolling stock number constraint, vehicle
The constraint of the coupling constraint and decision variable value of bottom and flow of goods.
Wherein, freight traffic volume constraint representation must be less than or equal to total freight traffic volume by the sum of the freight traffic volume of class's column service.
Due to the uncertainty of class's column freight demand, the demand that cannot be satisfied can be completed by ordinary goods train, and freight traffic volume is about
Beam are as follows:
Wherein, f is flow of goods, and F is flow of goods set, and a is service segmental arc, AvFor Virtual Service arc set, QfFor the stream of flow of goods f
Measure size, oaFor the start node for servicing segmental arc a, ofFor the start node of flow of goods f,For 0 or 1 variable, flow of goods f is via clothes
Be engaged in segmental arc a, thenOtherwise,
The cargo influx and discharge of each node of flow of goods flow equilibrium constraint representation will meet flow Conservation Relationship, simultaneouslyGuarantee can not be split property of the same branch flow of goods on unique space path, the constraint of flow of goods flow equilibrium for 0-1 variable are as follows:
Wherein, a is service segmental arc,Indicate the service segmental arc set from node n, n is three-dimensional service network section
Point, N are three-dimensional serving network node set, and F is flow of goods set, oaFor service segmental arc a start node,It indicates to reach node
The service segmental arc set of n；daFor service segmental arc a arrival node,For 0 or 1 variable, flow of goods f is via service segmental arc a, thenOtherwise,ofFor the start node of flow of goods f, dfFor the arrival node of flow of goods f；
The vehicle influx and discharge of each node of vehicle flow flow equilibrium constraint representation will meet flow Conservation Relationship, together
WhenGuarantee that vehicle flow keeps connecting on unique space path for 0-1 variable, i.e. the fixed marshalling in vehicle bottom, vehicle flow flow is put down
Weighing apparatus constraint are as follows:
Wherein, a is service segmental arc,Indicating the service segmental arc set from node n, n is three-dimensional serving network node,
oaFor service segmental arc a start node,Indicate the service segmental arc set of arrival node n；daFor the arrival section for servicing segmental arc a
Point,For 0 or 1 variable, if vehicle flow v via service segmental arc a,Otherwise,dvFor arriving for vehicle flow v
Up to node；N is three-dimensional serving network node set, and V is vehicle flow set；
Rolling stock number constraint indicate investment with number of allocated passenger trains amount be necessarily less than or equal to the number of allocated passenger trains for utilization
Amount, rolling stock number constraint are as follows:
Wherein, v is vehicle flow, and V is vehicle flow set, and a is service segmental arc, AvFor Virtual Service arc set, oaFor service arc
The start node of section a, ovFor the start node of vehicle flow v,For 0 or 1 variable, if vehicle flow v via service segmental arc a,
ThenOtherwise,VmaxIndicate available number of allocated passenger trains amount；
The coupling constraint of vehicle bottom and flow of goods indicates the capacity that the sum of freight traffic volume in service segmental arc must be less than in its segmental arc
Size (several and unit vehicle the loading capacity of weaving by passing through the vehicle bottom of segmental arc determine), the coupling constraint at vehicle bottom and flow of goods
Are as follows:
Wherein, v is vehicle flow, and V is vehicle flow set,For 0 or 1 variable, if vehicle flow v via service segmental arc a,
ThenOtherwise,F is flow of goods, and F is flow of goods set,For 0 or 1 variable, flow of goods f is via service segmental arc a, thenOtherwise,QfFor the uninterrupted of flow of goods f, EvFor the flow of vehicle flow v, ε is the load-carrying of a vehicle；AsFor
Operation service arc set, AdArc set is serviced to wait；
The value range of each decision variable of decision variable value constraint representation, the constraint of decision variable value are as follows:
Wherein,For 0 or 1 variable, flow of goods f is via service segmental arc a, thenOtherwise,F is flow of goods, F
For flow of goods set, a is service segmental arc, and A is service segmental arc set；For 0 or 1 variable, if vehicle flow v is via service segmental arc
A, thenOtherwise,V is vehicle flow, and V is vehicle flow set.
It should be noted that the node on behalf operation station in service network, segmental arc represent transportation service, the transport of cargo
Process can be regarded as distributes flow of goods on service network, and can regarding as with arrangement for vehicle bottom distributes vehicle flow on service network.Vehicle
The matching of vehicle bottom resource and freight demand is realized in stream and flow of goods using service network as medium.
S102: the given data of fast freight class column is obtained, and according to the given data, the collaboration Optimized model and described
Parameter constraints settling time-space-Ban Lie three-dimensional service network；
In this step, the given data of fast freight class column, comprising: cargo transport demand, vehicle bottom information and freight；
Wherein, the cargo transport demand, comprising: the cargo starting station, cargo terminal station, freight traffic volume, cargo set out
Time and cargo arrival time the latest；
Vehicle bottom information, comprising: the home station at vehicle bottom and the marshalling number at vehicle bottom；
The freight, comprising: cargo transport income, cargo transport cost, class's column start fixed cost and line of vehicles
Road usage charges.
Wherein, according to the departure time of cargo and cargo, arrival time determines temporal network the latest, is begun according to cargo
Hair station and cargo terminal station determine network spatially, according to freight traffic volume, vehicle bottom information and freight, on the class's of determination column
Combination of network on temporal network, network and Ban Lie spatially is constituted time-space-Ban Lie three-dimensional service by network
Network.
In the specific implementation, the given data of fast freight class column is obtained, and time-space-is constructed based on model constraint condition
Class arranges three-dimensional service network.It include cargo transport demand, vehicle bottom information, Railway Freight Transportation to given data by csv file
Cost parameters are stored, and the given data in csv file is read in computer program with C# language under .Net platform.?
When constructing three-dimensional service network, whole serving network nodes is generated according to three time, space, class's column dimensions, secondly respectively
According to constraint condition and given data building operation service arc, the virtual end for fictionalizing arcing, flow of goods for waiting service arc, flow of goods
To arc, the virtual super arc of flow of goods, vehicle flow fictionalize arcing, the virtual Zhongdao arc of vehicle flow, vehicle flow it is virtual super
Arc, transfer service arc and connecting service arc.
S103: decomposition is carried out to the three-dimensional service network and generates multiple three-dimensional services sub-network networks and determining each three-dimensional clothes
The minimum cost path for sub-network of being engaged in generates class's column starting scheme and rolling stock plan according to minimum cost path information.
In this step, antithesis is carried out to the three-dimensional service network established in step S102 using Lagrange relaxation method
It decomposes, generates multiple three-dimensional services sub-network networks；Most by the shortest path of flow of goods and vehicle flow in the three-dimensional services sub-network network
Minimum cost path of the short path as three-dimensional services sub-network network；Traverse multiple flows of goods in multiple three-dimensional services sub-network networks most
The shortest path of short path and multiple vehicle flows, the path for meeting segmental arc transport capacity is the transportation route of collaboration optimization.
Referring to fig. 2, lower mask body is illustrated this step:
(1) when carrying out Duality Decomposition to the three-dimensional service network established in step S102 using Lagrange relaxation method,
The number of iterations k=0 is set, initializing all Lagrange multiplier values is 0, sets iteration step length as a positive number, under setting is best
Boundary solves LB*=-∞, best upper bound solution UB*=+∞.
(2) Lagrange duality is solved, wherein Lagrange duality are as follows:
Max H(D)'；
Wherein, ρa、σaIt is the Lagrange multiplier on segmental arc a.
Further, solution procedure, comprising:
It is rightFlow of goods shortest path subproblem is solved, the shortest path and path length of flow of goods are saved
It is rightVehicle flow shortest path subproblem is solved, the shortest path and path length of vehicle flow are saved
Update Lagrange multiplier ρa、σa, more new formula are as follows:
Wherein, k is the number of iterations, αkIndicate iteration step length when kth time iteration, αkValue set according to actual needs,
Only it need to meet following rule:
And k → ∞, αk→0。
(3) lower bound solution LB is calculatedk, and generate best lower bound solution LB*=max { LB*,LBk}；Calculate upper bound solution UBk, and generate
Best upper bound solution UB*=min { UB*,UBk}。
Using calculating lower bound solution LBkFormula are as follows:
Wherein,For the shortest path length of flow of goods f at the kth iteration,It changes for vehicle flow v in kth time
For when shortest path length.
Calculate upper bound solution UBk, include the following steps:
A. according to the vehicle flow shortest path in lower bound solution, i-th vehicle flow is loaded onto service network, if vehicle flow is most
The case where taking on same class's column there are multiple groups vehicle bottom in short path, then b otherwise i=i+1 is gone to, by the transport capacity value of the segmental arc
It is set as the uninterrupted of the vehicle flow, repeats this step.
B. discharge car stream i updates the transport capacity of segmental arc, and the vehicle flow price for the segmental arc that existing vehicle flow passes through is set
It is set to maximum；Solve vehicle flow i shortest path subproblem, after restore segmental arc vehicle flow price, if rolling stock
Loaded is flowed, c is gone to, otherwise goes to a.
C. according to flow of goods plan priority grade coefficient wfDescending sequence is ranked up flow of goods.Flow of goods plan priority grade
Coefficient wfCalculation formula are as follows:
In formula,The path length of flow of goods f, Q when iteration secondary for kthfFor the uninterrupted of flow of goods.M=0.2, n=
0.8。
D. according to the flow of goods shortest path in lower bound solution, i-th flow of goods is loaded onto service network.If flow of goods shortest path
In there are freight traffic volume be more than segmental arc transport capacity the case where, then go to e, otherwise i=i+1, repeat this step.
E. flow of goods i is unloaded from service network, the segmental arc of traverse service network can transport load flow of goods i beyond segmental arc
The flow of goods price of the segmental arc of ability is set as maximum.Solve flow of goods i shortest path subproblem, after restore segmental arc flow of goods
Price, if whole flow of goods loadeds, go to f, otherwise go to d.
F. feasible solution is saved, upper bound solution UB is calculatedkIf the number of iterations k is greater than preset maximum number of iterations or upper and lower
The duality gap on boundary has been met the requirements, then Lagrangian Relaxation Algorithm terminates；Otherwise k=k+1, it is Lagrangian right to continue to solve
It is even.
In this step, former PROBLEM DECOMPOSITION multiple independent three is made by Duality Decomposition using Lagrangian Relaxation Algorithm
Service network minimum cost path subproblem is tieed up, the minimum cost path subproblem of whole flows of goods and vehicle flow is solved, it will be minimum
Cost route subproblem solving result (lower bound) is used as heuristic information, brings into Lagranging heuristic algorithm, believes according to inspiring
Lower bound result feasible robustness is obtained upper bound solution, while exporting solving result, comprising: class's column starting scheme, flow of goods allocation result by breath
With rolling stock plan.
Wherein, class's column starting scheme, comprising: class's column start period, class's column marshalling formation, class's column operation pathway and Ban Lie
Take on vehicle bottom；
Flow of goods allocation result, comprising: flow of goods set out the period, flow of goods reach the period, loading shift column and operation pathway；
Rolling stock plan, comprising: time section moment, the operation pathway at vehicle bottom and the vehicle bottom for going out section period, vehicle bottom at vehicle bottom
Succession relation.
As can be seen from the above description, a kind of railway fast freight class provided in an embodiment of the present invention column starting scheme and rolling stock
Cooperative optimization method, on the one hand can reduce empty wagons traveling, improve the utilization rate of vehicle bottom resource, reduce the operation of railway department at
This；On the other hand can be to avoid causing starting scheme that can not fulfil because of vehicle bottom inadequate resource the problem of, ensures railway fast freight class
The smooth development of the normal Transportation Organization work in Liege；And collaboration optimum results obtained from the organic connections of the two can be fast for railway
The establishment for transporting class's column running schedule provides more structurally sound input information.
To sum up, the present invention considers that class's column start the period, marshalling formation, flow of goods transfer, vehicle bottom are attached and the factors such as connect,
Effectively realize the supply-demand mode of transportation demand Yu vehicle bottom resource, can the class's of reduction column operation cost, improve operation benefits, guarantee
Everything goes well with your work carries out for class's column Transportation Organization.And it has the advantages that
(1) class's of realizing column starting scheme of the invention and rolling stock plan cooperates with optimization, not only can the class of reduction arrange
Operation cost, improve operation benefits, ensure Transportation Organization everything goes well with your work carry out, and consider both organic connections obtained from
Collaboration optimum results can provide more structurally sound input information for the establishment of railway fast freight class column running schedule.
(2) the invention proposes the construction method of time-space-Ban Lie three-dimensional service network, can on carriage of Cargo, vehicle
The complex transportations organizational process such as bottom connecting are portrayed, and create advantageous item for collaboration Optimized model of the building based on network flow
Part.
(3) this invention takes Lagrangian Relaxation Algorithms, by the way that Complex Constraints are relaxed in objective function, using pair
Even decompose makes the multiple independent three-dimensional service network minimum cost path subproblems of former PROBLEM DECOMPOSITION, to realize extensive
Problem is divided and rule, and solution efficiency and solution quality are higher.
The embodiment of the invention provides a kind of electronic equipment, and referring to Fig. 3, which may include: processor
(processor) 810, communication interface (Communications Interface) 820, memory (memory) 830 and communication
Bus 840, wherein processor 810, communication interface 820, memory 830 complete mutual communication by communication bus 840.
Processor 810 can call the logical order in memory 830, to execute following method: establish based on freight traffic volume distribution and
The collaboration Optimized model and parameter constraints that class train bottom connects；Obtain fast freight class column given data, and according to it is described
Primary data, the collaboration Optimized model and the parameter constraints settling time-space-Ban Lie three-dimensional service network；To institute
Three-dimensional service network is stated to carry out decomposing the most tip for generating multiple three-dimensional services sub-network networks and determining each three-dimensional services sub-network network
With path, class's column starting scheme and rolling stock plan are generated according to minimum cost path information.
In addition, the logical order in above-mentioned memory 830 can be realized by way of SFU software functional unit and conduct
Independent product when selling or using, can store in a computer readable storage medium.Based on this understanding, originally
Substantially the part of the part that contributes to existing technology or the technical solution can be in other words for the technical solution of invention
The form of software product embodies, which is stored in a storage medium, including some instructions to
So that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation of the present invention
The all or part of the steps of example the method.And storage medium above-mentioned include: USB flash disk, mobile hard disk, read-only memory (ROM,
Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. it is various
It can store the medium of program code.
The embodiment of the invention provides a kind of non-transient computer readable storage mediums, are stored thereon with computer program,
The computer program realizes method provided by above-mentioned each method embodiment when being executed by processor, for example, foundation is based on
The collaboration Optimized model and parameter constraints that freight traffic volume distribution and class's train bottom connect；Obtain the datum of fast freight class column
According to, and according to the given data, the collaboration Optimized model and the parameter constraints settling time-space-Ban Lie three
Tie up service network；The three-dimensional service network decompose and generates multiple three-dimensional services sub-network networks and determines each three-dimensional service
The minimum cost path of sub-network generates class's column starting scheme and rolling stock plan according to minimum cost path information.
It should be understood by those skilled in the art that, embodiments herein can provide as method, apparatus or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application be referring to according to the method, apparatus of the embodiment of the present application and the flow chart of computer program product and/or
Block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/or
The combination of process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions to arrive
General purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
Machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for realizing flowing
The device/system for the function of being specified in journey figure one process or multiple processes and/or block diagrams one box or multiple boxes.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.Term " on ", "lower" etc. refer to
The orientation or positional relationship shown is to be based on the orientation or positional relationship shown in the drawings, and is merely for convenience of the description present invention and simplifies
Description, rather than the device or element of indication or suggestion meaning must have a particular orientation, constructed and grasped with specific orientation
Make, therefore is not considered as limiting the invention.Unless otherwise clearly defined and limited, term " installation ", " connected ",
" connection " shall be understood in a broad sense, for example, it may be being fixedly connected, may be a detachable connection, or be integrally connected；It can be
Mechanical connection, is also possible to be electrically connected；It can be directly connected, two can also be can be indirectly connected through an intermediary
Connection inside element.For the ordinary skill in the art, above-mentioned term can be understood at this as the case may be
Concrete meaning in invention.
In specification of the invention, numerous specific details are set forth.Although it is understood that the embodiment of the present invention can
To practice without these specific details.In some instances, well known method, structure and skill is not been shown in detail
Art, so as not to obscure the understanding of this specification.Similarly, it should be understood that disclose in order to simplify the present invention and helps to understand respectively
One or more of a inventive aspect, in the above description of the exemplary embodiment of the present invention, each spy of the invention
Sign is grouped together into a single embodiment, figure, or description thereof sometimes.However, should not be by the method solution of the disclosure
Release is in reflect an intention that i.e. the claimed invention requires more than feature expressly recited in each claim
More features.More precisely, as the following claims reflect, inventive aspect is less than single reality disclosed above
Apply all features of example.Therefore, it then follows thus claims of specific embodiment are expressly incorporated in the specific embodiment,
It is wherein each that the claims themselves are regarded as separate embodiments of the invention.It should be noted that in the absence of conflict, this
The feature in embodiment and embodiment in application can be combined with each other.The invention is not limited to any single aspect,
It is not limited to any single embodiment, is also not limited to any combination and/or displacement of these aspects and/or embodiment.And
And can be used alone each aspect and/or embodiment of the invention or with other one or more aspects and/or its implementation
Example is used in combination.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement；And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme should all cover within the scope of the claims and the description of the invention.
Claims (9)
1. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock characterized by comprising
Establish the collaboration Optimized model and parameter constraints connected based on freight traffic volume distribution and class's train bottom；
The given data of fast freight class column is obtained, and according to the given data, the collaboration Optimized model and the restriction on the parameters
Condition settling time-space-Ban Lie three-dimensional service network；
The three-dimensional service network decompose and generates multiple three-dimensional services sub-network networks and determines each three-dimensional services sub-network network
Minimum cost path, class's column starting scheme and rolling stock plan are generated according to minimum cost path information.
2. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock according to claim 1,
It is characterized in that, the optimization aim of the collaboration Optimized model is running income maximum.
3. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock according to claim 2,
It is characterized in that, the collaboration Optimized model are as follows:
Wherein, f is flow of goods, and F is flow of goods set, and a is service segmental arc, and A is service segmental arc set, AvFor Virtual Service arc set, oa
For the start node for servicing segmental arc a, ofFor the origination node of flow of goods f, rfFor the revenue from transportation of flow of goods f,For 0 or 1 variable,
Flow of goods f is via service segmental arc a, thenOtherwise, It is flow of goods f by the transportation cost of service segmental arc a, v is vehicle
Stream, V be vehicle flow set,Pass through the operating cost of service segmental arc a for vehicle flow v,For 0 or 1 variable, if vehicle
Flow v via service segmental arc a, thenOtherwise,
4. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock according to claim 1,
It is characterized in that, the parameter constraints include:
Freight traffic volume constraint, the constraint of flow of goods flow equilibrium, the constraint of vehicle flow flow equilibrium, rolling stock number constraint, vehicle bottom with
The coupling constraint and decision variable value of flow of goods constrain.
5. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock according to claim 4,
It is characterized in that,
The freight traffic volume constraint are as follows:
Wherein, f is flow of goods, and F is flow of goods set, and a is service segmental arc, AvFor Virtual Service arc set, QfFlow for flow of goods f is big
It is small, oaFor the start node for servicing segmental arc a, ofFor the start node of flow of goods f,For 0 or 1 variable, flow of goods f is via service arc
Section a, thenOtherwise,
The flow of goods flow equilibrium constraint are as follows:
Wherein, a is service segmental arc,Indicate the service segmental arc set from node n, n is three-dimensional serving network node, and N is
Three-dimensional serving network node set, F are flow of goods set, oaFor service segmental arc a start node,Indicate the clothes of arrival node n
Business segmental arc set；daFor service segmental arc a arrival node,For 0 or 1 variable, flow of goods f is via service segmental arc a, then
Otherwise,ofFor the start node of flow of goods f, dfFor the arrival node of flow of goods f；
The vehicle flow flow equilibrium constraint are as follows:
Wherein, a is service segmental arc,Indicate the service segmental arc set from node n, n is three-dimensional serving network node, oaFor
The start node of segmental arc a is serviced,Indicate the service segmental arc set of arrival node n；daFor service segmental arc a arrival node,
For 0 or 1 variable, if vehicle flow v via service segmental arc a,Otherwise,dvFor the arrival section of vehicle flow v
Point；N is three-dimensional serving network node set, and V is vehicle flow set；
The rolling stock number constraint are as follows:
Wherein, v is vehicle flow, and V is vehicle flow set, and a is service segmental arc, AvFor Virtual Service arc set, oaTo service segmental arc a
Start node, ovFor the start node of vehicle flow v,For 0 or 1 variable, if vehicle flow v via service segmental arc a,Otherwise,VmaxIndicate available number of allocated passenger trains amount；
The coupling constraint at the vehicle bottom and flow of goods are as follows:
Wherein, v is vehicle flow, and V is vehicle flow set,For 0 or 1 variable, if vehicle flow v via service segmental arc a,Otherwise,F is flow of goods, and F is flow of goods set,For 0 or 1 variable, flow of goods f is via service segmental arc a, thenOtherwise,QfFor the uninterrupted of flow of goods f, EvFor the flow of vehicle flow v, ε is the load-carrying of a vehicle；AsFor
Operation service arc set, AdArc set is serviced to wait；
The decision variable value constraint are as follows:
Wherein,For 0 or 1 variable, flow of goods f is via service segmental arc a, thenOtherwise,F is flow of goods, and F is goods
Adfluxion is closed, and a is service segmental arc, and A is service segmental arc set；For 0 or 1 variable, if vehicle flow v via service segmental arc a,Otherwise,V is vehicle flow, and V is vehicle flow set.
6. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock according to claim 1,
It is characterized in that, the given data of fast freight class column, comprising: cargo transport demand, vehicle bottom information and freight；
Wherein, the cargo transport demand, comprising: the cargo starting station, cargo terminal station, freight traffic volume, cargo departure time
With cargo arrival time the latest；
Vehicle bottom information, comprising: the home station at vehicle bottom and the marshalling number at vehicle bottom；
The freight, comprising: cargo transport income, cargo transport cost, class's column are started fixed cost and vehicle line and made
Expense.
7. the cooperative optimization method of a kind of railway fast freight class column starting scheme and rolling stock according to claim 1,
It is characterized in that, it is described that the multiple three-dimensional services sub-network networks of decomposition generation are carried out to the three-dimensional service network and determine each three-dimensional clothes
The minimum cost path for sub-network of being engaged in generates class's column starting scheme and rolling stock plan, packet according to minimum cost path information
It includes:
Duality Decomposition is carried out to the three-dimensional service network using Lagrange relaxation method, generates multiple three-dimensional services sub-networks
Network；
Using the shortest path of flow of goods in the three-dimensional services sub-network network and the shortest path of vehicle flow as three-dimensional services sub-network network
Minimum cost path；
The shortest path of multiple flows of goods in multiple three-dimensional services sub-network networks and the shortest path of multiple vehicle flows are traversed, arc is met
The path of section transport capacity is the transportation route of collaboration optimization.
8. a kind of electronic equipment characterized by comprising processor, memory, communication interface and communication bus；Wherein,
Processor, communication interface and memory complete mutual communication by communication bus；
Processor is used to call the logical order in memory, requires a kind of described in any item railways of 1-7 fast with perform claim
Transport the cooperative optimization method of class's column starting scheme and rolling stock.
9. a kind of non-transient computer readable storage medium, the non-transient computer readable storage medium storage computer refers to
It enables, the computer instruction makes the computer perform claim that a kind of described in any item railway fast freight class column of 1-7 be required to start
The cooperative optimization method of scheme and rolling stock.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910130434.6A CN109902866B (en) | 2019-02-21 | 2019-02-21 | Cooperative optimization method for railway express train operation scheme and train bottom application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910130434.6A CN109902866B (en) | 2019-02-21 | 2019-02-21 | Cooperative optimization method for railway express train operation scheme and train bottom application |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109902866A true CN109902866A (en) | 2019-06-18 |
| CN109902866B CN109902866B (en) | 2021-03-12 |
Family
ID=66945262
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910130434.6A Active CN109902866B (en) | 2019-02-21 | 2019-02-21 | Cooperative optimization method for railway express train operation scheme and train bottom application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109902866B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458322A (en) * | 2019-06-26 | 2019-11-15 | 北京交通大学 | Consider the train operation plan generation method of enterprise demand |
| CN111523814A (en) * | 2020-04-26 | 2020-08-11 | 西南交通大学 | Intelligent planning method for urban rail transit schedule and vehicle bottom application plan |
| CN111967828A (en) * | 2020-08-20 | 2020-11-20 | 北京交通大学 | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method |
| CN112801346A (en) * | 2021-01-12 | 2021-05-14 | 北京交通大学 | Railway goods overall process transportation planning method |
| CN113379102A (en) * | 2021-05-20 | 2021-09-10 | 浙江百世技术有限公司 | Multi-network trunk transport optimization method, computer equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050114188A1 (en) * | 1998-04-08 | 2005-05-26 | Hitachi, Ltd. | Freight information management method and freight mangement system using electronic tags |
| CN107527111A (en) * | 2017-07-19 | 2017-12-29 | 成都华药共享网络科技有限公司 | Public vehicles dispatch logistics distribution system |
| CN107833002A (en) * | 2017-11-28 | 2018-03-23 | 上海海洋大学 | Multistage low-carbon logistics distribution network planing method based on collaboration multi-objective Algorithm |
-
2019
- 2019-02-21 CN CN201910130434.6A patent/CN109902866B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050114188A1 (en) * | 1998-04-08 | 2005-05-26 | Hitachi, Ltd. | Freight information management method and freight mangement system using electronic tags |
| CN107527111A (en) * | 2017-07-19 | 2017-12-29 | 成都华药共享网络科技有限公司 | Public vehicles dispatch logistics distribution system |
| CN107833002A (en) * | 2017-11-28 | 2018-03-23 | 上海海洋大学 | Multistage low-carbon logistics distribution network planing method based on collaboration multi-objective Algorithm |
Non-Patent Citations (2)
| Title |
|---|
| 孙敏: ""铁路快捷货物班列开行方案优化研究"", 《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》 * |
| 马利 等: ""铁路环形班列开行方案优化方法研究"", 《铁道运输与经济》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458322A (en) * | 2019-06-26 | 2019-11-15 | 北京交通大学 | Consider the train operation plan generation method of enterprise demand |
| CN110458322B (en) * | 2019-06-26 | 2022-06-03 | 北京交通大学 | Train operation plan generation method considering enterprise requirements |
| CN111523814A (en) * | 2020-04-26 | 2020-08-11 | 西南交通大学 | Intelligent planning method for urban rail transit schedule and vehicle bottom application plan |
| CN111523814B (en) * | 2020-04-26 | 2022-02-11 | 西南交通大学 | Intelligent planning method for urban rail transit schedule and vehicle bottom application plan |
| CN111967828A (en) * | 2020-08-20 | 2020-11-20 | 北京交通大学 | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method |
| CN112801346A (en) * | 2021-01-12 | 2021-05-14 | 北京交通大学 | Railway goods overall process transportation planning method |
| CN112801346B (en) * | 2021-01-12 | 2024-04-09 | 北京交通大学 | Method for planning whole-process transportation of railway goods |
| CN113379102A (en) * | 2021-05-20 | 2021-09-10 | 浙江百世技术有限公司 | Multi-network trunk transport optimization method, computer equipment and storage medium |
| CN113379102B (en) * | 2021-05-20 | 2022-10-18 | 浙江百世技术有限公司 | Multi-network trunk transport optimization method, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109902866B (en) | 2021-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109902866A (en) | The cooperative optimization method of railway fast freight class column starting scheme and rolling stock | |
| Yin et al. | Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches | |
| Froger et al. | The electric vehicle routing problem with capacitated charging stations | |
| Shiri et al. | Optimization of drayage operations with time-window constraints | |
| Li et al. | Real-time vehicle rerouting problems with time windows | |
| Kachitvichyanukul et al. | Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO | |
| CN111967828A (en) | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method | |
| JP2020004404A (en) | System for assigning commutation vehicle to passenger | |
| Wang et al. | Optimization of bus bridging service under unexpected metro disruptions with dynamic passenger flows | |
| CN110826951A (en) | Transportation line stowage method and device, electronic equipment and computer readable medium | |
| Qureshi et al. | Scheduling and routing of mobile charging stations with stochastic travel times to service heterogeneous spatiotemporal electric vehicle charging requests with time windows | |
| Kaewpuang et al. | Cooperative management in full-truckload and less-than-truckload vehicle system | |
| Ninikas et al. | Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls | |
| Montaña et al. | A novel mathematical approach for the Truck-and-Drone Location-Routing Problem | |
| Li et al. | Optimizing a shared freight and passenger high-speed railway system: A multi-commodity flow formulation with Benders decomposition solution approach | |
| Sadykov et al. | Solving a freight railcar flow problem arising in Russia | |
| Lan et al. | Optimizing train formation problem with car flow routing and train routing by benders-and-price approach | |
| Chow et al. | Real-time Bidding based Vehicle Sharing. | |
| Jin et al. | An approach for train stop planning with variable train length and stop time of high-speed rail under stochastic demand | |
| Al Theeb et al. | Optimization of logistic plans with adopting the green technology considerations by utilizing electric vehicle routing problem | |
| Haider et al. | Optimizing the relocation operations of free-floating electric vehicle sharing systems | |
| CN113743679B (en) | High-speed rail network maintenance scheduling method and equipment based on weighted graph and multiple traveling salesmen | |
| Hanczar et al. | The short-term car flow planning model in rail freight company–case study | |
| KR101321644B1 (en) | Method for wagon repositioning in railroad transportation | |
| Heilig et al. | port-IO: A mobile cloud platform supporting context-aware inter-terminal truck routing |
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 |