CN112668964A

CN112668964A - Transportation certificate routing method, device, equipment and computer readable storage medium

Info

Publication number: CN112668964A
Application number: CN202011540232.8A
Authority: CN
Inventors: 尹恒
Original assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2020-12-23
Filing date: 2020-12-23
Publication date: 2021-04-16

Abstract

The application provides a transportation certificate routing method, a transportation certificate routing device, transportation certificate routing equipment and a computer-readable storage medium, wherein the method comprises the following steps: acquiring attribute information of an object to be transported; determining an initial carrying path of the object to be transported according to the attribute information; determining at least one candidate path based on the attribute information, and acquiring historical carrying data and path attributes of the at least one candidate path, wherein the path attributes at least comprise real-time carrying capacity saturation; and adjusting the initial carrying path in real time based on the historical carrying path and the real-time carrying force saturation to obtain a target carrying path. Therefore, according to the historical carrying data and the real-time carrying capacity saturation, the intelligent adjustment of the carrying path is realized, the dynamic adjustment of the routing selection of the carrying path can be realized according to the real-time carrying capacity of a carrier, and the routing timeliness of the object to be transported is shortened.

Description

Transportation certificate routing method, device, equipment and computer readable storage medium

Technical Field

The application relates to the technical field of logistics transportation, and relates to but is not limited to a transportation certificate routing method, a device, equipment and a computer-readable storage medium.

Background

In the cross-border export business, the existing routing technology is to preset routing rules in an order receiving system, and route the order to a corresponding international carrier according to the routing rules (such as recipient country, recipient zip code, package weight and the like) in a preposed order receiving routing link. Routing does not support carrier reselection during the course of freight transport, and dynamic adjustment of routing cannot be realized according to the real-time carrying capacity of the carrier.

Disclosure of Invention

In view of the above, embodiments of the present application provide a transportation credential routing method, apparatus, device, and computer-readable storage medium.

The technical scheme of the embodiment of the application is realized as follows:

the embodiment of the application provides a transportation voucher routing method, which comprises the following steps:

acquiring attribute information of an object to be transported;

determining an initial carrying path of the object to be transported according to the attribute information;

determining at least one candidate path based on the attribute information, and acquiring historical carrying data and path attributes of the at least one candidate path, wherein the path attributes at least comprise real-time carrying capacity saturation;

and adjusting the initial carrying path in real time based on the historical carrying data and the real-time carrying force saturation to obtain a target carrying path.

In some embodiments, the obtaining attribute information of the object to be transported includes:

receiving a routing request aiming at an object to be transported;

analyzing the routing request to obtain first attribute information, wherein the first attribute information at least comprises a transportation certificate time period, a starting place, a destination, sender information and receiver information;

after the object to be transported is detected to be put in a warehouse, second attribute information is acquired, wherein the second attribute information at least comprises the weight, the declared price and object attributes of the object to be transported, and the object attributes comprise at least one of the type, the charge amount and the shape of the object to be transported;

and determining the first attribute information and the second attribute information as the attribute information of the object to be transported.

In some embodiments, the determining an initial carrier path of the object to be transported according to the attribute information includes:

acquiring a predefined routing rule;

and inputting the attribute information into the routing rule to obtain an initial carrying path of the object to be transported.

In some embodiments, the obtaining historical carriage data for the at least one candidate path comprises:

obtaining a historical shipment data set for the at least one candidate route;

screening historical carrying data of a target historical transport object in the historical carrying data set, wherein the target historical transport object is a historical transport object matched with the object to be transported;

and determining the filtered historical carrying data as the historical carrying data of the at least one candidate path.

In some embodiments, obtaining the path attribute of the at least one candidate path comprises:

acquiring real-time carrying data of the at least one candidate path;

determining real-time carrying capacity saturation of each carrier node included in the at least one candidate path based on the historical carrier data set and the real-time carrier data of the at least one candidate path;

determining real-time capacity saturation for each carrier node of the at least one candidate path as a path attribute for the at least one candidate path.

In some embodiments, the determining the real-time carrying capacity saturation of each carrier node included in the at least one candidate path based on the historical carrier data set and the real-time carrier data of the at least one candidate path includes:

acquiring historical highest carrying capacity of each carrying node included in each candidate path according to the historical carrying data set of each candidate path;

acquiring the current used carrying capacity of each carrying node according to the real-time carrying data of each candidate path;

and calculating the real-time carrying capacity saturation degree of each carrier node based on the current used carrying capacity and the historical highest carrying capacity.

In some embodiments, the path attributes further include: carrying node characteristics, inter-carrying node aging and carrying node optimal paths;

the obtaining of the route attribute of the at least one candidate route further comprises:

based on the historical carrying data of each candidate path, carrying out feature extraction on each carrying node included in each candidate path to obtain the carrying node feature;

acquiring the inter-carrier node timeliness based on the real-time carrier data of each candidate path, wherein the inter-carrier node timeliness is determined based on the warehousing timeliness, the transit timeliness, the last kilometer delivery timeliness and the destination receiving timeliness of the object to be transported;

based on the real-time carrying data, acquiring a path with the minimum time efficiency from a plurality of paths corresponding to each carrying node as an optimal path of each carrying node;

correspondingly, the adjusting the initial delivery path in real time based on the historical delivery data and the real-time delivery force saturation to obtain a target delivery path includes:

and adjusting the initial carrying path in real time based on the historical carrying data, the real-time carrying force saturation, the carrying node characteristics, the inter-carrying node aging and the carrying node optimal path to obtain a target carrying path.

In some embodiments, the adjusting the initial route in real time based on the historical route data, the real-time route saturation, the characteristics of the nodes, the inter-node aging, and the optimal route of the nodes to obtain the target route comprises:

