Transportation line combination method, electronic device, storage medium and computer program product

Abstract

The invention provides a transportation line combination method, electronic equipment, a storage medium and a computer program product. The method comprises the following steps: acquiring a plurality of transportation lines in a logistics network; combining the plurality of transportation lines to obtain a line set of a first type; the cost of the line set of the first type under the outsourcing calculation strategy is higher than that under the self-operation calculation strategy; the remaining transportation lines are combined to obtain a line set of a second type, and the remaining transportation lines comprise the transportation lines except the line set of the first type in the multiple transportation lines; and respectively outputting the line set of the first type and the line set of the second type. Two operation strategies of self-operation and outsourcing are considered in the whole combination process, so that the cost is reduced to the greatest extent, and the cost is well controlled.

Description

Methods for combining transport routes, electronic equipment, storage media, and computer program products Technical Field

[0001] This application relates to the field of logistics and transportation technology, specifically to a method for combining transportation routes, electronic equipment, storage media, and computer program products. Background Technology

[0002] With the rapid development of global e-commerce, the modern logistics industry faces increasingly complex transportation demands and challenges. To address this, logistics companies are constantly exploring various methods to optimize transportation route combinations in order to improve logistics efficiency and meet customer needs.

[0003] Currently, a widely used existing technology is the transportation route combination scheme based on the shortest path algorithm. This scheme mainly uses the shortest path algorithm to calculate the optimal combination of routes in the logistics network. However, in practical applications, although the transportation route combination scheme based on the shortest path algorithm improves logistics efficiency to a certain extent, it is not optimal in terms of cost control. Summary of the Invention

[0004] This application provides a method for combining transportation routes, an electronic device, a storage medium, and a computer program product to solve the problem of poor cost control under existing transportation route combination methods.

[0005] A first aspect of this application provides a method for combining transportation routes, the method comprising: acquiring multiple transportation routes in a logistics network; combining the multiple transportation routes to obtain a first type of route set; wherein the cost of the first type of route set under an outsourcing calculation strategy is higher than the cost under a self-operated calculation strategy; combining the remaining transportation routes to obtain a second type of route set, wherein the remaining transportation routes include transportation routes other than the first type of route set among the multiple transportation routes; and outputting the first type of route set and the second type of route set respectively.

[0006] A second aspect of this application provides an electronic device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the method for combining transport routes as described in the first aspect.

[0007] A third aspect of this application provides a storage medium storing a computer program that, when executed by a processor, implements the method for combining transport routes as described in the first aspect.

[0008] A fourth aspect of this application provides a computer program product, including: a computer program that, when executed by a processor, implements the method for combining transport routes as described in the first aspect.

[0009] As can be seen from the above technical solution, after obtaining the transportation routes of the logistics network, the embodiments of this application can obtain a first type of route set with lower costs under the self-operated calculation strategy through the first combination of transportation routes. Through the second combination of transportation routes, a second type of route set that facilitates the outsourcing operation strategy can be obtained. This ensures that the entire combination process takes into account both self-operated and outsourcing operation strategies, minimizing costs and achieving good cost control. Attached Figure Description

[0010] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0011] Figure 1 is a flowchart of a method for combining transportation routes according to an embodiment of this application;

[0012] Figure 2 is a schematic diagram of the method for combining transportation routes in an enterprise system according to an embodiment of this application;

[0013] Figure 3 is a structural schematic diagram of a transportation route combination device provided in an embodiment of this application;

[0014] Figure 4 is a schematic diagram of the electronic device structure provided in an embodiment of this application. Detailed Implementation

[0015] Unless otherwise defined, the technical or scientific terms used in the embodiments of this specification shall have the ordinary meaning understood by one of ordinary skill in the art to which this specification pertains. The terms "first," "second," and similar terms used in the embodiments of this specification do not indicate any order, quantity, or importance, but are merely used to avoid confusion of constituent elements.

[0016] Unless the context otherwise requires, throughout this specification, "a plurality of" means "at least two," and "including" is interpreted as open-ended or encompassing, that is, "including, but not limited to." In the description of this specification, terms such as "one embodiment," "some embodiments," "exemplary embodiment," "example," "specific example," or "some examples" are intended to indicate that a particular feature, structure, material, or characteristic associated with that embodiment or example is included in at least one embodiment or example of this specification. The illustrative representations of the above terms do not necessarily refer to the same embodiment or example.

