CN114330801A

CN114330801A - Express delivery capacity optimization method and device, computer equipment and storage medium

Info

Publication number: CN114330801A
Application number: CN202011071093.9A
Authority: CN
Inventors: 张策; 陈志文; 黎碧君; 谢宇昕; 张莹莹; 叶绍志
Original assignee: SF Technology Co Ltd
Current assignee: SF Technology Co Ltd
Priority date: 2020-10-09
Filing date: 2020-10-09
Publication date: 2022-04-12

Abstract

The application relates to a method and a device for optimizing express delivery capacity, computer equipment and a storage medium. The method comprises the following steps: determining the trunk transport capacity and the branch transport capacity according to the arrival fields of the transport capacities; respectively generating trunk transport capacity of trunk transport capacity according to historical freight bill timeliness to obtain timeliness data tables and branch transport capacity corresponding to the branch transport capacity to obtain timeliness data tables; when the fact that the freight note has the aging risk is determined, determining an aging rescue data table from a branch transport capacity achievable aging data table and a trunk transport capacity achievable aging data table according to a destination city of the freight note; and determining the optimal transport capacity of the waybill according to the time-dependent rescue data table. By adopting the method, the delay risk of the waybill can be reduced, and the determined optimal waybill capacity is more objective, so that the accuracy is improved.

Description

Express delivery capacity optimization method and device, computer equipment and storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for optimizing express delivery capacity, a computer device, and a storage medium.

Background

Express mail is the root of the logistics industry, and the effect of the aging of the express mail on the express mail is also crucial. However, since the whole circulation process of the express is very complicated, it is inevitable that some force-ineffectiveness factors affect the aging of the express, and the effect usually brings the risk of customer complaint and increases the cost. Therefore, it is important to provide the best transport capacity for the express mail, so as to reduce the risk of delay and even customer complaint when the express mail is formed. The existing recommendation of the optimal transport capacity of the express is to plan the subsequent whole optimal path of the shipping list, and the method can improve the timeliness to a certain extent.

However, the traditional way of planning the subsequent whole optimal path of the waybill only gives the subsequent optimal capacity of the waybill in theory, thereby reducing the accuracy.

Disclosure of Invention

In view of the above, it is necessary to provide a method, an apparatus, a computer device, and a storage medium for optimizing express delivery capacity, which can improve accuracy.

A method for optimizing the capacity of express items, the method comprising:

determining trunk transport capacity and branch transport capacity according to the arrival field of each transport capacity;

respectively generating a trunk line transport capacity achievable aging data table of the trunk line transport capacity and a branch line transport capacity achievable aging data table corresponding to the branch line transport capacity according to historical freight bill aging;

when determining that the freight note has an aging risk, determining an aging rescue data table from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table according to the destination city of the freight note;

and determining the optimal transport capacity of the freight bill according to the time-dependent rescue data table.

In one embodiment, generating a trunk capacity achievable aging data table for the trunk capacity based on historical waybill aging includes:

acquiring each stowage city corresponding to the trunk line transport capacity;

counting historical freight bill quantity of each lower district and county of each stowage city within first preset time, and respectively screening out remote districts and counties of each stowage city to obtain effective district and counties of each stowage city;

counting the trunk line transport capacity in a second preset time as historical freight bill quantity carried by each effective district county of each stowage city, and determining the coverable stowage city of the trunk line transport capacity from each stowage city;

acquiring the planned sending time of the trunk line transport capacity, and respectively counting the historical waybill timeliness of the historical waybill carried by each coverable stowage city;

respectively calculating the reachable time efficiency of the trunk line transport capacity reaching each coverable stowage city according to the historical freight bill time efficiency and the planned departure time of each coverable stowage city;

and generating a main line transportation capacity achievable aging data table according to the transportation capacity basic information of the main line transportation capacity and the achievable aging of the covered stowage cities.

In one embodiment, the method for generating the branch capacity reachable aging data table corresponding to the branch capacity according to the historical waybill aging comprises the following steps:

acquiring each stowage dot corresponding to the branch transport capacity;

respectively counting the historical waybill timeliness of the historical waybill carried by each distribution network point and acquiring the planned sending time of the branch waybill;

calculating the difference value between the 80 quantile of the historical freight bill aging corresponding to each distribution network point and the planned departure time to obtain the reachable aging of the branch transport capacity reaching each distribution network point;

and generating a branch transport capacity achievable aging data table according to the transport capacity basic information of the branch transport capacity and the achievable aging of the branch transport capacity reaching each distribution network point.

In one embodiment, when it is determined that the waybill is at a risk of aging, determining an aging rescue data table from the branch line capacity achievable aging data table and the trunk line capacity achievable aging data table according to a destination city of the waybill comprises:

when the fact that the freight note has the aging risk is determined, acquiring a city of a transit station where the freight note is located currently and a target city of the freight note;

when the city of the current transfer site is consistent with the target city, determining that the branch transport capacity can reach an aging data table as an aging rescue data table;

and when the city of the current transfer station is inconsistent with the target city, determining that the trunk transport capacity can reach the timeliness data table as a timeliness rescue data table.

In one embodiment, when the timeliness rescue data table is a branch capacity achievable timeliness data table, the determining the optimal capacity of the freight bill according to the timeliness rescue data table includes:

screening out candidate branch transport capacity of a destination network point containing the freight bill based on the branch transport capacity achievable timeliness data table;

obtaining the latest arrival time of the line of the transport capacity of each candidate branch line and the arrival time of the freight note to the current transit station;

screening candidate branch transport capacity of the latest arrival time of the line after the arrival time to obtain selectable branch transport capacity;

and obtaining the reachable time efficiency of the selectable branch capacity, comparing the reachable time efficiency of each selectable branch capacity, and determining the selectable branch capacity with the fastest time efficiency as the optimal capacity of the freight bill.

In one embodiment, when the timeliness rescue data table is a trunk capacity achievable timeliness data table, the determining the optimal capacity of the waybill according to the timeliness rescue data table includes:

acquiring the arrival time of the waybill to the current transfer station;

screening out first candidate trunk transport capacity of which the stowage city comprises the freight note destination city but the destination city is different from the freight note destination city according to the trunk transport capacity achievable timeliness data table;