determining the weight of each carrier node included in each candidate path based on the historical carrier data, the real-time carrier force saturation, the carrier node characteristics, the inter-carrier node aging and the optimal carrier node path;

adjusting the initial carrying path according to the weight of each carrying node to obtain a plurality of adjusted carrying paths;

and determining the adjusted carrying path with the minimum aging time in the plurality of adjusted carrying paths as a target carrying path.

In some embodiments, the method further comprises:

sending the target carrying path to each carrying node included in the target carrying path;

and updating the real-time carrying capacity saturation of each carrier node included in the target carrier path.

The embodiment of the application provides a transportation voucher routing device, the device includes:

the first acquisition module is used for acquiring attribute information of the object to be transported;

the first determining module is used for determining an initial carrying path of the object to be transported according to the attribute information;

a second determining module for determining at least one candidate path based on the attribute information;

a second obtaining module, configured to obtain historical carriage data and route attributes of the at least one candidate route, where the route attributes at least include real-time capacity saturation;

and the adjusting module is used for adjusting the initial carrying path in real time based on the historical carrying data and the real-time carrying force saturation to obtain a target carrying path.

The embodiment of the application provides a transportation voucher routing device, includes:

a processor; and

a memory for storing a computer program operable on the processor;

wherein the computer program when executed by a processor implements the steps of the transit voucher routing method described above.

Embodiments of the present application provide a computer-readable storage medium storing computer-executable instructions configured to perform the steps of the transportation credential routing method described above.

The embodiment of the application provides a transportation certificate routing method, a transportation certificate routing device, transportation certificate routing equipment and a computer-readable storage medium, wherein the method comprises the following steps: acquiring attribute information of an object to be transported; determining an initial carrying path of the object to be transported according to the attribute information; determining at least one candidate path based on the attribute information, and acquiring historical carrying data and path attributes of the at least one candidate path, wherein the path attributes at least comprise real-time carrying capacity saturation; and adjusting the initial carrying path in real time based on the historical carrying path and the real-time carrying force saturation to obtain a target carrying path. Therefore, according to the historical carrying data and the real-time carrying capacity saturation, the intelligent adjustment of the carrying path is realized, the dynamic adjustment of the routing selection of the carrying path can be realized according to the real-time carrying capacity of a carrier, and the routing timeliness of the object to be transported is shortened.

Drawings

In the drawings, which are not necessarily drawn to scale, like reference numerals may describe similar components in different views. The drawings illustrate generally, by way of example, but not by way of limitation, various embodiments discussed herein.

Fig. 1 is a schematic flow chart of an implementation of a transportation certificate routing method according to an embodiment of the present application;

fig. 2 is a schematic flow chart of another implementation of a transportation credential routing method according to an embodiment of the present application;

fig. 3 is a schematic flowchart of another implementation of the transportation certificate routing method according to an embodiment of the present application;

fig. 4 is a schematic flow chart of an implementation of the international shipper intelligent regression routing method according to the embodiment of the present application;

fig. 5 is a schematic structural diagram of a transportation certificate routing apparatus according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of a transportation certificate routing device according to an embodiment of the present application.

Detailed Description

In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be described in further detail with reference to the attached drawings, the described embodiments should not be considered as limiting the present application, and all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

In the following description, reference is made to "some embodiments" which describe a subset of all possible embodiments, but it is understood that "some embodiments" may be the same subset or different subsets of all possible embodiments, and may be combined with each other without conflict.

In the following description, references to the terms "first \ second \ third" are only to distinguish similar objects and do not denote a particular order, but rather the terms "first \ second \ third" are used to interchange specific orders or sequences, where appropriate, so as to enable the embodiments of the application described herein to be practiced in other than the order shown or described herein.

Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the present application only and is not intended to be limiting of the application.

Based on the technical problem that the routing can not be dynamically adjusted according to the real-time carrying capacity of a carrier in the related art, the embodiment of the application provides a transportation voucher routing method which is applied to transportation voucher routing equipment. The method provided by the embodiment of the present application can be implemented by a computer program, and when the computer program is executed, each step in the transportation certificate routing method provided by the embodiment of the present application is completed. In some embodiments, the computer program may be executable by a processor in a transit credential routing device. Fig. 1 is a schematic flow chart of an implementation of a transportation certificate routing method provided in an embodiment of the present application, and as shown in fig. 1, the transportation certificate routing method includes the following steps:

and S101, acquiring attribute information of the object to be transported.

The transportation voucher can be a transportation voucher (called a shipping receipt for short), and the object to be transported is a package to be delivered sent by a merchant or a sender. Here, the attribute information includes first attribute information and second attribute information.

The first attribute information is information related to distribution and at least comprises an invoice time period, a starting place, a destination, sending end information and receiving end information; the sender information is sender or merchant information and at least comprises a sender address and a sender identifier, the receiver information is receiver information and at least comprises a receiver address and a receiver identifier, and the sender identifier or the receiver identifier is a unique identifier capable of determining the sender or the receiver, such as a telephone. Here, the origin and the destination may be the same country or may be different countries.

The second attribute information is information related to the package, and at least comprises package weight, package declaration price and package attribute. Here, the parcel attribute includes at least one of an article type, an article electrification amount, and an article form of an article in the parcel. The article type may be a commodity, a food item, a document, clothing, a digital product, or others. It should be noted that the package declaration price meets the requirement of mailing value, and the articles in the object to be transported are articles meeting the requirement of forbidden mailing.

For example, the attribute information of the object to be transported is shown in table 1 below:

TABLE 1 Attribute information of objects to be transported

And step S102, determining an initial carrying path of the object to be transported according to the attribute information.

When the method is realized, a predefined routing model is firstly obtained; and then inputting the attribute information into the routing model to obtain an initial carrying path of the object to be transported. Wherein the routing model is determined by a static routing rule.