[0017] The technical solutions in the embodiments of this specification will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this specification, and not all embodiments. Based on the embodiments in this specification, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this specification.

[0018] Overview

[0019] As described in the background section, most existing logistics network transportation route combinations are geared towards transportation efficiency and are performed by experienced professionals. Because efficiency is the primary objective, the resulting combinations inevitably fail to effectively control costs. Furthermore, due to the complexity of vehicle cost calculations and the large number of cost items in logistics networks, as well as the fact that route combination optimization is an NP-hard problem, there is currently no transportation route combination solution in the industry specifically designed to reduce costs.

[0020] To address the aforementioned problems, the inventors of this application have considered both self-operated and outsourced transportation route management strategies, and based on cost considerations under these two strategies, have combined various transportation routes. This allows for subsequent processing of each combination using different operating models, minimizing costs. Therefore, this application provides a method for combining transportation routes. The purpose is to obtain a first-type route set with lower costs under a self-operated strategy through the first combination of transportation routes after acquiring the transportation routes of the logistics network. A second-type route set, convenient for an outsourcing strategy, can be obtained through the second combination of transportation routes. This ensures that the entire combination process considers both self-operated and outsourcing strategies, minimizing costs and achieving effective cost control. The specific solution is described in detail below through embodiments.

[0021] Exemplary methods

[0022] This application provides an exemplary description of a method for combining transportation routes, as shown in Figure 1. The method for combining transportation routes includes:

[0023] S101: Obtain multiple transportation routes in the logistics network.

[0024] In this step, the logistics network is a network composed of logistics nodes used to realize logistics transportation. In some embodiments, the logistics network can be a network composed of logistics nodes in a designated business area. Each logistics node can be considered a service point or outlet. For example, a service point is the origin, transit point, or destination of goods. Goods may pass through one or more service points during transportation within the logistics network. The transportation routes in the logistics network are the transportation routes between the logistics nodes. For example, region A has 10 logistics outlets, and there are cargo transportation relationships between these outlets. These logistics outlets and their transportation relationships constitute the logistics network of region A. The transportation routes of this logistics network are the routes along which goods are transported between the logistics outlets.

[0025] S102: Combine multiple transport routes to obtain a first type of route set.

[0026] It should be noted that combining multiple transportation routes can generate several different route combinations, and the number of transportation routes in each combination will vary. For each route combination, its cost under the outsourcing calculation strategy and its cost under the self-operated calculation strategy can be calculated separately. Then, the route combinations whose cost under the outsourcing calculation strategy is higher than their cost under the self-operated calculation strategy are classified as the first type of route set. Therefore, the cost of the first type of route set is higher under the outsourcing calculation strategy than under the self-operated calculation strategy.

[0027] It is understandable that the outsourcing calculation strategy, also known as the outsourcing operation strategy, means that the cost of a route combination under this strategy is the sum of all costs / expenses when all transportation routes in the route combination are outsourced according to the outsourcing operation strategy. Similarly, the self-operated calculation strategy, also known as the enterprise self-operation strategy, means that the cost of a route combination under this strategy is the sum of all costs / expenses when all transportation routes in the route combination are undertaken by the enterprise itself according to the self-operation strategy. In some embodiments, the outsourcing calculation strategy and the self-operated calculation strategy can be pre-set different cost / expense calculation strategies. Specifically, the outsourcing calculation strategy can be a strategy set based on the operational scenario of outsourcing transportation routes. The self-operated calculation strategy can be a strategy set based on the operational scenario of the enterprise undertaking the transportation routes itself.

[0028] S103: Combine the remaining transport routes to obtain a second type of route set.

[0029] In this step, the remaining transportation routes include those transportation routes other than the first type of route set. It is understood that for all transportation routes in the logistics network, after grouping a portion of them into the first type of route set, each of the remaining routes can be outsourced individually to other companies. In most cases, outsourcing multiple transportation routes in a package is easier to secure and saves time and effort compared to outsourcing a single route. Therefore, the remaining transportation routes are combined again according to certain rules to obtain packaged multiple transportation routes, i.e., the second type of route set. This application does not limit the rules followed during the combination. They can be any rules, for example, a random combination rule. Alternatively, a maximum quantity rule can be used, where the remaining transportation routes are combined in a fixed quantity, resulting in second-type route sets containing the same number of transportation routes.

