CN116862334A

CN116862334A - Product transportation management method and system

Info

Publication number: CN116862334A
Application number: CN202210305423.9A
Authority: CN
Inventors: 包斯琴; 郝文静; 李槊毫; 王芳
Original assignee: BMW Brilliance Automotive Ltd
Current assignee: BMW Brilliance Automotive Ltd
Priority date: 2022-03-25
Filing date: 2022-03-25
Publication date: 2023-10-10

Abstract

The application relates to a product transportation management method and system. There is provided a computer-implemented method of product transportation management, comprising: generating a plurality of shipping instructions based on a predetermined shipping route for a product, each shipping instruction associated with a respective shipping point and/or a respective shipping road segment in the shipping route for the product; and in response to monitoring a shipping point of the shipping route for the product, determining whether to trigger an automatic transmission of associated shipping instructions to a shipping provider and/or a subsequent warehouse provider of the subsequent shipping section based at least on the type of the shipping point and the attribute information of the product. Embodiments of the present disclosure provide for flexible and efficient management of transportation notifications.

Description

Product transportation management method and system

Technical Field

The present disclosure relates to product transportation management, and in particular to management of transportation instructions during product transportation.

Background

Transportation management of products involves aspects such as determination of the route of transportation of the product, information interaction with warehouse suppliers, transportation suppliers (i.e., carriers), etc. during transportation of the product, etc.

For products such as vehicles, there is a relatively fixed route of transportation when transported from the factory to the dealer. However, existing systems lack flexibility and are inefficient when the corresponding shipping routes for each product are to be generated for a large number of products, as the individual product conditions vary.

In the transportation of vehicles, which involves a plurality of transportation points and transportation routes between the transportation points, it is necessary TO send transportation instructions (TO: transportation order) TO warehouse suppliers, transportation suppliers, etc. so that each supplier knows which vehicles need TO be transported and where TO transport them from, and also informs the warehouse suppliers which vehicles have shipping conditions, and the transportation suppliers can pick up vehicles TO make relevant preparations such as preparation for the vehicles TO be shipped in advance. Thus, the management of complex transport instructions is involved in the transport of vehicles.

In the prior art, in each transportation node, which vehicles have shipment conditions for shipment and sending vehicle transportation instructions depend on manual screening statistics by using a spreadsheet, and then send the results to a corresponding transportation provider or warehouse provider in the form of mail. However, in this way, it is necessary to schedule a certain time for the downlink processing every day. And because the vehicle state is comparatively complicated, various conditions change probably take place in the transportation, therefore need to whether to shipment condition that checks more, manual calculation easily produces human error. Meanwhile, manual calculation is time-consuming, and has a certain influence on timeliness of vehicle delivery. In addition, all the sending instructions are sent by virtue of mails, so that information loss is easy to occur, and the mails are not timely checked and received, thereby influencing the timeliness of the sending.

Disclosure of Invention

According to one aspect of the present disclosure, there is provided a computer-implemented product transportation management method, including: generating a plurality of shipping instructions based on a predetermined shipping route for a product, each shipping instruction associated with a respective shipping point and/or a respective shipping road segment in the shipping route for the product; and in response to monitoring a shipping point of the shipping route for the product, determining whether to trigger an automatic transmission of associated shipping instructions to a shipping provider and/or a subsequent warehouse provider of the subsequent shipping section based at least on the type of the shipping point and the attribute information of the product.

According to some embodiments of the present disclosure, the product transportation management method further comprises: in response to determining to trigger automatic transmission of the transport instructions to the transport provider and/or the subsequent warehouse provider of the subsequent transportation path, performing automatic transmission of the transport instructions; and prompting the user to manually trigger the transmission of the transportation instructions in response to determining not to trigger the automatic transmission of the transportation instructions by the transportation provider and/or the subsequent warehouse provider of the subsequent transportation path.

According to some embodiments of the present disclosure, the product transportation management method further comprises: and when the product is delivered out of the warehouse, executing automatic transmission of the transportation instruction.

According to some embodiments of the present disclosure, the type of shipping point includes at least one of: factory, factory warehouse, transfer warehouse and final warehouse; and the attribute information of the product includes at least one of: whether to exit the vehicle; whether a large-displacement vehicle is used; whether to lock the vehicle; whether to pay or not.

According to some embodiments of the present disclosure, the product transportation management method further comprises: receiving a first query request from a user, the first query request including a unique identifier of a product; in response to the first query request, a shipping instruction monitoring entry corresponding to the product is presented, the entry including at least a frame number and a time of transmission of the most recently transmitted shipping instruction.

According to some embodiments of the present disclosure, the product transportation management method further comprises: and presenting a transport instruction sending history record corresponding to the product. The shipping instruction issue history includes at least one of: the product has been transported through the transport points and transport road sections, the actual time of warehousing and actual time of delivery at each transport point, the time of delivery of the transport instructions at each transport point that has been transported through, and the planned time of warehousing and planned time of delivery at each transport point.

According to some embodiments of the present disclosure, the product transportation management method further comprises: receiving an updated shipping route for the product; determining an updated shipping point and an updated shipping road segment based on a comparison between the updated shipping route of the product and the predetermined shipping route of the product; and generating corresponding transportation instructions for the updated transportation points and transportation segments.

According to some embodiments of the present disclosure, the product transportation management method further comprises: receiving an updated delivery route for the product when it is monitored that the product is delivered to and has not been delivered from a delivery point of the delivery route, wherein the updated delivery route results in a change in a subsequent delivery point relative to a previous subsequent delivery point; determining whether a transport order has been sent to a transport provider of a previous subsequent transport section and/or a warehouse provider of a previous subsequent transport point; in response to determining that the transport instructions have been sent to the transport provider of the previous subsequent transport section and/or the warehouse provider of the previous subsequent transport point, a cancel instruction for the previously sent transport instructions is automatically sent to the transport provider of the transport section of the previous subsequent transport point and/or the warehouse provider of the previous subsequent transport point.

According to some embodiments of the present disclosure, each transport instruction includes at least: a unique identifier of the product; a departure location; and the arrival location.

According to one aspect of the present disclosure, there is provided a computer-implemented product transportation management method, including: receiving attribute information of a product, the attribute information comprising attribute values of one or more attributes of the product; and traversing at least one rule set of a plurality of rule sets in a predetermined order based on the attribute information of the product to determine a transportation route of the product, wherein each rule set is associated with an attribute set containing attributes of at least one product and includes route determination logic corresponding to the attribute set.

In some embodiments, the route determination logic corresponding to the set of attributes specifies: each set of attribute values of the set of attribute values, and a particular route corresponding to the set of attribute values.

In some embodiments, the route determination logic corresponding to the set of attributes further specifies: a plurality of specific routes corresponding to the set of attribute values, and a priority corresponding to each specific route.