The shipping voucher routing device has pre-stored therein a predefined routing model determined by static routing rules (e.g., package shippable requirements for each carrier).

For example, carrier a shipping a package requires the following table 2:

table 2 carrier a carrier package requirements

The input information of the routing model is attribute information of the object to be transported, the output information is a carrying path, for example, the carrying path includes a first Chinese-French land transport, a second Chinese-French land transport, a first Chinese-French sea transport and a second Chinese-French sea transport, according to the attribute information and a predefined rule, one of the plurality of carrying paths is determined as an initial carrying path of the object to be transported, for example, the determined initial carrying path is a second Chinese-French land transport. The initial delivery route determined here is a fixed delivery route set in advance, and is not related to the real-time carrying capacity of the carrier, the historical delivery data, and the like.

Step S103, at least one candidate path is determined based on the attribute information.

Based on the attribute information and the requirements of each carrier package, a plurality of feasible carrier paths are determined as candidate paths. For example, if the object to be transported shown in table 1 can be transported by one of the first transportation by mesofaric land, the second transportation by mesofaric land, the first transportation by mesofaric sea, and the second transportation by mesofaric sea, the determined candidate routes are the first transportation by mesofaric land, the second transportation by mesofaric land, the first transportation by mesofaric sea, and the second transportation by mesofaric sea.

Step S104, acquiring historical carrying data and path attributes of the at least one candidate path.

Here, the path attribute includes at least a real-time carrying capacity saturation.

In one implementation, obtaining historical carriage data for the at least one candidate path may be implemented as: obtaining a historical shipment data set for the at least one candidate route; screening historical carrying data of a target historical transport object in the historical carrying data set; and determining the filtered historical carrying data as the historical carrying data of the at least one candidate path.

And if the object attribute and the transportation certificate time period of the historical transportation object are respectively matched with the object attribute and the transportation certificate time period of the object to be transported, the historical transportation object is considered as the target historical transportation object.

When the path attribute includes real-time capacity saturation, obtaining the path attribute of the at least one candidate path may be implemented as: acquiring real-time carrying data of the at least one candidate path; determining real-time carrying capacity saturation of each carrier node included in the at least one candidate path based on the historical carrier data set and the real-time carrier data of the at least one candidate path; determining real-time capacity saturation for each carrier node of the at least one candidate path as a path attribute for the at least one candidate path. Wherein the historical carrier data comprises peer historical carrier data and ring historical carrier data.

For example, the comparably historical shipper data (data of the same date in the past year) of one candidate route aging obtained is:

land transportation by the Chinese method I: 7 days;

and (2) land transportation by the middle law: 5 days;

the acquired ring ratio historical data (data of the last period, such as day, week and month) of one candidate path aging is as follows:

land transportation by the Chinese method I: 7.2 days;

and (2) land transportation by the middle law: 5.1 days;

according to the real-time carrying data, the real-time carrying capacity saturation of the obtained candidate path is as follows:

land transportation by the Chinese method I: 70.26 percent;

and (2) land transportation by the middle law: 70.51 percent.

And step S105, adjusting the initial carrying path in real time based on the historical carrying data and the real-time carrying force saturation to obtain a target carrying path.

And adjusting the initial carrying path determined in the step S102 according to the year-round historical carrying data, the ring-round historical carrying data and the real-time carrying capacity saturation of the carrier determined in the step S104 to obtain at least one adjusted carrying path, and selecting one adjusted carrying path with the minimum aging from the at least one adjusted carrying path as a target carrying path. In the above example, although the real-time carrying capacity saturation of the second intermediate-law land transportation is greater than that of the first intermediate-law land transportation, the year-round historical transportation data and the ring-round historical transportation data are combined, and the finally determined target transportation path is the second intermediate-law land transportation.

According to the method and the device, the initial carrying path is dynamically adjusted based on the acquired historical carrying data and the real-time carrying capacity saturation, so that the carrying path can be dynamically adjusted for routing selection according to the real-time carrying capacity of a carrier, and the routing timeliness of the object to be transported is shortened.

According to the transportation voucher routing method provided by the embodiment of the application, the transportation voucher routing equipment firstly acquires the attribute information of an object to be transported; determining an initial carrying path of the object to be transported according to the attribute information; determining at least one candidate path based on the attribute information, and acquiring historical carrying data and path attributes of the at least one candidate path, wherein the path attributes at least comprise real-time carrying capacity saturation; and adjusting the initial carrying path in real time based on the historical carrying data and the real-time carrying force saturation to obtain a target carrying path. Therefore, according to the historical carrying data and the real-time carrying capacity saturation, the intelligent adjustment of the carrying path is realized, the dynamic adjustment of the routing selection of the carrying path can be realized according to the real-time carrying capacity of a carrier, and the routing timeliness of the object to be transported is shortened.

In some embodiments, the step S101 "acquiring the attribute information of the object to be transported" in the embodiment shown in fig. 1 may be implemented as the following steps:

in step S1011, a routing request for the object to be transported is received.

Here, the routing request may be transmitted from a terminal corresponding to a merchant selling an item, or may be transmitted from a terminal of an individual user.

Step S1012, analyzing the routing request to obtain the first attribute information.

The first attribute information at least comprises a transportation certificate time period, a starting place, a destination, sender information and receiver information. The sender information is sender or merchant information and at least comprises a sender address and a sender identifier, the receiver information is receiver information and at least comprises a receiver address and a receiver identifier, and the sender identifier or the receiver identifier is a unique identifier capable of determining the sender or the receiver, such as a telephone. Here, the origin and the destination may be the same country or may be different countries.

And S1013, after the object to be transported is detected to be put in a warehouse, acquiring second attribute information.