screening the trunk transport capacity of a destination transfer site including a destination network point of the freight note to obtain a second candidate trunk transport capacity for the same trunk transport capacity of the destination city as that of the freight note;

respectively acquiring the latest arrival time of the lines of the first candidate trunk transport capacity and the second candidate trunk transport capacity;

screening candidate trunk capacity of the line after the arrival time at the latest arrival time from the first candidate trunk capacity and the second candidate trunk capacity to obtain selectable trunk capacity;

and obtaining the reachable time efficiency of each selectable trunk line transport capacity, comparing the reachable time efficiency of each selectable trunk line transport capacity, and determining the selectable trunk line transport capacity with the fastest time efficiency as the optimal transport capacity of the freight bill.

In one embodiment, the method for determining that the waybill has the aging risk includes:

acquiring initial committed dispatch time and predicted dispatch time of the freight note;

and comparing the initial committed dispatch time with the estimated dispatch time to determine whether the freight bill has aging risks.

An apparatus for optimizing the capacity of an express item, the apparatus comprising:

the classification module is used for determining the trunk transport capacity and the branch transport capacity according to the arrival field of each transport capacity;

the generation module is used for respectively generating a trunk line transport capacity achievable aging data table of the trunk line transport capacity and a branch line transport capacity achievable aging data table corresponding to the branch line transport capacity according to historical freight bill aging;

the selection module is used for determining an aging rescue data table from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table according to the destination city of the freight bill when the freight bill is determined to have aging risks;

and the determining module is used for determining the optimal transport capacity of the freight bill according to the time-dependent rescue data table.

A computer device comprising a memory storing a computer program and a processor implementing the steps of any of the methods for optimizing express delivery capacity described above when the computer program is executed by the processor.

A computer-readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, carries out the steps of the method for optimizing the capacity of a shipment of any one of the preceding claims.

According to the method, the device, the computer equipment and the storage medium for optimizing the express delivery capacity, the trunk delivery capacity and the branch delivery capacity are determined according to an arrival site, and then the trunk delivery capacity of the trunk delivery capacity can be generated according to historical waybill timeliness to form an timeliness data table and the branch delivery capacity corresponding to the branch delivery capacity can be formed into an timeliness data table; and when the fact that the freight note has the aging risk is determined, determining an aging rescue data table from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table according to the destination city of the freight note, and determining the optimal transport capacity of the freight note according to the aging rescue data table. The method respectively generates reachable time efficiency data tables of the branch lines and the trunk lines by calculating the reachable time efficiency, and can provide the optimal capacity for the freight note according to the reachable time efficiency data tables when the freight note has time efficiency risks, so that the delay risk of the freight note is reduced. And the reachable time schedule is generated according to the historical freight bill time schedule, so that the optimal transport capacity determined according to the reachable time schedule is more objective, and the accuracy is improved.

Drawings

FIG. 1 is a diagram of an exemplary embodiment of a method for optimizing the capacity of a courier;

FIG. 2 is a schematic flow chart illustrating a method for optimizing the capacity of a package in one embodiment;

FIG. 3 is a schematic flow chart illustrating steps of generating a schedule of achievable aging of trunk capacity for the trunk capacity based on historical waybill aging in one embodiment;

FIG. 4 is a flowchart illustrating steps of generating a list of branch capacity achievable aging data according to historical waybill aging for branch capacity;

FIG. 5 is a block diagram showing the construction of an apparatus for optimizing the capacity of delivery of an express mail according to an embodiment;

FIG. 6 is a diagram illustrating an internal structure of a computer device according to an 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.

The method for optimizing the express delivery capacity can be applied to the application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. After the terminal 102 receives the optimization instruction, the terminal 102 can independently realize the optimization method of the express delivery capacity. The terminal 102 may also send an optimization instruction to the server 104 in communication, and the server 104 may implement the method for optimizing the express delivery capacity. The server 104 returns the terminal 102 to notify the user after determining the optimal capacity of the waybill.

Specifically, taking the server 104 as an example, the server 104 determines the trunk transport capacity and the branch transport capacity according to the arrival place of each transport capacity; the server 104 respectively generates a trunk transport capacity achievable aging data table of the trunk transport capacity and a branch transport capacity achievable aging data table corresponding to the branch transport capacity according to the historical waybill aging; when the server 104 determines that the waybill has the aging risk, determining an aging rescue data table from a branch waybill reachable aging data table and a trunk waybill reachable aging data table according to a destination city of the waybill; and determining the optimal transport capacity of the waybill according to the time-dependent rescue data table. The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers.

In one embodiment, as shown in fig. 2, a method for optimizing express delivery capacity is provided, which is described by taking the method as an example applied to the server in fig. 1, and includes the following steps:

and step S202, determining the trunk transport capacity and the branch transport capacity according to the arrival site of each transport capacity.

The transportation capacity generally refers to transportation force, and in this embodiment, the transportation capacity is understood to be each line in the logistics transportation. In this embodiment, ten pieces of capacity basic information of specific dimensions are preferably used to define capacity, and these ten pieces of capacity basic information of specific dimensions are respectively line code, line sending site, line arrival site, latest arrival time, latest arrival week, planned sending time, planned sending week, sending shift, aging type, and stowage city/network point (trunk capacity is stowage city, branch capacity is stowage network point). It should be understood that the above ten specific dimensions of the capacity basic information are not limited thereto, and the capacity basic information may be increased or decreased according to actual situations. For example, the capacity base information may also include, but is not limited to, a line origination city, a line destination city, a line type, a radiation network point, and the like.

The arrival site is the site where the line arrives, the transportation capacity of the arrival site which is a network point is marked as the branch transportation capacity, and the transportation capacity of the arrival site which is not a network point is marked as the trunk transportation capacity.

Specifically, the server acquires an arrival site of each capacity of the whole network, and marks each capacity as a trunk capacity or a branch capacity according to the arrival site of each capacity. For example, when the arrival of capacity at the site is a branch, the capacity is labeled as branch capacity.

And step S204, respectively generating a trunk transport capacity achievable aging data table of the trunk transport capacity and a branch transport capacity achievable aging data table corresponding to the branch transport capacity according to the historical freight bill aging.

The historical waybill aging refers to waybill aging of historical waybill carried by corresponding load-sharing cities or load-sharing network points.

