CN113602838B - Railway container stacking method - Google Patents
Railway container stacking method Download PDFInfo
- Publication number
- CN113602838B CN113602838B CN202110887945.XA CN202110887945A CN113602838B CN 113602838 B CN113602838 B CN 113602838B CN 202110887945 A CN202110887945 A CN 202110887945A CN 113602838 B CN113602838 B CN 113602838B
- Authority
- CN
- China
- Prior art keywords
- tuple
- container
- containers
- train
- unloaded
- 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
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
- B65G67/00—Loading or unloading vehicles
- B65G67/02—Loading or unloading land vehicles
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
- B65G2201/00—Indexing codes relating to handling devices, e.g. conveyors, characterised by the type of product or load being conveyed or handled
- B65G2201/02—Articles
- B65G2201/0235—Containers
- B65G2201/0258—Trays, totes or bins
Abstract
A railway container stacking method belongs to the technical field of container stacking. Calculating the position of a shell corresponding to a container to be unloaded on each vehicle of the whole train according to the position of the first vehicle, the sequence number of the train number and the length change of each vehicle; classifying containers to be unloaded on the train according to consignees; determining the number of available containers in the stock track; establishing a tuple 1 and a tuple 2, wherein the tuple 1 is a triple taking a container number, a receiver and a beta number as elements, the tuple 2 is a triple taking the receiver, the beta number and an available box number as elements, and the distance between the tuple 1 and the tuple 2 is calculated to be the unloading walking distance of the container; and calculating the unloading walking distance of the containers to be unloaded of the whole train according to the unloading walking distance of each container to be unloaded of the train. The railway container stacking method reduces the traveling distance of the loading and unloading equipment as much as possible, and simultaneously distributes the containers corresponding to different consignees in different berths as much as possible, thereby reducing the occurrence of moving and dumping the containers.
Description
Technical Field
A railway container stacking method belongs to the technical field of container stacking.
Background
Whether the containers are reasonably stacked in the logistics park or not can greatly influence the operation efficiency of the logistics park, the containers in the railway logistics park are unreasonably stacked, and a large amount of box reversing operation can be generated when a train is transported and loaded or a client lifts the containers and loads the automobiles after arriving at a station, so that the operation cost is increased by times or even tens of times.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method overcomes the defects of the prior art, and provides the railway container stacking method which reduces the traveling distance of the loading and unloading equipment as much as possible and reduces the occurrence of moving and dumping containers.
The technical scheme adopted by the invention for solving the technical problems is as follows: the railway container stacking method is characterized in that: the method comprises the following steps:
calculating the position of a shell corresponding to a container to be unloaded on each vehicle of the whole train according to the position of the first vehicle, the sequence number of the train number and the length change of each vehicle;
classifying containers to be unloaded on the train according to consignees;
determining the number of available containers in the stock track;
establishing a tuple 1 and a tuple 2, wherein the tuple 1 is a triple taking a container number, a receiver and a beta number as elements, the tuple 2 is a triple taking the receiver, the beta number and an available box number as elements, and the distance between the tuple 1 and the tuple 2 is calculated to be the unloading walking distance of the container;
and calculating the unloading walking distance of the containers to be unloaded of the whole train according to the unloading walking distance of each container to be unloaded of the train.
Preferably, the first container with the train sequence of 1 or the largest sequence is positioned, the corresponding position of the container is determined, and the first train positioning is completed.
Preferably, all empty seats of the containers which are not stacked are determined as available container seats;
and calculating the most top container receiver according to the outermost measurement of the positions with the stacked containers on the train, wherein if the receiver is on the train, the remaining number of the positions is the number of the available containers, otherwise the number of the available containers is 0.
Preferably, when the consignee of tuple 1 is the same as the consignee of tuple 2, the distance is the sum of the number of containers between the beta number and the available number of boxes of the target beta;
when the consignees of the tuple 1 and the tuple 2 are different, the distance is the sum of the total number of the bunkers of the stock track, the number of containers between the bunkers and the bunkers, and the available number of boxes of the target bunkers.
Preferably, the calculation formula of the distance is as follows: s ═ b (| b) 1 -b 2 |)+d+k*B；
Wherein s is the distance from tuple 1 to tuple 2; b 1 The number is the corresponding shell number of the container to be unloaded on the train; b 2 The position number is the planned target unloading position; d is the number of available boxes at the target unloading position; b is the total number of shell bits of the stock track; k is an adjusting factor, the number of the receiver in the shell corresponding to the target unloading position is reduced by 1, and K is 0 when all containers in the shell are the same receiver.
Under the condition that the number of available shellfishes is enough, different shellfishes can be allocated according to the consignees when the train is unloaded, the automobile does not need to be moved over when the automobile is carried, and the shellfishes of the same consignee are filled as much as possible through the parameter d in the formula. When the number of available shellfishes is insufficient, containers which need to store two or more consignees in the same shellfishes necessarily exist, and K >0 is reflected in the calculation of the unloading distance of the containers to be unloaded.
Preferably, the unloading travel distance S of the container to be unloaded of the whole train is as follows:
wherein s is the distance between the tuple 1 and the tuple 2, and n is the number of containers to be unloaded.
Typical container handling instructions for a railway container logistics park include: unloading vehicles, loading vehicles, unloading vehicles, loading vehicles and moving containers in the yard; in addition, part of scenes also include train direct unloading automobiles and automobile direct loading trains, the direct loading and direct unloading do not relate to stacking and are not considered, and the automobile loading and the train loading are generally carried out according to the designated containers of the service and are not considered. The instructions that affect the heap efficiency include: two instructions of unloading the train and unloading the automobile.
Compared with a port container yard, the railway container yard has the characteristics that: (1) stacking the containers along a railway operation line, and reserving the operation radius of loading and unloading equipment between the operation line and a stacking area; (2) the loading and unloading operation area and the stacking area are combined together, and not only are the functional areas for loading and unloading trains and loading and unloading automobiles borne, but also the function of stacking containers is taken into consideration; (3) at present, the railway container yard generally has a small number of container positions, poor ground hardening conditions and limited number of stacked containers; (4) most of the yard loading and unloading equipment mainly comprises a front crane. These characteristics determine that the railway container yard has its unique handling operation characteristics, and can not follow the operation mode of harbor.
Compared with the prior art, the invention has the beneficial effects that:
the railway container stacking method reduces the traveling distance of the loading and unloading equipment as much as possible, and simultaneously distributes the containers corresponding to different consignees in different berths as much as possible, thereby reducing the occurrence of moving and dumping the containers.
Detailed Description
The present invention is further described with reference to the following detailed description, however, it should be understood by those skilled in the art that the detailed description given herein with respect to the accompanying drawings is for better explanation and that the present invention is not necessarily limited to the specific embodiments, but rather, for equivalent alternatives or common approaches, may be omitted from the detailed description, while still remaining within the scope of the present application.
Example 1
The railway container stacking method comprises the following steps:
and calculating the corresponding position of the container to be unloaded on each vehicle of the whole train according to the position of the first vehicle, the sequence number of the train number and the length change of each vehicle.
And positioning the first container with the train sequence of 1 or the largest sequence, determining the corresponding position of the container, and finishing the first train positioning. The first car location can adopt artifical acquisition mode, also can adopt sub-meter level big dipper accurate positioning conversion mode to go on.
Calculating the corresponding positions of the containers to be unloaded on each vehicle of the whole train, and also calculating the positions of two or three containers to be unloaded on each vehicle of the whole train.
The containers to be unloaded on the train are classified according to the consignee.
And determining the number of available container positions of the stock track.
Determining all empty slots of the containers which are not stacked as available container slots; and calculating the most top container receiver according to the outermost measurement of the positions with the stacked containers on the train, wherein if the receiver is on the train, the remaining number of the positions is the number of the available containers, and otherwise, the number of the available containers is 0.
And creating a tuple 1 and a tuple 2, wherein the tuple 1 is a triplet taking the container number, the receiver and the beta number of the container as elements, the tuple 2 is a triplet taking the receiver, the beta number and the available box number as elements, and the distance between the tuple 1 and the tuple 2 is calculated, namely the unloading walking distance of the container.
The triplet of tuple 1 is (box number, consignee, beta number) and the triplet of tuple 2 is (consignee, beta number, available box number).
When the consignees of the tuple 1 and the tuple 2 are the same, the distance is the sum of the number of containers between the beta number and the available number of boxes of the target beta; when the consignees of the tuple 1 and the tuple 2 are different, the distance is the sum of the total number of the bunkers of the stock track, the number of containers between the bunkers and the bunkers, and the available number of boxes of the target bunkers.
The calculation formula of the distance is as follows: s ═ b (| b) 1 -b 2 |)+d+k*B；
Wherein s is the distance from tuple 1 to tuple 2; b 1 The number is the corresponding shell number of the container to be unloaded on the train; b 2 The beta number of the planned target unloading position; d is the number of available boxes at the target unloading position; b is the total number of shell bits of the stock track; k is an adjusting factor, the number of the receiver in the shell corresponding to the target unloading position is reduced by 1, and K is 0 when all containers in the shell are the same receiver.
And calculating the unloading walking distance of the containers to be unloaded of the whole train according to the unloading walking distance of each container to be unloaded of the train.
The unloading travel distance S of the container to be unloaded of the whole train is as follows:
wherein n is the number of containers to be unloaded.
The railway logistics garden container is used for identifying and checking vehicles and loaded containers before and after unloading and loading trains, and the problems of wrong number reading, missing checking, improper checking and the like exist in the prior art when manual work is carried out on reading numbers and safety checking, so that inconvenience is caused to the next operation, serious potential safety hazards and accidents are easy to occur when the checking is not in place.
Example 2
The unloading operation is that when the waiting box is transported from the outside to the inside, a specific box falling position needs to be allocated, and most of the operation is that the shippers have the same position as much as possible.
Unloading from the car to a particular bin space, the distance is defined as follows:
the distance formula is: s ═ b (| b) 1 -b 2 |)+d+k*B；
Wherein, b 1 The first scallop position when the automobile enters the station track; b 2 The beta number of the planned target unloading position; d is the number of available boxes at the target unloading position; b is the total number of shell bits of the stock track; and K is an adjusting factor, and the number of shippers of the Berth corresponding to the target unloading position is subtracted by 1, namely all containers of the Berth are 0 when the shippers are the same shipper.
The shortest distance for unloading the automobile is the target scallop b corresponding to the s minimum 2 。
While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. However, any simple modification, equivalent change and modification of the above embodiments according to the technical essence of the present invention are within the protection scope of the technical solution of the present invention.
Claims (4)
1. The railway container stacking method is characterized in that: the method comprises the following steps:
calculating the position of a shell corresponding to a container to be unloaded on each vehicle of the whole train according to the position of the first vehicle, the sequence number of the train number and the length change of each vehicle;
classifying containers to be unloaded on the train according to consignees;
determining the number of available containers in the stock track;
establishing a tuple 1 and a tuple 2, wherein the tuple 1 is a triple taking a container number, a receiver and a base number as elements, the tuple 2 is a triple taking the receiver, the base number and an available container number as elements, and the distance between the tuple 1 and the tuple 2 is calculated, namely the unloading walking distance of the container to be unloaded;
according to the unloading walking distance of each container to be unloaded of the train, calculating the unloading walking distance of the containers to be unloaded of the whole train;
when the consignees of the tuple 1 and the tuple 2 are the same, the distance is the sum of the number of containers between the beta number and the available number of container digits of the target beta;
when the consignees of the tuple 1 and the tuple 2 are different, the distance is the sum of the total number of the bunkers of the stock track, the number of containers between the corresponding bunkers of the containers to be unloaded on the train and the bunkers of the planned target unloading position, and the available number of the container boxes of the target bunkers;
the calculation formula of the distance is as follows: s = (| B1-B2|) + d + k × B;
wherein s is the distance from tuple 1 to tuple 2; b1 is the corresponding shell number of the container to be unloaded on the train; b2 is the beta number of the planned target unloading position; d is the number of available boxes at the target unloading position; b is the total number of shell bits of the stock track; k is an adjusting factor, the number of the receiver in the shell corresponding to the target unloading position is reduced by 1, and K is 0 when all containers in the shell are the same receiver.
2. The method of claim 1, wherein: and positioning the first container to be unloaded of the train with the sequence number of 1 or the largest train number, determining the corresponding position of the container to be unloaded, and finishing the first train positioning.
3. The method of claim 1, wherein: determining all empty slots of the containers which are not stacked as available container slots;
and calculating the most top container receiver according to the outermost measurement of the positions with the stacked containers on the train, wherein if the receiver is on the train, the remaining number of the positions is the number of the available containers, and otherwise, the number of the available containers is 0.
4. The method of claim 1, wherein: the unloading travel distance S of the container to be unloaded of the whole train is as follows:
wherein the content of the first and second substances,sfor the distance of tuple 1 and tuple 2,nthe number of the containers to be unloaded.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110887945.XA CN113602838B (en) | 2021-08-03 | 2021-08-03 | Railway container stacking method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110887945.XA CN113602838B (en) | 2021-08-03 | 2021-08-03 | Railway container stacking method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113602838A CN113602838A (en) | 2021-11-05 |
| CN113602838B true CN113602838B (en) | 2022-09-27 |
Family
ID=78306654
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110887945.XA Active CN113602838B (en) | 2021-08-03 | 2021-08-03 | Railway container stacking method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113602838B (en) |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9171277B2 (en) * | 2011-05-04 | 2015-10-27 | Victaulic Company | Generation of plans for loading and unloading a container |
| CN103723532B (en) * | 2014-01-13 | 2015-11-18 | 上海海事大学 | Multi-story frame type automated container dock stockyard loading and unloading system and handling method thereof |
| CN110443409B (en) * | 2019-07-05 | 2022-08-30 | 武汉大学深圳研究院 | Port exit container ship stowage method |
| CN111144806B (en) * | 2019-12-18 | 2023-05-16 | 青岛港国际股份有限公司 | Automatic loading method for dangerous goods container |
| CN111861205B (en) * | 2020-07-20 | 2022-09-27 | 深圳大学 | Automatic container wharf outlet box space distribution method |
-
2021
- 2021-08-03 CN CN202110887945.XA patent/CN113602838B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113602838A (en) | 2021-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11447336B2 (en) | Robotic cargo handling system and method | |
| CN109726863A (en) | A kind of material-flow method and system of multiple-objection optimization | |
| Brinkmann | Operations systems of container terminals: a compendious overview | |
| US20060045659A1 (en) | Buffered magazine method and system for loading and unloading ships | |
| CN113602838B (en) | Railway container stacking method | |
| KR101108622B1 (en) | Method for Determination of container intermodal transportation scheduling | |
| Ilesaliev et al. | Development of mathematical models of the relationship between the main parameters of a container depot | |
| US1577184A (en) | Freight-transferring system | |
| Woxenius | Inventory of transshipment technologies in intermodal transport | |
| Schumann et al. | NGT Cargo–Concept For A High-Speed Freight Train In Europe | |
| CN1321849C (en) | Rail vehicle for transporting large dimension freight | |
| Bochynek et al. | Overview of the combined transport market in the BSR | |
| Lizbetin et al. | Significance of proper selection of handling equipment in inland intermodal transport terminals | |
| Woxenius et al. | Intermodal transshipment technologies–an overview | |
| JP6851453B1 (en) | Freight car container loading position management system and transportation object loading position management system | |
| CN216140904U (en) | Direct-taking seamless reloading system for container vehicles and ships in molten iron intermodal port | |
| CN219729823U (en) | Three-dimensional continuous loading and unloading operation system for intermodal transportation of container | |
| Hu et al. | AS/RS based yard and yard planning | |
| CN209507152U (en) | Packaging cargo handling platform | |
| CN116395310A (en) | Operation area upper cover warehouse of railway cargo area and warehouse control method | |
| Hricová | Situation on intermodal terminals in the slovak republic | |
| Wiśnicki et al. | Analysis of combined transport terminal operations | |
| Muślewski et al. | Analysis of intermode connections in terms of transport system development in Poland | |
| Hull | Containerization on the Great Lakes: Why It Declined | |
| CN115649706A (en) | Three-dimensional logistics system based on road and railway combined transportation |
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 |