The second attribute information at least comprises the weight, the declared price and the object attribute of the object to be transported, and the object attribute comprises at least one of the type, the charge amount and the shape of the object to be transported. Wherein the second attribute information is information related to the object to be transported, such as package weight, package declaration price and package attribute. The article type may be a commodity, a food item, a document, clothing, a digital product, or others. It should be noted that the package declaration price meets the requirement of mailing value, and the articles in the object to be transported are articles meeting the requirement of forbidden mailing.

Step 1014, determining the first attribute information and the second attribute information as the attribute information of the object to be transported.

In some embodiments, the "obtaining historical carrier data for the at least one candidate route" in step S104 in the embodiment shown in fig. 1 may be implemented as the following steps:

step S1041, obtaining a historical shipment data set of the at least one candidate route.

The storage space of the transportation voucher routing device stores attribute information of all historical transportation objects and information such as carrying routes and time periods for transportation, and historical carrying data of candidate routes can be acquired from the data stored in the storage space.

Step S1042, filtering the historical data of the target historical transportation object in the historical data set.

The target historical transport object is a historical transport object matched with the object to be transported. In actual implementation, historical carrying data of the target historical transport object is inquired in the historical carrying data set on the basis of the attribute information of the object to be transported. The matching means that the package attributes and the waybill time periods of the target historical transportation object and the object to be transported are the same. The waybill time periods are the same, and the waybill time period same ratio and the waybill time period ring ratio are the same.

And step S1043, determining the filtered historical data as the historical data of the at least one candidate route.

In some embodiments, when the path attribute includes real-time carrying capacity saturation, the step S104 of acquiring the path attribute of the at least one candidate path in the embodiment shown in fig. 1 may be implemented by:

step S1044, acquiring real-time carrying data of the at least one candidate route.

Here, the transit voucher routing device can acquire real-time carrier data from each carrier node included in the candidate path in real time.

Step S1045, determining real-time carrying capacity saturation of each carrier node included in the at least one candidate path based on the historical carrier data set and the real-time carrier data of the at least one candidate path.

In one implementation, determining the real-time capacity saturation of each carrier node included in each candidate path may be implemented as: acquiring historical highest carrying capacity of each carrying node included in each candidate path according to the historical carrying data set of each candidate path; acquiring the current used carrying capacity of each carrying node according to the real-time carrying data of each candidate path; and calculating the real-time carrying capacity saturation degree of each carrier node based on the current used carrying capacity and the historical highest carrying capacity.

For example, the historical highest capacity of a carrier node of a candidate path is 10 ten thousand transportation certificates (i.e., 10 ten thousand waybills are routed at the same time), the current used capacity of the carrier node is 6.1 ten thousand transportation certificates according to the real-time carrier data, and the real-time carrier capacity saturation of the carrier node is calculated to be 61% (6.1 ten thousand/10 ten thousand 100%) based on the ratio of the current used capacity to the historical highest capacity.

Step S1046, determining real-time carrying capacity saturation of each carrier node of the at least one candidate path as a path attribute of the at least one candidate path.

In some embodiments, the path attributes may include carrier node characteristics, inter-carrier node aging, and carrier node optimal path, among others, in addition to the real-time carrier force saturation.

In some embodiments, after the step S105, the transportation credential routing method may further include the steps of:

and step S106, sending the target carrying path to each carrying node included in the target carrying path.

After the target carrying path is determined, all nodes included in the target carrying path, namely carriers corresponding to all nodes are determined, and the target carrying path is sent to all carrying nodes, so that the carriers corresponding to all carrying nodes complete the routing of the objects to be transported.

And step S107, updating the real-time carrying capacity saturation of each carrier node included in the target carrier path.

The transportation voucher routing equipment updates the real-time carrying capacity of each carrying node in the database, so that the real-time carrying capacity saturation is updated, the subsequent waybill is dynamically routed, the real-time carrying capacity saturation is not required to be acquired from each carrying node for multiple times, and the efficiency of determining the target carrying path can be improved.

On the basis of the embodiment shown in fig. 1, the embodiment of the present application further provides a transportation certificate routing method. Fig. 2 is a schematic flow chart of another implementation of the transportation certificate routing method according to the embodiment of the present application, and as shown in fig. 2, the transportation certificate routing method includes the following steps:

step S201, obtaining attribute information of the object to be transported.

Step S202, according to the attribute information, determining an initial carrying path of the object to be transported.

When the method is realized, the transportation voucher routing equipment firstly acquires a predefined static routing rule from a storage space of the transportation voucher routing equipment; an initial carriage path is then determined based on the attribute information and the static routing rules. The initial delivery route determined here is a fixed delivery route set in advance, and is not related to the real-time carrying capacity of the carrier, the historical delivery data, and the like.

Step S203, determining at least one candidate path based on the attribute information.

Based on the attribute information and the requirements of each carrier package, a plurality of feasible carrier paths are determined as candidate paths.

Step S204, obtaining historical carrier data of the at least one candidate route.

In one implementation, step S204 may be implemented as the following steps:

step S2041, a historical shipment data set of the at least one candidate route is obtained.

Step S2042, the historical shipping data of the target historical shipping object is filtered from the historical shipping data set.

The target historical transport object is a historical transport object matched with the object to be transported. The matching means that the package attributes and the waybill time periods of the target historical transportation object and the object to be transported are the same.

Step S2043, determining the filtered historical data as the historical data of the at least one candidate route.

Step S205, obtaining a path attribute of the at least one candidate path.

In the embodiment of the application, the route attributes at least comprise real-time carrying capacity saturation, carrier node characteristics, inter-carrier node aging and carrier node optimal paths.

In one implementation, step S205 may be implemented as the following steps:

step S2051, real-time shipping data for the at least one candidate route is obtained.

Step S2052 is to determine, based on the historical carrier data set and the real-time carrier data of the at least one candidate path, real-time carrying capacity saturation of each carrier node included in the at least one candidate path.

