CN111652551A - Method and device for transporting and boxing goods - Google Patents
Method and device for transporting and boxing goods Download PDFInfo
- Publication number
- CN111652551A CN111652551A CN202010473542.6A CN202010473542A CN111652551A CN 111652551 A CN111652551 A CN 111652551A CN 202010473542 A CN202010473542 A CN 202010473542A CN 111652551 A CN111652551 A CN 111652551A
- Authority
- CN
- China
- Prior art keywords
- transported
- transport
- volume
- vehicle
- stacking
- 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
Images
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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a cargo transportation boxing method and device, electronic equipment and a computer readable storage medium, wherein the method comprises the following steps: acquiring a first to-be-transported package group sent from a first station to a second station, and calculating the sum of the volumes of all to-be-transported packages in the first to-be-transported package group as a first volume; allocating the transport vehicles of the first parcel group to be transported according to the first volume; classifying all packages to be transported in the first group of packages to be transported into N package types according to package volumes; and determining a stacking position of the ith type of package to be transported in the transport vehicles of the first package group to be transported as an ith type stacking position, so that any package to be transported in the ith type of package to be transported is stacked to any position in the ith type stacking position. The fixed positions of the codes or the codes are not required to be determined or printed for each package, and the packages are only required to be stacked to one type of stacking positions according to the package types, so that the method is simple and convenient, and the cargo loading efficiency is improved.
Description
Technical Field
The present application relates to the field of information processing technologies, and in particular, to a method and an apparatus for loading and packing goods, an electronic device, and a computer-readable storage medium.
Background
The rapid development of the internet promotes the rapid development of electronic commerce, and the regional difference between the supply and demand parties further promotes the rise of the express delivery industry. Transportation is an important part of the whole express logistics process, and the quality of the transportation process is influenced by vehicle scheduling and cargo loading.
In the commodity circulation trade, generally can carry out the freight vanning according to the quantity of waiting to transport the parcel, the process of goods loading is put the parcel by the staff at will gradually and is improved to the fine management, and the parcel that the loading and unloading car in-process exists is put things in good order, space utilization is low, loading and unloading car is long, consume the manpower, cause the damaged scheduling problem of parcel easily and obtain certain improvement, but prior art still has the problem that loading efficiency is not high and can not solve.
Disclosure of Invention
The application aims to provide a cargo transportation boxing method and device, electronic equipment and a computer readable storage medium, and solves the problem that the existing cargo transportation boxing technology is low in loading efficiency.
The purpose of the application is realized by adopting the following technical scheme:
in a first aspect, the present application provides a method of freight transportation binning, the method comprising: acquiring a first to-be-transported package group sent from a first station to a second station, and calculating the sum of the volumes of all to-be-transported packages in the first to-be-transported package group as a first volume; allocating the transport vehicles of the first parcel group to be transported according to the first volume, wherein the transport vehicles of the first parcel group to be transported pass through the first station and the second station in sequence; classifying all parcels to be transported in the first group of parcels to be transported into N parcel types according to the parcel volumes, and acquiring the parcels to be transported of the ith type, wherein N is a positive integer, and i is a positive integer not greater than N; and determining a stacking position of the ith type of package to be transported in the transport vehicles of the first package group to be transported as an ith type stacking position, so that any package to be transported in the ith type of package to be transported is stacked to any position in the ith type stacking position. The beneficial effects of this technical scheme lie in, according to the parcel that waits to transport of website allots haulage vehicle, treat that the transportation parcel is categorised, for the parcel that waits to transport of every type confirms one kind and puts things in good order the position, when putting things in good order and waiting to transport the parcel, put things in good order the parcel according to the parcel type and put things in good order arbitrary one position in the position to one kind that this type corresponds to the parcel, need not from this for every parcel confirms or beat sign indicating number, code fixed position, only need put things in good order to one kind according to parcel type sign indicating number put in good order the position can, and is simple and convenient, the reduction time.
In some possible implementations, the allocating the transport vehicles of the first group of parcels to be transported according to the first volume includes: acquiring the number M of empty vehicles required according to the first volume, wherein M is a positive integer; if the number of empty vehicles which can be allocated at the first station at present is not less than M, allocating M empty vehicles as the transport vehicles of the first to-be-transported package group; if the number of empty vehicles currently allocated to the first station is less than M, allocating all empty vehicles and at least one loaded transport vehicle as transport vehicles of the first to-be-transported package group, wherein the sum of the available transport volumes of allocated vehicles is not less than the first volume. The technical scheme has the advantages that the empty vehicles on the route are preferentially allocated according to the volume of the packages to be transported, if no empty vehicle exists or the empty vehicle is not enough to load the packages to be transported currently, other loaded transport vehicles are allocated, and the sum of the allocated available transport volumes of the empty vehicles and the loaded transport vehicles can meet the transportation requirement of the packages to be transported.
In some possible implementations, the allocating all empty vehicles and at least one loaded transport vehicle as transport vehicles for the first group of packages to be transported includes: acquiring the sum of available transportation volumes of all empty vehicles which can be currently allocated at the first station as a second volume; calculating a difference V between the first volume and the second volume0(ii) a Transferring at least one loaded vehicle whose sum of available transport volumes is not less than V0. The technical scheme has the beneficial effects that the volume of the residual packages to be transported after the empty vehicles load the goods is calculated, and the loaded transport vehicles are allocated accordingly.
In some possible implementations, the allocating at least one loaded vehicle includes: allocating a first loaded vehicle, obtaining a usable transport volume V of said first loaded vehicle1(ii) a If V0≤V1If so, allocating all empty vehicles and the first loaded transport vehicle as transport vehicles for the first group of parcels to be transported; if V0＞V1Then, a second loaded vehicle is deployed to obtain a usable transport volume V of the second loaded transport vehicle2(ii) a If V0-V1≤V2And then all empty vehicles, the first loaded transport vehicle and the second loaded transport vehicle are dispatched as transport vehicles for the first group of packages to be transported. The beneficial effects of this technical scheme lie in, after allocating a shipment haulage vehicle, obtain the current transportation volume that can use of allocation vehicle, judge whether satisfy the transportation needs that remain to transport the parcel, if unsatisfied, then continue allocating the vehicle, the transportation that can use the transportation volume to satisfy the parcel that waits to transport of allocation vehicle, realize haulage vehicle's many times or allocate in succession.
In some possible implementations, the determining a stacking position of the ith type of package to be shipped in the transporting vehicles of the first group of packages to be shipped as the ith type stacking position includes: obtaining a usable transport volume of a first transport vehicle of the transport vehicles of the first group of parcels to be transported; determining the stacking layer number of the first transport vehicle, the type of packages stacked on each layer and the quantity corresponding to each type according to the available transport volume of the first transport vehicle and a preset stacking rule; and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the first transport vehicle as the stacking position of the ith type of packages to be transported in the first transport vehicle. The beneficial effects of this technical scheme lie in, can use the transportation volume and predetermined rule of putting things in good order according to haulage vehicle confirms this haulage vehicle's the number of piles up, every layer of parcel type of putting things in good order and the quantity that every type corresponds, acquire the parcel of every type in this haulage vehicle and put things in good order layer sign and put things in good order quantity, put things in good order the layer that this type parcel that corresponds to the quantity to the layer sign that puts things in good order corresponds, put predetermined quantity's parcel to haulage vehicle according to the layer sign that puts things in good order, the layering is put in good order, there is the sign on every layer, personnel of being convenient for or automation equipment put things in good order appointed type's parcel to a certain layer according to the sign.
In some possible implementations, the determining the number of stacked layers, the type of package stacked on each layer, and the corresponding number of each type of the first transportation vehicle according to the available transportation volume of the first transportation vehicle and a predetermined stacking rule includes: acquiring the packages to be transported of which the time-effect type is the emergency type in the first package group to be transported, and calculating the sum of the volumes of the packages to be transported of which the time-effect type is the emergency type as a third volume; if the available transport volume of the first transport vehicle is greater than the third volume, calculating a difference W between the available transport volume of the first transport vehicle and the third volume; and determining the stacking number of layers of the first transportation vehicle, the stacking type of each layer of packages and the number corresponding to each type according to a preset stacking rule, so that the packages to be transported with the aging type of emergency and the packages to be transported with the aging type of W and the volume of W, which are not the emergency, are stacked in the first transportation vehicle. The technical scheme has the advantages that the emergency express is preferentially calculated when goods are calculated and stacked to a transport vehicle, the total volume of the package of the emergency express is subtracted, the package volume which can be accommodated by the residual volume is calculated and used for transporting general express, and the emergency express and the general express with the preset volume are stacked to the transport vehicle.
In some possible implementations, the determining a stacking position of the ith type of package to be shipped in the transporting vehicles of the first group of packages to be shipped as the ith type stacking position includes: pre-constructing a three-dimensional loading model of a second transport vehicle in the transport vehicles of the first parcel group to be transported, and updating the three-dimensional loading model according to the available transport volume and the internal loading shape at the current time after loading is finished each time; obtaining a preset stacking scheme according to the three-dimensional loading model of the second transport vehicle, wherein the preset stacking scheme is used for stacking preset package types in the second transport vehicle, and each type corresponds to a preset number of packages to be transported; and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the second transport vehicle according to the preset stacking scheme, wherein the stacking layer identification and the stacking quantity are used as the stacking positions of the ith type of packages to be transported in the second transport vehicle. The technical scheme has the advantages that the three-dimensional loading model of the transport vehicle is constructed in advance, the stacking scheme of the packages in the transport vehicle is simulated, the number of stacking layers in the transport vehicle is determined, the number of certain packages are stacked on each layer, the usable transport volume and the internal loading shape of the three-dimensional loading model corresponding to the transport vehicle are updated after each loading, the vehicle allocation is convenient for the next station, the three-dimensional loading model is dynamically maintained, the currently applicable stacking scheme is determined according to the dynamic maintenance, the packages are stacked in the transport vehicle according to the stacking scheme, and the efficiency of stacking the goods is further improved.
In some possible implementations, the method further includes: in response to a third transportation vehicle entering the first station, obtaining a usable transportation volume of the third transportation vehicle if the third transportation vehicle is a transportation vehicle of the first group of packages to be transported. The technical scheme has the advantages that the vehicles entering the station are monitored, and the usable transportation volume of the vehicles is determined.
In some possible implementations, the method further includes: transferring a parking location of each of the transport vehicles of the first group of parcels to be transported at the first station. The beneficial effects of this technical scheme lie in, transfer the parking position of vehicle at the website, personnel or automation equipment can prepare the parcel that needs the transportation in advance and put things in good order, improve work efficiency.
In a second aspect, the present application provides a freight transportation boxing apparatus, said apparatus comprising: the system comprises a package acquisition module, a first volume calculation module and a second volume calculation module, wherein the package acquisition module is used for acquiring a first to-be-transported package group sent from a first station to a second station and calculating the sum of the volumes of all to-be-transported packages in the first to-be-transported package group as a first volume; the vehicle allocating module is used for allocating the transport vehicles of the first parcel group to be transported according to the first volume, and the transport vehicles of the first parcel group to be transported pass through the first station and the second station in sequence; the parcel classification module is used for classifying all parcels to be transported in the first parcel group to be N parcel types according to the parcel volume, and acquiring the ith type of parcels to be transported, wherein N is a positive integer, and i is a positive integer not greater than N; and the position determining module is used for determining a stacking position of the ith type of package to be transported in the transporting vehicle of the first package group to be transported as an ith type stacking position, so that any package to be transported in the ith type of package to be transported is stacked to any position in the ith type stacking position.
In some possible implementations, the vehicle allocation module is configured to obtain a required number M of empty vehicles according to the first volume, where M is a positive integer; if the number of empty vehicles which can be allocated at the first station at present is not less than M, allocating M empty vehicles as the transport vehicles of the first to-be-transported package group; if the number of empty vehicles currently allocated to the first station is less than M, allocating all empty vehicles and at least one loaded transport vehicle as transport vehicles of the first to-be-transported package group, wherein the sum of the available transport volumes of allocated vehicles is not less than the first volume.
In some possible implementations, the vehicle allocation module obtains a sum of available transportation volumes of all empty vehicles currently available for allocation at the first station as a second volume; calculating a difference V between the first volume and the second volume0(ii) a Transferring at least one loaded vehicle whose sum of available transport volumes is not less than V0。
In some possible implementations, the vehicle allocation module allocates a first loaded vehicle to obtain the available transportation volume V of the first loaded transportation vehicle1(ii) a If V0≤V1If so, allocating all empty vehicles and the first loaded transport vehicle as transport vehicles for the first group of parcels to be transported; if V0＞V1Then, a second loaded vehicle is deployed to obtain a usable transport volume V of the second loaded transport vehicle2(ii) a If V0-V1≤V2And then all empty vehicles, the first loaded transport vehicle and the second loaded transport vehicle are dispatched as transport vehicles for the first group of packages to be transported.
In some possible implementations, the position determination module is to obtain a usable transport volume of a first transport vehicle of the transport vehicles of the first group of parcels to be transported; determining the stacking layer number of the first transport vehicle, the type of packages stacked on each layer and the quantity corresponding to each type according to the available transport volume of the first transport vehicle and a preset stacking rule; and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the first transport vehicle as the stacking position of the ith type of packages to be transported in the first transport vehicle.
In some possible implementations, the location determination module obtains the packages to be shipped in the first group of packages to be shipped whose aging type is the emergency type, and calculates a sum of volumes of the packages to be shipped whose aging type is the emergency type as a third volume; if the available transport volume of the first transport vehicle is greater than the third volume, calculating a difference W between the available transport volume of the first transport vehicle and the third volume; and determining the stacking number of layers of the first transportation vehicle, the stacking type of each layer of packages and the number corresponding to each type according to a preset stacking rule, so that the packages to be transported with the aging type of emergency and the packages to be transported with the aging type of W and the volume of W, which are not the emergency, are stacked in the first transportation vehicle.
In some possible implementations, the location determination module is configured to pre-construct a three-dimensional loading model of a second transport vehicle of the transport vehicles of the first group of packages to be transported, and update the three-dimensional loading model according to a current time available transport volume and an internal loading shape after each loading is completed; obtaining a preset stacking scheme according to the three-dimensional loading model of the second transport vehicle, wherein the preset stacking scheme is used for stacking preset package types in the second transport vehicle, and each type corresponds to a preset number of packages to be transported; and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the second transport vehicle according to the preset stacking scheme, wherein the stacking layer identification and the stacking quantity are used as the stacking positions of the ith type of packages to be transported in the second transport vehicle.
In some possible implementations, the method further includes a vehicle monitoring module, responsive to a third transport vehicle entering the first station, for obtaining a usable transport volume of the third transport vehicle if the third transport vehicle is a transport vehicle of the first group of packages to be transported.
In some possible implementations, the vehicle allocation module is further configured to allocate a parking location of each transport vehicle of the first group of packages to be transported at the first station.
In a third aspect, the present application provides an electronic device for cargo transportation packing, comprising a processor and a memory, the memory storing executable instructions of the processor, the processor being configured to perform the steps of the above-mentioned cargo transportation packing method via execution of the executable instructions.
In a fourth aspect, the present application provides a computer readable storage medium having stored thereon a computer program which, when executed, performs the steps of the above-described freight shipping packing method.
Compared with the prior art, the beneficial effect of this application includes:
the application discloses freight vanning method and device, electronic equipment and computer readable storage medium, a transport vehicle is allocated according to parcels to be transported at a station, the parcels to be transported are classified, one type of stacking position is determined for each type of parcel to be transported, the parcels are stacked to any one of the one type of stacking positions corresponding to the type according to the parcel type when the parcels to be transported are stacked, therefore, the fixed position does not need to be determined or coded and encoded for each parcel, only the parcel type is stacked to one type of stacking position, the method and device are simple and convenient, the time cost is reduced, and the freight loading efficiency is improved.
Drawings
The present application is further described below with reference to the drawings and examples.
Fig. 1 is a schematic flow chart of a cargo transportation packing method according to an embodiment of the present application;
fig. 2 is a schematic flow chart of preferentially allocating empty cars according to an embodiment of the present disclosure;
FIG. 3 is a schematic flow chart of transferring a loaded vehicle according to an embodiment of the present disclosure;
fig. 4 is a schematic flowchart of layered stacking according to an embodiment of the present application;
FIG. 5 is a flow chart illustrating a configuration and application of a stacking scheme according to an embodiment of the present disclosure;
FIG. 6 is a schematic flow chart of a method for packing cargo transportation according to an embodiment of the present application;
FIG. 7 is a block diagram of a cargo transportation and packing device according to an embodiment of the present disclosure;
FIG. 8 is a block diagram of a cargo transportation and packing device according to an embodiment of the present disclosure;
fig. 9 is a block diagram of an electronic device for cargo transportation packing according to an embodiment of the present disclosure;
fig. 10 is a schematic structural diagram of a program product for implementing a cargo transportation packing method according to an embodiment of the present application.
Detailed Description
The present application is further described with reference to the accompanying drawings and the detailed description, and it should be noted that, in the present application, the embodiments or technical features described below may be arbitrarily combined to form a new embodiment without conflict.
Referring to fig. 1, an embodiment of the present application provides a cargo transportation boxing method, which can be applied to a cargo transportation scene in a logistics industry, and the method includes steps S101 to S104.
Step S101: the method comprises the steps of obtaining a first to-be-transported package group sent from a first station to a second station, and calculating the sum of the volumes of all to-be-transported packages in the first to-be-transported package group to serve as a first volume. The first group of packages to be transported includes a plurality of packages to be transported, the packages to be transported can be accommodated in an outer packing box, and the volume of the packages to be transported can be determined according to the size of the outer packing box, for example, a rectangular parallelepiped. The unit of the first volume is for example cubic meters. It should be noted that the first station is generally an initial distribution station for the packages to be shipped in the first group of packages to be shipped, and the packages to be shipped are sent from the first station to the second station, but the second station is not necessarily a destination station for the packages to be shipped, and the second station may also be a distribution station for the route of the packages to be shipped.
Step S102: and allocating the transport vehicles of the first parcel group to be transported according to the first volume, wherein the transport vehicles of the first parcel group to be transported pass through the first station and the second station in sequence. The transport vehicles can be allocated by the vehicle allocation system, and the vehicle allocation system can master the dynamic state of each transport vehicle in real time and acquire various information of each transport vehicle, such as the model, the loadable weight, the volume and other parameters of the transport vehicle. In some possible implementations, the transportation volume of the transportation vehicle may be obtained according to a vehicle model, for example, if the model of a certain transportation vehicle is known as the passenger car M3, the transportation volume of the transportation vehicle may be obtained as the transportation volume corresponding to the passenger car M3. In other possible implementations, the license plate number of the transportation vehicle may be associated with the transportation volume of the transportation vehicle in advance, so that the transportation volume of the transportation vehicle and the remaining available transportation volume may be queried after the license plate number of the transportation vehicle is obtained, and in order to dynamically maintain the available transportation volume of the transportation vehicle, the latest available transportation volume of the transportation vehicle needs to be updated after the transportation vehicle passes through each allocation station for loading and unloading.
In some possible implementations, empty vehicles may be preferentially allocated to transport goods. Specifically, referring to fig. 2, the step S102 may include steps S201 to S203. Step S201: and acquiring the required empty vehicle number M according to the first volume, wherein M is a positive integer. Step S202: and if the number of the empty vehicles which can be currently allocated at the first station is not less than M, allocating M empty vehicles as the transport vehicles of the first to-be-transported package group. Step S203: if the number of empty vehicles currently allocated to the first station is less than M, allocating all empty vehicles and at least one loaded transport vehicle as transport vehicles of the first to-be-transported package group, wherein the sum of the available transport volumes of allocated vehicles is not less than the first volume. And preferentially allocating the empty vehicles on the route according to the volume of the packages to be transported, and allocating other loaded transport vehicles if no empty vehicle exists or the empty vehicle is not enough to load the packages to be transported currently, wherein the sum of the allocated available transport volumes of the empty vehicle and the loaded transport vehicles is required to meet the transportation of the packages to be transported. For example, a first group of packages to be shipped from a first site to a second site has 1000 packages, and the number of empty vehicles required is 3, whereas the first site can currently only allocate 1 empty vehicle, and allocate the 1 empty vehicle and at least one loaded transport vehicle to ship the 1000 packages.
Further preferably, the step of allocating all empty vehicles and at least one loaded transportation vehicle as the transportation vehicles of the first group of packages to be transported in step S203 may include: acquiring the sum of available transportation volumes of all empty vehicles which can be currently allocated at the first station as a second volume; calculating a difference V between the first volume and the second volume0(ii) a Transferring at least one loaded vehicle whose sum of available transport volumes is not less than V0. And calculating the volume of the packages to be transported left after the empty vehicles load the goods, and allocating the loaded transportation vehicles according to the volume.
Specifically, referring to fig. 3, the step of allocating at least one loaded vehicle may include steps S301 to S304. Step S301: allocating a first loaded vehicle, obtaining a usable transport volume V of said first loaded vehicle1. Step S302: if V0≤V1All empty vehicles and the first loaded transport vehicle are allocated as transport vehicles for the first group of parcels to be transported. Step S303: if V0＞V1Then, a second loaded vehicle is deployed to obtain a usable transport volume V of the second loaded transport vehicle2. Step S304: if V0-V1≤V2And then all empty vehicles, the first loaded transport vehicle and the second loaded transport vehicle are dispatched as transport vehicles for the first group of packages to be transported.
Further, the step of allocating at least one loaded vehicle may further include steps S305 to S306. Step S305: if V0-V1＞V2Then, a third loaded vehicle is dispatched and the available transport volume V of the third loaded transport vehicle is obtained3. Step S306: if V0-V1-V2≤V3And then all empty vehicles, the first loaded transport vehicle to the third loaded transport vehicle are dispatched as transport vehicles of the first group of packages to be transported. When V is0-V1-V2＞V3And by analogy, more loaded transport vehicles can be allocated. After a loaded transport vehicle is allocated, the current available transport volume of the allocated vehicle is acquired, whether the transport needs of the remaining packages to be transported are met or not is judged, if not, the allocated vehicle continues to be allocated until the available transport volume of the allocated vehicle meets the transport needs of the packages to be transported, and multiple or continuous allocation of the transport vehicle is realized.
Step S103: classifying all parcels to be transported in the first group of parcels to be transported into N parcel types according to the parcel volumes, and acquiring the parcels to be transported of the ith type, wherein N is a positive integer, and i is a positive integer not larger than N. For example, packages may be classified by package volume according to their outer box, and packages are classified into N package types, where N is, for example, 12, and 12 package types may be exemplarily expressed as: i, II, III, IV, V, VI, VII, VIII, IX, X, XI and XII. And 12 types. The volume between each type may increase or decrease by a multiple, which may be an integer multiple or 0.5, 0.8, 1.5 or other multiple, and the volume between adjacent types may increase or decrease sequentially, with a class v parcel volume of, for example, 40 cubic centimeters and a class vi parcel volume of, for example, 60 cubic centimeters. The multi-class volume is convenient for packing goods, the volume and the weight of the express delivery are also convenient to calculate, the parcel volume corresponding to each class can be recorded into a system in advance, and the corresponding relation between the parcel class and the volume is established.
Step S104: and determining a stacking position of the ith type of package to be transported in the transport vehicles of the first package group to be transported as an ith type stacking position, so that any package to be transported in the ith type of package to be transported is stacked to any position in the ith type stacking position. The parcel loading method comprises the steps of classifying parcels to be transported, determining a class stacking position for each type of parcel to be transported, stacking the parcels to any one of the class stacking positions corresponding to the type according to the parcel types when the parcels to be transported are stacked, determining or coding and fixing positions for each parcel without need of coding the parcel, and stacking the parcels to the class stacking positions according to the parcel types.
In some possible implementations, the work efficiency may be further improved by hierarchical stacking. Specifically, referring to fig. 4, the step S104 may include steps S401 to S403. Step S401: a usable transport volume of a first transport vehicle of the transport vehicles of the first group of parcels to be transported is obtained. Step S402: and determining the stacking layer number of the first transport vehicle, the type of the package stacked on each layer and the quantity corresponding to each type according to the available transport volume of the first transport vehicle and a preset stacking rule. The stacking rule includes various types of packages as much as possible to ensure the neatness and efficiency of stacking, and the stacking rule includes, for example, placing a package with a larger volume on the bottom layer and a package with a smaller volume on the upper layer to prevent the package from being lost. Determining the types of packages which can be transported by the first transport vehicle at this time and the quantity corresponding to each type according to the available transport volume of the first transport vehicle, wherein the first transport vehicle can transport a plurality of types of packing boxes, and the total volume of the transported plurality of packing boxes is smaller than the available transport volume of the first transport vehicle. Step S403: and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the first transport vehicle as the stacking position of the ith type of packages to be transported in the first transport vehicle. The method comprises the steps of obtaining stacking layer identification and stacking quantity corresponding to each type of package in a first transport vehicle, stacking the type packages of the corresponding quantity to the stacking layer corresponding to the stacking layer identification, and stacking a preset quantity of packages to the first transport vehicle according to the stacking layer identification. The parcel stacking device has the advantages that the parcels of the specified types are stacked to a certain layer according to the identification, so that the labor intensity is reduced, and the labor intensity is increased.
In some possible implementations, the express items of the emergency type are preferentially transported. Specifically, the step S402 may include: acquiring the packages to be transported of which the time-effect type is the emergency type in the first package group to be transported, and calculating the sum of the volumes of the packages to be transported of which the time-effect type is the emergency type as a third volume; if the available transport volume of the first transport vehicle is greater than the third volume, calculating a difference W between the available transport volume of the first transport vehicle and the third volume; and determining the stacking number of layers of the first transportation vehicle, the stacking type of each layer of packages and the number corresponding to each type according to a preset stacking rule, so that the packages to be transported with the aging type of emergency and the packages to be transported with the aging type of W and the volume of W, which are not the emergency, are stacked in the first transportation vehicle. The method comprises the steps of preferentially calculating emergency express items when goods stacked on a transport vehicle are calculated, calculating the volume of a package which can be accommodated by the residual volume for transporting general express items after the total volume of the package of the emergency express items is subtracted, and stacking the emergency express items and the general express items with the preset volume on the transport vehicle.
Further preferably, the specific manner of determining that the volume is W for the packages to be transported whose aging type is not the emergency type may include the steps of: and calculating the types of packages which can be accommodated in the transportation space with the volume of W and the quantity corresponding to each type, and selecting the packages with the volumes of W which are the same or similar to the sending dates from the first group of packages to be transported. Thereby ensuring the timeliness of package transportation.
For example, a first transport vehicle can stack 3 layers, a high layer, a middle layer and a bottom layer, the high layer can stack 40 types I, 30 types II and 10 types III, the middle layer can stack 10 types IV and 8 types V, the bottom layer can stack 2 types VI, the total number of package positions is 100, the emergency type express mail occupies 40, and the space of the rest 60 packages is used for transporting the general time-effect package, preferably the express mail which is sent on the same day or the next day for reservation. After the first transport vehicle transports the emergency express, when other transport vehicles transport general packages, the maximum package quantity can be accommodated in the space of the transport vehicles by direct calculation, and the packages with earlier dates can be sent out preferentially. Because the volume of the package is multiple proportion, the calculation is simple and the stacking is convenient.
In some possible implementations, some of the stacking schemes may be preconfigured through the three-dimensional loading model. Specifically, referring to fig. 5, the step S104 may include steps S501 to S503. Step S501: and pre-constructing a three-dimensional loading model of a second transport vehicle in the transport vehicles of the first parcel group to be transported, and updating the three-dimensional loading model according to the available transport volume and the internal loading shape at the current time after loading is finished each time. This step dynamically maintains the three-dimensional loading model. Step S502: and acquiring a preset stacking scheme according to the three-dimensional loading model of the second transport vehicle, wherein the preset stacking scheme is used for stacking preset package types in the second transport vehicle, and each type corresponds to a preset number of packages to be transported. This step determines the currently applicable stacking scheme from the three-dimensional loading model of the transport vehicle. Step S503: and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the second transport vehicle according to the preset stacking scheme, wherein the stacking layer identification and the stacking quantity are used as the stacking positions of the ith type of packages to be transported in the second transport vehicle. The method comprises the steps of constructing a three-dimensional loading model of a transport vehicle in advance, simulating a stacking scheme of packages in the transport vehicle, determining the number of stacking layers in the transport vehicle, stacking a certain type of packages on each layer, updating the available transport volume and the internal loading shape of the three-dimensional loading model corresponding to the transport vehicle after each loading, facilitating vehicle allocation at the next station, dynamically maintaining the three-dimensional loading model, determining the currently applicable stacking scheme according to the three-dimensional loading model, stacking the packages into the transport vehicle according to the stacking scheme, and further improving the efficiency of stacking goods.
In some possible implementations, vehicles entering the site may be monitored to determine the available transport volume of the transport vehicle. Specifically, the method may further include: in response to a third transportation vehicle entering the first station, obtaining a usable transportation volume of the third transportation vehicle if the third transportation vehicle is a transportation vehicle of the first group of packages to be transported.
In some possible implementations, the parking location of the transportation vehicle at the station may be pre-allocated. The method further comprises the following steps: transferring a parking location of each of the transport vehicles of the first group of parcels to be transported at the first station. The transfer vehicle can prepare the parcel that needs the transportation in advance to put things in good order in the parking position at the website, personnel or automation equipment, improves work efficiency. Because the stacking rule is limited, the staff who operate the stacking for a long time can finish the transportation stacking according to experience, but the operation efficiency is not high enough only according to experience, and human errors can also occur.
Referring to fig. 6, the embodiment of the present application further provides a cargo transportation packing method, which includes steps S601 to S604.
Step S601: and acquiring the network packages to be transported, and allocating the corresponding transport vehicles.
Step S602: the usable transport volume of the transport vehicle is determined.
Step S603: the type of package to be transported is determined, and the number of packages that can be transported by each transport vehicle is determined based on the calculation rules.
Step S604: and determining a stacking scheme by utilizing the three-dimensional loading model of the transport vehicle.
Referring to fig. 7, the present application provides a freight shipping boxing apparatus comprising: a package obtaining module 201, configured to obtain a first to-be-transported package group sent from a first station to a second station, and calculate a sum of volumes of all to-be-transported packages in the first to-be-transported package group as a first volume; a vehicle allocating module 202, configured to allocate the transportation vehicles of the first to-be-transported parcel group according to the first volume, where the transportation vehicles of the first to-be-transported parcel group pass through the first station and the second station in sequence; a parcel classification module 203, configured to classify all parcels to be shipped in the first group of parcels to be shipped into N parcel types according to parcel volumes, and obtain an ith type of parcel to be shipped, where N is a positive integer, and i is a positive integer not greater than N; a position determining module 204, configured to determine a stacking position of the ith type of package to be transported in the transport vehicles of the first package group to be transported as an ith type stacking position, so that any one package to be transported in the ith type of package to be transported is stacked to any one position of the ith type stacking position.
In some possible implementations, the vehicle allocation module 202 may be configured to obtain a required number M of empty vehicles according to the first volume, where M is a positive integer; if the number of empty vehicles which can be allocated at the first station at present is not less than M, allocating M empty vehicles as the transport vehicles of the first to-be-transported package group; if the number of empty vehicles currently allocated to the first station is less than M, allocating all empty vehicles and at least one loaded transport vehicle as transport vehicles of the first to-be-transported package group, wherein the sum of the available transport volumes of allocated vehicles is not less than the first volume.
In some possible implementations, the vehicle allocation module 202 may obtain a sum of available transportation volumes of all empty vehicles currently available for allocation at the first station as a second volume; calculating a difference V between the first volume and the second volume0(ii) a Transferring at least one loaded vehicle whose sum of available transport volumes is not less than V0。
In some possible implementations, the vehicle transfer module 202 may transfer a first loaded vehicle to obtain the available transport volume V of the first loaded transport vehicle1(ii) a If V0≤V1If so, allocating all empty vehicles and the first loaded transport vehicle as transport vehicles for the first group of parcels to be transported; if V0＞V1Then, a second loaded vehicle is deployed to obtain a usable transport volume V of the second loaded transport vehicle2(ii) a If V0-V1≤V2And then all empty vehicles, the first loaded transport vehicle and the second loaded transport vehicle are dispatched as transport vehicles for the first group of packages to be transported.
In some possible implementations, the position determination module 204 may be configured to obtain a usable transport volume of a first transport vehicle of the transport vehicles of the first to-be-transported group of packages; determining the stacking layer number of the first transport vehicle, the type of packages stacked on each layer and the quantity corresponding to each type according to the available transport volume of the first transport vehicle and a preset stacking rule; and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the first transport vehicle as the stacking position of the ith type of packages to be transported in the first transport vehicle.
In some possible implementations, the location determination module 204 may obtain the to-be-transported packages in the first group of to-be-transported packages whose aging type is the emergency type, and calculate a sum of the volumes of the to-be-transported packages whose aging type is the emergency type as a third volume; if the available transport volume of the first transport vehicle is greater than the third volume, calculating a difference W between the available transport volume of the first transport vehicle and the third volume; and determining the stacking number of layers of the first transportation vehicle, the stacking type of each layer of packages and the number corresponding to each type according to a preset stacking rule, so that the packages to be transported with the aging type of emergency and the packages to be transported with the aging type of W and the volume of W, which are not the emergency, are stacked in the first transportation vehicle.
In some possible implementations, the position determining module 204 may be configured to pre-construct a three-dimensional loading model of a second transport vehicle of the transport vehicles of the first group of packages to be transported, and update the three-dimensional loading model according to the available transport volume and the internal loading shape at the current time after each loading is completed; obtaining a preset stacking scheme according to the three-dimensional loading model of the second transport vehicle, wherein the preset stacking scheme is used for stacking preset package types in the second transport vehicle, and each type corresponds to a preset number of packages to be transported; and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the second transport vehicle according to the preset stacking scheme, wherein the stacking layer identification and the stacking quantity are used as the stacking positions of the ith type of packages to be transported in the second transport vehicle.
In some possible implementations, referring to fig. 8, the method may further include a vehicle monitoring module 205 for, in response to a third transportation vehicle entering the first station, acquiring a usable transportation volume of the third transportation vehicle if the third transportation vehicle is a transportation vehicle of the first group of parcels to be transported.
In some possible implementations, the vehicle allocation module 202 may be further configured to allocate a parking location of each transport vehicle of the first to-be-transported package group at the first station.
Referring to fig. 9, the present embodiment further provides an electronic device 3 for cargo transportation packing, where the electronic device 3 includes at least one storage unit 31, at least one processing unit 32, and a bus 33 for connecting different platform systems.
The storage unit 31 may include readable media in the form of volatile storage units, such as a random access memory unit (RAM)311 and/or a cache memory unit 312, and may further include a read only memory unit (ROM) 313.
Wherein the storage unit 31 further stores a program product 4, the program product 4 can be executed by the processing unit 32, so that the processing unit 32 executes the steps of the method for packing goods for transportation (as shown in fig. 1) in the embodiment of the present application. The storage unit 31 may also include a program/utility 314 having a set (at least one) of program modules 315, including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Accordingly, the processing unit 32 may execute the program product 4 described above, and may execute the program/utility 314.
The electronic device 3 may also communicate with one or more external devices 34, such as a keyboard, pointing device, bluetooth device, etc., and may also communicate with one or more devices capable of interacting with the electronic device 3, and/or with any device (e.g., router, modem, etc.) that enables the electronic device 3 to communicate with one or more other computing devices. Such communication may be through input/output (I/O) interfaces 35. Also, the electronic device 3 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 36. The network adapter 36 may communicate with other modules of the electronic device 3 via the bus 33. It should be appreciated that although not shown in FIG. 9, other hardware and/or software modules may be used in conjunction with the electronic device 3, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage platforms, to name a few.
Referring to fig. 10, the present application further provides a computer-readable storage medium for storing a computer program, where the computer program is executed to implement the steps of the cargo transportation packing method in the present application (as shown in fig. 1). Fig. 10 shows a program product 4 provided by the present embodiment for implementing the above method, which may employ a portable compact disc read only memory (CD-ROM) and include program codes, and may be run on a terminal device, such as a personal computer. However, the program product 4 of the present invention is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. Program product 4 may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing. Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The foregoing description and drawings are only for purposes of illustrating the preferred embodiments of the present application and are not intended to limit the present application, which is, therefore, to the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present application.
Claims (10)
1. A method of cargo transport binning, characterized in that the method comprises:
acquiring a first to-be-transported package group sent from a first station to a second station, and calculating the sum of the volumes of all to-be-transported packages in the first to-be-transported package group as a first volume;
allocating the transport vehicles of the first parcel group to be transported according to the first volume, wherein the transport vehicles of the first parcel group to be transported pass through the first station and the second station in sequence;
classifying all parcels to be transported in the first group of parcels to be transported into N parcel types according to the parcel volumes, and acquiring the parcels to be transported of the ith type, wherein N is a positive integer, and i is a positive integer not greater than N;
and determining a stacking position of the ith type of package to be transported in the transport vehicles of the first package group to be transported as an ith type stacking position, so that any package to be transported in the ith type of package to be transported is stacked to any position in the ith type stacking position.
2. The freight transportation binning method according to claim 1, wherein said allocating the transport vehicles of the first group of parcels to be transported according to the first volume comprises:
acquiring the number M of empty vehicles required according to the first volume, wherein M is a positive integer;
if the number of empty vehicles which can be allocated at the first station at present is not less than M, allocating M empty vehicles as the transport vehicles of the first to-be-transported package group;
if the number of empty vehicles currently allocated to the first station is less than M, allocating all empty vehicles and at least one loaded transport vehicle as transport vehicles of the first to-be-transported package group, wherein the sum of the available transport volumes of allocated vehicles is not less than the first volume.
3. The freight transportation binning method according to claim 2, wherein said allocating all empty vehicles and at least one loaded transportation vehicle as transportation vehicles of the first group of parcels to be transported comprises:
acquiring the sum of available transportation volumes of all empty vehicles which can be currently allocated at the first station as a second volume;
calculating a difference V between the first volume and the second volume0；
Transferring at least one loaded vehicle whose sum of available transport volumes is not less than V0。
4. The method of cargo transport binning according to claim 3, wherein said picking up at least one loaded vehicle comprises:
allocating a first loaded vehicle, obtaining a usable transport volume V of said first loaded vehicle1；
If V0≤V1If so, allocating all empty vehicles and the first loaded transport vehicle as transport vehicles for the first group of parcels to be transported;
if V0＞V1Then, a second loaded vehicle is deployed to obtain a usable transport volume V of the second loaded transport vehicle2(ii) a If V0-V1≤V2And then all empty vehicles, the first loaded transport vehicle and the second loaded transport vehicle are dispatched as transport vehicles for the first group of packages to be transported.
5. The freight shipping boxing method in accordance with claim 1, wherein the determining the stacking position of the i-th type of package to be shipped in the transporting vehicles of the first group of packages to be shipped as an i-th type stacking position comprises:
obtaining a usable transport volume of a first transport vehicle of the transport vehicles of the first group of parcels to be transported;
determining the stacking layer number of the first transport vehicle, the type of packages stacked on each layer and the quantity corresponding to each type according to the available transport volume of the first transport vehicle and a preset stacking rule;
and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the first transport vehicle as the stacking position of the ith type of packages to be transported in the first transport vehicle.
6. The method for freight transportation binning according to claim 5, wherein said determining the number of stacked layers, the type of package stacked per layer and the corresponding number of each type of the first transportation vehicle according to the available transportation volume of the first transportation vehicle and a predetermined stacking rule comprises:
acquiring the packages to be transported of which the time-effect type is the emergency type in the first package group to be transported, and calculating the sum of the volumes of the packages to be transported of which the time-effect type is the emergency type as a third volume;
if the available transport volume of the first transport vehicle is greater than the third volume, calculating a difference W between the available transport volume of the first transport vehicle and the third volume;
and determining the stacking number of layers of the first transportation vehicle, the stacking type of each layer of packages and the number corresponding to each type according to a preset stacking rule, so that the packages to be transported with the aging type of emergency and the packages to be transported with the aging type of W and the volume of W, which are not the emergency, are stacked in the first transportation vehicle.
7. The freight shipping boxing method in accordance with claim 1, wherein the determining the stacking position of the i-th type of package to be shipped in the transporting vehicles of the first group of packages to be shipped as an i-th type stacking position comprises:
pre-constructing a three-dimensional loading model of a second transport vehicle in the transport vehicles of the first parcel group to be transported, and updating the three-dimensional loading model according to the available transport volume and the internal loading shape at the current time after loading is finished each time;
obtaining a preset stacking scheme according to the three-dimensional loading model of the second transport vehicle, wherein the preset stacking scheme is used for stacking preset package types in the second transport vehicle, and each type corresponds to a preset number of packages to be transported;
and acquiring the stacking layer identification and the stacking quantity of the ith type of packages to be transported in the second transport vehicle according to the preset stacking scheme, wherein the stacking layer identification and the stacking quantity are used as the stacking positions of the ith type of packages to be transported in the second transport vehicle.
8. The method of cargo transport binning according to claim 1, further comprising:
in response to a third transportation vehicle entering the first station, obtaining a usable transportation volume of the third transportation vehicle if the third transportation vehicle is a transportation vehicle of the first group of packages to be transported.
9. The method of cargo transport binning according to claim 1, further comprising:
transferring a parking location of each of the transport vehicles of the first group of parcels to be transported at the first station.
10. A cargo transportation boxing apparatus, characterized in that the apparatus comprises:
the system comprises a package acquisition module, a first volume calculation module and a second volume calculation module, wherein the package acquisition module is used for acquiring a first to-be-transported package group sent from a first station to a second station and calculating the sum of the volumes of all to-be-transported packages in the first to-be-transported package group as a first volume;
the vehicle allocating module is used for allocating the transport vehicles of the first parcel group to be transported according to the first volume, and the transport vehicles of the first parcel group to be transported pass through the first station and the second station in sequence;
the parcel classification module is used for classifying all parcels to be transported in the first parcel group to be N parcel types according to the parcel volume, and acquiring the ith type of parcels to be transported, wherein N is a positive integer, and i is a positive integer not greater than N;
and the position determining module is used for determining a stacking position of the ith type of package to be transported in the transporting vehicle of the first package group to be transported as an ith type stacking position, so that any package to be transported in the ith type of package to be transported is stacked to any position in the ith type stacking position.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010473542.6A CN111652551B (en) | 2020-05-29 | 2020-05-29 | Method and device for transporting and boxing goods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010473542.6A CN111652551B (en) | 2020-05-29 | 2020-05-29 | Method and device for transporting and boxing goods |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111652551A true CN111652551A (en) | 2020-09-11 |
| CN111652551B CN111652551B (en) | 2022-10-25 |
Family
ID=72348685
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010473542.6A Active CN111652551B (en) | 2020-05-29 | 2020-05-29 | Method and device for transporting and boxing goods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111652551B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116307985A (en) * | 2023-03-06 | 2023-06-23 | 中天建设集团有限公司 | Energy-saving transportation method for building materials, computer equipment and medium |
| CN117557187A (en) * | 2024-01-10 | 2024-02-13 | 四川宽窄智慧物流有限责任公司 | Intelligent load control method for multiple orders |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049838A (en) * | 2012-12-26 | 2013-04-17 | 华中科技大学 | Finite state machine-based parcel transporting state monitoring method |
| US8498818B1 (en) * | 2008-10-17 | 2013-07-30 | United Parcel Service Of America, Inc. | Systems and methods for calculating emissions resulting from transporting a shipment |
| JP2017165510A (en) * | 2016-03-14 | 2017-09-21 | Ｓｂｓロジコム株式会社 | Transportation management system |
| CN107341638A (en) * | 2017-07-04 | 2017-11-10 | 醴陵市绿源商贸有限公司 | A kind of loose unpacked material allocator based on internet |
| CN109816299A (en) * | 2018-12-10 | 2019-05-28 | 北京航天智造科技发展有限公司 | Method, apparatus and computer equipment are determined based on the logistics vehicles of big data statistics |
| CN110119920A (en) * | 2018-02-06 | 2019-08-13 | 丰田自动车株式会社 | Device, system, method and medium for picking up and delivering |
| CN110310066A (en) * | 2019-07-05 | 2019-10-08 | 上海中通吉网络技术有限公司 | Cargo piles up location determining method, device, equipment and storage medium |
| CN110322128A (en) * | 2019-06-20 | 2019-10-11 | 吉旗物联科技（上海）有限公司 | Vehicle and goods matching method, apparatus and computer storage medium |
| CN110414895A (en) * | 2019-07-26 | 2019-11-05 | 珠海格力电器股份有限公司 | Vehicle dispatch system and method |
-
2020
- 2020-05-29 CN CN202010473542.6A patent/CN111652551B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8498818B1 (en) * | 2008-10-17 | 2013-07-30 | United Parcel Service Of America, Inc. | Systems and methods for calculating emissions resulting from transporting a shipment |
| CN103049838A (en) * | 2012-12-26 | 2013-04-17 | 华中科技大学 | Finite state machine-based parcel transporting state monitoring method |
| JP2017165510A (en) * | 2016-03-14 | 2017-09-21 | Ｓｂｓロジコム株式会社 | Transportation management system |
| CN107341638A (en) * | 2017-07-04 | 2017-11-10 | 醴陵市绿源商贸有限公司 | A kind of loose unpacked material allocator based on internet |
| CN110119920A (en) * | 2018-02-06 | 2019-08-13 | 丰田自动车株式会社 | Device, system, method and medium for picking up and delivering |
| CN109816299A (en) * | 2018-12-10 | 2019-05-28 | 北京航天智造科技发展有限公司 | Method, apparatus and computer equipment are determined based on the logistics vehicles of big data statistics |
| CN110322128A (en) * | 2019-06-20 | 2019-10-11 | 吉旗物联科技（上海）有限公司 | Vehicle and goods matching method, apparatus and computer storage medium |
| CN110310066A (en) * | 2019-07-05 | 2019-10-08 | 上海中通吉网络技术有限公司 | Cargo piles up location determining method, device, equipment and storage medium |
| CN110414895A (en) * | 2019-07-26 | 2019-11-05 | 珠海格力电器股份有限公司 | Vehicle dispatch system and method |
Non-Patent Citations (1)
| Title |
|---|
| 王阳明等: "基于多车型多约束的动态车辆调度算法研究", 《计算机工程》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116307985A (en) * | 2023-03-06 | 2023-06-23 | 中天建设集团有限公司 | Energy-saving transportation method for building materials, computer equipment and medium |
| CN116307985B (en) * | 2023-03-06 | 2024-01-26 | 北京中天北方建设有限公司 | Energy-saving transportation method for building materials, computer equipment and medium |
| CN117557187A (en) * | 2024-01-10 | 2024-02-13 | 四川宽窄智慧物流有限责任公司 | Intelligent load control method for multiple orders |
| CN117557187B (en) * | 2024-01-10 | 2024-03-26 | 四川宽窄智慧物流有限责任公司 | Intelligent load control method for multiple orders |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111652551B (en) | 2022-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lee et al. | A heuristic algorithm for yard truck scheduling and storage allocation problems | |
| Cao et al. | Integrated quay crane and yard truck schedule problem in container terminals | |
| CN111652551B (en) | Method and device for transporting and boxing goods | |
| Pang et al. | Ship routing problem with berthing time clash avoidance constraints | |
| CN111768151A (en) | Vehicle loading method and system for loading cargoes | |
| Taner et al. | Layout analysis affecting strategic decisions in artificial container terminals | |
| JP6993449B2 (en) | Delivery plan generators, systems, methods and computer readable storage media | |
| CN111598341B (en) | Power material distribution method and system based on material distribution and path optimization | |
| KR102503198B1 (en) | Device and method for providing optimal cargo delivery route based on artificial intelligence | |
| JP2007191296A (en) | Main physical distribution network schedule preparation system | |
| Mazaraki et al. | Development of a multimodal (railroad-water) chain of grain supply by the agent-based simulation method | |
| CN117371737A (en) | Three-dimensional loading method and system for logistics distribution vehicle based on digital twin | |
| Walha et al. | A rail-road PI-hub allocation problems: model and heuristic | |
| WO2021040612A1 (en) | Methods and apparatuses for generating product delivery plans | |
| CN113033971B (en) | Server, and waybill scheduling method, medium and device of delivery robot | |
| Castellucci et al. | Output maximization container loading problem with time availability constraints | |
| CN114529236A (en) | Storage management method and device for goods shelf, electronic equipment and storage medium | |
| KR102447122B1 (en) | Apparatus and method of providing freight allocation service based on artificial intelligence | |
| Wang et al. | Container assignment optimization considering overlapping amount and operation distance in rail-road transshipment terminal | |
| Chen et al. | An integrating scheduling model for mixed cross-operation in container terminals | |
| KR102447123B1 (en) | Apparatus and method of providing freight allocation service based on artificial intelligence | |
| Kravchenko et al. | MATHEMATICAL MODEL OF A RAILROAD GRAIN CARGO RIDESHARING SERVICE IN THE FORM OF COALITIONS IN CONGESTION GAMES. | |
| CN111428929A (en) | Path planning system with two-dimensional loading and unloading and time window limitation | |
| Li et al. | Maritime terminal operational problems | |
| Yuan et al. | Railcar reallocation optimization on water-rail network under uncertain busyness |
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 |