Specifically, after the trunk capacity and the branch capacity are determined, the server respectively obtains historical waybills carried by the trunk capacity and the branch capacity. The trunk transport capacity obtains the historical waybill carried by the corresponding distribution city, and the branch transport capacity obtains the historical waybill carried by the corresponding distribution network point. And then, the server respectively acquires the freight note timeliness of each historical freight note, and determines the reachable timeliness of the trunk freight capacity to the distribution city or the achievable timeliness of the branch freight capacity to the distribution network point according to the freight note timeliness of each historical freight note. And then, the server generates a corresponding reachable time efficiency data table according to the reachable time efficiency of each transport capacity and the transport capacity basic information. The method comprises the steps that the reachable time efficiency of trunk line transport capacity to a distribution city and the transport capacity basic information of the trunk line transport capacity generate a trunk line transport capacity reachable time efficiency data table, and the reachable time efficiency of branch line transport capacity to a distribution network point and the transport capacity basic information of the branch line transport capacity generate a branch line transport capacity reachable time efficiency data table.

In addition, since the capacity schedule varies, the capacity availability aging data table may be updated at a fixed time in order to ensure the accuracy of the capacity availability aging data table. Generally, the capacity schedule is substantially the same for each week, so the capacity can be updated once per week to achieve an age table.

And S206, when the fact that the freight bill has the aging risk is determined, determining an aging rescue data table from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table according to the destination city of the freight bill.

Wherein, the existence of aging risk in the freight note means that the freight note has the risk that the freight note can not be dispatched within the dispatching time of the initial commitment. The timeliness rescue data table is selected from a branch-line transportation capacity achievable timeliness data table and a trunk-line transportation capacity achievable timeliness data table and is used for determining the optimal transportation capacity of the waybill to rescue the waybill and reduce the waybill timeliness risk.

Specifically, when a certain transit point receives a waybill corresponding to an express, the express can be evaluated for dispatch risk. The server obtains the initial commitment dispatch time, and then judges whether the waybill currently has aging risk according to the dispatch time initially committed for the express. When the fact that the freight note has the aging risk is determined, according to the destination city of the freight note, one data table is selected from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table to serve as an aging rescue data table for rescuing the age of the freight note.

And S208, determining the optimal transport capacity of the waybill according to the aging rescue data table.

Specifically, after the timeliness rescue data table of the waybill is determined, the server screens the waybill-selectable capacity according to the capacity basic information recorded in the timeliness rescue data table, and obtains the waybill-selectable capacity. For example, when the time efficiency rescue data table corresponding to the waybill is a trunk waybill time efficiency data table, the selectable trunk waybill which can be selected by the waybill is finally obtained through screening. And finally screening the selectable branch transport capacity which can be selected by the waybill when the time efficiency rescue data table corresponding to the waybill is a data table in which the branch transport capacity can be reached. And then, the server acquires the reachable time efficiency corresponding to all the optional transport capacity according to the reachable time efficiency recorded in the time efficiency rescue data table. And sequencing all the selectable transporting forces according to the achievable aging of the selectable transporting forces, and determining the selectable transporting force with the fastest aging as the optimal transporting force of the freight bill.

The method for optimizing the transport capacity of the express mail comprises the steps of firstly determining the trunk transport capacity and the branch transport capacity according to an arrival site, and then generating a trunk transport capacity capable of achieving the time effect data table and a branch transport capacity capable of achieving the time effect data table corresponding to the branch transport capacity according to historical freight lists; and when the fact that the freight note has the aging risk is determined, determining an aging rescue data table from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table according to the destination city of the freight note, and determining the optimal transport capacity of the freight note according to the aging rescue data table. The method respectively generates reachable time efficiency data tables of the branch lines and the trunk lines by calculating the reachable time efficiency, and can provide the optimal capacity for the freight note according to the reachable time efficiency data tables when the freight note has time efficiency risks, so that the delay risk of the freight note is reduced. And the reachable time schedule is generated according to the historical freight bill time schedule, so that the optimal transport capacity determined according to the reachable time schedule is more objective, and the accuracy is improved.

In one embodiment, as shown in fig. 3, generating a trunk capacity achievable aging data table for the trunk capacity based on historical manifest aging includes:

and step S302, acquiring each stowage city corresponding to the trunk transport capacity.

The stowage city refers to a city carried by trunk capacity, for example, when the line a bears express mails carrying the city a and the city B, the city a and the city B are the stowage city of the line a.

Specifically, the server acquires the stowage data of the transport capacity of the whole network from the database, wherein the stowage data comprises data such as a route code of the transport capacity, the latest arrival time of a route, an aging type, a stowage node, a stowage city, a stowage district department and the like. Then, the server screens the distribution city corresponding to the trunk transport capacity from the distribution data of the whole network transport capacity.

In addition, the transport capacity of the whole network also comprises transport capacity car logo data and freight note data, wherein the transport capacity car logo data comprises but is not limited to car numbers, line codes, line starting places, line arriving places, scheduled sending times, scheduled arriving times, scheduled sending shifts, scheduled arriving shifts, car logos and the like. Waybill data includes, but is not limited to, data such as waybill number, car number, age type, operating yard code, waybill origin city code, waybill origin yard code, waybill destination city code, waybill destination yard code, waybill destination county, waybill time to commit, etc. The transport capacity vehicle logo data and the transport capacity stowage data are related through line coding, and the transport capacity vehicle logo data and the freight note data are related through vehicle logo numbers.

Step S304, counting historical freight bill quantity of each lower district and county of each stowage city within first preset time, and respectively screening out remote districts and counties of each stowage city to obtain effective districts and counties of each stowage city.

The lower district of the stowage city refers to the district of the stowage city. The historical waybill amount refers to the number of historical waybill. The first preset time is a preset time range and can be configured according to actual requirements.