In some embodiments, traversing at least one rule set of the plurality of sets of rules in a predetermined order based on the attribute information of the product to determine a shipping route for the product includes, for each rule set traversed: determining whether all of the one or more attributes contained in the received attribute information of the product exist in the set of attributes of the rule set; if not, skipping the rule set and proceeding to the next rule set; and if so, determining whether the received set of attribute values of the set of attributes of the product matches any set of attribute values of the set of rules, and if so, obtaining a particular route corresponding to the matched set of attribute values as at least a portion of the determined route for transportation of the product, and if not, jumping to the next set of rules.

In some embodiments, the method further comprises: determining whether the determined transportation route of the product is complete; if not, continuing to the next rule set; and if so, outputting the determined transportation route of the product.

In some embodiments, the method further comprises: receiving user input for changing availability of the shipping point; the rule set associated with the shipping point for which availability has changed is changed.

In some embodiments, the method further comprises: extracting data for changing availability of the transportation point from the network information; changing availability of the shipping points based on the data; and altering a rule set associated with the shipping point for which availability has changed.

In some embodiments, altering the rule set related to the transportation point with the changed availability includes at least one of: disabling a particular route involving a transport point that becomes unavailable from available; deleting a specific route involving a transport point that becomes unavailable from available; downregulating priorities of specific routes involving transport points that become unavailable from available; and replacing the specific route involving the transport point that becomes unavailable from available with an alternative route that bypasses the transport point that is unavailable; restoring a particular route involving a transport point that became available from unavailable; adding a specific route involving a transport point that becomes available from unavailable; and up-regulating the priority of a particular route involving a transit point that becomes available from unavailable.

In some embodiments, the method further comprises: user input is received for editing a particular route associated with the availability-changing shipping point in a rule set associated with the availability-changing shipping point.

In some embodiments, the method further comprises: updating the previously determined route of the product for a previously determined route of the product comprising at least one of the points of transportation where the availability has changed to obtain an updated route of the product.

According to one aspect of the present disclosure, there is provided a computer system comprising: one or more processors, and a memory coupled with the one or more processors, the memory storing computer-readable program instructions that, when executed by the one or more processors, cause the one or more processors to perform the method as described above.

According to one aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon computer readable program instructions which, when executed by a processor, cause the processor to perform the method as described above.

According to one aspect of the present disclosure, there is provided a computer program product comprising computer readable program instructions which, when executed by a processor, cause the processor to perform the method as described above.

Drawings

Fig. 1 is a flowchart illustrating a transportation management method according to an embodiment of the present disclosure.

Fig. 2A illustrates a plurality of exemplary rule sets according to an embodiment of the present disclosure.

Fig. 2B illustrates route determination logic corresponding to the attribute set of the first rule set.

Fig. 2C illustrates route determination logic corresponding to a second rule set.

Fig. 3 is a flowchart illustrating a method of product transportation management according to an embodiment of the present disclosure.

Fig. 4 is a flowchart illustrating a method of product transportation management according to an embodiment of the present disclosure.

Fig. 5A and 5B illustrate exemplary interface diagrams providing user input for changing availability of a shipping point in accordance with an embodiment of the present disclosure.

Fig. 6 is a flowchart illustrating a method of product transportation management according to an embodiment of the present disclosure.

Fig. 7 is a schematic flow chart diagram of a method of product shipment management in accordance with an embodiment of the present disclosure.

FIG. 8A illustrates an exemplary data structure for maintaining a plurality of shipping instructions generated based on a predetermined shipping route for a product in accordance with an embodiment of the present disclosure.

Fig. 8B illustrates exemplary decision logic for determining whether to trigger automatic transmission of a shipping instruction based at least on the type of shipping point and attribute information of a product, according to some embodiments of the present disclosure.

Fig. 9 shows a flowchart of a product transportation management method according to an embodiment of the present disclosure.

FIG. 10A illustrates an exemplary query result according to an embodiment of the present disclosure.

Fig. 10B illustrates an exemplary shipping instruction issue history according to an embodiment of the present disclosure.

Fig. 11 shows a flow chart of a transportation management method according to an embodiment of the present disclosure.

Fig. 12 shows a flow chart of a transportation management method according to an embodiment of the present disclosure.

Fig. 13 is a schematic diagram illustrating a general hardware environment in which devices according to embodiments of the present disclosure may be implemented.

Detailed Description

The following description is presented to enable one of ordinary skill in the art to make and use the embodiments and is provided in the context of a particular application and its requirements. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments and applications without departing from the spirit or scope of the embodiments. Thus, the embodiments are not limited to the embodiments shown, but are to be accorded the widest scope consistent with the principles and features disclosed herein.

The disclosed embodiments provide improved transportation management methods and systems for determining and updating transportation routes for products that provide flexible rule configurations, enable efficient and accurate transportation route determination and updating, and also dynamically adapt to dynamic changes in transportation conditions.

For convenience of explanation, a product will be described below as an example of a vehicle. It will be appreciated that the method of the present disclosure is applicable to any product for which a route of transportation needs to be determined.

Fig. 1 is a flowchart illustrating a transportation management method 100 according to an embodiment of the present disclosure.

As shown in fig. 1, the method 100 may include a step 101 of receiving attribute information of a product, the attribute information including attribute values of one or more attributes of the product.

In some embodiments, the attribute information for the product may include attribute values for one or more attributes related to a shipping route for the product.

