CN112926906A - Method, device, storage medium and equipment for distributing transfer shifts of cargo item receiving and dispatching points - Google Patents

Method, device, storage medium and equipment for distributing transfer shifts of cargo item receiving and dispatching points Download PDF

Info

Publication number
CN112926906A
CN112926906A CN201911240977.XA CN201911240977A CN112926906A CN 112926906 A CN112926906 A CN 112926906A CN 201911240977 A CN201911240977 A CN 201911240977A CN 112926906 A CN112926906 A CN 112926906A
Authority
CN
China
Prior art keywords
data
grouped data
goods
receiving
grouped
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
Application number
CN201911240977.XA
Other languages
Chinese (zh)
Other versions
CN112926906B (en
Inventor
黎碧君
刘子恒
潘舒静
谢宇昕
张莹莹
张策
蔡钰雯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SF Technology Co Ltd
Original Assignee
SF Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by SF Technology Co Ltd filed Critical SF Technology Co Ltd
Priority to CN201911240977.XA priority Critical patent/CN112926906B/en
Publication of CN112926906A publication Critical patent/CN112926906A/en
Application granted granted Critical
Publication of CN112926906B publication Critical patent/CN112926906B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Abstract

The application relates to a method, a device, a computer-readable storage medium and a computer device for distributing transfer shifts of a cargo item receiving and dispatching point, wherein the method comprises the following steps: acquiring order data in historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data; grouping the order data to obtain grouped data; calculating quantiles for screening the quantity of the goods according to the quantity of the goods in the grouped data; when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data. Whether the transfer shift is required to be allocated to the future cargo receiving and dispatching points or not is predicted by counting the number of date data which correspond to the cargo receiving and dispatching points in the order data in the historical time and correspond to the transfer shift, and dynamic allocation of the transfer shift is achieved.

Description

Method, device, storage medium and equipment for distributing transfer shifts of cargo item receiving and dispatching points
Technical Field
The application relates to the technical field of logistics transportation, in particular to a method and a device for distributing transfer shifts of a cargo receiving and dispatching point, a computer-readable storage medium and computer equipment.
Background
Along with the development of the logistics industry, the connection efficiency among the receiving and dispatching points of each goods is improved, and the improvement of the logistics transportation efficiency is more and more important. Particularly for high-aging goods which are required to be transported as soon as possible, the connection is required to be completed in the first time so as to carry out subsequent circulation transportation work as soon as possible.
However, the existing method for allocating the transfer shifts of the cargo receiving and dispatching points generally allocates a fixed transfer shift for each cargo receiving and dispatching point, and when the cargo receiving and dispatching points have a small quantity of cargo or no cargo, the transfer according to the fixed transfer shift may cause some unnecessary transfer shifts, which wastes resources; when the quantity of the goods at the goods receiving and dispatching points is large, if the number of fixed transfer shifts is not enough, part of the goods cannot be transferred in time, and the transfer efficiency is low. When the quantity of the goods at the goods receiving and dispatching points changes greatly, the fixed transfer shifts are distributed according to each goods receiving and dispatching point for transfer, the cost is high, and the transfer efficiency is low.
Disclosure of Invention
Therefore, it is necessary to provide a method, an apparatus, a computer-readable storage medium, and a computer device for assigning a transfer shift of a cargo receiving and dispatching point, for the technical problems of high cost and low transfer efficiency of transferring a fixed transfer shift assigned to each cargo receiving and dispatching point.
A method for distributing transfer shifts of cargo item receiving and dispatching points comprises the following steps:
acquiring order data in historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data;
grouping the order data to obtain grouped data;
calculating quantiles for screening the cargo quantity according to the cargo quantities in the grouped data;
when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile;
and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift to the goods receiving and dispatching points in the grouped data.
A device for distributing transfer shifts of a point of dispatch of a piece of goods, characterized in that it comprises:
the system comprises an acquisition module, a storage module and a processing module, wherein the acquisition module is used for acquiring order data in historical time, and the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data;
the grouping module is used for grouping the order data to obtain grouped data;
the calculating module is used for calculating quantiles for screening the goods quantity according to the goods quantity in the grouped data;
the screening module is used for screening each grouped data reaching the quantile when the goods quantity in the grouped data reaches the quantile;
and the connection shift allocation module is used for determining the number of each grouped data, and allocating a connection shift to the cargo piece transceiving points in the grouped data if the number of the target grouped data in the grouped data reaches a first preset threshold.
A computer-readable storage medium, storing a computer program which, when executed by a processor, causes the processor to perform the steps of a method of assigning a transfer shift for a shipment receiving and dispatching point.
A computer arrangement comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to carry out the steps of a method of allocating a transfer shift of a shipment transceiver.
The method, the device, the computer readable storage medium and the computer equipment for distributing the transfer shifts of the cargo receiving and dispatching points divide order data in historical time into groups to obtain grouped data; calculating quantiles according to the quantity of the goods in the grouped data, and when the grouped data with the quantity of the goods reaching the quantile is screened out, the grouped data with less quantity of the goods and less influence on the distribution of the transfer shift can be excluded, so that the distribution accuracy of the transfer shift is improved; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data. Whether the transfer shift is required to be allocated to the future cargo receiving and dispatching points or not is predicted by counting the number of date data which correspond to the cargo receiving and dispatching points in the order data in the historical time and correspond to the transfer shift, and dynamic allocation of the transfer shift is achieved.
Drawings
FIG. 1 is a diagram of an exemplary implementation of a method for assigning a transfer shift to a consignment dispatch point;
FIG. 2 is a schematic flow chart illustrating a method for assigning a transfer shift to a consignment receiving and dispatching point in one embodiment;
FIG. 3 is a schematic flow chart illustrating a method for assigning a transfer shift to a consignment receiving and dispatching point in one embodiment;
FIG. 4 is a schematic flow chart illustrating the transfer shift assignment procedure of the shipment receiving and dispatching station in one embodiment;
FIG. 5 is a schematic flow chart illustrating the transfer shift assignment procedure of the shipment receiving and dispatching station in one embodiment;
FIG. 6 is a timing diagram of a transfer shift allocation method for a shipment receiving and dispatching point in one embodiment;
FIG. 7 is a block diagram of a transfer shift distribution facility at a delivery and pickup point according to one embodiment;
FIG. 8 is a block diagram of a transfer shift distribution facility at a delivery/pickup station according to another embodiment;
FIG. 9 is a block diagram of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
Fig. 1 is a diagram of an application environment of a method for assigning a transfer shift to a consignment receiving and dispatching point in one embodiment. Referring to fig. 1, the method for distributing the transfer shifts of the cargo receiving and dispatching points is applied to a transfer shift distribution system of the cargo receiving and dispatching points. The system for assigning a transfer shift to a delivery and receipt point of a cargo item includes a terminal 110 and a server 120. The terminal 110 and the server 120 are connected through a network. The terminal 110 may specifically be a desktop terminal or a mobile terminal, and the mobile terminal may specifically be at least one of a mobile phone, a tablet computer, a notebook computer, and the like. The server 120 may be implemented as a stand-alone server or a server cluster composed of a plurality of servers.
The server 120 acquires order data in historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data; grouping the order data to obtain grouped data; calculating quantiles for screening the quantity of the goods according to the quantity of the goods in the grouped data; when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data.
As shown in FIG. 2, in one embodiment, a method for assigning a transfer shift to a cargo item receiving and dispatching site is provided. The method may be executed by the terminal 110 or the server 120, and the embodiment is mainly illustrated by applying the method to the server 120 in fig. 1. Referring to fig. 2, the method for distributing transfer shifts of the cargo item receiving and dispatching points specifically comprises the following steps:
s202, obtaining order data in the historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data.
Wherein the historical time is a historical time corresponding to a future time period of the cargo receiving and dispatching point to which the transfer shift is to be allocated, for example, when the current time is the last day of week 31 of 2019, when the future time period of the cargo receiving and dispatching point to which the transfer shift is to be allocated is week 32 of 2019 and the next week is a holiday, the historical time may be the previous ten weeks from monday to sunday of the next week, that is, a historical period from week 22 to week 31 of 2019; or the same weekly history period of monday to the first 5 years of sunday of the next week, i.e., the 32 nd week history period of each year between 2014 and 2018; or the holiday period of 5 years before the historical period, i.e. the historical period of the holiday of each year during 2014 to 2018.
In one embodiment, the order data includes a shipment receiving and dispatching point, date data, and a shipment volume corresponding to the date data. The delivery point is a site for delivering and receiving the delivery, and can be a logistics network, a delivery warehouse and an express delivery collection point. The date data includes the date, and the week, holiday and hour corresponding to the date.
In one embodiment, the server may obtain the order data in the historical time by obtaining the order data uploaded by the user through the terminal, or by downloading the order data from a network database.
And S204, grouping the order data to obtain grouped data.
In one embodiment, the order data is grouped according to different date data of the same item receiving and sending point to obtain grouped data of each group. The order data of the same freight receiving and dispatching point can belong to the same group.
As shown in table 1, when the cargo receiving and dispatching points to which the transfer shift is to be allocated are two cargo receiving and dispatching points 010AA and 010AB, and the future time period to which the transfer shift is to be allocated is the next monday 18, order data with history time of the cargo receiving and dispatching points of the two cargo receiving and dispatching points 010AA and 010AB being monday are obtained, and the order data is grouped according to date data monday 18 to obtain grouped data, wherein the order data numbers in the grouped data are a1 to a5 and B1 to B5, respectively. Wherein groups A1-A5 are groups A, and groups B1-B5 are groups B; the order data corresponding to a1 is "010 AA, 2019, monday, 2019/01/01, 18, non-holiday, 2", the order data corresponding to a2 is "010 AA, 2019, monday, 2019/01/07, 18, non-holiday, 1", and so on, the order data of a1 to a5 and B1 to B5 can be obtained, and table 1 can be referred to specifically.
TABLE 1 first grouping Table
Figure BDA0002306216870000051
S206, calculating quantiles for screening the goods quantity according to the goods quantity in the grouped data.
In one embodiment, to exclude the influence of the grouped data with smaller part of the goods quantity on the prediction result of whether the future goods receiving and sending point needs to distribute the transfer shift or not, the server calculates a quantile for screening the grouped data according to the goods quantity in the grouped data, wherein the quantile comprises a binary number, a quartile and a percentile. The server arranges the goods quantity in each grouped data from small to large and divides the goods quantity into a plurality of equal parts, the numerical value at the Nth dividing point position is N quantile, the server calls quantile calculation functions (such as a percentile function and a percentile _ approx function) by using hive sql or calls quantile calculation functions (such as a percentile.
For example, the pieces of goods in the grouped data with the numbers of A1 to A5 and B1 to B5 are respectively 2, 1, 2, 3, 2 and 2, the 5% quantile of the pieces of goods in the grouped data means that 2, 1, 2, 3, 2 and 2 are arranged from small to large and divided into 100 equal parts, the value at the 5% dividing point position is the 5% quantile, and the server calculates that the 5% dividing point is 1.1, namely 1.1 is the 5% quantile of the pieces of goods in the grouped data.
S208, when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile.
In one embodiment, the server compares the quantity of the piece of grouped data with the calculated quantile, and screens out each piece of grouped data that is greater than or equal to the quantile when the quantity of the piece of grouped data is greater than or equal to the quantile. Or, when the goods quantity in the grouped data is less than the quantile, filtering out the grouped data less than the quantile, and keeping the grouped data more than or equal to the quantile.
For example, when the quantity of each piece of goods in the grouped data reaches 1.1, the server screens the grouped data of which the quantity of the pieces of goods is more than 1.1 in the grouped data in the table 1, the quantity of the pieces of goods in the grouped data of A1 and B1 to B5 is more than 5% quantile 1.1, and the server screens the grouped data of A1 and B1 to B5; the amount of cargo in the grouped data of a2 to a5 did not reach 5% quantile 1.1, and the server filtered the grouped data of a2 to a5 to obtain the grouped data tables up to the quantiles shown in table 2.
TABLE 2 grouping data tables to quantiles
Figure BDA0002306216870000061
S210, determining the number of each grouped data, and if the number of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift to the goods receiving and dispatching points in the grouped data.
In one embodiment, the server determines the number of each screened grouped data, compares the number of target grouped data in the grouped data with a first preset threshold, wherein the grouped data is each screened grouped data reaching the quantile, the target grouped data in the grouped data is grouped data corresponding to each cargo receiving and dispatching point, and when the number of the screened grouped data corresponding to each cargo receiving and dispatching point is larger than or equal to the first preset threshold, the cargo receiving and dispatching point is predicted to have a larger cargo quantity in a future date corresponding to historical time, namely, a transfer shift needs to be allocated to the cargo receiving and dispatching points in the grouped data in the future date. For example, the server determines the number of each screened grouped data, counts the number of target grouped data in the grouped data, that is, counts the number of grouped data corresponding to each screened freight forwarding and receiving point, as shown in table 2, each screened grouped data is 5 pieces of data, a1-B5, the server determines that the number of each screened grouped data is 5, counts the number of grouped data, the screened freight forwarding and receiving point is 010AA, only one grouped data is a1, that is, the number of the screened freight forwarding and receiving point is 010AA grouped data is 1. Counting the number of the grouped data of the screened freight parcel transceiving point 010AB, wherein the grouped data comprises five grouped data of B1, B2, B3, B4 and B5, namely the number of the screened grouped data of the freight parcel transceiving point 010AB is 5.
If the first preset threshold value is 2, when the number of the grouped data corresponding to the screened goods receiving and dispatching points is larger than or equal to 2, distributing the transfer shift for the goods receiving and dispatching points corresponding to the grouped data with the number larger than or equal to 2. As shown in table 2, in the grouped data with history time of monday corresponding to the shipment receiving and sending point 010AA, the number of the grouped data is 1, the first preset threshold value 2 is not reached, and the shipment quantity of the shipment receiving and sending point 010AA in the next monday is predicted to be small, so that no transfer shift needs to be allocated to the shipment receiving and sending point 010 AA. In the grouped data with the historical time of Monday corresponding to the goods receiving and dispatching point 010AB, the number of the grouped data is 5, the first preset threshold value 2 is reached, and the goods quantity of the goods receiving and dispatching point 010AB on the next Monday is predicted to be large, so that the transfer shift needs to be allocated to the goods receiving and dispatching point 010 AB.
In one embodiment, when the screened number of grouped data corresponding to each goods receiving and dispatching point is larger, the more the goods quantity of the goods receiving and dispatching point in the corresponding date in the future is predicted, the more the transfer shift needs to be allocated. And when the number of the grouped data corresponding to each screened goods receiving and dispatching point is smaller, predicting that the quantity of the goods at the goods receiving and dispatching point is smaller in the corresponding future date, and allocating fewer shifts of the transfer shift.
The method for distributing the transfer shift of the cargo receiving and dispatching points divides order data in historical time into groups to obtain grouped data; calculating quantiles according to the quantity of the goods in the grouped data, and when the grouped data with the quantity of the goods reaching the quantile is screened out, the grouped data with less quantity of the goods and less influence on the distribution of the transfer shift can be excluded, so that the distribution accuracy of the transfer shift is improved; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data. Whether the transfer shift is required to be allocated to the future cargo receiving and dispatching points or not is predicted by counting the number of date data which correspond to the cargo receiving and dispatching points in the order data in the historical time and correspond to the transfer shift, and dynamic allocation of the transfer shift is achieved.
As shown in fig. 3, in one embodiment, the method for assigning a transfer shift of a cargo item receiving and dispatching point further comprises:
s302, when the grouped data reaching the quantile are screened out, a first mark is set for the grouped data reaching the quantile.
Wherein, the first mark can be one or more combinations of numbers, letters or other characters.
In one embodiment, when each grouped data greater than or equal to the quantile is screened out, one or more combinations of numbers, letters or other characters are adopted to mark each grouped data greater than or equal to the quantile, and a first mark is obtained.
For example, as shown in table 3, when the quantity of each shipment in the grouped data reaches 1.1, the server screens out each grouped data with a quantity of shipment greater than 1.1 in the grouped data in table 1, and sets a first flag for the screened grouped data, where the first flag may be 1. The quantity of the goods in the grouped data of A1 and B1-B5 is larger than 1.1 of 5% quantile, the server screens the grouped data of A1 and B1-B5, and sets a first mark 1 for the grouped data of A1 and B1-B5; the cargo volume in the grouped data of A2 to A5 did not reach 5% quantile 1.1, and the server did not screen the grouped data of A2 to A5.
TABLE 3 packet data tag Table
Figure BDA0002306216870000081
S304, according to the first mark of each grouped data, counting the total number of marks belonging to the corresponding receiving and sending points of the goods; and if the total number of the marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the grouped data.
In one embodiment, the server calculates the number of first tags of each group of data in each group, and obtains the total number of tags of each shipment receiving and dispatching point according to the calculated number of first tags.
As shown in table 3, only a1 pieces of the first marked grouped data corresponding to the shipment receiving and dispatching point 010AA are counted, that is, the total number of the marks corresponding to the shipment receiving and dispatching point 010AA is 1. The grouped data marked with the first mark corresponding to the shipment receiving and dispatching point 010AB is counted to be B1, B2, B3, B4 and B5, namely the total number of the marks corresponding to the shipment receiving and dispatching point 010AB is 5.
In one embodiment, when the total number of tags for each item receiving and dispatching point reaches a first preset threshold, the item receiving and dispatching point is predicted to have a greater quantity of items in a future date corresponding to the historical time, i.e., a transfer shift needs to be assigned to the item receiving and dispatching points in the grouped data in the future date.
For example, when the first preset threshold that the total number of the marks of each cargo receiving and dispatching point needs to reach is 2, a transfer shift is allocated to the cargo receiving and dispatching point corresponding to the mark total number greater than or equal to 2. As shown in table 3, the total number of tags belonging to the shipment receiving and dispatching point 010AA is 1, and does not reach the first preset threshold 2, and the shipment quantity of the shipment receiving and dispatching point 010AA on the next monday is predicted to be small, so that it is not necessary to allocate a transfer shift to the shipment receiving and dispatching point 010 AA. The total number of the marks belonging to the goods receiving and dispatching point 010AB is 5, the first preset threshold value 2 is reached, the goods quantity of the goods receiving and dispatching point 010AB on the next Monday is predicted to be large, and the transfer shift needs to be allocated to the goods receiving and dispatching point 010 AB.
In one embodiment, the more the number of corresponding first indicia in the historical time of the shipment receiving and dispatching site, the more the quantity of the shipment is predicted to be in the future for the shipment receiving and dispatching site on the corresponding date, the more shift that needs to be assigned to the shift. When the quantity of the corresponding first marks in the historical time of the goods receiving and dispatching point is smaller, the quantity of the goods in the corresponding future date of the goods receiving and dispatching point is predicted to be smaller, and the shift needing to be assigned is smaller.
In the above embodiment, the total number of the marks belonging to the corresponding delivery and receipt points of the goods is counted by setting the first mark for each grouped data reaching the quantile, and if the total number of the marks reaches the first preset threshold, the transfer shift is allocated to the delivery and receipt points in the grouped data. Grouping data with less cargo quantity and less influence on the assignment of the transfer shift can be eliminated, and the accuracy of the assignment of the transfer shift is improved.
As shown in fig. 4, in one embodiment, the method for assigning a transfer shift of a cargo item receiving and dispatching point further comprises:
s402, combining the grouped data according to preset combination conditions to obtain combined data.
In one embodiment, the server combines the packet data according to other preset combination conditions such as week data, holidays and the like, and the total number of combined data obtained by combination is smaller than or equal to the total number of the packet data. As shown in table 4, when the preset combination condition is the week data, the grouped data corresponding to each cargo sending and receiving point with the numbers a1, B1 to B5 in table 3 are combined according to the week data to obtain the combined data with the numbers a and B, wherein the combined data with the number a includes the grouped data with the number a1, and all the week data are the grouped data of the monday; the combined data numbered B includes the grouped data numbered B1 through B5, and all the data on the week are the grouped data on the monday.
TABLE 4 Combined data tag Table
Numbering Net points Year of year Week Hour(s) Total number of first marks
A 010AA 2019 Monday 18 1
B 010AB 2019 Monday 18 5
S404, if the total number of the first marks reaches a first preset threshold value, distributing a transfer shift for the goods receiving and dispatching points in the combined data.
In one embodiment, the server counts the total number of the first marks in the combined data, and when the total number of the first marks in the combined data reaches a first preset threshold value, the quantity of the goods in the future corresponding to the goods receiving and dispatching point in the combined data is predicted to be larger, that is, the transfer shift needs to be allocated to the goods receiving and dispatching point.
As shown in table 4, in the combined data numbered a, the first packet data marked with 1 is only a1, that is, the total number of the first marks in the combined data numbered a is 1; of the packet data of B1 through B5, the packet data with the first flag of 1 has five pieces of B1 through B5, i.e., the total number of the first flags in the combined data with the number of B is 5. And when a first preset threshold corresponding to the total number of the first marks in the combined data needs to reach 2, allocating a transfer shift to the goods receiving and dispatching points corresponding to the goods with the number of the first marks being greater than or equal to 2. The total number of the first marks corresponding to the combined data of the goods receiving and dispatching point 010AA is 1, the first preset threshold value 2 is not reached, the quantity of the goods receiving and dispatching point 010AA in the next Monday is less, and a transfer shift does not need to be allocated to the goods receiving and dispatching point 010 AA. The total number of the first marks corresponding to the combined data of the goods receiving and dispatching point 010AB is 5, the first preset threshold value 2 is reached, the goods quantity of the goods receiving and dispatching point 010AB on the next Monday is predicted to be large, and the transfer shift needs to be allocated to the goods receiving and dispatching point 010 AB.
In one embodiment, when the total number of the first marks corresponding to the cargo receiving and dispatching points in the combined data is larger, the more the cargo receiving and dispatching points are predicted to have more cargo in the corresponding dates in the future, the more the transfer shift needs to be allocated. And when the total number of the first marks corresponding to the goods receiving and dispatching points in the combined data is smaller, predicting that the quantity of the goods at the goods receiving and dispatching points in the corresponding future date is smaller, and the shift needing to be allocated to the transfer shift is smaller.
In the above embodiment, the grouped data are combined according to a preset combination condition to obtain combined data, and when the total number of the corresponding first markers in the combined data reaches a first preset threshold, a transfer shift is allocated to the cargo item transceiver points in the combined data. By combining order data in historical time and distributing the transfer shifts of the goods receiving and dispatching points according to the number of the marks, the dynamic distribution of the transfer shifts is realized.
As shown in fig. 5, in one embodiment, the method for assigning a transfer shift of a cargo item receiving and dispatching point further comprises:
s502, if the total number of the first marks reaches a first preset threshold value, a second mark is set for the combined data.
In one embodiment, the server counts the total number of the first marks in the combined data, and when the total number of the first marks in the combined data reaches a first preset threshold value, sets a second mark for the combined data to indicate that the cargo receiving and dispatching points in the combined data have a larger quantity of cargo in the future corresponding date, namely need to allocate a transfer shift for the cargo receiving and dispatching points, wherein the total number of the second marks is smaller than or equal to the total number of the first marks.
And S504, when the historical time is a plurality of different historical time periods, each historical time period is provided with corresponding combined data, and the total number of the second marks in the combined data corresponding to each historical time period is counted.
In one embodiment, when the historical time is a plurality of different historical time periods, according to the method for allocating the transfer shifts of the cargo item receiving and dispatching point, second marks are respectively set for the combined data corresponding to each historical time. And counting the total number of the second marks in the combined data corresponding to each historical time period. For example, if two pieces of combined data corresponding to two different historical times are provided with the second flag, the total number of the second flags in the pieces of combined data corresponding to the three historical time periods is two.
And S505, when the total number of the second marks reaches a second preset threshold value, setting a transfer shift for the goods receiving and dispatching points in the combined data.
In one embodiment, when the total number of the second marks reaches the second preset threshold, it is indicated that the cargo receiving and dispatching points in the combined data have a larger cargo amount in each historical time, and it is predicted that the cargo amount is larger in the corresponding future date, and a transfer shift needs to be allocated to the cargo receiving and dispatching points in the combined data. The larger the total number of second markers, the more pieces of goods are predicted in the future corresponding dates, and more transfer shifts need to be assigned. When the total number of the second marks does not reach the second preset threshold value, the fact that the goods quantity of the goods receiving and sending points in the combined data in each historical time is less is shown, the goods quantity is predicted to be less in the corresponding future date, and the transfer shift does not need to be distributed to the goods receiving and sending points in the combined data.
In the above embodiment, the second markers are set for the combined data in which the total number of the first markers reaches the first preset threshold, the transfer shift is allocated to the goods receiving and dispatching points in the combined data according to the total number of the second markers, the transfer shift is allocated to the goods receiving and dispatching points according to the total number of the second markers in the combined data corresponding to the multiple historical time periods, and the accuracy of transfer shift allocation is improved.
As an example, in the technology, a fixed transfer shift is allocated to each cargo receiving and dispatching point for transfer, so that the cost is high, and the transfer efficiency is low. In view of the above problem, an embodiment of the present invention provides a method for assigning a transfer shift of a cargo item receiving and dispatching point, as shown in fig. 6, the method mainly includes the following steps:
the method comprises the steps of (I) obtaining order data in historical time, and carrying out first grouping on the order data to obtain grouped data.
Acquiring basic data related to the order in the historical time, wherein the basic data comprises a goods receiving and dispatching point, an invoice number, receiving time, sending time and product timeliness, judging whether the goods related to the basic data of the order in the historical time are high-timeliness products (goods needing to be connected as soon as possible) or not according to the receiving time, the sending time and the product timeliness, and if the goods are not high-timeliness products, excluding the goods; and if the goods are high-aging products, generating order data in historical time according to the basic data corresponding to the high-aging products. The order data includes a shipment receiving and dispatching point, date data, and a shipment quantity corresponding to the date data. The date data comprises the date, the week corresponding to the date, whether the holiday and the hour are saved, and the date is the month and day when the high-aging product is connected in the historical time.
The server groups the order data according to the goods receiving and sending point and the date data to obtain first grouped data. When the cargo item receiving and dispatching points to which the transfer shift is to be assigned are two points 010AA and 010AB, and the future time period to which the transfer shift is to be assigned is the next monday (31/01/2019), then the order data corresponding to the goods receiving and dispatching points of the two goods receiving and dispatching points 010AA and 010AB when the historical time is the latest five Monday 18 hours are obtained, and according to the date data 'Monday 18 hours', the order data of 010AA and 010AB two cargo receiving and dispatching points at the latest five Monday 18 are grouped to obtain first grouped data, the order data numbers in the first grouped data are respectively A1-A5, B1-B5, the order data corresponding to A1 are respectively '010 AA, 2019, Monday, 2019/01/01, 18, non-holidays, 2', the order data corresponding to A2 are, and so on, the order data of a 1-a 5 and B1-B5 can be obtained, and refer to table 1.
(II) calculating the quantile according to each goods quantity in the first grouping data, and setting a first mark for the grouping data of which the goods quantity reaches the quantile in the first grouping data
In order to eliminate the influence of the grouped data with small part of the goods quantity on the prediction result of whether the transfer shift is required to be allocated at the future goods receiving and dispatching point or not, the server calculates quantiles according to the goods quantities in the grouped data, wherein in the table 1, the goods quantities in the grouped data with the numbers of A1 to A5 and B1 to B5 are respectively 2, 1, 2, 3, 2 and 2, the 5% quantile is calculated to be 1.1, and the 5% quantile 1.1 is taken as the 'quantile _ five weeks'.
Judging whether the quantity of the goods in each first group of data is larger than the quantile or not, setting a mark named as 'mark _ week' for each first group of data, and if the quantity of the goods in the first group of data is larger than the quantile, setting a mark for the first group of data as a first mark, wherein the first mark is 1; if the quantity of the goods in the first group of data is less than or equal to the quantile, the mark set for the first group of data is 0. As shown in table 5, the quantity of cargo in the first packet data of a1, B1 to B5 is greater than 1.1 of the 5% quantile, and the first flag 1 is set for the first packet data of a1, B1 to B5; the cargo quantity in the first packet data of a2 to a5 is equal to or less than 5% quantile 1.1, and the flag is set to 0 for the first packet data of a2 to a 5.
TABLE 5 first grouping Mark Table
Numbering Net points Year of year Week Date Hour(s) Whether to save holidays Quantity of goods MarkingWeek (u)
A1 010AA 2019 Monday 2019/01/01 18 Holidays without festivals 2 1
A2 010AA 2019 Monday 2019/01/07 18 Holidays without festivals 1 0
A3 010AA 2019 Monday 2019/01/13 18 Holidays without festivals 1 0
A4 010AA 2019 Monday 2019/01/19 18 Holidays without festivals 1 0
A5 010AA 2019 Monday 2019/01/25 18 Holidays without festivals 1 0
B1 010AB 2019 Monday 2019/01/01 18 Holidays without festivals 2 1
B2 010AB 2019 Monday 2019/01/07 18 Holidays without festivals 3 1
B3 010AB 2019 Monday 2019/01/13 18 Holidays without festivals 2 1
B4 010AB 2019 Monday 2019/01/19 18 Holidays without festivals 2 1
B5 010AB 2019 Monday 2019/01/25 18 Holidays without festivals 2 1
(III) grouping the first grouped data according to a preset combination condition to obtain second grouped data
The server groups the first grouped data according to other preset grouping conditions such as the year, the week data, the hour, whether the holiday is saved and the like in the goods receiving and sending point and the date data to obtain second grouped data. As shown in table 6, when the preset combination condition is day data, the first packet data numbered a1 to a5, B1 to B5 in table 5 are grouped by day data to obtain second packet data numbered a and B, wherein the second packet data numbered a includes the first packet data numbered a1 to a5, and all day data are the first packet data of monday; the second packet data of number B includes the first packet data of numbers B1 to B5, all of which are monday first packet data.
TABLE 6 second grouping frequency table
Numbering Net points Year of year Week Hour(s) Frequency of Whether the frequency is greater than the threshold (2)
A 010AA 2019 Monday 18 1 Whether or not
B 010AB 2019 Monday 18 5 Is that
(IV) counting the frequency of the first mark in the second packet data
And counting the number of first marks corresponding to the first packet in the second packet data, and taking the number of the first marks corresponding to the first packet as the frequency of the first marks. As shown in table 6, when the historical time is monday, in the first packet data of a1 to a5, the first packet data marked with 1 is only a1, that is, the number of the first marks corresponding to the cargo transceiver point 010AA in the second packet data is 1, that is, the frequency of the first marks corresponding to the cargo transceiver point 010AA in the second packet data is 1; in the first packet data of B1 to B5, there are five pieces of packet data B1 to B5 for the first packet data marked with 1, that is, the number of the first marks corresponding to the cargo item receiving and dispatching point 010AB in the second packet data is 5, that is, the frequency of the first marks corresponding to the cargo item receiving and dispatching point 010AB in the packet data is 5.
And (V) when the frequency of the first mark in the second packet data is greater than the threshold value, setting a connection mark for the second packet data
When the frequency of the first marks in the second group data is greater than the threshold value, the receiving and sending point of the goods is predicted to have a large quantity of goods in the corresponding future date, namely a connection shift needs to be set for the receiving and sending point of the goods, and a connection mark 1 is set for the second group data. For example, when the number threshold corresponding to the total number of the first tags in the second grouping data needs to be greater than 2, the connection tag 1 is set for the cargo item receiving and dispatching point corresponding to the first tag whose number is greater than 2. As shown in tables 6 and 7, in the second packet data whose shipment destination is 010AA, the total number of the first tags is 1, and is not greater than the number threshold 2, and the connection tag 0 is set thereto. In the second packet data whose shipment receiving and dispatching point is 010AB, the frequency of the first flag is 5, which is greater than the threshold value 2, and the connection flag 1 is set for it.
TABLE 7 second grouping connection tag Table
Numbering Net points Year of year Week Hour(s) Docking tag
A 010AA 2019 Monday 18 0
B 010AB 2019 Monday 18 1
(VI) acquiring order data with the same period in the previous 5 years, the same holiday in the previous 5 years and the transfer scheduling current week, and respectively setting transfer marks for second-group data corresponding to each historical time according to the transfer scheduling distribution method of the cargo receiving and dispatching points
(VII) distributing the transfer shift according to the corresponding goods receiving and dispatching points marked by the transfer marks, and outputting a transfer shift table
The method comprises the steps of obtaining connection marks of order data with historical time of the previous 5 weeks, the same period of the previous 5 years, the same holiday of the previous 5 years and the current week of connection scheduling, and setting the connection marks corresponding to the historical time as a first connection mark, a second connection mark, a third connection mark and a fourth connection mark respectively. Judging whether the date corresponding to the future is a holiday, and if the date is the holiday, acquiring the frequency of the first mark corresponding to the first connection mark, the second connection mark, the third connection mark and the fourth connection mark; and if the holiday is not the festival, acquiring the frequency of the first mark corresponding to the first connection mark, the second connection mark and the fourth connection mark.
Acquiring a first mark with the maximum frequency in the frequency of the first marks corresponding to each historical time, taking a connection mark corresponding to the first mark with the maximum frequency as a final connection mark, predicting that the quantity of the goods in a future corresponding date of the goods receiving and dispatching point is large when the final connection mark is 1, and allocating a connection shift for the corresponding goods receiving and dispatching point; when the final transfer flag is 0, the receiving and sending point of the goods is predicted to have less goods in the corresponding future date, and a transfer shift does not need to be allocated to the receiving and sending point of the goods. And generating a transfer shift table according to the distributed transfer shifts, and outputting the transfer shift table.
In the above embodiment, the order data in a plurality of historical times are respectively subjected to first grouping to obtain first grouping data; calculating quantiles according to the quantity of each piece in the first grouped data, and setting a first mark for the grouped data of which the quantity of the pieces reaches the quantile in the first grouped data, so that the grouped data with less quantity of the pieces and less influence on the distribution of the transfer shifts can be eliminated, and the distribution accuracy of the transfer shifts is improved; grouping the first grouped data according to a preset combination condition to obtain second grouped data, counting the frequency of the first marks in the second grouped data, setting a connection mark for the second grouped data when the frequency of the first marks in the second grouped data is greater than a threshold value, and allocating a connection shift for the cargo item receiving and dispatching points in the second grouped data corresponding to the connection mark. By counting the number of date data which correspond to the cargo receiving and dispatching points in the order data in the plurality of historical times and correspond to the distribution transfer shifts, whether the transfer shifts need to be distributed at the future cargo receiving and dispatching points is predicted, and the dynamic distribution of the transfer shifts is realized.
Fig. 2-6 are schematic flow diagrams illustrating a method for assigning a transfer shift to a consignment receiving and dispatching point in one embodiment. It should be understood that although the various steps in the flow charts of fig. 2-6 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, unless explicitly stated otherwise, and may be performed in other orders. Moreover, at least some of the steps in fig. 2-6 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternating with other steps or at least some of the sub-steps or stages of other steps.
A lightering shift distribution device for a cargo item receiving and dispatching point, the device comprising: an obtaining module 702, a grouping module 704, a calculating module 706, a screening module 708, and a transfer shift assigning module 710, wherein:
an obtaining module 702, configured to obtain order data in historical time, where the order data includes a shipment receiving and sending point, date data, and a shipment volume corresponding to the date data;
a grouping module 704, configured to group order data to obtain grouped data;
a calculating module 706, configured to calculate quantiles for screening the quantity of the goods according to the quantity of the goods in the grouped data;
a screening module 708, configured to screen each piece of grouped data that reaches a quantile when the quantity of the goods in the grouped data reaches the quantile;
and the transfer shift allocation module 710 is configured to determine the number of each grouped data, and allocate a transfer shift to the cargo transceiving points in the grouped data if the number of the target grouped data in the grouped data reaches a first preset threshold.
In the embodiment, the order data in the historical time is grouped to obtain grouped data; calculating quantiles according to the quantity of the goods in the grouped data, and when the grouped data with the quantity of the goods reaching the quantile is screened out, the grouped data with less quantity of the goods and less influence on the distribution of the transfer shift can be excluded, so that the distribution accuracy of the transfer shift is improved; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data. Whether the transfer shift is required to be allocated to the future cargo receiving and dispatching points or not is predicted by counting the number of date data which correspond to the cargo receiving and dispatching points in the order data in the historical time and correspond to the transfer shift, and dynamic allocation of the transfer shift is achieved.
In one embodiment, as shown in fig. 8, the apparatus further comprises:
a first marking module 802, configured to set a first mark for each grouped data reaching a quantile when each grouped data reaching the quantile is screened out; counting the total number of the marks belonging to the corresponding freight receiving and dispatching points according to the first marks of the grouped data; and if the total number of the marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the grouped data.
The combination module 804 is used for combining the grouped data according to a preset combination condition to obtain combined data; and if the total number of the first marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the combined data.
A second flag module 806, configured to set a second flag for the combined data if the total number of the first flags reaches a first preset threshold; when the historical time is a plurality of different historical time periods, each historical time period is provided with corresponding combined data, and the total number of the second marks in the combined data corresponding to each historical time period is counted; and when the total number of the second marks reaches a second preset threshold value, setting a transfer shift for the goods receiving and sending points in the combined data.
In the above embodiment, the first markers are set for the grouped data reaching the quantile, the grouped data are combined according to the preset combination condition to obtain the combined data, and when the total number of the corresponding first markers in the combined data reaches the first preset threshold, the transfer shift is allocated to the goods receiving and dispatching points in the combined data. By combining order data in historical time and distributing the transfer shifts of the goods receiving and dispatching points according to the number of the marks, the dynamic distribution of the transfer shifts is realized.
In one embodiment, the grouping module 704 is further configured to group the order data according to the item receiving and sending points and the date data to obtain the grouped data of each item receiving and sending point.
In one embodiment, the calculation module 706 is further configured to rank the cargo quantities in the grouped data in order from smaller to larger; calling a quantile calculation function; and calculating the quantiles for screening the goods quantity according to the arranged goods quantity through the quantile calculation function.
In the embodiment, the quantiles are calculated by using the goods amount in the grouped data, and the grouped data are screened according to the quantiles, so that the grouped data with less goods amount and less influence on the distribution of the transfer shift can be eliminated, and the distribution accuracy of the transfer shift is improved.
FIG. 9 is a diagram illustrating an internal structure of a computer device in one embodiment. The computer device may specifically be the server 120 in fig. 1. As shown in fig. 9, the computer apparatus includes a processor, a memory, a network interface, an input device, and a display screen connected through a system bus. Wherein the memory includes a non-volatile storage medium and an internal memory. The non-volatile storage medium of the computer device stores an operating system and may also store a computer program that, when executed by the processor, causes the processor to implement a method for assigning a transfer shift of a shipment receiving and dispatching point. The internal memory may also have a computer program stored therein, which when executed by the processor, causes the processor to perform a method for assigning a transfer shift to a shipment receiving and dispatching site.
Those skilled in the art will appreciate that the architecture shown in fig. 9 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, the means for assigning a transfer shift to a delivery point of a cargo item provided herein may be embodied in the form of a computer program that is executable on a computer device such as that shown in fig. 9. The memory of the computer device may store various program modules that make up the transfer shift assignment device of the shipment receiving and dispatching point, such as the acquisition module 702, grouping module 704, calculation module 706, screening module 708, and transfer shift assignment module 710 shown in fig. 7. The computer program of the respective program modules causes the processor to execute the steps of the method for assigning a transfer shift of a shipment receiving and dispatching point of the respective embodiments of the present application described in the present specification.
For example, the computer device shown in fig. 9 may perform step S202 by the acquisition module 702 in the docked shift distribution device of the shipment receiving and dispatching station as shown in fig. 7. The computer device may perform step S204 through the grouping module 704. The computer device may perform step S206 via the computing module 706, the computer device may perform step S208 via the filtering module 708, and the computer device may perform step S210 via the docked shift assignment module 710.
In one embodiment, there is provided a computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform: acquiring order data in historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data; grouping the order data to obtain grouped data; calculating quantiles for screening the quantity of the goods according to the quantity of the goods in the grouped data; when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data.
In one embodiment, there is provided a computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform: when all the grouped data reaching the quantile are screened out, setting a first mark for all the grouped data reaching the quantile; counting the total number of the marks belonging to the corresponding freight receiving and dispatching points according to the first marks of the grouped data; and if the total number of the marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the grouped data.
In one embodiment, there is provided a computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform: combining the grouped data according to a preset combination condition to obtain combined data; and if the total number of the first marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the combined data.
In one embodiment, there is provided a computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform: if the total number of the first marks reaches a first preset threshold value, setting a second mark for the combined data; when the historical time is a plurality of different historical time periods, each historical time period is provided with corresponding combined data, and the total number of the second marks in the combined data corresponding to each historical time period is counted; and when the total number of the second marks reaches a second preset threshold value, setting a transfer shift for the goods receiving and sending points in the combined data.
In one embodiment, there is provided a computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform: and grouping the order data according to the goods receiving and sending points and the date data to obtain grouped data of each goods receiving and sending point.
In one embodiment, there is provided a computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform: arranging the goods in the grouped data in the order from small to large; calling a quantile calculation function; and calculating the quantiles for screening the goods quantity according to the arranged goods quantity through the quantile calculation function.
In one embodiment, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform: acquiring order data in historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data; grouping the order data to obtain grouped data; calculating quantiles for screening the quantity of the goods according to the quantity of the goods in the grouped data; when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile; and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift for the goods receiving and dispatching points in the grouped data.
In one embodiment, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform: when all the grouped data reaching the quantile are screened out, setting a first mark for all the grouped data reaching the quantile; counting the total number of the marks belonging to the corresponding freight receiving and dispatching points according to the first marks of the grouped data; and if the total number of the marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the grouped data.
In one embodiment, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform: combining the grouped data according to a preset combination condition to obtain combined data; and if the total number of the first marks reaches a first preset threshold value, distributing the transfer shift for the goods receiving and dispatching points in the combined data.
In one embodiment, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform: if the total number of the first marks reaches a first preset threshold value, setting a second mark for the combined data; when the historical time is a plurality of different historical time periods, each historical time period is provided with corresponding combined data, and the total number of the second marks in the combined data corresponding to each historical time period is counted; and when the total number of the second marks reaches a second preset threshold value, setting a transfer shift for the goods receiving and sending points in the combined data.
In one embodiment, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform: and grouping the order data according to the goods receiving and sending points and the date data to obtain grouped data of each goods receiving and sending point.
In one embodiment, there is provided a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform: arranging the goods in the grouped data in the order from small to large; calling a quantile calculation function; and calculating the quantiles for screening the goods quantity according to the arranged goods quantity through the quantile calculation function.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, and the program can be stored in a non-volatile computer readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above examples only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A method for distributing transfer shifts of cargo item receiving and dispatching points comprises the following steps:
acquiring order data in historical time, wherein the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data;
grouping the order data to obtain grouped data;
determining quantiles for screening the cargo quantity according to the cargo quantity in the grouped data;
when the goods quantity in the grouped data reaches the quantile, screening the grouped data reaching the quantile;
and determining the quantity of each grouped data, and if the quantity of the target grouped data in the grouped data reaches a first preset threshold value, allocating a transfer shift to the goods receiving and sending points in the target grouped data.
2. The method of claim 1, further comprising:
when all the grouped data reaching the quantile are screened out, setting a first mark for all the grouped data reaching the quantile;
the determining the number of each grouped data, and if the number of target grouped data in the grouped data reaches a first preset threshold, allocating a transfer shift to the cargo item transceiving points in the grouped data, including:
counting the total number of the marks belonging to the corresponding goods receiving and dispatching points according to the first mark of each grouped data;
and if the total number of the marks reaches a first preset threshold value, distributing a transfer shift for the goods receiving and dispatching points in the grouped data.
3. The method of claim 1, wherein assigning a transfer shift to a cargo item receiving and sending point in the grouped data if the total number of the first tags in the grouped data reaches a first predetermined threshold comprises:
combining the grouped data according to a preset combination condition to obtain combined data;
and if the total number of the first marks reaches a first preset threshold value, distributing a transfer shift for the goods receiving and dispatching points in the combined data.
4. The method of claim 3, further comprising:
if the total number of the first marks reaches a first preset threshold value, setting a second mark for the combined data;
when the historical time is a plurality of different historical time periods, each historical time period is provided with corresponding combined data, and the total number of second marks in the combined data corresponding to each historical time period is counted;
and when the total number of the second marks reaches a second preset threshold value, setting a transfer shift for the goods receiving and sending points in the combined data.
5. The method according to any one of claims 1 to 4, wherein said grouping the order data into grouped data comprises:
and grouping the order data according to the freight receiving and sending points and the date data to obtain grouped data of each freight receiving and sending point.
6. The method of any of claims 1 to 4, wherein said calculating a quantile for screening said quantity of items based on each quantity of items in said grouped data comprises:
arranging the goods quantity in the grouped data according to the sequence from small to large;
calling a quantile calculation function;
and calculating the quantiles for screening the goods quantity according to the arranged goods quantity through the quantile calculation function.
7. A device for distributing transfer shifts of a point of dispatch of a piece of goods, characterized in that it comprises:
the system comprises an acquisition module, a storage module and a processing module, wherein the acquisition module is used for acquiring order data in historical time, and the order data comprises a goods receiving and sending point, date data and goods quantity corresponding to the date data;
the grouping module is used for grouping the order data to obtain grouped data;
the calculating module is used for calculating quantiles for screening the goods quantity according to the goods quantity in the grouped data;
the screening module is used for screening each grouped data reaching the quantile when the goods quantity in the grouped data reaches the quantile;
and the connection shift allocation module is used for determining the number of each grouped data, and allocating a connection shift to the cargo piece transceiving points in the grouped data if the number of the target grouped data in the grouped data reaches a first preset threshold.
8. The apparatus of claim 7, further comprising:
the combination module is used for combining the grouped data according to a preset combination condition to obtain combined data; and if the total number of the first marks reaches a first preset threshold value, distributing a transfer shift for the goods receiving and dispatching points in the combined data.
9. A computer-readable storage medium, storing a computer program which, when executed by a processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 6.
10. A computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform the steps of the method according to any one of claims 1 to 6.
CN201911240977.XA 2019-12-06 2019-12-06 Method, device, storage medium and equipment for allocating connection shifts of goods receiving and dispatching points Active CN112926906B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911240977.XA CN112926906B (en) 2019-12-06 2019-12-06 Method, device, storage medium and equipment for allocating connection shifts of goods receiving and dispatching points

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911240977.XA CN112926906B (en) 2019-12-06 2019-12-06 Method, device, storage medium and equipment for allocating connection shifts of goods receiving and dispatching points

Publications (2)

Publication Number Publication Date
CN112926906A true CN112926906A (en) 2021-06-08
CN112926906B CN112926906B (en) 2023-06-13

Family

ID=76162403

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911240977.XA Active CN112926906B (en) 2019-12-06 2019-12-06 Method, device, storage medium and equipment for allocating connection shifts of goods receiving and dispatching points

Country Status (1)

Country Link
CN (1) CN112926906B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110238593A1 (en) * 2010-03-23 2011-09-29 United Parcel Service Of America, Inc. Systems and Methods for Identifying Suspicious Orders
EP2750086A1 (en) * 2012-12-28 2014-07-02 Exapaq Sas Methods and systems for providing package pickup/delivery services
CN104915846A (en) * 2015-06-18 2015-09-16 北京京东尚科信息技术有限公司 Electronic commerce time sequence data anomaly detection method and system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110238593A1 (en) * 2010-03-23 2011-09-29 United Parcel Service Of America, Inc. Systems and Methods for Identifying Suspicious Orders
EP2750086A1 (en) * 2012-12-28 2014-07-02 Exapaq Sas Methods and systems for providing package pickup/delivery services
CN104915846A (en) * 2015-06-18 2015-09-16 北京京东尚科信息技术有限公司 Electronic commerce time sequence data anomaly detection method and system

Also Published As

Publication number Publication date
CN112926906B (en) 2023-06-13

Similar Documents

Publication Publication Date Title
CN106875148B (en) Method and device for determining a storage position for an item
CN106980955B (en) Method and apparatus for outputting information
US7125179B1 (en) System and method of evaluating print shop consolidation options in an enterprise
US20150294265A1 (en) Systems and methods for delivering packages
CN108681845B (en) Intelligent logistics order dispatching management system based on big data
CN110705805A (en) Cargo assembling method and device, storage medium and electronic device
CN109685429B (en) Distribution capacity determining method and device, electronic equipment and storage medium
CN110264123B (en) Distribution path generation method and equipment
CN110599067A (en) Storage allocation method, storage medium and electronic equipment
CN110852668A (en) Goods warehousing processing method and device, warehousing system and computer equipment
CN111178830B (en) Cost accounting method, cost accounting device, computer equipment and storage medium
CN111047264A (en) Logistics task allocation method and device
CN109784644B (en) Case distribution method, device, computer equipment and storage medium
CN113935528B (en) Intelligent scheduling method, intelligent scheduling device, computer equipment and storage medium
CN112926906A (en) Method, device, storage medium and equipment for distributing transfer shifts of cargo item receiving and dispatching points
CN110852626A (en) Dispatching method and device for receiving order, electronic equipment and storage medium
CN109961258A (en) Pickup code generating method and electronic equipment
CN112718539B (en) Grading method and device for assembly part, electronic equipment and storage medium
CN112949884B (en) Article waybill processing method and device, computer equipment and storage medium
CN115545250A (en) Departure time planning method and device, electronic equipment and storage medium
CN113327074B (en) Logistics network updating method and device and logistics network structure
CN113723729A (en) Transportation network data integration method and device, computer equipment and storage medium
CN109784816A (en) Express delivery distribution method and device
CN111476521A (en) Goods storage method and device
CN115130940A (en) Logistics cost accounting method and device, computer equipment and storage medium

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