Specifically, there are multiple respective lower prefectures for each city, but for individual cities there are some remote prefectures. On one hand, the freight note arriving at the remote counties is small in amount and low in reference value, and on the other hand, the freight note arriving at the remote counties is long in time, belongs to an abnormal value and has certain influence on time efficiency calculation. Therefore, we eliminate the impact of these remote counties when calculating the time-efficiency of the trunk capacity. That is, the lower region of the stowage city is filtered, and those regions with historical waybill amount less than a specific threshold are discarded, thereby excluding these remote regions. And respectively counting the historical waybill quantities of the districts and counties under each distribution city in the main line capacity within the first preset time to obtain the historical waybill total quantity of the districts and counties under each distribution city within the first preset time. Then, the historical waybill amount of each district and county with the preset first waybill amount threshold value is compared. And taking the district where the historical waybill amount is less than the first waybill amount threshold value as a remote district screen, and taking the rest districts as effective districts. The first waybill quantity threshold value can be set according to actual requirements.

Step S306, the trunk transport capacity in the second preset time is counted as the historical freight bill quantity carried by each effective district county of each distribution city, and the distribution city which can be covered by the trunk transport capacity is determined from each distribution city.

The second preset time is a preset time range, may be equal to the first preset time or may not be equal to the first preset time, and is configured according to actual requirements.

In particular, since the positioning of trunk capacity in this example is in the city dimension, the historical volume of waybills for the loaded city that the trunk capacity is required to carry in a particular time reaches a certain amount. In addition to this, it is also necessary that the trunk capacity can reach every prefecture set under the stowage city. Therefore, the historical waybill amount carried by the trunk waybill capacity to each effective county of each distribution city in the second preset time is counted, and if the historical waybill amount carried by the effective county under the corresponding distribution city exceeds the preset second waybill amount threshold, the trunk waybill capacity can cover the effective county. Further, when the main transport capacity can cover all the effective prefectures and counties under the stowage city, it indicates that the main transport capacity can cover the stowage city, and the stowage city is a coverable stowage city of the main transport capacity. The second waybill amount threshold value can be set according to actual requirements.

Step S308, acquiring the planned sending time of the trunk transport capacity, and respectively counting the historical waybill timeliness of the historical waybill carried by each coverable stowage city.

Specifically, the server obtains the planned departure time of the trunk capacity from the aging rescue data table. Meanwhile, respectively counting the historical waybill timeliness of the historical waybill carried by each coverable stowage city, namely respectively counting the waybill timeliness of the historical waybill carried by the trunk waybill and reaching each coverable stowage city. For example, the concealable stowage cities include city 1 and city 2, i.e., accounting for waybill aging for historical waybill arriving at city 1 for the trunk capacity load, and accounting for waybill aging for historical waybill arriving at city 2 for the trunk capacity load.

And S310, respectively calculating the reachable time limit of the trunk line transport capacity reaching each coverable stowage city according to the historical freight list time limit and the planned departure time of each coverable stowage city.

Specifically, eighty percent of the shipments can be determined to be on time according to the aging of historical shipments, since each freight call has corresponding aging, and most of the freight calls can be dispatched on time generally. Therefore, the aging corresponding to the 80 quantile of the historical waybill aging corresponding to each stowage city is obtained, and the aging is called 80 quantile aging. And further, calculating a difference value between the 80-quantile timeliness and the planned sending time of the trunk capacity to obtain the reachable timeliness of the arrival of the trunk capacity at the coverable stowage city. Through statistics, the achievable aging can be finally classified into the following eight achievable aging types, the code numbers and meanings of which are as follows:

1D 12: can be reached 12 o' clock before the day;

1D 18: can be reached 18 o' clock before the day;

1D 24: can be reached 24 o' clock before the day;

2D 12: can be reached 12 o' clock before the next day;

2D 18: can be reached 18 o' clock before the next day;

2D 24: the next day is up to 24 o' clock;

3D 12: can be reached 12 o' clock after the day;

3D 18: can be reached 18 o' clock after the day;

3D 24: can be reached 24 o' clock after the day;

4D or above: can be reached more than three days.

And step S312, generating a main line capacity achievable aging data table according to the capacity basic information of the main line capacity and the achievable aging of each coverable stowage city.

Specifically, after the reachable aging of the distribution city which can be covered by the trunk capacity is obtained through calculation, the reachable aging and the capacity basic information corresponding to the trunk capacity are combined into a data table to obtain a trunk capacity reachable aging data table.

In the embodiment, the overlappable stowage city is obtained by screening out the abnormal county and the stowage city through the historical waybill amount, and the reachable time efficiency of reaching the overlappable stowage city is further calculated, so that the accuracy can be ensured. Meanwhile, the aging calculation according to the historical freight bill can achieve more accurate aging.

In one embodiment, as shown in fig. 4, generating a spur transport capacity corresponding to the spur transport capacity according to the historical waybill aging may achieve an aging data table, including the following steps:

step S402, acquiring each stowage dot corresponding to the branch transport capacity.

For example, when the mesh points borne by the line a include mesh point a and mesh point B, the mesh point a and mesh point B are the mesh points borne by the line a.

Specifically, the server acquires the stowage data of the transport capacity of the whole network from the database, wherein the stowage data comprises data such as a route code of the transport capacity, the latest arrival time of a route, an aging type, a stowage node, a stowage city, a stowage district department and the like. Then, the server screens the distribution network points corresponding to the branch transport capacity from the distribution data of the whole network transport capacity.

Step S404, respectively counting the historical waybill aging of the historical waybill carried by each distribution network point and obtaining the planned sending time of the branch waybill.

In particular, the achievable age of spur traffic is based on mesh point dimensions, since the number of orders of spur traffic is smaller compared to the number of trunk traffic, and spur traffic is directed to the destination mesh point. Therefore, the condition of district coverage and city coverage of the capacity is not required to be considered as the condition of calculating the capacity of the trunk line to achieve the time effect, the capacity of the branch line can be calculated to achieve the time effect by directly bearing the freight bill according to the history of the capacity of the branch line and taking the distribution network point of the capacity of the branch line as the basis. That is, after the server determines the distribution network points of the straight-line capacity, the server respectively counts the historical waybill timeliness of the historical waybill carried by each distribution network point for the branch capacity, that is, the server respectively counts the waybill timeliness of the historical waybill carried by the branch capacity and reaching each distribution network point. Meanwhile, the server acquires the planned sending time of the trunk transport capacity from the aging rescue data table.

Step S406, calculating the difference value between the 80 quantiles of the historical waybill timeliness corresponding to each distribution network point and the planned departure time, and obtaining the reachable timeliness of the branch road capacity reaching each distribution network point.