For example, taking a product as an example of a vehicle, the attribute information of the product may include at least one of: a frame number, a production factory, a dealer, one or more uses (e.g., test use, exhibition use, etc.), a market, an entry port, an exit port, a sales area, a financial status, a priority, a model, a necessary transportation point (e.g., a total warehouse where vehicles must arrive from a factory shipment, a warehouse where dealer's vehicles must park upon receipt, etc.), a city where a dealer is located, etc. Attribute values for some of the attributes of the vehicle may be represented by identifiers.

The method 100 may further include a step 102 of traversing at least one rule set of a plurality of rule sets in a predetermined order based on the attribute information of the product to determine a transportation route for the product, wherein each rule set is associated with an attribute set including attributes of at least one product and includes route determination logic corresponding to the attribute set.

FIG. 2A illustrates a plurality of exemplary rule sets 201-222 according to embodiments of the present disclosure.

As shown in fig. 2A, the plurality of rule sets 201-222 are arranged in a predetermined order. At least some of the plurality of rule sets are traversed in the predetermined order in accordance with attribute information of the vehicle when determining a transportation route of the product, i.e., the vehicle.

The attribute set represents an attribute screening parameter. In general, the property sets of the following rule set are more common than the property sets of the preceding rule set.

The property set of the first rule set 201 is composed of a frame number. Through the rule set, the frame numbers of some special vehicles and the specific routes corresponding to the frame numbers can be pre-configured. The specific route may be a sub-route of the complete transportation route or may be the complete transportation route itself.

Fig. 2B illustrates route determination logic corresponding to the attribute set of the first rule set 201. The leftmost box of fig. 2B may represent the interface element used to select each entry. The dotted box with the plus sign in fig. 2B may represent, for example, interface elements for adding sub-segments. Although not shown, it will be understood by those skilled in the art that interface elements for editing or deleting sub-sections may be added in the box representing each sub-section.

As shown in fig. 2B, the route determination logic may include a plurality of entries, each of which may include a chassis number 1, a priority code, and a corresponding route.

For frame number 1, two different routes with priority 1 and priority 2 are set. Normally, for a vehicle with frame number 1, a priority 1 route may be used. When a route with priority code 1 is disabled or deleted, a route with priority code 2 is automatically used. Those skilled in the art will appreciate that any number of routes may be provided for the same frame number, with a corresponding priority code being provided for each route.

The priority code may be determined comprehensively, for example, based on a variety of factors such as time of transportation, cost, efficiency, etc. The priority code of each route may be adjusted according to the change of the actual transportation condition. For example, the priority code of one route may be the most preferred during a certain period of time, and the priority code of this route may become suboptimal due to changes in transportation conditions during another period of time.

The route set for the frame number may be a complete route, for example, the route set for the frame number 2 is a complete route from the factory E to the 4S store I, which includes sub-segments of the segment type "middle" and also includes sub-segments of the segment type "final".

The route set for the frame number may also be one or more sub-sections of a complete route, for example a route set for frame number 1, the sections of which are all "intermediate" in type, indicating that these sections have not yet constituted a complete transportation route.

The first rule set 201 allows for the convenience of setting a particular route of a vehicle for a particular scene by employing a unique identifier, i.e., a frame number, for that particular scene. And the first rule set is placed in a forward position such that when determining a transportation route for such a vehicle, the set of attributes of the rule set can be quickly matched to thereby quickly determine the transportation route for the vehicle.

The set of attributes of the second rule set 202 may consist of the first vehicle use and the dealer. The first vehicle use for example indicates that the vehicle is a test vehicle.

Fig. 2C illustrates route determination logic corresponding to the second rule set 202. As shown in fig. 2C, the route determination logic corresponding to the set of attributes may include a plurality of entries, each of which may include, for example, a particular dealer number, test purpose, priority code, and corresponding particular route. The first vehicle use and the particular dealer number may constitute a set of attribute values.

The set of attributes of third rule set 203 may consist of a first vehicle use.

It is understood that the third rule set is wider or looser than the second rule set. This makes it possible to more quickly determine a suitable transportation route for a vehicle that meets both a dealer and a test purpose.

Fig. 2A also shows the remaining rule sets. Similarly, the route determination logic corresponding to each rule set may include a plurality of entries, each entry including a different set of attribute values for a respective attribute in the attribute set, and a particular route corresponding to the respective set of attribute values.

For example, the set of attributes of fourth rule set 204 is comprised of a second vehicle use. The second vehicle use is, for example, a showout.

The set of attributes of the fifth rule set 205 may consist of vehicle priorities. The vehicle priority may be associated with a value of the vehicle or a level of the purchaser, for example. The entries included in the route determination logic may include vehicle priorities and corresponding particular routes.

The set of attributes of the sixth rule set 206 consists of port of entry information, market, sales area, and financial status of the vehicle. The entries included in the route determination logic may include various attribute values for the preset port of entry information, market, sales area, and financial status, as well as different specific routes corresponding to the various sets of attribute values.

The set of attributes of the seventh rule set 207 is composed of the model number and financial status of the vehicle. The entries included in the route determination logic may include attribute values of model and financial status of the vehicle that are set in advance, as well as different specific routes corresponding to each set of attribute values.

The set of attributes of eighth rule set 208 may be comprised of a model number of the vehicle. The entries included in the route determination logic may include a model number of the vehicle that is set in advance, and different specific routes corresponding to the different model numbers. Those skilled in the art will appreciate that the entries included in the route determination logic may be more refined to different specific routes for different factories and different dealers for the same vehicle model.

The set of attributes of the ninth rule set 209 may be comprised of the financial state of the vehicle.

The set of attributes of tenth rule set 210 may be comprised of a dealer of the vehicle.

It can be seen that rule sets 208-210 are wider than rule set 207, i.e., the attribute screening conditions are less stringent.

The attribute set of the eleventh rule set 211 is composed of the outlet port of the vehicle and the dealer;

the property set of the twelfth rule set 212 is composed of the model of the vehicle, the factory, and the necessary transportation points;

the set of attributes of thirteenth rule set 213 is made up of factory and must-travel transportation points;

The attribute set of fourteenth rule set 214 is comprised of the city in which the dealer is located;

the fifteenth set of rules 215 of the set of attributes consists of the port of entry, market and sales area of the vehicle;

the attribute set of the sixteenth rule set 216 is comprised of the egress port, market, and sales area of the vehicle;

the attribute set of seventeenth rule set 217 is made up of the port of entry of the vehicle and the market;

the set of attributes of the eighteenth rule set 218 consists of the port of egress of the vehicle and the market;

the set of attributes of the nineteenth rule set 219 consists of port of entry;

the set of attributes of the twentieth rule set 220 is comprised of ports of egress;

the set of attributes of the twenty-first rule set 221 is comprised of market and sales areas;

the set of attributes of the twenty-second rule set 222 is comprised of factories.

The factory that the attribute set of rule set 222 contains is the attribute that the attribute information of almost every vehicle will contain, and can be considered as the broadest screening condition. The attribute set is mainly used for screening out the vehicles meeting the conditions, and the route logic rules can set various specific routes aiming at various scenes of the vehicles meeting the conditions. These particular routes may be one or more sub-segments from one shipping point to another, or may be complete routes from the factory to the dealer.

Those skilled in the art will appreciate that the above-described rule sets and their ordering are merely examples, and that those skilled in the art may employ fewer or more rule sets as desired.

Although not shown, it is understood that the individual sub-sections of the route under each entry may be deleted or edited separately. Sub-segments may be added.

Those skilled in the art will appreciate that for different products, the set of attributes and route determination logic of the rule set may be set based on different attributes of the product.

Fig. 3 is a flowchart illustrating a product transportation management method 300 according to an embodiment of the present disclosure.

As shown in fig. 3, the method 300 may include a step 301 in which attribute information of a product is received. The attribute information includes attribute values for one or more attributes of the product.

Next, a route of transportation for the vehicle may be determined based on the attribute information of the product, e.g., the vehicle, by traversing at least one of the plurality of rule sets, e.g., at least some of rule sets 200-222, in a predetermined order. As described above, each rule set is associated with an attribute set containing at least one attribute of the vehicle and includes route determination logic corresponding to the attribute set.

Specifically, method 300 may include step 303, where, for a rule set to traverse, it is determined whether all of the one or more attributes contained in the attribute information of the received product are present in the set of attributes of the rule set.

If the determination at step 303 is negative, the method 300 proceeds to step 315, where the rule set is skipped and proceeds to the next rule set.

If yes at step 303, the method 300 proceeds to step 305, where it is determined whether the received set of attribute values for the set of attributes of the product matches any set of attribute values for the set of attributes of the rule set.

If the determination at step 305 is yes, the method 300 proceeds to step 307 where a particular route corresponding to the matched set of attribute values is obtained as at least a portion of the determined transportation route for the product.

If the determination at step 305 is negative, the method 300 proceeds to step 315 to jump to the next rule set.

The method 300 further comprises a step 311 in which it is determined whether the determined transportation route of the product is complete. For example, by determining whether the last sub-segment is the final sub-segment.

If the determination at step 311 is negative, proceed to the next rule set.

If the determination at step 311 is yes, the determined transportation route for the product is output.

In other words, by traversing multiple rule sets based on attributes of a product, a transportation route can be quickly determined for a product for a particular scenario. For common products, suitable transportation routes can also be automatically generated.

In some embodiments, if a match is found only at the last rule set, but the result of the match does not constitute a complete transportation route, a re-traversal from the first rule set may be performed again. Since the last rule set may for example provide a part of the sub-section, it is possible to make up the complete transportation route by traversing the splice again.

In some embodiments, it may be that a complete route cannot be found by traversing all rule sets, then the determined portion may be output and the staff prompted to supplement the incomplete route.

The user may make further adjustments and edits to the determined shipping route for the product, such as deleting/adding sub-segments, changing the configuration of sub-segments, and so forth.

Embodiments of the present disclosure allow flexibility in configuring rule sets for different products for various special situations, and in automatically calculating a transportation route for a product, utilizing attribute screening may efficiently determine suitable sub-segments/routes. Embodiments of the present disclosure may also automatically calculate a transportation route for a common product.

In some embodiments, the analysis may be performed with respect to a calculated route of transportation for a large number of products. For example, if it is known by analysis that the transportation routes of some products have the same sub-section, the products having the same sub-section may be bundled for transportation, for example, during transportation in the same sub-section, the products may be arranged to the same carrier, to the same warehouse, etc. This can make full use of transportation resources, improves overall transportation efficiency.

In actual transportation, it is desirable to be able to dynamically adapt to changes in transportation conditions.

In some cases, a transport point may be unavailable for some particular reason, a transport point in a region, and then become available again. For example, due to an emergency situation, all transport points of a certain city may be rendered unusable and become available again after the emergency situation is alleviated. It is expected that the rule set will vary adaptively.

In some cases, it may also be possible that a shipping point is not available because of insufficient shipping capacity or insufficient warehouse processing capacity at that point.

In these cases, it is desirable to be able to dynamically update the rule set, and further update the shipping route of the product, in response to dynamic changes in shipping conditions.

Fig. 4 is a flowchart illustrating a product transportation management method 400 according to an embodiment of the present disclosure. The method 400 may be implemented on one or more computing devices.

As shown in fig. 4, the method 400 includes a step 401 in which user input is received for changing the availability of a shipping point.

Fig. 5A and 5B illustrate exemplary interface diagrams providing user input for changing availability of a shipping point in accordance with an embodiment of the present disclosure. As shown in FIG. 5A, the user may enter the city "Shanghai" in the search bar, the user interface will present all of shipping points 1-4 in Shanghai, the user may select, for example, shipping point 1 and shipping point 2, and select the "disable" button. As shown in fig. 5B, the user may restore availability of shipping points 1 and 2 by de-selecting shipping points 1 and 2 and the "disable" button.

One skilled in the art may contemplate various ways of receiving user input for changing the availability of a shipping point. For example, the user may set up directly for a city or country, i.e. select a certain city or country such that all transportation points of that city or country are disabled or restored. For example, the user may directly enter an identifier of a particular shipping point in the search bar, thereby performing disable and restore operations for that particular shipping point. The user may also perform operations such as adding shipping points, deleting shipping points, and the like. Each shipping point may have associated identification information, associated supplier information, and the like.

In some embodiments, the user input to change the availability of a shipping point may be a notification from a remote device, e.g., a carrier associated with a shipping point may not have sufficient capacity to handle shipping services for a period of time to be estimated next, and thus, a notification may be sent indicating that a shipping point is not available. In response to receiving such notification, the notification content may be processed to identify a change in availability of the shipping point.

The method 400 may also include a step 402 in which a rule set relating to the shipping point for which the availability has changed is altered.

Altering the rule set associated with the shipping point whose availability has changed may be performed automatically in response to receiving a user input to change the availability of the shipping point. It is possible to automatically identify which rule sets relate to shipping points for which availability has changed based on user input and to automatically make changes to those rule sets.

Altering the rule set relating to the point of transportation of which the availability is changing may also include receiving user input for editing a particular route relating to the point of transportation of which the availability is changing in the rule set relating to the point of transportation of which the availability is changing. For example, a rule set, or more specifically, a specific entry associated with the rule set, may be listed that relates to a shipping point for which availability has changed so that the user may edit the entry therein.

For example, for a transport point that becomes unavailable from available, a particular route that involves a transport point that becomes unavailable from available may be disabled, a particular route that involves a transport point that becomes unavailable from available may be deleted, or the priority of a particular route that involves a transport point that becomes unavailable from available may be adjusted down, or an alternative route that bypasses an unavailable transport point may be replaced with a particular route that involves a transport point that becomes unavailable from available.

For transport points that are not available to become available, a specific route involving transport points that are not available to become available may be restored (in the case of using an alternative route, the alternative route may be disabled and the previous route restored), a specific route involving transport points that are not available to become available may be added, or the priority of a specific route involving transport points that are not available to become available may be adjusted up.

Those skilled in the art, having the benefit of the teachings of the present application, will recognize various situations and implementations for altering rule sets associated with shipping points where availability changes.

The method 400 may further comprise a step 404 of updating the previously determined transportation route of the product for a previously determined transportation route of the product comprising at least one of the transportation points for which the availability has changed to obtain an updated transportation route of the product.

Based on the identification of the points of transportation where availability has changed, it may be determined which previously determined routes of transportation for the product contain points of transportation where availability has changed. The previously determined routes for products may be those that have not yet been shipped or that have not yet been sent to the destination.

In some embodiments, it may be caused to re-traverse all rule sets (e.g., all rule sets in fig. 2A) containing the modified rule set for the affected product to determine the updated haul route. Such a process may be performed, for example, on a product that has not yet been shipped.

In other embodiments, only the modified rule set or rule sets may be traversed for only the affected sub-road segments. Such a process may be performed, for example, for products that have been shipped but not yet shipped to the destination. For example, assuming that a rule set involves only one sub-section where transport point a passes from unavailable transport point B to transport point C before modification, and that the modified rule set uses an alternate sub-section where transport point a passes from available transport point E to transport point C, then assuming that a previously determined one transport route contains such sub-section where transport point a passes from unavailable transport point B to transport point C, the previous sub-section may be changed to an alternate sub-section by traversing only the rule set, thereby obtaining an updated transport route.

Fig. 6 is a flowchart illustrating a method 600 of product shipment management in accordance with an embodiment of the present disclosure.

As shown in fig. 6, method 600 may include step 610, where data for changing availability of a shipping point is extracted from network information.

For example, taking an emergency situation as an example, a government emergency release network station generally updates daily emergency distribution situations periodically or aperiodically, including in which cities or areas the emergency situation occurs and the level of the emergency situation that occurs. In the embodiment of the application, the website can be monitored, and the published emergency distribution data can be timely extracted. Data for cities or regions with emergency levels exceeding predetermined criteria may be extracted from the emergency distribution data and used to determine which points of transportation will be unavailable.

For example, assuming that the emergency distribution data shows that the a city exceeds a predetermined criteria, it may be determined that all transportation points of the a city should be changed from available to unavailable. In other cases, the emergency distribution data may indicate that the emergency level of the B city falls, and then it may be determined that all transport points of the B city should be changed from unavailable to available.

The method 600 may further comprise a step 602, in which the availability of the transportation point is changed based on the data.

As above, the availability of these shipping points may be automatically changed from available to unavailable or from unavailable to available as the availability of which shipping points should be changed based on the network information.

The method 600 may further include step 603, where a rule set relating to the shipping point where the availability has changed is altered.

This step is similar to step 402 in method 400 and will not be described in detail herein.

The method 600 may further comprise step 604 of updating the previously determined shipping route for the product for the previously determined shipping route for the product that includes at least one of the shipping points for which the availability has changed to obtain an updated shipping route for the product.

This step is similar to step 404 of method 400 and is not described in detail herein.

The embodiment of the disclosure can change the availability of the transportation points according to the change of the transportation conditions, and automatically update the rule set of the transportation points with the changed availability, so that the calculation of the transportation route can adapt to the dynamic change of the transportation conditions. The accuracy and the efficiency of transportation route calculation are improved, and unexpected transportation smoothness is avoided. The embodiment of the disclosure can also update the transportation route of the product with changed availability, so that the transportation route can be automatically adapted along with the change of the transportation condition, and the smooth transportation is ensured.

Based on the transport route automatically generated/updated as described above, more flexible and efficient management of transport instructions can be achieved. The following mainly relates to enabling management of generation, transmission, etc. of transportation instructions based on predetermined/updated transportation routes.

Fig. 7 is a schematic flow chart diagram of a method 700 of product shipment management in accordance with an embodiment of the present disclosure.

As shown in fig. 7, method 700 may include step 701 of generating a plurality of shipping instructions based on a predetermined shipping route for a product, each shipping instruction associated with a respective shipping point and/or a respective shipping road segment in the shipping route for the product.

A data structure associated with the generated plurality of transport instructions may be maintained. For example, fig. 8A illustrates an exemplary data structure for maintaining a plurality of shipping instructions generated based on a predetermined shipping route for a product in accordance with an embodiment of the present disclosure.

As shown in fig. 8A, the data structure maintains one entry for each transport instruction, for example.

Assume that a predetermined transportation route for a vehicle includes 6 transportation points, as shown from factory a to dealer F, and 5 transportation segments therebetween. The individual transport segments from plant a to port E are referred to as intermediate segments, and the transport segments from port E to dealer F are referred to as end segments. Accordingly, 5 transport instructions may be generated, each of which may be associated with a respective transport point and/or transport road segment. For example, the transport order number 0001 is associated with the transport points factory a and/or factory warehouse B and the transport path between factory a and factory warehouse B.

The instruction type may indicate whether the instruction is for an intermediate road segment or an ending road segment.

The status of each transport instruction may be used to indicate the status of the instruction, such as whether the instruction was sent, whether it was cancelled, whether it was modified. Those skilled in the art may devise more or fewer states for them.

Each transport instruction is associated with a respective transport point and/or a respective transport section in the transport route for the product. For example, for a transport instruction to be sent at a current transport point, the corresponding transport point may include one or more of the current transport point, the next transport point, and the corresponding transport section may include one or more of a transport section from the current transport point to the next transport point, and a transport section from the next transport point to the next transport point.

Fig. 8A illustrates only exemplary entries corresponding to the transport instructions, and those skilled in the art will appreciate that each entry of the transport instructions may include more or less information, e.g., each entry may include contact information for a departure location, contact information for an arrival location, a specific address for a departure location, a specific address for an arrival location.

In some embodiments, the entry of each transport instruction may also contain one or more attribute information of the associated vehicle, such as those of the products described in connection with fig. 1 and 2A.

The shipping instructions themselves may contain a unique identifier of the product (e.g., a frame number), a departure location (e.g., a location of a current shipping point), an arrival location (e.g., a location of a next shipping point), a model number, and any information that aids a subsequent shipping provider and/or a subsequent warehouse provider in knowing the subsequent shipping needs of the product. Those skilled in the art can design the specific contents of each transportation instruction according to actual needs. For example, the transportation instructions may include a current location (e.g., a location of a current transportation point), a departure location (e.g., a location of a next transportation point), an arrival location (e.g., a location of a next transportation point), etc., as desired. The shipping instructions may also contain information indicating whether the product is already in a ready-to-ship state. The transport instructions may also contain information indicating a priority of transport, e.g., a vehicle with a high priority may require transport as soon as possible, and a vehicle with a low priority may not have to transport as soon as possible.

As shown in fig. 7, method 700 may include a step 703 of determining whether to trigger an automatic transmission of associated shipping instructions to a shipping provider of a subsequent shipping section and/or a warehouse provider of a subsequent shipping point based at least on the type of shipping point and attribute information of the product in response to monitoring that the product is shipped to a shipping point of the shipping route.

In some embodiments, the subsequent transportation segment for which the at least one transportation instruction is directed may be a transportation segment from a current transportation point to a next transportation point, and the sending object of the transportation instruction may be a transportation provider of the transportation segment from the current transportation point to the next transportation point and/or a warehouse provider of the next transportation point. In this case, the delivery of the shipping instructions may be triggered in response to the warehousing of the product to inform the shipping provider that the product may be shipped and to prepare the warehouse provider for receipt of the product.

In other embodiments, the subsequent transportation path for which the at least one transportation instruction is directed may be a transportation path from the next transportation point to the next transportation point, and the transmission object of the transportation instruction may be a transportation provider of the transportation path from the next transportation point to the next transportation point and/or a warehouse provider of the next transportation point. In this case, the sending of the transportation instruction may be triggered in response to the warehousing or ex-warehouse of the product at the current transportation point to inform the warehouse supplier of the next transportation point in advance that it is ready and inform the transportation suppliers of the transportation path from the next transportation point to the next transportation point in advance that it is ready to make a transportation plan.

There may be a plurality of shipping instructions that need to be sent for a product when it is shipped to a shipping point. In some embodiments, the automatic transmission of the plurality of shipping instructions may be performed in response to a time of warehousing of the product at the current shipping point. In other embodiments, the automatic transmission of the plurality of shipping instructions may be performed in response to the time of shipment of the product at the current shipping point. In yet other embodiments, a portion of the plurality of shipping instructions may be executed in response to a time of warehousing of the product at the current shipping point (e.g., to alert a next shipping provider to carry the product and to alert a next warehouse provider to be ready for product receipt), and another portion of the shipping instructions may be executed in response to a time of shipment of the product at the current shipping point (e.g., to advance notice the shipping demand to the next shipping provider and advance notice the warehouse capacity demand to the next warehouse provider).

The type of transport point includes, for example, at least one of the following: factory, factory warehouse, transfer warehouse, and final stage warehouse.

The shipping warehouse is, for example, the first shipping point that the product must travel after shipping.

The transit warehouse may be other transportation points through which transportation is underway, such as train stations, ports.

The final warehouse may be a shipping point that must be traversed before reaching the dealer.

The attribute information of the product may include, for example, at least one of: whether to exit the vehicle; whether a large-displacement vehicle is used; whether to lock the vehicle; whether to pay or not.

It will be appreciated that the above are merely examples listed for illustrative purposes and that one skilled in the art could conceive more transportation point types and attribute information for products.

Fig. 8B enumerates the decision logic for the delivery of the transport order in each case for different vehicle attributes, such as whether to export vehicles and whether to large displacement vehicles, and for different types of transport points, such as what warehouse type.

As shown in fig. 8B, for a transportation point "factory", for all vehicles that can be shipped, a transportation instruction is automatically sent to the warehouse suppliers of the subsequent transportation point (e.g., the next transportation point, i.e., the factory warehouse and/or the next transportation point) and/or the transportation suppliers of the subsequent transportation section (e.g., from factory to factory warehouse and/or from factory warehouse to transfer warehouse).

For a transportation point "factory warehouse", when the vehicle is not an exit vehicle, it is necessary to determine whether the vehicle is a large displacement vehicle.

If it is determined that the vehicle is not a large displacement vehicle, the associated transportation instructions are sent directly to the warehouse provider of the subsequent transportation point and/or the transportation provider of the subsequent transportation segment. If the vehicle is determined to be a large-displacement vehicle, then whether the large-displacement vehicle is in a financial state (whether payment is made) and whether the large-displacement vehicle is in an unlocking state is further determined, if payment is made and the large-displacement vehicle is in the unlocking state, an associated transportation instruction is automatically sent to a warehouse supplier of a subsequent transportation point and/or a transportation supplier of a subsequent transportation road section, and if not, the transportation instruction is not sent.

In the case where the condition of the vehicle does not satisfy the automatic transmission condition of the transportation instruction, the user may be prompted to manually trigger the transmission of the transportation instruction.

In some embodiments, the user may handle manual forced transmission of the transportation instructions for multiple batches of vehicles at the transportation point that do not meet the automatic transmission conditions of the transportation instructions. For example, a plurality of entries for a plurality of vehicles that do not satisfy the automatic transmission condition of the transportation instructions, a plurality of operation buttons (e.g., selection boxes) associated therewith, and a "transmission button" for initiating manual forced transmission may be provided at the corresponding user interface, and the user may select the vehicles by selecting the corresponding selection boxes and manually trigger transmission of the transportation instructions associated with these vehicles by selecting the "transmission button".

For the transit warehouse at the transportation point, when the vehicle is not in the export vehicle, whether the vehicle pays or not and the vehicle locking state are not judged, and the automatic sending of the transportation instruction is triggered only by taking the warehouse as a condition.

For a "terminal warehouse" at a shipping point, when the vehicle is not an export vehicle, it is determined for the vehicle whether to pay, whether to be a vehicle for cross-regional sales, or whether to reach a set delivery time, either of which does not satisfy an automatic delivery that does not trigger a shipping instruction. Otherwise, a shipping instruction is automatically sent to the dealer or to a shipping provider from the terminal warehouse to the dealer.

When the condition of the vehicle does not meet the condition for automatically sending the transportation instruction, the user can be prompted to manually trigger the sending of the transportation instruction when the condition is judged to be met.

For the exit vehicle, it is possible to set up that for both the delivery point "delivery warehouse" and "transit warehouse" it is not judged whether the payment and locking state is made and the transmission of the delivery instruction must be triggered manually by the user. The "terminal warehouse" is typically the last shipping point in the country where it may be arranged to send shipping instructions only to the export sellers to inform the end of the entire shipping process in the country.

It will be appreciated by those skilled in the art that fig. 8B merely illustrates exemplary decision logic for determining whether to trigger automatic transmission of shipping instructions based at least on the type of shipping point and attribute information of the product according to business logic settings, and that various changes may be made to the decision logic as desired without departing from the teachings of the present disclosure.

As shown in fig. 7, method 700 may include step 705, where automatic transmission of the shipping instructions is performed in response to determining to trigger automatic transmission of the shipping instructions to the shipping suppliers of the subsequent shipping section and/or to the warehouse suppliers of the subsequent shipping points.

In some embodiments, after determining to trigger the automatic transmission of the transport instructions to the transport provider of the subsequent transport section and/or to the warehouse provider of the subsequent transport point, the automatic transmission of the transport instructions is performed at the time of the product shipment, for example, in the case of providing the transport instructions to the warehouse provider of the next transport point and/or to the transport provider of the transport section from the next transport point to the next transport point.

As shown in fig. 7, method 700 may include step 707, where the user is prompted to manually trigger the transmission of the shipping instructions in response to determining not to trigger the automatic transmission of the shipping instructions to the shipping suppliers of the subsequent shipping road segments and/or to the warehouse suppliers of the subsequent shipping points.

According to the embodiment of the disclosure, the transport instructions to be sent at each transport point can be generated based on the predetermined transport route, the transport progress of the products is monitored based on the predetermined transport route, and the condition judgment of whether the transport instructions are automatically sent or not is carried out according to the transport progress of the products, so that accurate and real-time pushing associated with the transport instructions of each product can be realized, manual errors are avoided, efficiency is improved, and smooth product transport is promoted. The embodiment of the disclosure can provide advance or timely notification for warehouse suppliers and transportation suppliers, promote coordination of all parties in the transportation process, and is beneficial to improving the overall transportation efficiency and avoiding resource waste.

When transporting a product along a transport route predetermined for the product, data relating to various events of the transport process may be recorded, such as a planned arrival/entry time, an actual arrival/entry time, a planned departure/exit time, an actual departure/exit time, a transport instruction transmission manner (automatic trigger or manual trigger), and the like, for the product at each transport point. The user may query for each product. When a change in the transportation path occurs, a new transportation instruction may also be automatically generated and a cancel instruction may be sent for the already sent transportation instruction.

Fig. 9 shows a flow chart of a product shipment management method 900 in accordance with an embodiment of the present disclosure.

As shown in fig. 9, method 900 may include step 901 where a first query request of a user is received, the first query request including a unique identifier of a product.

In some embodiments, the user may enter a unique identifier of the product, such as a frame number, in a user interface for the query.

As shown in fig. 9, method 900 may include a step 903 of presenting a shipping instruction monitoring entry corresponding to the product in response to the first query request, the entry including at least a frame number and a time of transmission of the most recently transmitted shipping instruction.

FIG. 10A illustrates an exemplary query result according to an embodiment of the present disclosure. As shown in fig. 10A, the query result presents a transportation instruction monitoring entry corresponding to the product, the entry including a car frame number, a dealer code, a dealer name, a car model, a transmission time of a recently transmitted transportation instruction.

Those skilled in the art will appreciate that the transport instruction monitoring entry may include more or fewer information items.

As shown in fig. 9, the method 900 may further include a step 905 of presenting a shipping instruction transmission history corresponding to the product.

In some embodiments, a shipping instruction issue history corresponding to the product may be presented in response to a second query request by the user. For example, a "history inquiry" button may be set on the inquiry page for each transport instruction monitoring entry, and the user may issue a second inquiry request by clicking on the "history inquiry" button.

In other embodiments, a shipping instruction issue history corresponding to the product may be presented at the same time as the shipping instruction monitor entry is presented in response to the first query request.

As shown in fig. 10B, the transportation instruction transmission history includes: the product is transported through a transportation point and a transportation road section, the actual warehouse-in time and the actual warehouse-out time of each transportation point, the transportation instruction sending time of each transportation point which is transported through, the planned warehouse-in time and the planned warehouse-out time of each transportation point, and the like.

The various transportation points and transportation segments involved based on a predetermined transportation route for the product are presented in fig. 10B with a long line with nodes, each node representing a transportation point, and the position of the trolley on the line representing the transportation segment where the vehicle is currently located. As shown in fig. 10B, the current dolly has traveled to the transportation path between the relay warehouse 2 and the relay warehouse 3, and "send 03-01 14:41" indicates that the transportation instruction has been sent at the point of time (indicated by "actual 03-01 14:41") at which the vehicle is actually put in storage.

Fig. 10B is merely an exemplary shipping instruction transmission history according to embodiments of the present disclosure, and may be modified as desired by those skilled in the art. For example, the time of delivery of the shipping instructions may be set at the actual point in time of shipment of the product.

Fig. 11 shows a flow chart of a transportation management method 1100 according to an embodiment of the disclosure.

As shown in fig. 11, method 1100 may include step 1101 where an updated shipping route for the product is received.

As described above, the shipping routes for the products may be dynamically updated based on changes in actual shipping conditions, such as the embodiments described with reference to fig. 4-6.

The method 110 may also include a step 1103 in which updated shipping points and updated shipping segments are determined based on a comparison between the updated shipping route of the product and the predetermined shipping route of the product.

The method 110 may also include step 1105, where corresponding shipping instructions are generated for the updated shipping points and shipping road segments.

In some embodiments, only updated shipping routes may be utilized to determine updated shipping points and updated shipping segments that have not been passed by the product, for which new corresponding shipping instructions are generated.

When products are transported to these updated transportation points or to the upcoming updated transportation path, the associated transportation instructions may be sent as described above in connection with the methods of fig. 7-10B.

Fig. 12 shows a flow chart of a transportation management method 1200 according to an embodiment of the disclosure.

As shown in fig. 12, method 1200 includes a step 1201 in which, when a product is monitored to be transported to and not yet transported from a transportation point of a transportation route, an updated transportation route for the product is received, wherein the updated transportation route causes a subsequent transportation point to be changed relative to a previous subsequent transportation point.

The method 1200 further includes step 1203, where it is determined whether a transport order has been sent to a transport provider of a previous subsequent transport section and/or a warehouse provider of a previous subsequent transport point.

The method 1200 further includes a step 1205 in which, in response to determining that the transport instructions have been sent to the transport provider of the previous subsequent transport section and/or the warehouse provider of the previous subsequent transport point, a cancel instruction for the previously sent transport instructions is automatically sent to the transport provider of the transport section of the previous subsequent transport point and/or the warehouse provider of the previous subsequent transport point.

In this case, a new transportation instruction is generated for a new subsequent transportation point and a new subsequent transportation section, as will be described above in connection with the methods of fig. 7-11, and a determination and processing of whether to automatically send the transportation instruction is performed when the product is transported past these transportation points.

The embodiment of the disclosure can adapt to the dynamic change of the product transportation route, and realize efficient and flexible transportation instruction management.

Fig. 13 is a schematic diagram illustrating a general hardware environment of a system in which methods according to embodiments of the present disclosure may be implemented. The product transportation management method described above may be implemented on a computer system.

Referring now to FIG. 13, a schematic diagram of an example of a computing node 1300 is shown. Computing node 1300 is but one example of a suitable computing node and is not intended to suggest any limitation as to the scope of use or functionality of the embodiments described herein. Regardless, computing node 1300 is capable of implementing and/or performing any of the functions set forth above.

In computing node 1300, there is a computer system/server 1312 that can operate with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 1312 include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers systems, mainframe computer systems, distributed cloud computing environments that include any of the above systems or devices, and the like.

Computer system/server 1312 can be described in the general context of computer-system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer system/server 1312 can be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

As shown in FIG. 13, computer system/server 1312 in computing node 1300 is illustrated in the form of a general purpose computing device. Components of computer system/server 1312 may include, but are not limited to: one or more processors or processing units 1316, a system memory 1328, a bus 1318 that couples various system components including the system memory 1328 to the processing unit 1316.

Bus 1318 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include, but are not limited to, industry Standard Architecture (ISA) bus, micro channel architecture (MAC) bus, enhanced ISA bus, video Electronics Standards Association (VESA) local bus, peripheral Component Interconnect (PCI) bus, peripheral component interconnect express (PCIe), and Advanced Microcontroller Bus Architecture (AMBA).

Computer system/server 1312 typically includes a variety of computer system readable media. Such media can be any available media that is accessed by computer system/server 1312 and includes both volatile and nonvolatile media, removable and non-removable media.

The system memory 1328 may include computer system readable media in the form of volatile memory such as Random Access Memory (RAM) 30 and/or cache memory 1332. Computer system/server 1312 can also include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, a storage system 1334 may be provided for reading from and writing to non-removable, non-volatile magnetic media (not shown, and commonly referred to as a "hard disk drive"). Although not shown, a magnetic disk drive may be provided for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk"), and an optical disk drive may be provided for reading from and writing to a removable, nonvolatile optical disk such as a CD-ROM, DVD-ROM, or other optical media. In such cases, each may be coupled to bus 1318 by one or more data medium interfaces. As will be further depicted and described below, memory 1328 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of embodiments of the present disclosure.

By way of example, and not limitation, program/utility 1340 with a set (at least one) of program modules 1342, as well as an operating system, one or more application programs, other program modules, and program data, can be stored in memory 1328. An operating system, one or more application programs, other program modules, and program data, or some combination thereof, may each include an implementation of a network environment. Program modules 1342 generally perform the functions and/or methodologies in the embodiments as described herein.

The computer system/server 1312 can also communicate with one or more external devices 1314 (such as a keyboard, a pointing device, a display 1324, etc.), one or more devices that enable a user to interact with the computer system/server 1312, and/or any device (e.g., a network card, modem, etc.) that enables the computer system/server 1312 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 22. Also, the computer system/server 1312 can communicate with one or more networks such as a Local Area Network (LAN), a general Wide Area Network (WAN), and/or a public network (e.g., the internet) via a network adapter 7024. As depicted, the network adapter 7024 communicates with other components of the computer system/server 1312 via bus 1318. It should be appreciated that although not shown, other hardware and/or software components can be utilized in conjunction with computer system/server 1312. Examples include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archive storage systems, among others.

The present disclosure may be embodied as systems, methods, and/or computer program products. The computer program product may include a computer-readable storage medium(s) having computer-readable program instructions thereon for causing a processor to perform aspects of the present disclosure.

A computer readable storage medium may be a tangible device that can hold and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium include the following: portable computer disks, hard disks, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static Random Access Memory (SRAM), portable compact disk read-only memory (CD-ROM), digital Versatile Disks (DVD), memory sticks, floppy disks, mechanical coding devices such as punch cards or in-groove bump structures having instructions stored thereon, and any suitable combination of the foregoing. A computer-readable storage medium, as used herein, is not to be construed as a transitory signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., a pulse of light through a fiber optic cable), or an electrical signal transmitted through an electrical wire.