[0030] S104: Output the first type of line set and the second type of line set respectively.

[0031] It should be noted that this application does not limit the output method for the two types of line sets. It can be any output method. For example, it can be output in a vivid and engaging way with graphics and text, or it can be output via voice broadcast.

[0032] Understandably, the first type of route set is more suitable for self-operation due to its lower cost, while the second type of route set is more suitable for outsourcing. Therefore, in some embodiments, the first type of route set can be output to the management department within the enterprise responsible for self-operated business, and the second type of route set can be output to the management department responsible for outsourced business. Here, the aforementioned management department within the enterprise can be understood as an electronic device under that department, meaning the route set is output to a specific electronic device under that management department. For example, the route set could be output to the corporate email address of an employee under that management department.

[0033] In this embodiment, after acquiring the transportation routes of the logistics network, a first set of routes with lower costs under the self-operated calculation strategy can be obtained through the first combination of transportation routes. A second set of routes, which is convenient for the outsourcing operation strategy, can be obtained through the second combination of transportation routes. This ensures that the entire combination process considers both self-operated and outsourcing strategies, minimizing costs and achieving good cost control.

[0034] To avoid omitting any individual transport routes, in some embodiments of this application, after combining the remaining transport routes to obtain a second type of route set, the method further includes:

[0035] Output each transport route in the target route set separately; wherein, the target route set includes transport routes other than the route sets of the first type and the route sets of the second type.

[0036] It should be noted that not every transportation route in the logistics network can be successfully combined with other transportation routes. For example, during the process of combining the remaining transportation routes, due to conflicts in transportation time, one or more transportation routes cannot be successfully combined with all the remaining transportation routes. Omitting these uncombinable transportation routes will have more serious consequences. Therefore, this embodiment will output these uncombinable transportation routes separately for subsequent processing. In some embodiments, each transportation route in the target route set can be output separately to the management department responsible for self-operated business. In some embodiments, each transportation route in the target route set can be output separately to the management department responsible for outsourced business. In some embodiments, the cost can also be calculated for each transportation route, and the output recipient can be determined based on the cost.

[0037] As shown in Figure 2, when applying the transportation route combination method in an enterprise system, the user can trigger the system to execute operations, and the system will output the relevant results according to the transportation route combination method. Specifically, the process includes:

[0038] S201: Data Preprocessing. After obtaining the transportation routes in the logistics network, preprocessing operations are performed to facilitate subsequent steps. This preprocessing includes, but is not limited to, removing redundant or invalid data and standardizing the data format of all transportation routes.

[0039] S202: First combination to generate a full packet. This step is the same as step S102 above. The full packet is equivalent to the first type of line set in step S102 above. To avoid repetition, it will not be described again here.

[0040] S203: Output full package.

[0041] S204: Second combination to generate a half-packet. This step is the same as step S103 above. The half-packet is equivalent to the second type of line set in step S103 above. To avoid repetition, it will not be described again here.

[0042] S205: Output half packet.

[0043] S206: Output a single side, which is equivalent to each transport route in the target route set.

[0044] In this embodiment, individual transport routes that failed to be combined are output separately, which avoids omitting any transport routes.

[0045] In some embodiments of this application, multiple transport routes are combined to obtain a first type of route set, including:

[0046] According to the all-inclusive route combination constraint, multiple transportation routes are combined to generate route combinations that satisfy the all-inclusive route combination constraint. The all-inclusive route combination constraint includes: route combination constraint conditions set for self-operation; calculating the first cost of each route combination that satisfies the all-inclusive route combination constraint under the outsourcing calculation strategy and the second cost under the self-operation calculation strategy; selecting all-inclusive route combinations whose first cost is higher than the second cost and which do not have duplicate transportation routes; and treating the all-inclusive route combinations as the first type of route set.