Specifically, the aging corresponding to the 80 quantiles of the historical waybill aging corresponding to each distribution network point of the branch waybill capacity is obtained, which is called 80 quantile aging, as the same as the calculation principle of the trunk waybill capacity. And further, calculating a difference value between the 80-quantile timeliness and the planned sending time of the branch transport capacity to obtain the reachable timeliness of the branch transport capacity reaching the distribution city network point.

And step S408, generating a branch line transportation capacity achievable aging data table according to the transportation capacity basic information of the branch line transportation capacity and the achievable aging of the arrival at each distribution network point.

Specifically, after the reachable aging of the branch capacity reaching the coverable stowage city is obtained through calculation, the reachable aging and the capacity basic information corresponding to the branch capacity are combined into a data table, and a branch capacity reachable aging data table is obtained.

In the embodiment, the corresponding achievable timeliness is calculated according to the timeliness of the historical freight note corresponding to the branch transport capacity, so that more accurate timeliness can be obtained, and the accuracy of the optimal transport capacity is improved.

In one embodiment, step S206 includes: when the fact that the freight note has the aging risk is determined, the city of the current transit station where the freight note is located and the target city of the freight note are obtained; when the city of the current transfer is consistent with the target city, determining that the branch transport capacity can reach the timeliness data table as a timeliness rescue data table; when the city of the current transfer site is inconsistent with the target city, the trunk transport capacity is determined to be capable of achieving the timeliness data table as the timeliness rescue data table.

Specifically, when it is determined that the waybill has the aging risk, the server determines a destination city of the waybill according to waybill information corresponding to the waybill, that is, a city to which the waybill is finally sent. And simultaneously, determining the city of the transfer where the waybill is currently located according to the transfer where the waybill is currently received. Then, the current transition city is compared with the target city to judge whether the current transition city and the target city are consistent. If the express items are consistent, the express items corresponding to the freight notes are sent to the destination city. At the moment, the express corresponding to the waybill does not need to be carried among cities, so that the branch traffic capacity with the network points as the dimensionality can be selected to be used as a time efficiency data table to serve as a time efficiency rescue data table. And if the express delivery is inconsistent with the target express delivery, the express delivery corresponding to the waybill is not sent to the final target city currently, and subsequent delivery needs to be carried out among the cities. So the selection of city-dimensional trunk capacity can reach the timeliness data table as the timeliness rescue data table.

In the embodiment, the selected time efficiency rescue data table is determined through the destination city of the freight bill and the current city, so that the accuracy of the selection of the transport capacity can be ensured.

In one embodiment, when the effectiveness rescue data table is the spur capacity achievable effectiveness rescue data table, step S208 includes: the method comprises the following steps of (1) screening out candidate branch transport capacity of a destination network point containing a freight note based on a branch transport capacity achievable timeliness data table; obtaining the latest arrival time of the line of the transport capacity of each candidate branch line and the arrival time of the freight note to the current transit station; screening candidate branch transport capacity of the latest arrival time of the line after the arrival time to obtain selectable branch transport capacity; and obtaining the achievable aging of the transport capacity of the selectable branch lines, comparing the achievable aging of the transport capacity of each selectable branch line, and determining the most aged selectable branch line transport capacity as the optimal transport capacity of the freight bill.

The candidate branch transport capacity is the branch transport capacity which is screened out to contain the corresponding destination mesh point, and the selectable branch transport capacity is the branch transport capacity which is screened out from the candidate branch transport capacity and can be selected as the carrying transport capacity.

Specifically, the branch capacity can be achieved as the stowage dot included in each branch capacity is recorded in the aging data table. Therefore, the server determines the destination network point of the freight note according to the freight note information of the freight note. And then screening the branch transport capacity according to the network points contained in the branch transport capacity, screening the branch transport capacity of the destination network points containing the freight list, and obtaining the candidate branch transport capacity. For example, when the destination node of the waybill is node A, all the branch traffic capacity including node A is screened out to obtain the candidate branch traffic capacity. Meanwhile, the latest arrival time of the line corresponding to each candidate branch capacity can be obtained from the branch capacity time-efficiency data table. And obtaining the arrival time of the waybill to the current transit station, for example, the time of receiving the express corresponding to the waybill in the transit station or the scanning time when the waybill is scanned can be used as the arrival time of the current transit station.

Then, since the latest arrival time of the line represents the latest arrival time of the line at the transit station, if the arrival time of the express corresponding to the waybill at the transit station is later than the latest arrival time of the line, the express cannot be sent to the next transit station by the branch capacity. Therefore, the server screens out the candidate branch capacity of the line after the latest arrival time, and obtains the selectable branch capacity. In order to obtain the most aged optimal capacity, the reachable aging of all the optional branch capacity is obtained from the branch capacity reachable aging data table. Sorting according to the sequence of the achievable aging, and selecting the selectable branch transport capacity with the fastest aging as the optimal transport capacity. The screening process may be expressed as assuming that the leg capacity comprises leg capacity A, B, C, D, E, the candidate leg capacity screened out comprises leg capacity A, C, D, E, and the optional leg capacity screened out from the candidate leg capacity comprises leg capacity A, C, D. And the optimal transport capacity is A, C, D according to the reachable time efficiency sequence, and the remaining two are the alternative transport capacities.

In this embodiment, the optimal transportation capacity is finally determined by performing screening step by step based on the destination point, the time and the time efficiency, so that not only can the accuracy of the optimal transportation capacity be ensured, but also the availability of the optimal transportation capacity can be ensured.

In one embodiment, when the effectiveness rescue data table is the trunk capacity achievable effectiveness rescue data table, step S208 includes: acquiring the arrival time of the waybill to the current transit station; according to the trunk transport capacity, an aging data table can be achieved, and first candidate trunk transport capacities of the distribution city, which contains the freight order destination city but is different from the freight order destination city, are screened out; screening the trunk transport capacity of a destination transfer site including a destination network point of the waybill to obtain a second candidate trunk transport capacity for the same trunk transport capacity of the destination city and the destination city of the waybill; respectively acquiring the latest arrival time of the lines of the first candidate trunk transport capacity and the second candidate trunk transport capacity; screening candidate trunk transport capacity of the line after the arrival time at the latest arrival time from the first candidate trunk transport capacity and the second candidate trunk transport capacity to obtain selectable trunk transport capacity; and obtaining the reachable time efficiency of the transport capacity of each selectable trunk line, comparing the reachable time efficiencies of the transport capacities of the selectable trunk lines, and determining the selectable trunk line transport capacity with the fastest time efficiency as the optimal transport capacity of the freight bill.