The computer readable program instructions described herein may be downloaded from a computer readable storage medium to individual computing/processing devices or over a network (e.g., the internet, a local area network, a wide area network, and/or a wireless network) to an external computer or external storage device. The network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards these computer readable program instructions for storage in a computer readable storage medium in the respective computing/processing device.

Computer readable program instructions for performing the operations of the present disclosure may be assembly instructions, instruction Set Architecture (ISA) instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, c++ or the like and conventional over-programmed programming languages such as the "C" programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (e.g., through the internet using an internet service provider). In some embodiments, the custom electronic circuit, including, for example, a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), may be personalized by utilizing state information of computer readable program instructions that may be executed in order to perform aspects of the disclosure.

Aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable medium having the instructions stored therein includes an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Those skilled in the art will also appreciate that the various operations illustrated in the order of execution in the embodiments of the disclosure are not necessarily performed in the order illustrated. The order of operations may be adjusted as desired by those skilled in the art. Those skilled in the art may add more operations or omit some of them as desired.

The description of the various embodiments of the present disclosure has been presented for purposes of illustration, but is not intended to be exhaustive or limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application, or the technical improvement of the technology found in the marketplace, or to enable others skilled in the art to understand the embodiments disclosed herein.

Claims

1. A computer-implemented method of product shipment management, comprising:

generating a plurality of shipping instructions based on a predetermined shipping route for a product, each shipping instruction associated with a respective shipping point and/or a respective shipping road segment in the shipping route for the product; and

In response to monitoring a shipping point of the shipping route for a product, a determination is made whether to trigger an automatic transmission of associated shipping instructions to a shipping provider and/or a subsequent warehouse provider of a subsequent shipping section based at least on the type of the shipping point and attribute information of the product.

2. The product transportation management method of claim 1, further comprising:

in response to determining to trigger automatic transmission of the transport instructions to the transport provider and/or the subsequent warehouse provider of the subsequent transportation path, performing automatic transmission of the transport instructions; and

in response to determining not to trigger the automatic transmission of the transport instructions to the transport provider and/or the subsequent warehouse provider of the subsequent transport section, the user is prompted to manually trigger the transmission of the transport instructions.

3. The product transportation management method of claim 2, further comprising:

and when the product is delivered out of the warehouse, executing automatic transmission of the transportation instruction.

4. The product transportation management method of claim 1, wherein

The type of transport point includes at least one of: factory, factory warehouse, transfer warehouse and final warehouse; and is also provided with

The attribute information of the product includes at least one of: whether to exit the vehicle; whether a large-displacement vehicle is used; whether to lock the vehicle; whether to pay or not.