[0047] It should be noted that the first type of route set can be considered a route set more suitable for self-operation by enterprises. Therefore, it is necessary to pre-set route combination constraints for self-operation and treat them as all-inclusive route combination constraints. When combining transportation routes, route combinations that satisfy the all-inclusive route combination constraints are generated. The content of the all-inclusive route combination constraints can include at least one constraint from Table 1 below.

[0048]

[0049]

[0050] Table 1

[0051] The relevant descriptions of the outsourcing and self-operated computing strategies can be found in the above embodiments and will not be repeated here. It is understood that in obtaining the first type of route set, the objective can be to maximize the cost difference between the first cost and the second cost, as shown in Formula 1:

[0052] max∑ i S i —C i Among them, S i Let C represent the standard price of the i-th car package. i Let represent the cost price of the i-th car package. Here, the car packages represent the first type of route set, the standard price is the first cost, and the cost price is the second cost.

[0053] In some embodiments, the first cost can be divided into labor costs, vehicle fixed costs, and variable costs (such as fuel consumption). The first cost is calculated by taking into account factors such as the vehicle's mileage, driver's working hours, fuel consumption, and the number of vehicles.

[0054] In this embodiment, route combination constraints are set in advance for the purpose of self-operation and are used as all-inclusive route combination constraints. When combining transportation routes, route combinations that meet the all-inclusive route combination constraints are generated, so that the resulting route combinations are more suitable for the enterprise's self-operation.

[0055] In some embodiments of this application, multiple transport routes are combined according to the all-inclusive route combination constraint to generate a route combination that satisfies the all-inclusive route combination constraint, including:

[0056] According to the all-inclusive route combination constraint, multiple transportation routes are combined to obtain an initial route combination. For each transportation route in the remaining route set, each initial route combination is traversed, and the corresponding transportation route is inserted into an initial route combination that does not have overlapping transportation times and meets the all-inclusive route combination constraint after insertion, generating an intermediate route combination. The remaining route set includes transportation routes other than the initial route combinations. The intermediate route combinations and the initial route combinations that failed to insert transportation routes are determined as route combinations that meet the all-inclusive route combination constraint.

[0057] It should be noted that during the process of combining multiple transport routes according to the all-inclusive route combination constraint, algorithmic defects may cause some transport routes that could be successfully combined to ultimately not be included in any combination. Therefore, after combination, insertion optimization can be performed, that is, attempting to reinsert each transport route that failed to be combined into the formed combination.

[0058] In some embodiments, during the process of combining multiple transport routes to obtain the initial route combination according to the all-inclusive route combination constraint, the combination with a depth of 2 (the number of transport routes in the combination) can be calculated first by exhaustively searching for combinations. The transport routes in the combination must meet the all-inclusive route combination constraint. Then, the search continues downward from the depth of 2, continuously increasing the depth until the maximum depth is reached. The combination process in the previous step is referenced during the downward search. To improve search efficiency, in some embodiments, some combinations can be directly ignored during the search process based on known uncombinable information. For example, if there are two combinations, AB and BC, but no combination BD, then ABD will not be generated, but ABC will be generated. Therefore, the combination ABD can be directly ignored.

[0059] In some embodiments, during the route optimization process, the initial route combinations can be sorted, prioritizing those with higher cargo mileage. Each initial route combination is traversed in descending order of cargo mileage. For each initial route combination, all remaining unused transport routes are traversed to determine if they overlap or conflict with transport routes in the initial route combination in time, and whether the insertion satisfies the all-inclusive route combination constraint. If there is no conflict and the all-inclusive route combination constraint is satisfied, then the transport route is inserted into the initial route combination.

[0060] In this embodiment of the application, during the assembly process, the wiring optimization of the preliminary assembly results can improve the quality of the final assembly results.

[0061] In some embodiments of this application, the full-packet line combination constraint includes at least one of: inter-line constraint, packet relaxation constraint, and overall packet constraint;

[0062] Among them, the inter-line constraint is used to constrain whether two transport lines can be combined, the packet relaxation constraint is used to constrain the total transport time of all transport lines in the current combination, and the packet overall constraint is used to constrain the verification of all transport lines in the current combination.

[0063] It should be noted that, in order to speed up the combination process and increase the search scale during the combination process, the embodiments of this application distinguish between line constraints, package relaxation constraints and package overall constraints.