The first candidate trunk capacity is the trunk capacity of the screened destination city containing the waybill but the destination city of the first candidate trunk capacity is different from the destination city of the waybill, and the second candidate trunk capacity is the trunk capacity which simultaneously meets the three conditions of the destination city containing the waybill, the same destination city as the destination city of the waybill and the condition that the transit station of the destination of the second candidate trunk capacity contains the mesh point of the waybill. The selectable leg capacity refers to screening out trunk capacity from the first candidate trunk capacity and the second candidate trunk capacity that can be selected as carrying capacity.

Specifically, the main line capacity can be achieved as the stowage city included in each main line capacity is recorded in the time efficiency data table. Therefore, the server determines the destination city of the waybill according to the waybill information of the waybill. And further screening the transport capacity of each trunk line according to the distribution city contained in the transport capacity of each trunk line, screening the transport capacity of the trunk line of the target city containing the freight note, and obtaining the transport capacity of the candidate trunk line. The trunk capacity of the candidate trunk capacity is only the destination city containing the waybill but the destination city of the candidate trunk capacity is different from the destination city of the waybill, and the trunk capacity is the first candidate trunk capacity. And the remaining candidate trunk capacity except the first candidate trunk capacity is further screened out to obtain a second candidate trunk capacity, wherein the destination transition field comprises the trunk capacity of a destination branch point corresponding to the freight note.

Then, similarly, since the latest arrival time of the route indicates the latest arrival time of the route at the transit point, if the arrival time of the express corresponding to the waybill at the transit point is later than the latest arrival time of the route, it indicates that the express cannot be delivered to the next transit point with the branch capacity. Therefore, the server screens out candidate branch capacity of which the line latest arrival time is after the arrival time from the first candidate trunk capacity and the second candidate trunk capacity to obtain the selectable trunk capacity. Further, in order to obtain the most time-efficient optimal capacity, the achievable time-efficiency of all the optional trunk capacity is obtained from the trunk capacity achievable time-efficiency data table. And sequencing according to the sequence of the achievable aging, and selecting the selectable trunk transport capacity with the fastest aging as the optimal transport capacity.

In this embodiment, the optimal transportation capacity is finally determined by performing screening step by step based on cities, network points, time and timeliness, so that not only can the accuracy of the optimal transportation capacity be ensured, but also the availability of the optimal transportation capacity can be ensured.

In one embodiment, a method for determining that an invoice presents an aging risk includes: acquiring initial committed dispatch time and predicted dispatch time of the freight note; and comparing the initial committed dispatch time with the estimated dispatch time to determine whether the freight bill has aging risks.

The initial committed dispatch time is the dispatch time committed to the sender during dispatch, and the estimated dispatch time is the current dynamically estimated dispatch time. The estimated dispatch time may be understood as estimated based on the required transit time between the current location and the final dispatch point.

Specifically, when judging whether express mail corresponding to the freight order has aging risk, obtaining initial commitment dispatch time. Meanwhile, the predicted dispatch time is dynamically estimated. The initial committed dispatch time is then compared to the expected dispatch time. When the initial committed dispatch time is behind the expected dispatch time, the express can be dispatched on time without aging risk. And when the initial committed dispatch time is before the expected dispatch time, the express is at risk of not dispatching on time and has aging risk.

In this embodiment, the accuracy of determining whether there is an aging risk can be improved by dynamically estimating the expected delivery time and comparing the initial committed delivery time.

It should be understood that although the various steps in the flow charts of fig. 2-4 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, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2-4 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed in turn or alternately with other steps or at least some of the other steps.

In one embodiment, as shown in fig. 5, there is provided an apparatus for optimizing express delivery capacity, comprising: a classification module 502, a generation module 504, a selection module 506, and a determination module 508, wherein:

a classification module 502 for determining trunk line capacity and branch line capacity according to the arrival site of each capacity;

a generating module 504, configured to generate a trunk capacity achievable aging data table of the trunk capacity and a branch capacity achievable aging data table corresponding to the branch capacity according to the historical waybill aging;

a selecting module 506, configured to determine an aging rescue data table from the branch transport capacity achievable aging data table and the trunk transport capacity achievable aging data table according to a destination city of the waybill when it is determined that the waybill has an aging risk;

and the determining module 508 is used for determining the optimal transport capacity of the waybill according to the time-dependent rescue data table.

In one embodiment, the generating module 504 is further configured to obtain each stowage city corresponding to the trunk transportation capacity; counting historical freight sheet quantities of all lower districts and counties of all distribution cities within first preset time, and respectively screening out remote districts and counties of all distribution cities to obtain effective counties of all distribution cities; the trunk transport capacity in the second preset time is counted as the historical freight bill quantity carried by each effective district county of each stowage city, and the coverable stowage city of the trunk transport capacity is determined from each stowage city; acquiring plan sending time of the trunk line transport capacity, and respectively counting the historical waybill timeliness of the historical waybill carried by each coverable stowage city; respectively calculating the reachable time efficiency of the trunk line transport capacity reaching each coverable stowage city according to the historical freight bill time efficiency and the planned departure time of each coverable stowage city; and generating a main line transportation capacity achievable aging data table according to the transportation capacity basic information of the main line transportation capacity and the achievable aging of the reachable distribution cities.

In one embodiment, the generating module 504 is further configured to obtain each stowage dot corresponding to the branch transport capacity; respectively counting the historical waybill timeliness of the historical waybill carried by each distribution network point and acquiring the plan sending time of the branch waybill; calculating the difference value between the 80 quantiles of the historical freight bill timeliness corresponding to each distribution network point and the planned departure time to obtain the reachable timeliness of the branch transport capacity reaching each distribution network point; and generating a branch transport capacity achievable aging data table according to the transport capacity basic information of the branch transport capacity and the achievable aging of the branch transport capacity reaching each distribution network point.

