CN116205470B - Container synchronous transfer scheduling optimization method and system - Google Patents
Container synchronous transfer scheduling optimization method and system Download PDFInfo
- Publication number
- CN116205470B CN116205470B CN202310493316.8A CN202310493316A CN116205470B CN 116205470 B CN116205470 B CN 116205470B CN 202310493316 A CN202310493316 A CN 202310493316A CN 116205470 B CN116205470 B CN 116205470B
- Authority
- CN
- China
- Prior art keywords
- transfer
- cargo
- container
- yard
- time
- 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.)
- Active
Links
- 238000012546 transfer Methods 0.000 title claims abstract description 299
- 230000001360 synchronised effect Effects 0.000 title claims abstract description 54
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000005457 optimization Methods 0.000 title claims description 39
- 230000006870 function Effects 0.000 claims description 8
- 230000007704 transition Effects 0.000 claims description 7
- 238000006467 substitution reaction Methods 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 8
- 238000004891 communication Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000014509 gene expression Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
-
- 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
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a system for optimizing synchronous transfer scheduling of containers, which belong to the technical field of container resource scheduling and comprise the following steps: calculating transfer task switching waiting time of the transfer vehicle based on the container transfer information; constructing a synchronous transfer scheduling model according to the stacking position, the operation sequence and the transfer task switching waiting time of the container, and determining a transfer task allocation strategy; based on a transfer task allocation strategy, determining cargo transportation information between the train transfer station and the cargo yard; and constructing a cargo yard transfer model, and determining the optimal cargo yard reaching the train transfer station in all cargo yards by combining the cargo transportation information. The invention takes the common rail intermodal transportation as the background, reduces the waiting time of freight trains in the process of transferring the containers on the premise of determining the stacking positions and the operation sequences of the containers, optimizes the scheduling arrangement of transfer vehicles in the process of transferring the containers, and accelerates the in-station management and operation efficiency of transferring the containers.
Description
Technical Field
The invention relates to the technical field of container resource scheduling, in particular to a method and a system for optimizing synchronous transfer scheduling of containers.
Background
In modern logistics systems, multi-mode intermodal transportation is mostly adopted, wherein in multi-mode intermodal cargo transportation, containers are widely used as a standardized cargo transportation unit for rapid transportation of cargoes. The rapid transfer of the container is an important link in the intermodal transportation of the public and the railway, and mainly solves the problem of transferring the container between different vehicles so as to realize rapid connection and transportation of cargoes. Although the development of the intermodal transportation is on a primary scale, the problems of poor dispatching optimization and low dispatching efficiency still exist in the aspects of actual container dispatching and dispatching optimization.
Under the existing container yard operation plan, the container yard transfer operation needs the container transfer among all the classes to take the container yard as a transfer point, and under the transfer mode, the necessary flow is two loading and unloading operations and one temporary storage operation of the container. In order to accelerate the transfer process of the container, it is necessary to reduce the time for temporary storage as much as possible. The factors considered by the container transferring mode adopted at present are single, and the overall planning is lacked, so that the efficiency of container transportation scheduling is lower.
Disclosure of Invention
The invention provides a method and a system for optimizing synchronous transfer scheduling of containers, which are used for solving the defect that the prior art lacks an effective planning means for the transfer scheduling of the containers, so that the overall transportation efficiency is lower.
In a first aspect, the present invention provides a method for optimizing synchronous transportation scheduling of containers, including:
acquiring container transfer information, and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information;
according to the stacking position, the operation sequence and the transferring task switching waiting time of the container, a synchronous transferring scheduling model is constructed, and the synchronous transferring scheduling model is optimized by utilizing a dynamic optimization algorithm and preset constraint conditions, so that a transferring task allocation strategy is determined;
based on the transferring task allocation strategy, determining cargo transportation information between the class transfer station and the cargo yard;
and constructing a cargo yard transfer model, and determining the optimal cargo yard reaching the shift column transfer station in all cargo yards by combining the cargo transportation information.
In a second aspect, the present invention also provides a system for optimizing synchronous transportation scheduling of containers, including:
the acquisition module is used for acquiring container transfer information and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information;
the optimizing module is used for constructing a synchronous transfer scheduling model according to the stacking position, the operation sequence and the transfer task switching waiting time of the container, optimizing the synchronous transfer scheduling model by utilizing a dynamic optimizing algorithm and a preset constraint condition, and determining a transfer task allocation strategy;
the distribution module is used for determining the cargo transportation information between the shift column transfer station and the cargo yard based on the transfer task distribution strategy;
and the determining module is used for constructing a cargo yard transferring model and determining the optimal cargo yard reaching the train transfer station in all cargo yards by combining the cargo transportation information.
In a third aspect, the present invention further provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the container synchronous diversion scheduling optimization method according to any one of the above when executing the program.
According to the method and the system for optimizing the synchronous transfer scheduling of the containers, disclosed by the invention, by taking the common rail intermodal transportation as the background, on the premise of determining the stacking positions and the operation sequences of the containers, the waiting time of freight trains in the container transfer process is reduced, the scheduling of transfer vehicles in the container transfer process is optimized, and the in-station management and operation efficiency of the container transfer are accelerated.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described, and it is obvious that the drawings in the description below are some embodiments of the invention, and other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of a method for optimizing synchronous transfer scheduling of containers;
FIG. 2 is a schematic diagram of a system for optimizing synchronous transportation and dispatch of containers;
fig. 3 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Fig. 1 is a flow chart of a method for optimizing synchronous transportation scheduling of containers according to an embodiment of the present invention, as shown in fig. 1, including:
step 100: acquiring container transfer information, and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information;
step 200: according to the stacking position, the operation sequence and the transferring task switching waiting time of the container, a synchronous transferring scheduling model is constructed, and the synchronous transferring scheduling model is optimized by utilizing a dynamic optimization algorithm and preset constraint conditions, so that a transferring task allocation strategy is determined;
step 300: based on the transferring task allocation strategy, determining cargo transportation information between the class transfer station and the cargo yard;
step 400: and constructing a cargo yard transfer model, and determining the optimal cargo yard reaching the shift column transfer station in all cargo yards by combining the cargo transportation information.
Specifically, firstly, acquiring transfer information of a container, and calculating waiting time of a transfer vehicle from the end of a current transfer task to the start of a next transfer task according to the transfer information; then, the stacking position and the operation sequence of the container are obtained, a synchronous transfer scheduling optimization model of the container is established, constraint conditions are set for the synchronous transfer scheduling optimization model, the synchronous transfer scheduling optimization model is optimized through a dynamic optimization algorithm, and transfer tasks are distributed to different transfer vehicles; acquiring a plurality of cargo yards with transfer relations with the train transfer stations, and acquiring cargo information required to be transferred to the train transfer stations in each cargo yard and the distance between the cargo yards, wherein the cargo loading waiting time, the cargo yard entering time and the cargo yard leaving time are acquired; and finally, by setting a yard transfer model, combining the cargo information and the distance between the yards, selecting the optimal yard from all yards to transport the cargo to the train transfer station, wherein the efficiency of transporting the cargo from the current yard to the optimal yard to the train transfer station is highest.
The invention takes the common rail intermodal transportation as the background, reduces the waiting time of freight trains in the process of transferring the containers on the premise of determining the stacking positions and the operation sequences of the containers, optimizes the scheduling arrangement of transfer vehicles in the process of transferring the containers, and accelerates the in-station management and operation efficiency of transferring the containers.
Based on the above embodiment, the calculating the transfer task switching waiting time of the transfer vehicle based on the container transfer information includes:
acquiring the running speed of a transfer vehicle, the operation time required by loading and unloading single containers by a train, the time required by loading and unloading any container by the train, the distance between a current transfer task and a next transfer task and the operation determining coefficient of a cargo yard;
dividing the distance between the current transfer task and the next transfer task by the running speed of the transfer vehicle, and obtaining the transfer task switching waiting time after the product of the cargo yard operation determining coefficient and the time required by the shift line to load and unload any container and the product of the difference of the cargo yard operation determining coefficient and the time required by the shift line to load and unload the single container are subtracted by 1, and respectively adding.
Specifically, calculating the waiting time of the diversion vehicle from the end of the current diversion task to the start of the next diversion task includes:
t represents the working time required for loading and unloading a container by the train,indicating the time required for loading and unloading the jth container by the class,/->Indicating the speed of travel of the transport vehicle,/->Representing the path between the current transfer task m and the next transfer task n; />Determining coefficients for the operation of the freight yard, if the transfer task n is still operating in the freight yard, +.>1, otherwise->0->Representing the waiting time.
Based on the above embodiment, the constructing a synchronous transfer scheduling model according to the stacking position of the container, the job sequence, and the transfer task switching waiting time includes:
determining the operation starting time of any container, the time required by a transfer vehicle to transfer any container between a cargo yard and a train transfer station, the time required by a train to load and unload any container and the operation time required by a train to load and unload a single container;
adding the operation starting time of any container, the time required by the transfer vehicle to transfer any container between a cargo yard and a train transfer station, the time required by the train to load and unload any container and the operation time required by the train to load and unload a single container, and obtaining the association relation between the unified transfer task starting time and the finishing time;
and determining the minimum value of the difference between the initial time of starting transferring of the first container subtracted from the association relation between the initial time and the final time of the unified transferring task, and obtaining the synchronous transferring scheduling model.
Wherein the dynamic optimization algorithm comprises:
if any transfer vehicle is determined to finish the transfer task, the any transfer vehicle enters a garage to wait for task arrangement, otherwise, enters a train transfer station to wait for cargo loading and unloading;
if any transfer vehicle enters a train transfer station to wait for cargo loading and unloading, matching the train with the least loading and unloading task vehicles;
and if the fact that other yard operations exist in the preset range after the fact that any transfer vehicle completes the yard operations is determined, and loading and unloading operations of the shift transfer stations are not affected, completing the other yard operations by any transfer vehicle, otherwise, entering the shift transfer stations by any transfer vehicle to wait for the operations.
Wherein, the preset constraint condition includes:
determining that the initial time for starting transferring of the first container is 0;
determining that the operation start time of other containers except the first container is greater than 0;
the association relation between the starting time and the ending time of the unified transferring task is determined and is obtained by summing the operation starting time of any container, the time required by the transferring vehicle to transfer any container between a cargo yard and a train transfer station, the time required by the train to load and unload any container and the operation time required by the train to load and unload a single container;
determining that any container can only be transported by any transport vehicle;
determining, in a work sequence of any one of the haul vehicles, that any one of the haul tasks is represented adjacent to any other of the haul tasks;
determining that in different transfer vehicle operations, the sum of the association relation between the unified transfer task starting time and the end time and the transfer task switching waiting time is less than or equal to 1 minus the product of the difference between adjacent representations of any transfer task and any other transfer task and a preset maximum positive number, and the sum of the transfer task starting time and the transfer task switching waiting time and the sum of the container operation starting time;
determining that the value range of any container which can only be transported by any transport vehicle is between 0 and 1;
determining that the value range of the adjacent representation of any transfer task and any other transfer task is between 0 and 1;
and determining that the transfer task switching waiting time is more than or equal to 0.
The optimizing the synchronous transfer scheduling model by using a dynamic optimization algorithm and a preset constraint condition, and determining a transfer task allocation strategy comprise the following steps:
acquiring a plurality of stages of any route from a starting point to a destination in a transfer task, and determining an initial node of each stage as a state variable and a termination node of each stage as a decision variable;
determining the state variable of the next stage of any stage according to the state variable and the decision variable of any stage to obtain a state transition equation;
acquiring an arc weight from a state variable of any stage in the state transition equation to a decision variable of any stage, wherein the arc weight is used as the working time of any stage;
summing the arc weights of all stages, determining an objective function, and determining the minimum value of the sum of the arc weight of any stage and the decision variable of the next stage of any stage by the objective function, wherein the state variable of adding 1 to the number of all stages is 0, and the state variable is used as a dynamic optimization equation;
and outputting the transferring task allocation strategy by using the dynamic optimization equation.
Specifically, the synchronous transfer scheduling optimization model constructed by the embodiment of the invention is as follows:
the corresponding constraint conditions include:
1）the initial time for the 1 st container to start transferring is 0;
2）indicating that the operation start time of the subsequent container is greater than 0;
3）representing the relation between the start time and the end time of a unified transfer task, wherein +.>Indicating that the transfer vehicle will be->The time required for transferring individual containers from a cargo yard to a shift gate or from a shift gate to a cargo yard, +.>Indicating the handling of the class->Time required for individual containers, < >>Indicating the working time required for loading and unloading a container by the class,/->Representing the total time required for unifying the transferring tasks;
4）represents->The individual containers can only be transported by transport vehicles +.>Transport, I/O>Representing the total number of transport vehicles>Representing transport vehicle +.>Transportation is taken>A plurality of containers;
5）indicating in the transfer vehicle->In the work sequence of (2) transport task->Immediately following the transfer task->Thereafter (I)>Representing the total number of transfer tasks>Representing transport vehicle->Transportation is taken>Individual containers and->A plurality of containers;
6）representing the relationship between adjacent transfer tasks in k operations of different transfer vehicles, H representing a very large positive number, < ->Indicate->Waiting time of each container;
will beSubstitution of the specific expression of (c) to obtain:
；
7）representing the variable->Is a value range of (a);
8）representing the variable->Is a value range of (a);
9）representing the variable->Is a range of values.
Further, the scheduling rules of the transfer vehicles need to be determined when solving by using a dynamic optimization algorithm:
1) After the transfer vehicle finishes the transfer task, entering a garage to wait for subsequent task arrangement, and returning to a train transfer station to wait for cargo loading and unloading if the transfer task still exists;
2) When the transfer vehicle returns to the train transfer station to wait for loading and unloading operation, the train with fewer vehicles waiting for loading and unloading tasks is preferentially selected;
3) After the transfer vehicle finishes the operation in the storage yard, if the operation in the storage yard is still nearby and the loading and unloading operation of the shift column transfer station is not influenced, the operation in the storage yard is nearly finished, otherwise, the operation returns to the shift column transfer station to wait for the subsequent loading and unloading operation.
The first step:
in the problem of the number of steps in the whole process, since any one route from the start point to the destination is composed of n sides (the transit time of each container is regarded as a side length), n is taken as the total number of stages, and k=1, 2. State selection of initial node of each stageThe decision is the termination node +_ of each stage>State transition equation->To represent. Given the value of the k-stage state variable, if the decision variable for that stage determines,the state variable of stage (k+1) can be determined.
And a second step of:
stage effect，/>The representation is from s k To u k The arc weight in between, here representing the working time of this stage.
And a third step of:
determining an objective function:
fourth step:
after the objective function is determined, the dynamic optimization equation can be further determined
Fifth step:
to make the symbols unified and the expressions clearer, useRepresenting the state of stage k by +.>Decision representing stage k will +.>Marked as->The dynamic optimization equation determined in the fourth step can be further simplified:
representing the state of the k phase->Representing the decision of the k-stage and n representing the total number of stages.
Based on the above embodiment, the cargo transportation information includes: loading waiting time, entering cargo yard time, leaving cargo yard time and distance between cargo yards.
Specifically, the embodiment of the invention acquires a plurality of cargo yards with a transfer relation with the train transfer stations, and acquires cargo information which needs to be transferred to the train transfer stations in each cargo yard and the distance between the cargo yards, wherein the cargo information comprises cargo loading waiting time, cargo entering yard time and cargo leaving yard time.
Based on the above embodiment, the constructing a cargo yard transfer model, combining the cargo transportation information, determining an optimal cargo yard from all cargo yards to the shift column transfer station includes:
determining a cargo transportation coefficient of a cargo yard;
if the cargo transportation coefficient of the cargo yard is determined to be not equal to 1, dividing the product of the sum of the distances from all cargo yards to the current cargo yard and the distance adjustment weight by the product of the sum of the cargo waiting time, the time for entering the cargo yard and the time for leaving the cargo yard and the running speed of the transfer vehicle, and taking the minimum value to obtain the optimal cargo yard;
and if the cargo transportation coefficient of the cargo yard is determined to be equal to 1, determining the current cargo yard as the optimal cargo yard.
Specifically, the yard storage yard transfer model is:
wherein ,for the optimal cargo yard, < > for>For loading waiting time, +.>To enter the yard time, < > for the goods>For leaving the yard time of goods, ->For transferring the total number of tasks->For the speed of the transport vehicle>For the distance of the ith cargo yard from the current cargo yard, +.>Weights are adjusted for distance->For the freight transport coefficient of the freight yard, when +.>When the cargo can be transported by the transfer vehicle, representing the existence of the cargo in the current cargo yard, when +.>And when the representative transfer vehicle needs to transport goods to other goods yards to the train transfer station.
The container synchronous transfer scheduling optimization system provided by the invention is described below, and the container synchronous transfer scheduling optimization system described below and the container synchronous transfer scheduling optimization method described above can be referred to correspondingly.
Fig. 2 is a schematic structural diagram of a container synchronous transferring, dispatching and optimizing system provided by an embodiment of the present invention, as shown in fig. 2, including: an acquisition module 21, an optimization module 22, an allocation module 23 and a determination module 24, wherein:
the acquiring module 21 is configured to acquire container transferring information, and calculate transferring task switching waiting time of a transferring vehicle based on the container transferring information; the optimizing module 22 is configured to construct a synchronous transfer scheduling model according to the stacking position, the job sequence and the transfer task switching waiting time of the container, optimize the synchronous transfer scheduling model by using a dynamic optimizing algorithm and a preset constraint condition, and determine a transfer task allocation strategy; the allocation module 23 is used for determining cargo transportation information between the train transfer station and the cargo yard based on the transfer task allocation strategy; the determining module 24 is configured to construct a cargo yard transfer model, and determine an optimal cargo yard from all cargo yards to the shift gate in conjunction with the cargo transportation information.
Fig. 3 illustrates a physical schematic diagram of an electronic device, as shown in fig. 3, where the electronic device may include: processor 310, communication interface (Communications Interface) 320, memory 330 and communication bus 340, wherein processor 310, communication interface 320, memory 330 accomplish communication with each other through communication bus 340. The processor 310 may invoke logic instructions in the memory 330 to perform a container synchronous diversion scheduling optimization method comprising: acquiring container transfer information, and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information; according to the stacking position, the operation sequence and the transferring task switching waiting time of the container, a synchronous transferring scheduling model is constructed, and the synchronous transferring scheduling model is optimized by utilizing a dynamic optimization algorithm and preset constraint conditions, so that a transferring task allocation strategy is determined; based on the transferring task allocation strategy, determining cargo transportation information between the class transfer station and the cargo yard; and constructing a cargo yard transfer model, and determining the optimal cargo yard reaching the shift column transfer station in all cargo yards by combining the cargo transportation information.
Further, the logic instructions in the memory 330 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the container synchronous diversion scheduling optimization method provided by the above methods, the method comprising: acquiring container transfer information, and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information; according to the stacking position, the operation sequence and the transferring task switching waiting time of the container, a synchronous transferring scheduling model is constructed, and the synchronous transferring scheduling model is optimized by utilizing a dynamic optimization algorithm and preset constraint conditions, so that a transferring task allocation strategy is determined; based on the transferring task allocation strategy, determining cargo transportation information between the class transfer station and the cargo yard; and constructing a cargo yard transfer model, and determining the optimal cargo yard reaching the shift column transfer station in all cargo yards by combining the cargo transportation information.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (4)
1. The method for optimizing the synchronous transfer scheduling of the container is characterized by comprising the following steps of:
acquiring container transfer information, and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information;
according to the stacking position, the operation sequence and the transferring task switching waiting time of the container, a synchronous transferring scheduling model is constructed, and the synchronous transferring scheduling model is optimized by utilizing a dynamic optimization algorithm and preset constraint conditions, so that a transferring task allocation strategy is determined;
based on the transferring task allocation strategy, determining cargo transportation information between the class transfer station and the cargo yard;
constructing a cargo yard transfer model, and determining the optimal cargo yard reaching the shift column transfer station in all cargo yards by combining the cargo transportation information;
the calculating the transferring task switching waiting time of the transferring vehicle based on the container transferring information comprises the following steps:
acquiring the running speed of a transfer vehicle, the operation time required by loading and unloading single containers by a train, the time required by loading and unloading any container by the train, the distance between a current transfer task and a next transfer task and the operation determining coefficient of a cargo yard;
dividing the distance between the current transfer task and the next transfer task by the running speed of the transfer vehicle, and obtaining the transfer task switching waiting time after the product of the cargo yard operation determining coefficient and the time required by the shift column to load and unload any container and the product of 1 subtracting the difference of the cargo yard operation determining coefficient and the time required by the shift column to load and unload a single container;
wherein ,indicating the working time required for loading and unloading a container by the class,/->Indicating the time required for loading and unloading the jth container by the class,/->Indicating the speed of travel of the transport vehicle,/->Representing the path between the current transfer task m and the next transfer task n; />Determining coefficients for the operation of the freight yard, if the transfer task n is still operating in the freight yard, +.>1, otherwise->0->Representing a waiting time;
the constructing a cargo yard transferring model, combining the cargo transportation information, determining the optimal cargo yard reaching the shift column transfer station in all cargo yards, comprising:
determining a cargo transportation coefficient of a cargo yard;
if the cargo transportation coefficient of the cargo yard is determined to be not equal to 1, dividing the product of the sum of the distances from all cargo yards to the current cargo yard and the distance adjustment weight by the product of the sum of the cargo waiting time, the time for entering the cargo yard and the time for leaving the cargo yard and the running speed of the transfer vehicle, and taking the minimum value to obtain the optimal cargo yard;
if the cargo transportation coefficient of the cargo yard is determined to be equal to 1, determining that the current cargo yard is the optimal cargo yard:
wherein ,for the optimal cargo yard, < > for>For loading waiting time, +.>To enter the yard time, < > for the goods>For leaving the cargo yard time，/>For transferring the total number of tasks->For the speed of the transport vehicle>For the distance of the ith cargo yard from the current cargo yard, +.>Weights are adjusted for distance->For the freight transport coefficient of the freight yard, when +.>When the cargo can be transported by the transfer vehicle, representing the existence of the cargo in the current cargo yard, when +.>When the representative transfer vehicle needs to transport goods to other goods yards to the train transfer station;
the step of constructing a synchronous transfer scheduling model according to the stacking position, the operation sequence and the transfer task switching waiting time of the container comprises the following steps:
determining the operation starting time of any container, the time required by a transfer vehicle to transfer any container between a cargo yard and a train transfer station, the time required by a train to load and unload any container and the operation time required by a train to load and unload a single container;
adding the operation starting time of any container, the time required by the transfer vehicle to transfer any container between a cargo yard and a train transfer station, the time required by the train to load and unload any container and the operation time required by the train to load and unload a single container, and obtaining the association relation between the unified transfer task starting time and the finishing time;
determining the minimum value of the difference between the initial time of starting transferring of the first container subtracted from the association relation between the initial time and the final time of the unified transferring task, and obtaining the synchronous transferring scheduling model;
the synchronous transportation scheduling model comprises the following steps:
the corresponding constraint conditions include:
the initial time for the 1 st container to start transferring is 0;
indicating that the operation start time of the subsequent container is greater than 0;
representing the relation between the start time and the end time of a unified transfer task, wherein +.>Indicating that the transfer vehicle will be->The time required for transferring individual containers from a cargo yard to a shift gate or from a shift gate to a cargo yard, +.>Indicating the handling of the class->Time required for individual containers, < >>Indicating the working time required for loading and unloading a container by the class,/->Representing the total time required for unifying the transferring tasks;
represents->The individual containers can only be transported by transport vehicles +.>Transport, I/O>Representing the total number of transport vehicles>Representing transport vehicle +.>Transportation is taken>A plurality of containers;
indicating in the transfer vehicle->In the work sequence of (2) transport task->Immediately following the transfer task->Thereafter (I)>Representing the total number of transfer tasks>Representing transport vehicle->Transportation is taken>Individual containers and->A plurality of containers;
representing the relationship between adjacent transfer tasks in k operations of different transfer vehicles, H representing a very large positive number, < ->Indicate->Waiting time of each container;
will beSubstitution results in:
；
representing the variable->Is a value range of (a);
representing the variable->Is a value range of (a);
representing the variable->Is a value range of (a);
the dynamic optimization algorithm comprises the following steps:
if any transfer vehicle is determined to finish the transfer task, the any transfer vehicle enters a garage to wait for task arrangement, otherwise, enters a train transfer station to wait for cargo loading and unloading;
if any transfer vehicle enters a train transfer station to wait for cargo loading and unloading, matching the train with the least loading and unloading task vehicles;
if the fact that after the storage yard operation is finished by any transfer vehicle, other storage yard operations exist in a preset range and loading and unloading operations of the shift transfer stations are not affected is determined, finishing the other storage yard operations by any transfer vehicle, otherwise, entering the shift transfer stations by any transfer vehicle to wait for the operations;
the preset constraint condition comprises:
determining that the initial time for starting transferring of the first container is 0;
determining that the operation start time of other containers except the first container is greater than 0;
the association relation between the starting time and the ending time of the unified transferring task is determined and is obtained by summing the operation starting time of any container, the time required by the transferring vehicle to transfer any container between a cargo yard and a train transfer station, the time required by the train to load and unload any container and the operation time required by the train to load and unload a single container;
determining that any container can only be transported by any transport vehicle;
determining, in a work sequence of any one of the haul vehicles, that any one of the haul tasks is represented adjacent to any other of the haul tasks;
determining that in different transfer vehicle operations, the sum of the association relation between the unified transfer task starting time and the end time and the transfer task switching waiting time is less than or equal to 1 minus the product of the difference between adjacent representations of any transfer task and any other transfer task and a preset maximum positive number, and the sum of the transfer task starting time and the transfer task switching waiting time and the sum of the container operation starting time;
determining that the value range of any container which can only be transported by any transport vehicle is between 0 and 1;
determining that the value range of the adjacent representation of any transfer task and any other transfer task is between 0 and 1;
determining that the transfer task switching waiting time is greater than or equal to 0;
optimizing the synchronous diversion scheduling model by using a dynamic optimization algorithm and preset constraint conditions, and determining a diversion task allocation strategy, wherein the method comprises the following steps:
acquiring a plurality of stages of any route from a starting point to a destination in a transfer task, and determining an initial node of each stage as a state variable and a termination node of each stage as a decision variable;
determining the state variable of the next stage of any stage according to the state variable and the decision variable of any stage to obtain a state transition equation;
acquiring an arc weight from a state variable of any stage in the state transition equation to a decision variable of any stage, wherein the arc weight is used as the working time of any stage;
summing the arc weights of all stages, determining an objective function, and determining the minimum value of the sum of the arc weight of any stage and the decision variable of the next stage of any stage by the objective function, wherein the state variable of adding 1 to the number of all stages is 0, and the state variable is used as a dynamic optimization equation;
and outputting the transferring task allocation strategy by using the dynamic optimization equation.
2. The method of optimizing synchronous transshipment scheduling of a container according to claim 1, wherein the cargo transportation information comprises: loading waiting time, entering cargo yard time, leaving cargo yard time and distance between cargo yards.
3. A synchronous transportation scheduling optimization system for containers, comprising:
the acquisition module is used for acquiring container transfer information and calculating transfer task switching waiting time of a transfer vehicle based on the container transfer information;
the optimizing module is used for constructing a synchronous transfer scheduling model according to the stacking position, the operation sequence and the transfer task switching waiting time of the container, optimizing the synchronous transfer scheduling model by utilizing a dynamic optimizing algorithm and a preset constraint condition, and determining a transfer task allocation strategy;
the distribution module is used for determining the cargo transportation information between the shift column transfer station and the cargo yard based on the transfer task distribution strategy;
the determining module is used for constructing a cargo yard transferring model and determining the optimal cargo yard reaching the train transfer station in all cargo yards by combining the cargo transferring information;
the acquisition module is specifically configured to:
acquiring the running speed of a transfer vehicle, the operation time required by loading and unloading single containers by a train, the time required by loading and unloading any container by the train, the distance between a current transfer task and a next transfer task and the operation determining coefficient of a cargo yard;
dividing the distance between the current transfer task and the next transfer task by the running speed of the transfer vehicle, and obtaining the transfer task switching waiting time after the product of the cargo yard operation determining coefficient and the time required by the shift column to load and unload any container and the product of 1 subtracting the difference of the cargo yard operation determining coefficient and the time required by the shift column to load and unload a single container;
wherein ,indicating the working time required for loading and unloading a container by the class,/->Indicating the time required for loading and unloading the jth container by the class,/->Indicating the speed of travel of the transport vehicle,/->Representing the path between the current transfer task m and the next transfer task n; />Determining coefficients for the operation of the freight yard, if the transfer task n is still operating in the freight yard, +.>1, otherwise->0->Representing a waiting time;
the determining module is specifically configured to:
determining a cargo transportation coefficient of a cargo yard;
if the cargo transportation coefficient of the cargo yard is determined to be not equal to 1, dividing the product of the sum of the distances from all cargo yards to the current cargo yard and the distance adjustment weight by the product of the sum of the cargo waiting time, the time for entering the cargo yard and the time for leaving the cargo yard and the running speed of the transfer vehicle, and taking the minimum value to obtain the optimal cargo yard;
if the cargo transportation coefficient of the cargo yard is determined to be equal to 1, determining that the current cargo yard is the optimal cargo yard:
wherein ,for the optimal cargo yard, < > for>For loading waiting time, +.>To enter the yard time, < > for the goods>For leaving the yard time of goods, ->For transferring the total number of tasks->For the speed of the transport vehicle>For the distance of the ith cargo yard from the current cargo yard, +.>Weights are adjusted for distance->For the freight transport coefficient of the freight yard, when +.>When the cargo can be transported by the transfer vehicle, representing the existence of the cargo in the current cargo yard, when +.>When the representative transfer vehicle needs to transport goods to other goods yards to the train transfer station;
the optimization module is specifically used for:
the step of constructing a synchronous transfer scheduling model according to the stacking position, the operation sequence and the transfer task switching waiting time of the container comprises the following steps:
determining the operation starting time of any container, the time required by a transfer vehicle to transfer any container between a cargo yard and a train transfer station, the time required by a train to load and unload any container and the operation time required by a train to load and unload a single container;
adding the operation starting time of any container, the time required by the transfer vehicle to transfer any container between a cargo yard and a train transfer station, the time required by the train to load and unload any container and the operation time required by the train to load and unload a single container, and obtaining the association relation between the unified transfer task starting time and the finishing time;
determining the minimum value of the difference between the initial time of starting transferring of the first container subtracted from the association relation between the initial time and the final time of the unified transferring task, and obtaining the synchronous transferring scheduling model;
the synchronous transportation scheduling model comprises the following steps:
the corresponding constraint conditions include:
the initial time for the 1 st container to start transferring is 0;
indicating that the operation start time of the subsequent container is greater than 0;
representing the relation between the start time and the end time of a unified transfer task, wherein +.>Indicating that the transfer vehicle will be->The time required for transferring individual containers from a cargo yard to a shift gate or from a shift gate to a cargo yard, +.>Indicating the handling of the class->Time required for individual containers, < >>Indicating the working time required for loading and unloading a container by the class,/->Representing the total time required for unifying the transferring tasks;
represents->The individual containers can only be transported by transport vehicles +.>Transport, I/O>Representing the total number of transport vehicles>Representing transport vehicle +.>Transportation is taken>A plurality of containers;
indicating in the transfer vehicle->In the work sequence of (2) transport task->Immediately following the transfer task->Thereafter (I)>Representing the total number of transfer tasks>Representing transport vehicle->Transportation is taken>Individual containers and->A plurality of containers;
representing the relationship between adjacent transfer tasks in k operations of different transfer vehicles, H representing a very large positive number, < ->Indicate->Waiting time of each container;
will beSubstitution results in:
；
representing the variable->Is a value range of (a);
representing the variable->Is a value range of (a);
representing the variable->Is a value range of (a);
the dynamic optimization algorithm comprises the following steps:
if any transfer vehicle is determined to finish the transfer task, the any transfer vehicle enters a garage to wait for task arrangement, otherwise, enters a train transfer station to wait for cargo loading and unloading;
if any transfer vehicle enters a train transfer station to wait for cargo loading and unloading, matching the train with the least loading and unloading task vehicles;
if the fact that after the storage yard operation is finished by any transfer vehicle, other storage yard operations exist in a preset range and loading and unloading operations of the shift transfer stations are not affected is determined, finishing the other storage yard operations by any transfer vehicle, otherwise, entering the shift transfer stations by any transfer vehicle to wait for the operations;
the preset constraint condition comprises:
determining that the initial time for starting transferring of the first container is 0;
determining that the operation start time of other containers except the first container is greater than 0;
the association relation between the starting time and the ending time of the unified transferring task is determined and is obtained by summing the operation starting time of any container, the time required by the transferring vehicle to transfer any container between a cargo yard and a train transfer station, the time required by the train to load and unload any container and the operation time required by the train to load and unload a single container;
determining that any container can only be transported by any transport vehicle;
determining, in a work sequence of any one of the haul vehicles, that any one of the haul tasks is represented adjacent to any other of the haul tasks;
determining that in different transfer vehicle operations, the sum of the association relation between the unified transfer task starting time and the end time and the transfer task switching waiting time is less than or equal to 1 minus the product of the difference between adjacent representations of any transfer task and any other transfer task and a preset maximum positive number, and the sum of the transfer task starting time and the transfer task switching waiting time and the sum of the container operation starting time;
determining that the value range of any container which can only be transported by any transport vehicle is between 0 and 1;
determining that the value range of the adjacent representation of any transfer task and any other transfer task is between 0 and 1;
determining that the transfer task switching waiting time is greater than or equal to 0;
optimizing the synchronous diversion scheduling model by using a dynamic optimization algorithm and preset constraint conditions, and determining a diversion task allocation strategy, wherein the method comprises the following steps:
acquiring a plurality of stages of any route from a starting point to a destination in a transfer task, and determining an initial node of each stage as a state variable and a termination node of each stage as a decision variable;
determining the state variable of the next stage of any stage according to the state variable and the decision variable of any stage to obtain a state transition equation;
acquiring an arc weight from a state variable of any stage in the state transition equation to a decision variable of any stage, wherein the arc weight is used as the working time of any stage;
summing the arc weights of all stages, determining an objective function, and determining the minimum value of the sum of the arc weight of any stage and the decision variable of the next stage of any stage by the objective function, wherein the state variable of adding 1 to the number of all stages is 0, and the state variable is used as a dynamic optimization equation;
and outputting the transferring task allocation strategy by using the dynamic optimization equation.
4. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the container synchronous diversion scheduling optimization method of claim 1 or 2 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310493316.8A CN116205470B (en) | 2023-05-05 | 2023-05-05 | Container synchronous transfer scheduling optimization method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310493316.8A CN116205470B (en) | 2023-05-05 | 2023-05-05 | Container synchronous transfer scheduling optimization method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116205470A CN116205470A (en) | 2023-06-02 |
| CN116205470B true CN116205470B (en) | 2023-08-04 |
Family
ID=86509828
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310493316.8A Active CN116205470B (en) | 2023-05-05 | 2023-05-05 | Container synchronous transfer scheduling optimization method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116205470B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004213090A (en) * | 2002-12-26 | 2004-07-29 | Nippon Express Co Ltd | Optimal dispatch management system for combination vehicle for export/import container |
| JP2012242997A (en) * | 2011-05-18 | 2012-12-10 | Hitachi Ltd | Transfer time calculation system and transfer time calculation method |
| CN111967828A (en) * | 2020-08-20 | 2020-11-20 | 北京交通大学 | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method |
| CN113298403A (en) * | 2021-06-03 | 2021-08-24 | 大连海事大学 | Transportation time window synchronization-based highway and molten iron combined transportation scheduling method |
| CN113361804A (en) * | 2021-06-28 | 2021-09-07 | 同济大学 | Buffer yard operation and inter-dock truck transportation cooperative scheduling system and method thereof |
| CN113627643A (en) * | 2021-06-28 | 2021-11-09 | 东南大学 | Multi-type intermodal ship and yard unmanned truck-concentration scheduling optimization method |
| CN114118605A (en) * | 2021-12-02 | 2022-03-01 | 招商局国际科技有限公司 | Container loading and unloading scheduling method, system, equipment and medium for container wharf |
| JP2022091599A (en) * | 2020-12-09 | 2022-06-21 | Ｊｆｅスチール株式会社 | Bottleneck visualization device and bottleneck visualization method |
| CN115049325A (en) * | 2022-08-17 | 2022-09-13 | 上海文景信息科技有限公司 | Intelligent scheduling method, system, equipment and storage medium for container port transshipment |
| CN115375220A (en) * | 2022-07-08 | 2022-11-22 | 湖南科技大学 | Logistics scheduling method, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200327497A1 (en) * | 2019-04-11 | 2020-10-15 | Federal Express Corporation | System and method for linehaul optimization |
-
2023
- 2023-05-05 CN CN202310493316.8A patent/CN116205470B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004213090A (en) * | 2002-12-26 | 2004-07-29 | Nippon Express Co Ltd | Optimal dispatch management system for combination vehicle for export/import container |
| JP2012242997A (en) * | 2011-05-18 | 2012-12-10 | Hitachi Ltd | Transfer time calculation system and transfer time calculation method |
| CN111967828A (en) * | 2020-08-20 | 2020-11-20 | 北京交通大学 | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method |
| JP2022091599A (en) * | 2020-12-09 | 2022-06-21 | Ｊｆｅスチール株式会社 | Bottleneck visualization device and bottleneck visualization method |
| CN113298403A (en) * | 2021-06-03 | 2021-08-24 | 大连海事大学 | Transportation time window synchronization-based highway and molten iron combined transportation scheduling method |
| CN113361804A (en) * | 2021-06-28 | 2021-09-07 | 同济大学 | Buffer yard operation and inter-dock truck transportation cooperative scheduling system and method thereof |
| CN113627643A (en) * | 2021-06-28 | 2021-11-09 | 东南大学 | Multi-type intermodal ship and yard unmanned truck-concentration scheduling optimization method |
| CN114118605A (en) * | 2021-12-02 | 2022-03-01 | 招商局国际科技有限公司 | Container loading and unloading scheduling method, system, equipment and medium for container wharf |
| CN115375220A (en) * | 2022-07-08 | 2022-11-22 | 湖南科技大学 | Logistics scheduling method, electronic equipment and storage medium |
| CN115049325A (en) * | 2022-08-17 | 2022-09-13 | 上海文景信息科技有限公司 | Intelligent scheduling method, system, equipment and storage medium for container port transshipment |
Non-Patent Citations (1)
| Title |
|---|
| Scheduling trucks in container terminals using a genetic algorithm;Ng, W. C.; Mak, K. L.; Zhang, Y. X.;《Engineering Optimization》;第39卷(第1期);第35页第2段-第40页第3段 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116205470A (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109726863A (en) | A kind of material-flow method and system of multiple-objection optimization | |
| CN111861205B (en) | Automatic container wharf outlet box space distribution method | |
| CN113298403B (en) | Public molten iron intermodal transportation scheduling method based on transportation time window synchronization | |
| CN108171460A (en) | A kind of Freight Transport method and its management system based on empty wagons resource peak use rate | |
| CN113627643A (en) | Multi-type intermodal ship and yard unmanned truck-concentration scheduling optimization method | |
| CN110490391B (en) | Calculation method of multi-type intermodal transportation scheme | |
| CN115081674B (en) | Local container transportation typesetting optimization method under novel truck queuing driving mode | |
| CN111428902A (en) | Method and device for determining transport route | |
| CN116205470B (en) | Container synchronous transfer scheduling optimization method and system | |
| Kong et al. | Joint optimization of container slot planning and truck scheduling for tandem quay cranes | |
| CN110097313B (en) | Method for acquiring a delivery vehicle path with a time window and a first-in last-out limit | |
| Martínez et al. | Gantry crane operations to transfer containers between trains: a simulation study of a Spanish terminal | |
| CN116090689B (en) | Freight resource optimization method and system based on transfer connection | |
| CN110544067B (en) | Multi-type combined transport system | |
| KR101108622B1 (en) | Method for Determination of container intermodal transportation scheduling | |
| KR100389076B1 (en) | Method for dispatching a transporter of a port container terminal | |
| CN115617049A (en) | AGV dolly control system based on concrete transportation platform | |
| Ambrosino et al. | New solution approaches for the train load planning problem | |
| CN113682352B (en) | Train flow calculation method, device, electronic equipment and storage medium | |
| CN111434394B (en) | Method and device for locking key points of travelling path of automatic trolley | |
| Coene et al. | The Lockmaster's problem | |
| CN112053046A (en) | Automatic container terminal AGV reentry and reentry path planning method with time window | |
| CN115169640B (en) | Automatic container terminal import box bit rearrangement method | |
| CN113602838B (en) | Railway container stacking method | |
| Liang | Analysis on the applicability of typical railway vehicle in intermodal transport |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230814 Address after: 430063 No. 745 Heping Avenue, Wuchang District, Hubei, Wuhan Patentee after: CHINA RAILWAY SIYUAN SURVEY AND DESIGN GROUP Co.,Ltd. Patentee after: HUBEI SANHUAN INTELLIGENT TECHNOLOGY Co.,Ltd. Address before: 430063 No. 745 Heping Avenue, Wuchang District, Hubei, Wuhan Patentee before: CHINA RAILWAY SIYUAN SURVEY AND DESIGN GROUP Co.,Ltd. Patentee before: HUBEI SANHUAN INTELLIGENT TECHNOLOGY Co.,Ltd. Patentee before: WUHAN GUIDE INTELLIGENT TECHNOLOGY CO.,LTD. |
|
| TR01 | Transfer of patent right | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhang Kun Inventor after: Zhou Mingxiang Inventor after: Li Jiaqi Inventor after: Liu Hui Inventor after: Zhang Junling Inventor after: Peng Fangjin Inventor after: Li Chengyang Inventor after: Zhang Yu Inventor after: Wan Chengpeng Inventor after: Mei Jie Inventor after: She Yong Inventor after: He Yi Inventor after: Wu Feng Inventor after: Zhan Jun Inventor after: Luo Xiaohua Inventor after: Guang Zhenxiong Inventor after: Dong Yunsong Inventor after: Lei Chong Inventor after: Yin Qin Inventor after: Qiu Shaofeng Inventor before: Zhang Kun Inventor before: Qiu Shaofeng Inventor before: Zhou Mingxiang Inventor before: Li Jiaqi Inventor before: Liu Hui Inventor before: Zhang Junling Inventor before: Peng Fangjin Inventor before: Li Chengyang Inventor before: Zhang Yu Inventor before: Wan Chengpeng Inventor before: Mei Jie Inventor before: He Yi Inventor before: Zhang Tao Inventor before: She Yong Inventor before: Wu Feng Inventor before: Zhan Jun Inventor before: Fan Pei Inventor before: Luo Xiaohua Inventor before: Guang Zhenxiong Inventor before: Dong Yunsong Inventor before: Lei Chong Inventor before: Yin Qin |
|
| CB03 | Change of inventor or designer information |