[0064] Inter-route constraints: These determine whether two transport routes can be combined, acting as a pruning mechanism to reduce many infeasible combinations. For example, inter-route constraints can include empty run distance constraints between two transport routes and waiting time constraints between two transport routes.

[0065] Packet relaxation constraint: This involves determining in advance whether a route combination could potentially become a packet. If so, the search can continue; otherwise, it terminates early. For example, a packet relaxation constraint could be the maximum duration of a vehicle / packet. That is, the overall duration of the vehicle / packet (from the arrival of the vehicle on the first transport route to the unloading on the last transport route) must be within a certain range.

[0066] Package overall constraints: Use all constraints to validate the combination. If it passes, output the combination; if any constraint fails the validation, the validation fails and ends early. For example, package overall constraints can be empty-running rate, vehicle-package efficiency, etc., as shown in Table 1 above.

[0067] In this embodiment of the application, the constraints of the full-package line combination are divided into inter-line constraints, packet relaxation constraints, and overall packet constraints, which can speed up the combination process and increase the search scale during the combination process.

[0068] In some embodiments of this application, obtaining multiple transport routes in a logistics network includes:

[0069] Obtain multiple transportation routes corresponding to a target area in the logistics network, where the target area is any area of ​​the logistics network.

[0070] It should be noted that when the logistics network is large in scale, the number of its transportation routes is usually enormous, and directly combining them would typically be a lengthy process. Furthermore, some business requirements may only require combining transportation routes for specific areas within the logistics network. Therefore, this embodiment can obtain only the transportation routes corresponding to a target area in the logistics network and then optimize their combination. This provides a finer granularity in the combination optimization process, meeting more specific business needs. In other embodiments, transportation routes for different areas of the logistics network can be divided into different route pools, and then combination optimization can be performed on the transportation routes in each route pool, i.e., the two combination steps and the output route set steps described above. This way, the number of transportation routes in each route pool is not too large, allowing for rapid response.

[0071] In this embodiment, transportation routes in only certain areas of the logistics network can be combined. This allows for finer-grained optimization, meeting more specific business needs. Furthermore, different areas of the logistics network can be managed separately, improving the response speed of route combinations.

[0072] In some embodiments of this application, obtaining multiple transport routes in a logistics network includes:

[0073] Obtain information on each transportation route and its schedule in the logistics network; merge the schedules of each transportation route based on its schedule information to obtain multiple transportation routes.

[0074] It should be noted that there may be connections between transportation routes within a logistics network, and these connections can be used to reduce the number of routes. For example, one transportation route departs from location A to location B, with departures Monday through Wednesday. Another transportation route also departs from location A to location B, with departures Thursday through Friday. By merging the schedules of these two routes, a single transportation route will be generated, also departing from location A to location B, with departures Monday through Friday. Of course, the connections between transportation routes are not limited to the aforementioned departure schedules; for example, they could also include the monthly number of trips made by the transportation route.

[0075] In this embodiment of the application, by merging schedules, the number of transportation routes can be reduced, thereby improving the response speed of route combinations.

[0076] In some embodiments of this application, the remaining transport routes are combined to obtain a second type of route set, including:

[0077] According to the semi-package route combination constraint, the remaining transportation routes are combined to generate route combinations that satisfy the semi-package route combination constraint; the semi-package route combination constraint includes: route combination constraint conditions set for the purpose of outsourcing; the route combinations that satisfy the semi-package route combination constraint are regarded as the second type of route set.

[0078] It should be noted that the process of generating a line combination that satisfies the semi-enclosed line combination constraint in this embodiment is similar to the process of generating a line combination that satisfies the full-enclosed line combination constraint in the above embodiments. The difference lies in the fact that the objects being combined are different and the constraints used are different in the two combination processes. For the specific process, please refer to the above embodiments, which will not be repeated here.

[0079] Understandably, the second type of route set can be considered a more suitable route set for outsourcing. Therefore, it is necessary to pre-set route combination constraints for outsourcing purposes and treat them as semi-outsourcing route combination constraints. When combining transport routes, route combinations that satisfy the semi-outsourcing route combination constraints are generated. The content of the semi-outsourcing route combination constraints can include at least one constraint from Table 2 below.