In one embodiment, the selection module 506 is further configured to, when it is determined that the waybill has a time-critical risk, obtain a city in which the waybill is currently located in a transit and a destination city of the waybill; when the city of the current transfer is consistent with the target city, determining that the branch transport capacity can reach the timeliness data table as a timeliness rescue data table; when the city of the current transfer site is inconsistent with the target city, the trunk transport capacity is determined to be capable of achieving the timeliness data table as the timeliness rescue data table.

In one embodiment, the determining module 508 is further configured to screen out candidate branch capacity of a destination node including the waybill based on the branch capacity achievable timeliness data table; obtaining the latest arrival time of the line of the transport capacity of each candidate branch line and the arrival time of the freight note to the current transit station; screening candidate branch transport capacity of the latest arrival time of the line after the arrival time to obtain selectable branch transport capacity; and obtaining the achievable aging of the transport capacity of the selectable branch lines, comparing the achievable aging of the transport capacity of each selectable branch line, and determining the most aged selectable branch line transport capacity as the optimal transport capacity of the freight bill.

In one embodiment, the determining module 508 is further configured to obtain an arrival time of the waybill to the current transit station; according to the trunk transport capacity, an aging data table can be achieved, and first candidate trunk transport capacities of the distribution city, which contains the freight order destination city but is different from the freight order destination city, are screened out; screening the trunk transport capacity of a destination transfer site including a destination network point of the waybill to obtain a second candidate trunk transport capacity for the same trunk transport capacity of the destination city and the destination city of the waybill; respectively acquiring the latest arrival time of the lines of the first candidate trunk transport capacity and the second candidate trunk transport capacity; screening candidate trunk transport capacity of the line after the arrival time at the latest arrival time from the first candidate trunk transport capacity and the second candidate trunk transport capacity to obtain selectable trunk transport capacity; and obtaining the reachable time efficiency of the transport capacity of each selectable trunk line, comparing the reachable time efficiencies of the transport capacities of the selectable trunk lines, and determining the selectable trunk line transport capacity with the fastest time efficiency as the optimal transport capacity of the freight bill.

In one embodiment, the selection module 506 is further configured to obtain an initial committed dispatch time and an expected dispatch time for the shipment; and comparing the initial committed dispatch time with the estimated dispatch time to determine whether the freight bill has aging risks.

The specific definition of the express freight capacity optimization device can be referred to the definition of the express freight capacity optimization method in the foregoing, and the detailed description is omitted here. The modules in the device for optimizing the express delivery capacity can be wholly or partially realized by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as shown in fig. 6. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer equipment is used for storing transportation capacity stowage data, transportation capacity vehicle logo data, freight note data and the like. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method for optimizing the capacity of a dispatch.

Those skilled in the art will appreciate that the architecture shown in fig. 6 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, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program:

determining the trunk transport capacity and the branch transport capacity according to the arrival fields of the transport capacities;

respectively generating trunk transport capacity of trunk transport capacity according to historical freight bill timeliness to obtain timeliness data tables and branch transport capacity corresponding to the branch transport capacity to obtain timeliness data tables;

when the fact that the freight note has the aging risk is determined, determining an aging rescue data table from a branch transport capacity achievable aging data table and a trunk transport capacity achievable aging data table according to a destination city of the freight note;

and determining the optimal transport capacity of the waybill according to the time-dependent rescue data table.

In one embodiment, the processor, when executing the computer program, further performs the steps of: acquiring each stowage city corresponding to the trunk transport capacity; counting historical freight sheet quantities of all lower districts and counties of all distribution cities within first preset time, and respectively screening out remote districts and counties of all distribution cities to obtain effective counties of all distribution cities; the trunk transport capacity in the second preset time is counted as the historical freight bill quantity carried by each effective district county of each stowage city, and the coverable stowage city of the trunk transport capacity is determined from each stowage city; acquiring plan sending time of the trunk line transport capacity, and respectively counting the historical waybill timeliness of the historical waybill carried by each coverable stowage city; respectively calculating the reachable time efficiency of the trunk line transport capacity reaching each coverable stowage city according to the historical freight bill time efficiency and the planned departure time of each coverable stowage city; and generating a main line transportation capacity achievable aging data table according to the transportation capacity basic information of the main line transportation capacity and the achievable aging of the reachable distribution cities.

In one embodiment, the processor, when executing the computer program, further performs the steps of: acquiring each stowage dot corresponding to the branch transport capacity; respectively counting the historical waybill timeliness of the historical waybill carried by each distribution network point and acquiring the plan sending time of the branch waybill; calculating the difference value between the 80 quantiles of the historical freight bill timeliness corresponding to each distribution network point and the planned departure time to obtain the reachable timeliness of the branch transport capacity reaching each distribution network point; and generating a branch transport capacity achievable aging data table according to the transport capacity basic information of the branch transport capacity and the achievable aging of the branch transport capacity reaching each distribution network point.

In one embodiment, the processor, when executing the computer program, further performs the steps of: when the fact that the freight note has the aging risk is determined, the city of the current transit station where the freight note is located and the target city of the freight note are obtained; when the city of the current transfer is consistent with the target city, determining that the branch transport capacity can reach the timeliness data table as a timeliness rescue data table; when the city of the current transfer site is inconsistent with the target city, the trunk transport capacity is determined to be capable of achieving the timeliness data table as the timeliness rescue data table.

In one embodiment, the processor, when executing the computer program, further performs the steps of: the method comprises the following steps of (1) screening out candidate branch transport capacity of a destination network point containing a freight note based on a branch transport capacity achievable timeliness data table; obtaining the latest arrival time of the line of the transport capacity of each candidate branch line and the arrival time of the freight note to the current transit station; screening candidate branch transport capacity of the latest arrival time of the line after the arrival time to obtain selectable branch transport capacity; and obtaining the achievable aging of the transport capacity of the selectable branch lines, comparing the achievable aging of the transport capacity of each selectable branch line, and determining the most aged selectable branch line transport capacity as the optimal transport capacity of the freight bill.