During actual implementation, according to the historical carrying data set of each candidate path, the historical highest carrying capacity of each carrying node included in each candidate path can be obtained; then acquiring the current used carrying capacity of each carrying node according to the real-time carrying data of each candidate path; and finally, calculating the real-time carrying capacity saturation of each carrying node based on the current used carrying capacity and the historical highest carrying capacity.

Step S2053 is to perform feature extraction on each of the carrier nodes included in each of the candidate paths based on the historical carrier data of each of the candidate paths, so as to obtain the carrier node features.

The carrier node comprises characteristic extraction of first kilometer acquisition of international trunk lines, last kilometer distribution, departure from a port of a sender country, on-road of the international trunk lines, arrival at a transit country A, departure from the port of the transit country, arrival at a destination port, destination clearance and the like.

When the characteristics are extracted, data such as remark information corresponding to the dependency history waybill track and track nodes are extracted, and the characteristics of the line channels are extracted in batches by using the offline tasks.

Step S2054 is to acquire the aging between the carrier nodes based on the real-time carrier data of each candidate route.

And determining the inter-carrier node timeliness based on the warehousing timeliness, the transit timeliness, the last kilometer delivery timeliness and the destination receiving timeliness of the objects to be transported.

Step S2055 is to acquire, based on the real-time carrier data, a path with the minimum aging from among the plurality of paths corresponding to each carrier node as the optimal path for each carrier node.

And calculating the time efficiency of each path of each carrier node according to the regression of the track line, and determining the path with the minimum time efficiency as the optimal path of each carrier node so as to obtain the optimal path of each carrier node.

Here, trajectory aging regression routing: the parameters set are as follows: the same aging and the ring aging.

In some embodiments, the optimal path may also be determined using lines (hours, climate), emergency (politics, strikes), cultural differences (beliefs), etc. as input parameters.

Step S2056, determine the real-time carrying capacity saturation, the carrier node characteristics, the inter-carrier node aging, and the carrier node optimal path as the route attributes.

Step S206, the initial carrying path is adjusted in real time based on the historical carrying data and the path attribute of the at least one candidate path, and a target carrying path is obtained.

And adjusting the initial carrying path in real time based on the path attribute of the at least one candidate path, namely based on the historical carrying data of the at least one candidate path, the real-time carrying force saturation, the carrying node characteristics, the inter-carrying node aging and the carrying node optimal path to obtain a target carrying path.

In some embodiments, different weights can be set for different carrier nodes of different carrier paths according to any condition of year-on-year historical aging, religious belief, emergency and the like, so as to determine a more scientific target carrier path. The method can be practically realized as follows: determining the weight of each carrier node included in each candidate path based on the historical carrier data, the real-time carrier force saturation, the carrier node characteristics, the inter-carrier node aging and the optimal carrier node path; adjusting the initial carrying path according to the weight of each carrying node to obtain a plurality of adjusted carrying paths; and determining the adjusted carrying path with the minimum aging time in the plurality of adjusted carrying paths as a target carrying path.

The method and the device for automatically adjusting the route of the object to be transported achieve intelligent adjustment of the carrying route based on historical carrying data, real-time carrying capacity saturation, carrying node characteristics, inter-carrying node aging and the optimal path of the carrying nodes, enable the carrying route to achieve dynamic adjustment of route selection according to real-time carrying capacity of a carrier, and accordingly shorten the route aging of the object to be transported.

On the basis of the embodiment shown in fig. 1, the embodiment of the present application further provides a transportation certificate routing method. Fig. 3 is a schematic flow chart of another implementation of the transportation certificate routing method according to the embodiment of the present application, and as shown in fig. 3, the transportation certificate routing method includes the following steps:

step S301, receiving a route request aiming at an object to be transported.

Step S302, the routing request is analyzed to obtain first attribute information.

Here, the first attribute information includes at least an invoice time period, a start place, a destination, delivery side information, and receiving side information.

Step S303, after the object to be transported is detected to be put in storage, second attribute information is obtained.

Here, the second attribute information includes at least a weight, a declared price, and an object attribute of the object to be transported, the object attribute including at least one of an article type, an article charging amount, and an article form in the object to be transported.

Step S304, determining the first attribute information and the second attribute information as the attribute information of the object to be transported.

In step S305, a predefined routing model is obtained.

Step S306, inputting the attribute information into the routing model to obtain an initial carrying path of the object to be transported.

Step S307, determining at least one candidate path based on the attribute information.

Step S308, a historical carrier data set of the at least one candidate route is obtained.

In step S309, the historical transport data of the target historical transportation object is filtered from the historical transport data set.

And the target historical transport object is a historical transport object matched with the object to be transported.

And step S310, determining the filtered historical carrying data as the historical carrying data of the at least one candidate path.

Step S311, acquiring real-time delivery data of the at least one candidate route.

Step S312, obtaining the historical highest carrying capacity of each carrier node included in each candidate path according to the historical carrier data set of each candidate path.

And step 313, acquiring the current used carrying capacity of each carrying node according to the real-time carrying data of each candidate path.

And step S314, calculating the real-time carrying capacity saturation of each carrier node based on the current used carrying capacity and the historical highest carrying capacity.

Step S315, performing feature extraction on each of the carrier nodes included in each of the candidate paths based on the historical carrier data of each of the candidate paths to obtain the carrier node features.

And step S316, acquiring the aging time among the carrier nodes based on the real-time carrier data of each candidate path.

Here, the inter-carrier node timeliness are determined based on the warehousing timeliness, the transit timeliness, the last kilometer delivery timeliness and the destination receiving timeliness of the objects to be transported.

And step S317, acquiring a path with the minimum time efficiency from a plurality of paths corresponding to each carrier node as the optimal path of each carrier node based on the real-time carrier data.