[0080]

[0081]

[0082] Table 2

[0083] In this embodiment, route combination constraints are set in advance for the purpose of outsourcing, and these constraints are used as semi-outsourcing route combination constraints. When combining transportation routes, route combinations that satisfy the semi-outsourcing route combination constraints are generated, so that the resulting route combinations are more suitable for outsourcing.

[0084] Exemplary device

[0085] In this embodiment of the application, a transport line assembly device is also provided, as shown in FIG3. The transport line assembly device includes:

[0086] The acquisition module 301 is used to acquire multiple transportation routes in the logistics network; the first combination module 302 is used to combine the multiple transportation routes to obtain a first type of route set; wherein the cost of the first type of route set under the outsourcing calculation strategy is higher than the cost under the self-operated calculation strategy; the second combination module 303 is used to combine the remaining transportation routes to obtain a second type of route set, wherein the remaining transportation routes include transportation routes other than the first type of route set; the first output module 304 is used to output the first type of route set and the second type of route set respectively.

[0087] In some embodiments of this application, the device further includes: a second output module for outputting each transport route in the target route set individually; wherein the target route set includes transport routes other than the first type of route set and the second type of route set among multiple transport routes.

[0088] In some embodiments of this application, the first combination module 302 includes: a first combination unit, used to combine multiple transportation routes according to the all-inclusive route combination constraint to generate a route combination that satisfies the all-inclusive route combination constraint; the all-inclusive route combination constraint includes: route combination constraint conditions set for self-operation; a cost calculation unit, used to calculate the first cost of each route combination that satisfies the all-inclusive route combination constraint under the outsourcing calculation strategy and the second cost under the self-operation calculation strategy; a cost screening unit, used to screen out all-inclusive route combinations whose first cost is higher than the second cost and which do not have duplicate transportation routes; and a first determination unit, used to treat the all-inclusive route combination as a first type of route set.

[0089] In some embodiments of this application, the first combination unit is specifically used to combine multiple transportation routes according to the full-package route combination constraint to obtain an initial route combination; for each transportation route in the remaining route set, traverse each initial route combination, insert the target transportation route into an initial route combination that does not have overlapping transportation times and meets the full-package route combination constraint after insertion, and generate an intermediate route combination; wherein, the remaining route set includes: transportation routes other than the initial route combinations among the multiple transportation routes; the intermediate route combination and the initial route combination that failed to insert a transportation route are determined as route combinations that meet the full-package route combination constraint.

[0090] In some embodiments of this application, the full-package route combination constraint includes at least one of: inter-route constraint, packet relaxation constraint, and overall packet constraint; wherein, the inter-route constraint is used to constrain whether two transport routes can be combined, the packet relaxation constraint is used to constrain the total transport time of all transport routes in the current combination, and the overall packet constraint is used to constrain the verification of all transport routes in the current combination.

[0091] In some embodiments of this application, the acquisition module 301 is specifically used to acquire multiple transportation routes corresponding to a target area in the logistics network, wherein the target area is any area of ​​the logistics network.

[0092] In some embodiments of this application, the acquisition module 301 is specifically used to acquire each transportation route in the logistics network and the schedule information of each transportation route; and to merge the schedules of the transportation routes in the logistics network based on the schedule information of each transportation route to obtain multiple transportation routes.

[0093] In some embodiments of this application, the second combination module 303 includes: a second combination unit, used to combine the remaining transportation routes according to the semi-packaged route combination constraint to generate a route combination that satisfies the semi-packaged route combination constraint; the semi-packaged route combination constraint includes: a route combination constraint condition set for the purpose of outsourcing; and a second determination unit, used to take the route combination that satisfies the semi-packaged route combination constraint as a second type of route set.

[0094] It should be noted that the transportation line combination device provided in this embodiment belongs to the same application concept as the transportation line combination method provided in the above embodiments of this application specification. It can execute the transportation line combination method provided in any of the above embodiments of this specification, and specifically execute the corresponding functional modules and beneficial effects of the transportation line combination device. For technical details not described in detail in this embodiment, please refer to the specific processing content of the transportation line combination method provided in the above embodiments of the specification. Here, it will not be repeated.