In one embodiment, the processor, when executing the computer program, further performs the steps of: acquiring the arrival time of the waybill to the current transit station; according to the trunk transport capacity, an aging data table can be achieved, and first candidate trunk transport capacities of the distribution city, which contains the freight order destination city but is different from the freight order destination city, are screened out; screening the trunk transport capacity of a destination transfer site including a destination network point of the waybill to obtain a second candidate trunk transport capacity for the same trunk transport capacity of the destination city and the destination city of the waybill; respectively acquiring the latest arrival time of the lines of the first candidate trunk transport capacity and the second candidate trunk transport capacity; screening candidate trunk transport capacity of the line after the arrival time at the latest arrival time from the first candidate trunk transport capacity and the second candidate trunk transport capacity to obtain selectable trunk transport capacity; and obtaining the reachable time efficiency of the transport capacity of each selectable trunk line, comparing the reachable time efficiencies of the transport capacities of the selectable trunk lines, and determining the selectable trunk line transport capacity with the fastest time efficiency as the optimal transport capacity of the freight bill.

In one embodiment, the processor, when executing the computer program, further performs the steps of: acquiring initial committed dispatch time and predicted dispatch time of the freight note; and comparing the initial committed dispatch time with the estimated dispatch time to determine whether the freight bill has aging risks.

In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:

In one embodiment, the computer program when executed by the processor further performs the steps of: acquiring each stowage city corresponding to the trunk transport capacity; counting historical freight sheet quantities of all lower districts and counties of all distribution cities within first preset time, and respectively screening out remote districts and counties of all distribution cities to obtain effective counties of all distribution cities; the trunk transport capacity in the second preset time is counted as the historical freight bill quantity carried by each effective district county of each stowage city, and the coverable stowage city of the trunk transport capacity is determined from each stowage city; acquiring plan sending time of the trunk line transport capacity, and respectively counting the historical waybill timeliness of the historical waybill carried by each coverable stowage city; respectively calculating the reachable time efficiency of the trunk line transport capacity reaching each coverable stowage city according to the historical freight bill time efficiency and the planned departure time of each coverable stowage city; and generating a main line transportation capacity achievable aging data table according to the transportation capacity basic information of the main line transportation capacity and the achievable aging of the reachable distribution cities.

In one embodiment, the computer program when executed by the processor further performs the steps of: acquiring each stowage dot corresponding to the branch transport capacity; respectively counting the historical waybill timeliness of the historical waybill carried by each distribution network point and acquiring the plan sending time of the branch waybill; calculating the difference value between the 80 quantiles of the historical freight bill timeliness corresponding to each distribution network point and the planned departure time to obtain the reachable timeliness of the branch transport capacity reaching each distribution network point; and generating a branch transport capacity achievable aging data table according to the transport capacity basic information of the branch transport capacity and the achievable aging of the branch transport capacity reaching each distribution network point.

In one embodiment, the computer program when executed by the processor further performs the steps of: when the fact that the freight note has the aging risk is determined, the city of the current transit station where the freight note is located and the target city of the freight note are obtained; when the city of the current transfer is consistent with the target city, determining that the branch transport capacity can reach the timeliness data table as a timeliness rescue data table; when the city of the current transfer site is inconsistent with the target city, the trunk transport capacity is determined to be capable of achieving the timeliness data table as the timeliness rescue data table.

In one embodiment, the computer program when executed by the processor further performs the steps of: the method comprises the following steps of (1) screening out candidate branch transport capacity of a destination network point containing a freight note based on a branch transport capacity achievable timeliness data table; obtaining the latest arrival time of the line of the transport capacity of each candidate branch line and the arrival time of the freight note to the current transit station; screening candidate branch transport capacity of the latest arrival time of the line after the arrival time to obtain selectable branch transport capacity; and obtaining the achievable aging of the transport capacity of the selectable branch lines, comparing the achievable aging of the transport capacity of each selectable branch line, and determining the most aged selectable branch line transport capacity as the optimal transport capacity of the freight bill.

In one embodiment, the computer program when executed by the processor further performs the steps of: acquiring the arrival time of the waybill to the current transit station; according to the trunk transport capacity, an aging data table can be achieved, and first candidate trunk transport capacities of the distribution city, which contains the freight order destination city but is different from the freight order destination city, are screened out; screening the trunk transport capacity of a destination transfer site including a destination network point of the waybill to obtain a second candidate trunk transport capacity for the same trunk transport capacity of the destination city and the destination city of the waybill; respectively acquiring the latest arrival time of the lines of the first candidate trunk transport capacity and the second candidate trunk transport capacity; screening candidate trunk transport capacity of the line after the arrival time at the latest arrival time from the first candidate trunk transport capacity and the second candidate trunk transport capacity to obtain selectable trunk transport capacity; and obtaining the reachable time efficiency of the transport capacity of each selectable trunk line, comparing the reachable time efficiencies of the transport capacities of the selectable trunk lines, and determining the selectable trunk line transport capacity with the fastest time efficiency as the optimal transport capacity of the freight bill.

In one embodiment, the computer program when executed by the processor further performs the steps of: acquiring initial committed dispatch time and predicted dispatch time of the freight note; and comparing the initial committed dispatch time with the estimated dispatch time to determine whether the freight bill has aging risks.

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 instructions of a computer program, which 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 can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.

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-mentioned embodiments 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 invention. 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

1. A method for optimizing the capacity of express items, the method comprising:

2. The method of claim 1, wherein generating a trunk capacity achievable aging data table for the trunk capacity based on historical manifest aging comprises:

acquiring each stowage city corresponding to the trunk line transport capacity;

3. The method of claim 1, wherein generating a spur capacity achievable aging data table corresponding to the spur capacity according to historical waybill aging comprises:

acquiring each stowage dot corresponding to the branch transport capacity;

4. The method of claim 1, wherein when it is determined that the manifest is at risk of aging, determining an aging rescue data table from the branch capacity achievable aging data table and the trunk capacity achievable aging data table according to the destination city of the manifest comprises:

5. The method of claim 1, wherein when the timeliness rescue data table is a branch capacity achievable timeliness data table, said determining the optimal capacity of the waybill in accordance with the timeliness rescue data table comprises:

6. The method of claim 1, wherein when the timeliness rescue data table is a trunk capacity achievable timeliness data table, said determining the optimal capacity of the manifest according to the timeliness rescue data table comprises:

acquiring the arrival time of the waybill to the current transfer station;

7. The method of claim 1 or 4, wherein the method of determining that the waybill is at risk of aging comprises:

8. An apparatus for optimizing the capacity of an express item, the apparatus comprising:

9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the method of any of claims 1 to 7.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 7.