Step S318, determining the weight of each carrier node included in each candidate path based on the historical carrier data, the real-time carrier force saturation, the carrier node characteristics, the inter-carrier node aging and the carrier node optimal path.

And step S319, adjusting the initial delivery path according to the weight of each delivery node to obtain a plurality of adjusted delivery paths.

In step S320, the adjusted route with the least aging time among the plurality of adjusted routes is determined as the target route.

Step S321, sending the target carrier path to each carrier node included in the target carrier path.

And step S322, updating the real-time carrying capacity saturation of each carrier node included in the target carrier path.

Next, an exemplary application of the embodiment of the present application in a practical application scenario will be described.

In the related technology, the routing technology of the cross-border export business is to preset routing rules in an order receiving system, to preset an order receiving routing link, to route the package to a corresponding international carrier according to the attributes of the package (such as the country of delivery, the country of receipt, the weight and volume of the package, whether the package is electrified or not, whether the package is liquid or dangerous goods, the declared price of the package and the like) and the specific preset routing rules (such as the country of delivery, the postal code of the recipient, the weight of the package and the like). The related art has the following defects: existing routes can no longer select carriers during the course of the shipment of goods; the granularity of the route is coarse, and the routing can not be dynamically adjusted according to the real-time carrying capacity of the carrier.

In order to solve the problem that a suitable carrier cannot be selected according to the real-time carrying capacity of the carrier when the international route is imported and exported across the border, an embodiment of the present application provides a transportation voucher routing method, and fig. 4 is a schematic diagram of an implementation flow of the international carrier intelligent regression routing method provided by the embodiment of the present application, and as shown in fig. 4, the method includes the following steps:

step S401, information flow ordering.

And step S402, performing basic routing according to the package attributes to obtain a pre-routing result.

In one implementation, step S4021 may be implemented to base the routing according to package attributes (destination, zip code, address, package weight, package declared price, commodity attributes (charged, liquid, cosmetics)).

Step S403, storing the pre-routing result.

And step S404, judging whether the package to be routed is put in storage.

When the parcel to be routed is put into a warehouse, the step S405 is executed; and when the parcel to be routed is not put in storage, continuing to execute the detection step S404.

In step S405, a track of the historical waybill carrier is acquired.

In one implementation, this may be implemented as step S4051, the same package attributes, the same time period (season, holidays, weekdays), the same type of transportation (air, land, sea).

When the route is calculated, reference needs to be made according to historical data of the past year, the most used routes are generally the most efficient routes, and meanwhile, the node characteristics (time, climate and culture) of the national regions where the routes pass on the routes are comprehensively calculated by combining the data of the previous month, the previous week, the previous day and the like. The weight of the same ratio and the ring ratio is higher, and the weight of the time-saving, the climate, the cultural difference and the like is lower.

For example: from china, packages are transported to france and travel to the sea (2 channels A, B), channel a is more efficient in one quarter, channel B is more efficient in two and three quarters, and channel a is more efficient in four quarters. The conditions under which such a result is calculated may depend on: comparing historical time, ring time, carrier capacity saturation, season climate, festival culture and other variables, wherein the variables need to extract the characteristics of each track node, such as circuit climate: rainy season, ice and snow weather, holidays, culture and the like of all nodes on the line.

Step S406, track node characteristics are obtained.

In one implementation, the step S4061 may be implemented to obtain feature extractions of the international trunk line collected in the first kilometer, the last kilometer delivery, departure from the port of the country of origin, the international trunk line being on the way, arrival at the transit country a, departure from the port of the transit country, arrival at the port of the destination, clearance at the destination, and the like.

In the (label) feature extraction scheme, waybill track nodes extract features offline, data dependent historical waybill tracks, remark information corresponding to the track nodes and the like are extracted, and the features of line channels are extracted in batches every day by using offline tasks.

Step S407, acquiring the aging between the nodes.

In one implementation, it may be implemented as step S4071 to acquire the timeliness (delivery country distributed document database operation timeliness, trunk relay timeliness, destination receiving timeliness, last kilometer delivery timeliness, and the like) between the respective nodes.

In the ring ratio real-time track aging scheme, a flink real-time data processing framework is used for node aging calculation, calculated data are stored in an ES, real-time track node aging is used for routing, and the node aging calculation can be obtained by querying a database through track aging of a background.

In step S408, the carrier force saturation is acquired.

In one implementation, this may be implemented as step S4081, and the current carrier capacity saturation level of the carrier is calculated according to the carrier capacity committed by the carrier, the historical highest capacity, and the current capacity used by the carrier.

In the carrier capacity saturation regression route, the set parameters are as follows: pre-set shipping capacity, used shipping capacity (number of packages shipped by the carrier), channel. The model used was: generalized Linear Model (Generalized Linear Regression Model).

And step S409, calculating the optimal path of each node according to real-time trajectory regression.

In one implementation, the method may be implemented as step S4091, where the optimal path of each country node and the optimal path on the route are calculated according to a trajectory route regression.

Here, trajectory aging regression routing: the parameters set are as follows: year-on-year, line (hours, climate), emergency (politics, strikes), cultural differences (beliefs), etc.

And step S410, adjusting the pre-routing result according to the track of the historical waybill carrier, the track node characteristics, the time efficiency among the nodes, the carrier force saturation and the optimal path of each node to obtain a target routing result.

The embodiment of the application mainly utilizes multivariate linear regression to calculate the real-time carrying saturation, the historical waybill track, the real-time track regression, the international node aging calculation and the extracted carrying node characteristics of the carrier, and provides support for the real-time international intelligent waybill route.

And S411, changing the order of the package to be routed based on the target route result to obtain target waybill information.

And step S412, pushing the target waybill information to a corresponding carrier.

The following are exemplified:

the first example is as follows:

special line for Chinese style small bags:

routing basic parameters:

at the beginning: china;