[0095] Exemplary electronic devices

[0096] Another embodiment of this application also provides an electronic device. Please refer to FIG4, which is a schematic diagram of the structure of the electronic device provided in the embodiment of this application. An exemplary embodiment of this specification also provides an electronic device, including: a memory and a processor. The memory stores a computer program, and the processor executes the computer program to perform the steps in the method for combining transportation lines according to various embodiments of this specification described in the above embodiments.

[0097] The internal structure of the electronic device is shown in Figure 4. The electronic device includes a processor, memory, network interface, and input devices connected via a system bus. The processor provides computing and control capabilities. The memory includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The network interface is used to communicate with external terminals via a network connection. When the computer program is executed by the processor, it follows the steps of the method for combining transport lines according to various embodiments of this specification as described in the above embodiments.

[0098] The processor may include the main processor, as well as baseband chips, modems, etc.

[0099] The memory stores a computer program that executes the technical solution of this invention, and may also store an operating system and other key business functions. Specifically, the computer program may include program code, which includes computer operation instructions. More specifically, the memory may include read-only memory (ROM), other types of static storage devices capable of storing static information and instructions, random access memory (RAM), other types of dynamic storage devices capable of storing information and instructions, disk storage, flash memory, etc.

[0100] The processor can be a general-purpose processor, such as a general-purpose central processing unit (CPU), a microprocessor, etc., or an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of the program of the present invention. It can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0101] Input devices may include devices that receive data and information input by the user, such as keyboards, mice, cameras, scanners, light pens, voice input devices, touch screens, pedometers, or gravity sensors.

[0102] Output devices may include devices that allow information to be output to a user, such as displays, printers, speakers, etc.

[0103] The communication interface may include any transceiver-like device for communicating with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), Wireless Local Area Network (WLAN), etc.

[0104] The processor executes computer programs stored in memory and calls other devices, which can be used to implement the various steps of any of the transportation route combination methods provided in the above embodiments of this application.

[0105] The electronic device may also include a display component and a voice component. The display component may be a liquid crystal display screen or an e-ink display screen. The input device of the electronic device may be a touch layer covering the display component, or a button, trackball or touchpad set on the casing of the electronic device, or an external keyboard, touchpad or mouse, etc.

[0106] Those skilled in the art will understand that the structure shown in Figure 4 is merely a block diagram of a portion of the structure related to the solution in this specification, and does not constitute a limitation on the electronic device to which the solution in this specification is applied. A specific electronic device may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0107] In addition to the methods and devices described above, the method for combining transport routes provided in the embodiments of this specification can also be a computer program product, which includes a computer program that, when run by a processor, causes the processor to perform the steps in the method for combining transport routes according to various embodiments of this specification as described in the "Exemplary Methods" section above.

[0108] The computer program product described herein can be written in any combination of one or more programming languages ​​to perform the operations of the embodiments described herein. These programming languages ​​include object-oriented programming languages ​​such as Java and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0109] Furthermore, embodiments of this specification also provide a computer-readable storage medium having a computer program stored thereon, the computer program being executed by a processor of the steps in the method of combining transport routes according to various embodiments of this specification as described in the "Exemplary Methods" section above.

[0110] It is understood that the specific examples in this document are only intended to help those skilled in the art better understand the implementation methods of this specification, and are not intended to limit the scope of this specification.

[0111] It is understood that in the various embodiments described in this specification, the sequence number of each process does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments described in this specification.

[0112] It is understood that the various implementation methods described in this specification can be implemented individually or in combination, and the implementation methods in this specification are not limited in this respect.

[0113] Unless otherwise stated, all technical and scientific terms used in the embodiments of this specification have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the scope of this specification. The term "and / or" as used in this specification includes any and all combinations of one or more of the associated listed items. The singular forms "a," "the," and "the" as used in the embodiments of this specification and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.

[0114] It is understood that the processor in the embodiments of this specification can be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this specification. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this specification can be directly implemented by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0115] It is understood that the memory in the embodiments of this specification may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory may be random access memory (RAM). It should be noted that the memory in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0116] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this specification.

[0117] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the aforementioned method implementations, and will not be repeated here.