5. The product transportation management method of claim 1, further comprising:

receiving a first query request from a user, the first query request including a unique identifier of a product;

in response to the first query request, a shipping instruction monitoring entry corresponding to the product is presented, the entry including at least a frame number and a time of transmission of the most recently transmitted shipping instruction.

6. The product transportation management method of claim 5, further comprising:

presenting a shipping instruction issue history corresponding to the product, wherein the shipping instruction issue history includes at least one of:

the transport point and the transport section through which the product has been transported,

the actual time of warehousing and actual time of ex warehouse at each shipping point,

a transport instruction sending time at each transport point that has been transported through, and

the planned warehouse-in time and the planned warehouse-out time at each transport point.

7. The product transportation management method of claim 1, further comprising:

receiving an updated shipping route for the product;

determining an updated shipping point and an updated shipping road segment based on a comparison between the updated shipping route of the product and the predetermined shipping route of the product; and

Corresponding transportation instructions are generated for the updated transportation points and transportation segments.

8. The product transportation management method of claim 1, further comprising:

receiving an updated delivery route for the product when it is monitored that the product is delivered to and has not been delivered from a delivery point of the delivery route, wherein the updated delivery route results in a change in a subsequent delivery point relative to a previous subsequent delivery point;

determining whether a transport order has been sent to a transport provider of a previous subsequent transport section and/or a warehouse provider of a previous subsequent transport point; and

in response to determining that the transport instructions have been sent to the transport provider of the previous subsequent transport section and/or the warehouse provider of the previous subsequent transport point, a cancel instruction for the previously sent transport instructions is automatically sent to the transport provider of the transport section of the previous subsequent transport point and/or the warehouse provider of the previous subsequent transport point.

9. The product shipment management method of claim 1, wherein each shipment instruction comprises at least:

a unique identifier of the product;

a departure location; and

the position is reached.

10. A computer system, comprising:

One or more processors, and

a memory coupled to the one or more processors, the memory storing computer-readable program instructions that, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-9.

11. A computer readable storage medium having stored thereon computer readable program instructions which, when executed by a processor, cause the processor to perform the method of any of claims 1-9.

12. A computer program product comprising computer readable program instructions which, when executed by a processor, cause the processor to perform the method of any of claims 1-9.