destination: france;

the wrapping weight is as follows:

minimum weight: 0.01 kg;

maximum weight: 20 kg;

transportable charge property: is that;

the wrapping value is as follows:

minimum value: 10 US;

maximum value: 100 US.

And (3) associating channels: carrying one land by China (aging for about 7 days in 1-3 months, about 5 days in 4-10 months, and about 10 days in 11-12 months) in each year:

first kilometer carriers: xx logistics distribution;

international segment carriers: international ZH of Jing Luo, international HE of Jing Luo, international ED of Jing Luo (temporary switching to: international BED of Jing Luo), international DF of Jing Luo;

end kilometer delivery carriers: prepared in the Jing Yun Fang.

And (3) associating channels: China-China land transportation of two (aging for 5 days in 1-3 months, 6 days in 4-10 months and 8 days in 11-12 months) each year:

first kilometer carriers: xx logistics distribution;

international segment carriers: international ZH for jingluo, international HB for jingluo and international BF for jingluo;

end kilometer delivery carriers: prepared in the Jing Yun Fang.

When the package information flow reaches the system, a preset route is firstly made, for example:

the first step is as follows: and the routing is a special line of the medium-sized small packet (routing to the special line of the medium-sized small packet) according to the basic attribute of the package.

The second step is that: according to the extended attribute:

1) year-by-year (current month information: month 3): and selecting the second Fairland according to the routing rule, wherein the carrier is aged (acquired by data in the same year as the previous year) as follows:

land transportation by the Chinese method I: 7 days;

and (2) land transportation by the middle law: 5 days;

2) ring ratio aging: according to the aging of the last period (day, week and month), the ring is compared with the aging selection, the ring is shipped on the second land (no emergency condition exists, and no abnormal line is received according to the line operation condition), and the carrier aging is as follows:

land transportation by the Chinese method I: 7.2 days;

and (2) land transportation by the middle law: 5.1 days;

3) capacity saturation: selecting a Chinese land transportation one (the difference is small, and the weight is also small) according to the carrying capacity of two carriers (obtained by the initial carrying capacity of the carriers and the prediction of historical carrying capacity calculated by the system):

land transportation by the Chinese method I: 70.26 percent;

and (2) land transportation by the middle law: 70.51 percent;

the third step: finally selecting the special line of the Chinese small packet by the route according to the results and the weight of the first step and the second step, wherein the selected channel is as follows: and carrying out land transportation by the middle law.

In conclusion, the special line for the Chinese small packet is finally selected, and the channel is selected: and carrying out land transportation by the middle law.

Example two:

the first step is as follows: the preset routing scheme refers to sample one.

The second step is that: and (4) sorting and routing:

the significance is as follows: on the basis of the preset route, before the warehouse produces packages (goods are taken from a shelf and packaged into small packages, and a bill is pasted on the small packages), sorting and routing before production are carried out, the preset route is corrected, the running states of all carriers on channels before delivery are ensured to be good, and if a certain emergency condition affects the timeliness of the route, optimization adjustment can be carried out according to resources on the current route. For example:

1) and (3) associating channels: china shipping of one (aging for about 20 days in 1-3 months, about 15 days in 4-10 months, and about 25 days in 11-12 months) every year.

First kilometer carriers: xx logistics distribution;

international segment carriers: international ZB of Jinghai, international BX of Jinghai (temporarily switched to: international BYX of Jinghai), international XF of Jinghai;

end kilometer delivery carriers: prepared in the Jing Yun Fang.

2) And (3) associating channels: China-China shipping two (aging for every year in 1-3 months is about 22 days, aging for 4-10 months is about 13 days, and aging for 11-12 months is about 25 days).

First kilometer carriers: xx logistics distribution;

international segment carriers: international ZB of Jinghai, international BY of Jinghai and international YF of Jinghai;

end kilometer delivery carriers: prepared in the Jing Yun Fang.

3) In sorting routes prior to warehouse production of packages:

carrying saturation (the difference ratio is relatively large, and the weight is relatively large):

the first sea transportation by the Chinese method: 91.35%, the efficiency will be reduced and the aging will be elongated;

and (2) China-method shipping II: 50.68 percent, the efficiency can be ensured, and the aging is not changed.

The third step: according to the results of the first step and the second step, the carrying saturation indexes of the two channels (under the premise that other parameters are the same), and the weight of the final routing selection Zhongkao special packet line, the selected channels are as follows: and (5) carrying out the second China sea, and simultaneously correcting the carrier saturation of the two channels.

When the channel selected finally is determined, the weight of each index and the index number can be added, and the maximum line is the optimal line.

On the premise of the same other parameters, the channel of the package is adjusted to the channel of China and China maritime transportation according to the carrier saturation indexes of the latest two channels, and the carrier saturation of the two channels is corrected at the same time.

According to the method and the device, the route lines are intelligently calculated according to historical data and carrier saturated transport capacity, the real-time cross-border carrier route is calculated through variables such as label extracted by regression waybill node historical aging, carrier transport capacity saturation and waybill track node characteristics, the purpose that a proper carrier is selected according to the real-time carrier capacity of the carrier is achieved, and the route aging of the package to be routed can be shortened.

Based on the foregoing embodiments, the embodiments of the present application provide a transportation credential routing apparatus, where the apparatus includes modules and units included in the modules, and the modules may be implemented by a processor in a computer device; of course, the implementation can also be realized through a specific logic circuit; in the implementation process, the processor may be a Central Processing Unit (CPU), a Microprocessor Unit (MPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), or the like.

An embodiment of the present application further provides a transportation certificate routing apparatus, and fig. 5 is a schematic structural diagram of the transportation certificate routing apparatus provided in the embodiment of the present application, and as shown in fig. 5, the transportation certificate routing apparatus 500 includes:

a first obtaining module 501, configured to obtain attribute information of an object to be transported;

a first determining module 502, configured to determine an initial carrying path of the object to be transported according to the attribute information;

a second determining module 503, configured to determine at least one candidate path based on the attribute information;

a second obtaining module 504, configured to obtain historical carriage data and path attributes of the at least one candidate path, where the path attributes include at least real-time capacity saturation;

and an adjusting module 505, configured to adjust the initial delivery path in real time based on the historical delivery data and the real-time delivery force saturation, so as to obtain a target delivery path.

In some embodiments, the first obtaining module 501 is further configured to:

receiving a routing request aiming at an object to be transported;

In some embodiments, the first determining module 502 is further configured to:

acquiring a predefined routing model;

and inputting the attribute information into the routing model to obtain an initial carrying path of the object to be transported.

In some embodiments, the second obtaining module 504 is further configured to:

obtaining a historical shipment data set for the at least one candidate route;

In some embodiments, the second obtaining module 504 is further configured to:

acquiring real-time carrying data of the at least one candidate path;

In some embodiments, the second obtaining module 504 is further configured to:

In some embodiments, the route attributes further include: carrying node characteristics, inter-carrying node aging and carrying node optimal paths;

the second obtaining module 504 is further configured to:

and acquiring a path with the minimum time efficiency from a plurality of paths corresponding to each carrying node as the optimal path of each carrying node based on the real-time carrying data.

Correspondingly, the adjusting module 505 is further configured to:

In some embodiments, the adjusting module 505 is further configured to:

In some embodiments, the transportation credential routing apparatus 500 further comprises:

the transmitting module is used for transmitting the target carrying path to each carrying node included in the target carrying path;

and the updating module is used for updating the real-time carrying capacity saturation of each carrier node included in the target carrier path.

Here, it should be noted that: the above description of the embodiments of the transportation certificate routing apparatus is similar to the above description of the method, and has the same beneficial effects as the embodiments of the method. For technical details not disclosed in the embodiments of the transportation certificate routing apparatus of the present application, those skilled in the art should understand with reference to the description of the embodiments of the method of the present application.

It should be noted that, in the embodiment of the present application, if the above evaluation method of the advertising copy is implemented in the form of a software functional module and is sold or used as a standalone product, it may also be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or portions thereof contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read Only Memory (ROM), a magnetic disk, or an optical disk. Thus, embodiments of the present application are not limited to any specific combination of hardware and software.

Accordingly, embodiments of the present application provide a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the steps in the transit credential routing method provided in the above embodiments.

Fig. 6 is a schematic diagram illustrating a constituent structure of the transportation certificate routing apparatus provided in the embodiment of the present application, and according to the exemplary structure of the transportation certificate routing apparatus 600 illustrated in fig. 6, other exemplary structures of the transportation certificate routing apparatus 600 may be foreseen, so that the structures described herein should not be considered as limiting, for example, some components described below may be omitted, or components not described below may be added to adapt to special requirements of some applications.

The transit credential routing device 600 shown in fig. 6 includes: a processor 601, at least one communication bus 602, a user interface 603, at least one external communication interface 604, and memory 605. Wherein the communication bus 602 is configured to enable connective communication between these components. The user interface 603 may comprise a display screen, and the external communication interface 604 may comprise a standard wired interface and a wireless interface, among others. Wherein the processor 601 is configured to execute the program of the transportation certificate routing method stored in the memory to implement the steps in the transportation certificate routing method provided by the above-mentioned embodiment.

The above description of the shipping voucher routing device and storage medium embodiments is similar to the description of the method embodiments above, with similar beneficial effects as the method embodiments. For technical details not disclosed in the embodiments of the transportation voucher routing device and the storage medium of the present application, reference is made to the description of the embodiments of the method of the present application for understanding.

It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application. The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, all functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.

Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.

Alternatively, the integrated units described above in the present application may be stored in a computer-readable storage medium if they are implemented in the form of software functional modules and sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present application may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a device to perform all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.

The above description is only for the embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A transit credential routing method, the method comprising:

acquiring attribute information of an object to be transported;

2. The method according to claim 1, wherein the obtaining of the attribute information of the object to be transported comprises:

receiving a routing request aiming at an object to be transported;

3. The method of claim 1, wherein determining the initial carrier path for the object to be transported according to the attribute information comprises:

acquiring a predefined routing model;

4. The method of claim 2, wherein said obtaining historical carrier data for said at least one candidate route comprises:

obtaining a historical shipment data set for the at least one candidate route;

5. The method of claim 4, wherein obtaining the path attribute of the at least one candidate path comprises:

acquiring real-time carrying data of the at least one candidate path;

6. The method of claim 5, wherein determining real-time capacity saturation for each carrier node included in the at least one candidate path based on the historical carrier data set and the real-time carrier data for the at least one candidate path comprises:

7. The method of claim 5, wherein the path attributes further comprise: carrying node characteristics, inter-carrying node aging and carrying node optimal paths;

the obtaining the path attribute of the at least one candidate path further includes:

8. The method of claim 7, wherein said adjusting said initial routing path in real-time based on said historical routing data, said real-time routing power saturation level, said routing node characteristics, said inter-routing node aging level, and said routing node optimal path to obtain a target routing path comprises:

9. The method of claim 2, further comprising:

10. A transit credential routing apparatus, the apparatus comprising:

a second obtaining module, configured to obtain historical carriage data and path attributes of the at least one candidate path, where the path attributes at least include real-time capacity saturation;

11. A transit credential routing device, comprising:

a processor; and

a memory for storing a computer program operable on the processor;

wherein the computer program realizes the steps of the method of any one of claims 1 to 9 when executed by a processor.

12. A computer-readable storage medium having stored thereon computer-executable instructions configured to perform the steps of the method of any one of claims 1 to 9.