[0118] In the several embodiments provided in this specification, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0119] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0120] In addition, the functional units in the various embodiments of this specification can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0121] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of this specification, in essence, or the parts that contribute to the prior art, or parts of the technical solutions, can be embodied in the form of software products. These computer software products are stored in a storage medium and include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this specification. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0122] The above description is merely a specific embodiment of this specification, but the scope of protection of this specification is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this specification should be included within the scope of protection of this specification. Therefore, the scope of protection of this specification should be determined by the scope of the claims.

Claims

1. A method for combining transportation routes, characterized in that, The method includes: acquiring multiple transportation routes in a logistics network; combining the multiple transportation routes to obtain a first type of route set; wherein the cost of the first type of route set under an outsourcing calculation strategy is higher than the cost under a self-operated calculation strategy; combining the remaining transportation routes to obtain a second type of route set, wherein the remaining transportation routes include transportation routes other than the first type of route set; and outputting the first type of route set and the second type of route set respectively.

2. The method according to claim 1, characterized in that, After combining the remaining transportation routes to obtain a second type of route set, the method further includes: outputting each transportation route in the target route set individually; wherein, the target route set includes transportation routes other than the first type of route set and the second type of route set among the multiple transportation routes.

3. The method according to claim 1, characterized in that, Combining the multiple transportation routes to obtain a first type of route set includes: combining the multiple transportation routes according to the all-inclusive route combination constraint to generate route combinations that satisfy the all-inclusive route combination constraint; the all-inclusive route combination constraint includes: route combination constraint conditions set for self-operation; calculating the first cost of each route combination that satisfies the all-inclusive route combination constraint under the outsourcing calculation strategy and the second cost under the self-operation calculation strategy; selecting all-inclusive route combinations whose first cost is higher than the second cost and which do not have duplicate transportation routes; and using the all-inclusive route combinations as the first type of route set.

4. The method according to claim 3, characterized in that, According to the all-inclusive route combination constraint, the multiple transportation routes are combined to generate a route combination that satisfies the all-inclusive route combination constraint. This includes: combining the multiple transportation routes according to the all-inclusive route combination constraint to obtain an initial route combination; for each transportation route in the remaining route set, traversing each of the initial route combinations, inserting the corresponding transportation route into an initial route combination that does not have overlapping transportation times and satisfies the all-inclusive route combination constraint after insertion, to generate an intermediate route combination; wherein, the remaining route set includes: transportation routes other than the initial route combinations among the multiple transportation routes; the intermediate route combinations and the initial route combinations that failed to successfully insert transportation routes are determined as route combinations that satisfy the all-inclusive route combination constraint.

5. The method according to claim 3, characterized in that, The full-package route combination constraint includes at least one of the following: inter-route constraint, package relaxation constraint, and package overall constraint; wherein, the inter-route constraint is used to constrain whether two transport routes can be combined, the package relaxation constraint is used to constrain the total transport time of all transport routes in the current combination, and the package overall constraint is used to constrain the verification of all transport routes in the current combination.

6. The method according to claim 1, characterized in that, Obtaining multiple transportation routes in a logistics network includes: obtaining multiple transportation routes corresponding to a target area in the logistics network, wherein the target area is any area of ​​the logistics network.

7. The method according to claim 1, characterized in that, Obtain multiple transportation routes in the logistics network, including: obtaining each transportation route in the logistics network and the schedule information of each transportation route; merging the schedules of the transportation routes in the logistics network based on the schedule information of each transportation route to obtain multiple transportation routes.

8. The method according to claim 1, characterized in that, The remaining transportation routes are combined to obtain a second type of route set, including: combining the remaining transportation routes according to the semi-outsourcing route combination constraint to generate a route combination that satisfies the semi-outsourcing route combination constraint; the semi-outsourcing route combination constraint includes: route combination constraint conditions set for the purpose of outsourcing; and the route combination that satisfies the semi-outsourcing route combination constraint is taken as the second type of route set.

9. An electronic device, characterized in that, It includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the method for combining transport routes as described in any one of claims 1-8.

10. A storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, implements the method for combining transportation routes as described in any one of claims 1-8.

11. A computer program product, characterized in that, include: A computer program, when executed by a processor, implements the method for combining transport routes as described in any one of claims 1-8.

Images