CN114781972A

CN114781972A - Method, device, equipment and medium for determining cargo transportation scheme

Info

Publication number: CN114781972A
Application number: CN202210464803.7A
Authority: CN
Inventors: 李云帆; 许媛媛; 王虎
Original assignee: Man Bang Information Consulting Co ltd
Current assignee: Man Bang Information Consulting Co ltd
Priority date: 2022-04-25
Filing date: 2022-04-25
Publication date: 2022-07-22

Abstract

The embodiment of the invention discloses a method, a device, equipment and a medium for determining a cargo transportation scheme. Wherein, the method comprises the following steps: acquiring a starting position and an end position of a cargo transportation task; determining a preset number of candidate transportation schemes according to the starting position and the ending position and a segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is taken charge of the carrying by one carrying body; and determining a target transportation scheme in the preset number of candidate transportation schemes according to a preset distribution rule. According to the technical scheme, the matching efficiency and effectiveness of the cargo transportation scheme can be improved, the equipment operation burden is reduced, the resource waste is reduced, and the freight transportation requirements of users can be better met.

Description

Method, device, equipment and medium for determining cargo transportation scheme

Technical Field

The invention relates to the technical field of logistics, in particular to a method, a device, equipment and a medium for determining a cargo transportation scheme.

Background

With the rapid development of logistics technology, various industries generate a large amount of freight transportation requirements. Therefore, how to improve the efficiency of cargo transportation in the logistics process is a problem that needs to be solved urgently in logistics management. Typically, each logistics company will serve as a carrier of the goods and enter a network freight platform, and release a freight line which can be taken over by the logistics company on the platform.

In the related technology, all the freight schemes are compared according to the principle of optimal price or optimal time efficiency, and the optimal freight line is selected from the freight schemes. However, because there are many logistics companies residing on the freight platform, and each logistics company has a plurality of business outlets, the adoption of the comparison of all freight schemes will greatly increase the burden of equipment operation, thereby causing resource waste.

In addition, if the shipping scheme is selected only according to the principle of optimal price or time efficiency, it is inevitable that the matching shipping scheme cannot be realized because the logistics company cannot actually carry the goods. For example, the matched freight line cannot pass through actually due to epidemic situations or road maintenance, or the carrying capacity of the logistics company exceeds the carrying capacity of the logistics company within a certain period of time, so that the freight goal cannot be achieved. In this case, the matching freight scheme is far from the actual carrying scheme, so that the matching efficiency and effectiveness of the freight scheme are greatly reduced.

Disclosure of Invention

The invention provides a method, a device, equipment and a medium for determining a cargo transportation scheme, which can improve the matching efficiency and effectiveness of the cargo transportation scheme, reduce the operation burden of the equipment, reduce the resource waste and better meet the cargo transportation requirements of users.

According to an aspect of the present invention, there is provided a cargo transportation scheme determining method, the method including:

acquiring a starting position and an end position of a cargo transportation task;

determining a preset number of candidate transportation schemes according to the starting position and the ending position and a segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is taken charge of the carrying by one carrying body;

and determining a target transportation scheme in the preset number of candidate transportation schemes according to a preset distribution rule.

Optionally, determining a preset number of candidate transportation schemes according to the segment delivery rule according to the starting point position and the ending point position includes:

determining the number of segments from the starting position to the end position according to segment carrying rules;

and intercepting the transportation schemes of each segmentation mode in the sequence of the number of the segments from small to large so as to intercept a preset number of candidate transportation schemes.

Optionally, if the number of the transportation schemes for the same segment mode is at least two, the transportation schemes for the current segment mode are ranked according to the distance factors and/or cost factors of the transportation schemes.

Optionally, according to a preset allocation rule, determining a target transportation scheme in the preset number of candidate transportation schemes includes:

and determining a target transportation scheme in the preset number of candidate transportation schemes according to at least one of a rule with the fastest aging, a rule with the shortest route and a rule with the lowest cost.

Optionally, after determining the target transportation scenario among the preset number of candidate transportation scenarios, the method further includes:

determining one of the candidate transportation solutions as a candidate transportation solution if at least one segment of the target transportation solution is overloaded with carrier capacity.

Optionally, the process of determining that the capacity of the carrier body is overloaded includes:

acquiring the upper limit of the transport capacity of a carrier body;

acquiring the number of the carrying tasks accepted by the carrying main body;

and if the carrying task number reaches the upper limit of the transport capacity, determining that the transport capacity of the carrying body is overloaded.

Optionally, determining a target transportation plan in the preset number of candidate transportation plans according to at least one of a rule of fastest aging, a rule of shortest route, and a rule of lowest cost, includes:

determining at least one of an age score, a journey score and a cost score for each candidate transportation scenario;

sorting the candidate transportation schemes according to at least one of the aging score, the distance score and the cost score to obtain a sorting result;

and determining the candidate transportation scheme positioned at the head in the sorting result as the target transportation scheme.

According to another aspect of the present invention, there is provided a cargo transportation scheme determining apparatus, including:

the position acquisition module is used for acquiring a starting position and an end position of the cargo transportation task;

the candidate transportation scheme determining module is used for determining a preset number of candidate transportation schemes according to the starting point position and the end point position and a segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is carried by a carrier body;

and the target transportation scheme determining module is used for determining a target transportation scheme in the preset number of candidate transportation schemes according to a preset distribution rule.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to enable the at least one processor to perform the method of determining a cargo transportation scenario according to any of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a processor to implement the method for determining a cargo transportation scheme according to any one of the embodiments of the present invention when the computer instructions are executed.

According to the technical scheme of the embodiment of the invention, the starting position and the end position of the cargo transportation task are obtained; determining a preset number of candidate transportation schemes according to the starting position and the ending position and the segment carrying rule; the candidate transportation scheme is divided into at least one segment, and each segment is carried by a carrying body; and determining a target transportation scheme in a preset number of candidate transportation schemes according to a preset distribution rule. According to the technical scheme, the matching efficiency and effectiveness of the cargo transportation scheme can be improved, the equipment operation burden is reduced, the resource waste is reduced, and the freight transportation requirement of a user can be better met.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present invention, nor do they necessarily limit the scope of the invention. Other features of the present invention will become apparent from the following description.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.

Fig. 1 is a flowchart of a method for determining a cargo transportation scheme according to an embodiment of the present invention;

fig. 2 is a schematic diagram of matching of a candidate transportation scheme according to an embodiment of the present invention;

fig. 3 is a flowchart of a method for determining a cargo transportation scheme according to a second embodiment of the present invention;

fig. 4 is a schematic structural diagram of a cargo transportation scheme determining apparatus according to a third embodiment of the present invention;

fig. 5 is a schematic structural diagram of an electronic device implementing a method for determining a cargo transportation scheme according to an embodiment of the present invention.

Detailed Description

In order to make those skilled in the art better understand the technical solutions of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

It should be noted that the terms "first," "second," "target," and the like in the description and claims of the present invention and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Moreover, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example one

Fig. 1 is a flowchart of a method for determining a transportation scheme of a cargo according to an embodiment of the present invention, where this embodiment is applicable to a situation where a transportation scheme of a cargo is matched quickly and efficiently, and the method may be implemented by a device for determining a transportation scheme of a cargo, where the device for determining a transportation scheme of a cargo may be implemented in hardware and/or software, and the device for determining a transportation scheme of a cargo may be configured in an electronic device with data processing capability. As shown in fig. 1, the method includes:

and S110, acquiring a starting position and an end position of the cargo transportation task.

The technical scheme in the embodiment can be executed by a network freight platform, and is suitable for a use scene of quickly and effectively matching the segmented transportation scheme aiming at the cargo transportation task. The segmental transportation scheme may refer to a manner in which cargo transportation from a departure place to a destination is to be achieved by dividing a transportation section. For example, the goods can be directly transported from south to Beijing, i.e. the goods transportation route is divided into one transportation section from south to Beijing, i.e. the goods are directly transported. The goods can be transported from Nanjing to Tianjin and then from Tianjin to Beijing, namely the goods transportation line is divided into two transportation sections from Nanjing to Tianjin and from Tianjin to Beijing. It should be noted that, during the transportation of goods, the logistics company as the goods carrier can set up business outlets in multiple cities, and can only take over the transportation task of goods between the business outlets. Due to the regional limitation of business outlets, the goods transportation is often carried out in a sectional transportation mode.

Wherein the cargo transportation task may refer to an activity for indicating the transportation of the cargo. Specifically, the cargo transportation task may include a cargo type, a cargo weight, a departure place and a destination of the cargo transportation, a time limit requirement of the cargo transportation, and the like. The starting position may refer to a starting location of the shipment of the goods. The end location may refer to a destination location of the cargo transport. In this embodiment, when the cargo owner has a cargo transportation demand, the cargo transportation task can be issued on the network cargo transportation platform. After receiving the cargo transportation task issued by the cargo owner, the network cargo platform may obtain a departure location (starting location) and a destination location (end location) of the cargo transportation task.

S120, determining a preset number of candidate transportation schemes according to the starting point position and the end point position and the segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is carried by a carrying body.

The segment shipping rules may refer to preset segment shipping standards, and may be used to indicate how to segment the freight route. For example, the segment shipper rule may be set to divide the freight line into one segment, or may be set to divide the freight line into multiple segments. It will be appreciated that when the freight line is divided into sections, it is possible to go from the origin to the destination. The preset number may refer to a preset number of candidate transportation solutions. The candidate transportation scheme may refer to a transportation scheme to be selected. Specifically, the candidate transportation scheme is to divide at least one segment, and each segment is carried by a carrier body. The carrier may refer to a logistics company responsible for the transportation of goods. It should be noted that the candidate transportation scheme may be to divide one or more segments, and the specific segment condition corresponds to the segment carrying rule. Illustratively, the candidate transportation scenario is divided into a segment, which is carried by logistics company A; alternatively, the candidate transportation scheme is divided into two segments, segment 1 being carried by the B logistics company and segment 2 being carried by the C logistics company.

In this embodiment, the preset number of candidate transportation schemes may be determined according to the segment shipper rule according to the start position and the end position of the cargo transportation task. Optionally, determining a preset number of candidate transportation schemes according to the segment delivery rule according to the starting position and the ending position includes: determining the number of segments of each segment mode from the starting point position to the end point position according to segment carrying rules; and intercepting the transportation schemes of each segmentation mode in the sequence of the number of the segments from small to large so as to intercept a preset number of candidate transportation schemes.

The segmentation method may refer to dividing the freight transportation line into several segments. The number of segments may refer to a segment value corresponding to the segmentation mode. For example, assuming that the segmentation method is to divide the freight route into 3 segments, the number of segments is 3. In this embodiment, the number of segments in each segment from the departure point to the destination point may be determined according to the segment delivery rule. For example, assuming that the segment shipping rule is to divide the shipping route into multiple segments, the segmentation method may be set to 1 segment, 2 segment, 3 segment, etc. in sequence from 1 segment, and the corresponding number of segments is 1, 2, 3, etc. in sequence. And matching the freight lines according to the number of each section until the sum of the number of each freight line is equal to or greater than the preset number for the first time.

For example, assuming that the preset number is 6, 2 freight lines are matched in 1 section, 2 freight lines are matched in 2 sections, and 3 freight lines are matched in 3 sections. Therefore, if the segmentation mode only comprises a segment 1 and a segment 2, 4 freight lines can be matched in total, the number of the freight lines is less than the preset number, and the number requirement of the transportation scheme is not met; if the segmentation mode simultaneously comprises 1 segment division, 2 segment division and 3 segment division, 7 freight lines are matched, and the sum of the number of the freight lines is greater than the preset number for the first time, the number requirement of the transportation scheme can be met, and the matching is stopped at the moment. Therefore, it can be determined that the segmentation manner includes 1 segment, 2 segment, and 3 segment, and the corresponding number of segments is 1, 2, and 3, respectively.

In this embodiment, after determining the number of segments of each segment mode and the freight route (transportation plan) obtained by matching the number of segments, the transportation plans of each segment mode may be sorted in the order of the number of segments from small to large. That is, the transportation scheme of the number of segments 1 is ranked first, i.e., the transportation scheme of the number of segments 1 is set to the highest priority. And then intercepting the transportation schemes matched with the number of each segment according to the sequencing result so as to intercept the preset number of candidate transportation schemes. Based on the above example, after stopping matching, the matched 7 freight lines are sorted according to priority, the freight line ranked at the last is discarded, and the remaining 6 freight lines can be determined as candidate transportation schemes.

The route factor may refer to a total route factor for transporting the goods from the departure point to the destination. The cost factor may refer to a total cost factor for transporting goods from an origin to a destination. It is understood that the shorter the total distance, the shorter the transportation time, i.e. the higher the transportation efficiency; the lower the total cost, the lower the transportation price, i.e. the lower the transportation cost. Thus, shorter or less costly transportation solutions result in more cost effective freight transportation.

In this embodiment, if the number of transportation schemes for the same segment mode is at least two, the transportation schemes for the current segment mode may be sorted in order of the distance from small to large and/or the cost from low to high according to at least one of the distance factor and the cost factor of the transportation schemes. It should be noted that, when sorting the transportation schemes of each segment mode, the route factor or the cost factor of the transportation scheme may be only considered, or both factors may be considered at the same time.

Illustratively, based on the above example, after stopping matching, 7 matched freight lines are sorted. Since the segmentation modes include a segment 1, a segment 2 and a segment 3, and the number of the freight lines matched to each segmentation mode is 2, 2 and 3, respectively, it is necessary to sequence the freight lines of each segmentation mode respectively. Suppose that the freight paths in the section 1 are a1 and a2, the freight paths in the section 2 are b1 and b2, and the freight paths in the section 3 are c1, c2 and c 3. If the distance is sorted from small to large, the results of 1 segment are a1 and a 2; the results of 2 segmentations are b2, b 1; the results of the segmentation into 3 segments are c3, c1 and c2, and the final sorting results are a1, a2, b2, b1, c3, c1 and c 2.

Through the arrangement, the transportation schemes of the subsection modes can be sequenced according to the distance factors and/or the cost factors in a priority mode.

Fig. 2 is a schematic diagram of matching of a candidate transportation scenario according to an embodiment of the present invention. Fig. 2 is an example of the transportation of goods from south to beijing, i.e. the origin of the goods transportation task is south beijing and the destination is beijing. Wherein, a, B, and C denote different logistics companies (carriers), respectively.

Specifically, the logistics company capable of carrying the transportation lines from Nanjing to Beijing can be determined based on the transportation lines which can be carried and are released by the logistics company on the network transportation platform. Assuming that the preset quantity is 6, firstly, matching the freight transportation lines with the segmented quantity of 1, and finding 2 direct lines from Nanjing to Beijing (A) and Nanjing to Beijing (B), so as to determine 2 transportation schemes. And continuously matching the freight lines with the sectional quantity of 2 because the quantity of the transportation schemes is less than the preset quantity (2 < 6). 3 lines can be found in segment 1, namely Nanjing to Tianjin (A1), Nanjing to Xuzhou (A2) and Nanjing to Hainan (A3); segment 2 has 3 lines, Tianjin to Beijing (B0), Tianjin to Beijing (B1) and Xuzhou to Beijing (B2). The route from south of Hainan to Beijing (A3) was abandoned since no matching could be made to the freight route from Hainan to Beijing. From this, 3 transportation schemes were determined, namely Nanjing to Tianjin to Beijing (A1, B0), Nanjing to Tianjin to Beijing (A1, B1) and Nanjing to Xuzhou to Beijing (A2, B2).

At this time, the case that the number of segments is 1 and 2 determines 5 transportation schemes, the number of transportation schemes does not reach the preset number yet, and the freight line with the number of segments being 3 needs to be matched continuously. 2 lines can be found in segment 1, namely Nanjing to Hefei (A0) and Nanjing to Xuzhou (A1); there are 3 routes in segment 2, namely xu zhou to tianjin (B1), xu zhou to hainan (B2) and xu zhou to shijiazhuang (B3); segment 3 has 2 lines from Tianjin to Beijing (C1) and Shijiazhuang to Beijing (C2). The shipping lines from Nanjing to Hefei (A0) and from Nanjing to Xuzhou to Hainan (A1, B2) were abandoned because of the inability to match the shipping lines from Hefei to Beijing and from Hainan to Beijing. From this, 2 transportation schemes were identified, namely Nanjing to Xuzhou to Tianjin to Beijing (A1, B1, C1) and Nanjing to Xuzhou to Shijiazhuang to Beijing (A1, B3, C2). At this point a total of 7 transportation scenarios are determined, already greater than the preset number, so that the matching can be stopped. Further, the 7 transportation schemes are comprehensively sorted in the order of the distance from small to large and the cost from low to high by taking the same segment number as a unit, and the results are shown in table 1:

TABLE 1 transport scheme from Nanjing to Beijing

Where line a is ranked first (highest priority) and line g is ranked last (lowest priority). Since the number of the matched transportation schemes is larger than the preset number (7 is larger than 6), 1 line needs to be abandoned, and the number of the transportation schemes can be equal to the preset number. Thus, route g is discarded according to the ranking results, and routes a-f are retained and considered as candidate transportation solutions.

S130, determining a target transportation scheme in a preset number of candidate transportation schemes according to a preset distribution rule.

The preset allocation rule may refer to a preset allocation mode of the transportation scheme. For example, the preset allocation rule may be set based on a time factor or a cost factor. For example, the preset allocation rule may be set to select the candidate transportation scheme with the shortest transportation time or the candidate transportation scheme with the lowest transportation price. The target transportation scheme may refer to a transportation scheme determined from the candidate transportation schemes. In this embodiment, one of the preset number of candidate transportation schemes may be selected as the target transportation scheme according to a preset allocation rule.

Example two

Fig. 3 is a flowchart of a method for determining a cargo transportation plan according to a second embodiment of the present invention, which is optimized based on the second embodiment. The concrete optimization is as follows: determining a target transportation scheme in a preset number of candidate transportation schemes according to a preset distribution rule, wherein the method comprises the following steps: and determining a target transportation scheme in the preset number of candidate transportation schemes according to at least one of a rule with the fastest aging, a rule with the shortest route and a rule with the lowest cost.

As shown in fig. 3, the method of this embodiment specifically includes the following steps:

and S310, acquiring a starting position and an end position of the cargo transportation task.

S320, determining a preset number of candidate transportation schemes according to the starting position and the ending position and the segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is carried by a carrying body.

The implementation manners of S310-S320 can be referred to the detailed descriptions in S110-S120.

S330, determining a target transportation scheme in the preset number of candidate transportation schemes according to at least one of a rule with the fastest aging, a rule with the shortest route and a rule with the lowest cost.

In this embodiment, one of the preset number of candidate transportation schemes may be selected and determined as the target transportation scheme according to at least one of a rule with the fastest aging, a rule with the shortest route, and a rule with the lowest cost. It should be noted that, when determining the target transportation scenario, one of the fastest-time rule, the shortest-route rule, and the lowest-cost rule may be used, that is, only a single factor is considered, or each rule may be combined, that is, multiple factors are considered at the same time.

According to the technical scheme of the embodiment of the invention, on the basis of determining the target transportation scheme in the preset number of candidate transportation schemes according to the preset allocation rule, the factors of timeliness, distance and cost can be fully considered, the matching efficiency and effectiveness of the cargo transportation scheme can be further improved, the equipment operation burden is reduced, the resource waste is reduced, and the freight transportation requirement of a user can be better met.

In this embodiment, optionally, after determining the target transportation scenario among the preset number of candidate transportation scenarios, the method further includes: if at least one segment of the target transportation solution is overloaded with carrier capacity, then one is determined from the candidate transportation solutions as a candidate transportation solution.

The condition that the transport capacity of the carrier body is overloaded can be understood as that the cargo transportation task amount exceeds the transport capacity which can be borne by the carrier body. The alternate transportation solution may refer to an alternate transportation solution selected from the candidate transportation solutions in addition to the target transportation solution.

In this embodiment, after the target transportation plan is determined among the preset number of candidate transportation plans, the carrying capacity of each segment carrying body may be estimated, and whether the carrying capacity of each segment carrying body has been overloaded or not may be determined according to the respective cargo transportation task amounts carried by each segment carrying body. If at least one segment of the target transportation plan is overloaded, the efficiency of the cargo transportation will be affected, and at this time, the determined target transportation plan may be discarded, and one transportation plan is selected from the candidate transportation plans as a candidate transportation plan, and the candidate transportation plan is determined as the final target transportation plan. Likewise, alternate transportation schemes may be determined based on time or cost factors. For example, the transportation option with the shortest transportation time or the lowest transportation price may be selected as the alternate transportation option.

Through the arrangement, the target transportation scheme can be adjusted in time according to the carrying capacity of each segmented carrying body of the target transportation scheme, so that the influence on the cargo transportation efficiency due to the fact that the carrying body can not actually carry the goods is avoided.

In this embodiment, optionally, the process of determining the overload of the transport capacity of the carrier includes: acquiring the upper limit of the transport capacity of a carrier body; acquiring the number of the carrying tasks accepted by a carrying subject; and if the carrying task number reaches the upper limit of the transport capacity, determining that the transport capacity of the carrying body is overloaded.

The upper limit of the transport capacity may refer to the limit of the carrying capacity of the carrier body, and may be used to indicate how many cargo transportation tasks the carrier body can perform at most. The number of shipping tasks may refer to the number of cargo shipping tasks undertaken by the shipping body. In this embodiment, whether the capacity of the carrier body is overloaded may be determined according to the upper limit of the capacity of the carrier body and the number of the carrier tasks. Specifically, the upper limit of the transport capacity of the carrier body and the number of actually accepted carrier tasks are acquired first. Then comparing the upper limit of the transport capacity of the carrier body with the actually accepted number of the carrying tasks, and if the number of the carrying tasks reaches the upper limit of the transport capacity, determining that the transport capacity of the carrier body is overloaded; conversely, if the number of carrier tasks does not reach the capacity cap, it may be determined that the carrier entity capacity is not overloaded.

By means of the arrangement, whether the transport capacity of the carrier body is overloaded or not can be determined according to the upper limit of the transport capacity of the carrier body and the number of the carrying tasks.

In this embodiment, optionally, determining the target transportation plan among the preset number of candidate transportation plans according to at least one of a rule with the fastest aging, a rule with the shortest route, and a rule with the lowest cost includes: determining at least one of an age score, a journey score and a cost score for each candidate transportation scenario; sequencing the candidate transportation schemes according to at least one of the timeliness score, the route score and the cost score to obtain a sequencing result; and determining the candidate transportation scheme positioned at the head in the sorting result as the target transportation scheme.

Wherein the aging score, the trip score, and the cost score may refer to the aging score, the trip score, and the cost score, respectively, of the candidate transportation scenario. In this embodiment, at least one of the time score, the route score, and the cost score of each candidate transportation scenario is first determined. Specifically, the aging score, the journey score, and the cost score may be determined based on the aging factor, the journey factor, and the cost factor of the candidate transportation scenario, respectively. For example, taking route factors as an example, assuming that a total of 3 candidate transportation plans H1, H2, and H3 correspond to routes of 50 km, 100 km, and 200 km, respectively, route scores of H1, H2, and H3 may be directly determined as 1, 2, and 3, respectively, or a route score corresponding to the maximum route may be set as 100, and then other route scores may be determined according to a proportional relationship, that is, route scores of H1, H2, and H3 may be determined as 25, 50, and 100, respectively. And sequencing the candidate transportation schemes according to at least one of the time efficiency score, the route score and the cost score, and determining the first candidate transportation scheme as a target transportation scheme according to a sequencing result.

It should be noted that, in the present embodiment, each candidate transportation scenario may be ranked according to one or more of the age score, the journey score, and the cost score, and the determination manner of the age score, the journey score, and the cost score is not limited at all.

Through the arrangement, the candidate transportation schemes can be sequenced according to at least one of the time efficiency score, the route score and the cost score, and then the target transportation scheme is determined.

EXAMPLE III

Fig. 4 is a schematic structural diagram of a device for determining a cargo transportation scheme according to a third embodiment of the present invention, where the device is capable of executing a method for determining a cargo transportation scheme according to any embodiment of the present invention, and has functional modules and beneficial effects corresponding to the execution method. As shown in fig. 4, the apparatus includes:

a position obtaining module 410, configured to obtain a start position and an end position of the cargo transportation task;

a candidate transportation scheme determining module 420, configured to determine a preset number of candidate transportation schemes according to the starting point position and the ending point position and according to a segment delivery rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is taken charge of the carrying by one carrying body;

and a target transportation scheme determining module 430, configured to determine a target transportation scheme among the preset number of candidate transportation schemes according to a preset allocation rule.

Optionally, the candidate transportation scheme determining module 420 includes:

the segment number determining unit is used for determining the segment number of each segment mode from the starting position to the end position according to segment carrying rules;

and the candidate transportation scheme determining unit is used for intercepting the transportation schemes of the segmentation modes in the sequence of the number of the segments from small to large so as to intercept the preset number of the candidate transportation schemes.

Optionally, the candidate transportation scheme determining module 420 is specifically configured to:

and if the number of the transportation schemes for the same segmentation mode is at least two, sequencing the transportation schemes of the current segmentation mode according to the distance factors and/or cost factors of the transportation schemes.

Optionally, the target transportation scheme determining module 430 includes:

and the target transportation scheme determining unit is used for determining a target transportation scheme in the preset number of candidate transportation schemes according to at least one of a rule with the fastest time efficiency, a rule with the shortest route and a rule with the lowest cost.

Optionally, the target transportation scheme determining module 430 further includes:

a candidate transportation scheme determining unit, configured to determine one candidate transportation scheme from the candidate transportation schemes if at least one segmented carrier body transportation capacity of the target transportation scheme is overloaded after determining the target transportation scheme among the preset number of candidate transportation schemes.

acquiring the upper limit of the transport capacity of a carrier body;

acquiring the number of the carrying tasks accepted by the carrying main body;

Optionally, the target transportation scheme determining unit is specifically configured to:

sequencing all candidate transportation schemes according to at least one of the timeliness score, the route score and the cost score to obtain a sequencing result;

The device for determining the cargo transportation scheme provided by the embodiment of the invention can execute the method for determining the cargo transportation scheme provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method.

Example four

FIG. 5 illustrates a schematic diagram of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 5, the electronic device 10 includes at least one processor 11, and a memory communicatively connected to the at least one processor 11, such as a Read Only Memory (ROM)12, a Random Access Memory (RAM)13, and the like, wherein the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various suitable actions and processes according to the computer program stored in the Read Only Memory (ROM)12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data necessary for the operation of the electronic apparatus 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to the bus 14.

A number of components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, or the like; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The processor 11 performs the various methods and processes described above, such as the determination of a cargo transportation scheme.

In some embodiments, the method of determining a cargo transportation scheme may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the method of determining a cargo transportation scheme described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured by any other suitable means (e.g., by means of firmware) to perform the method of determining the cargo transportation scheme.

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Computer programs for implementing the methods of the present invention can be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be performed. A computer program can execute entirely on a machine, partly on a machine, as a stand-alone software package partly on a machine and partly on a remote machine or entirely on a remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. A computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service are overcome.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present invention may be executed in parallel, sequentially, or in different orders, and are not limited herein as long as the desired results of the technical solution of the present invention can be achieved.

The above-described embodiments should not be construed as limiting the scope of the invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method of determining a cargo transportation solution, the method comprising:

determining a preset number of candidate transportation schemes according to the starting position and the ending position and a segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is carried by a carrier body;

2. The method of claim 1, wherein determining a preset number of candidate transportation solutions according to segment carrier rules based on the starting and ending locations comprises:

3. The method according to claim 2, characterized in that if the number of transportation schemes for the same segment mode is at least two, the transportation schemes of the current segment mode are sorted according to the distance factor and/or the cost factor of the transportation schemes.

4. The method of claim 1, wherein determining a target transportation scheme among the preset number of candidate transportation schemes according to a preset allocation rule comprises:

5. The method of claim 4, wherein after determining a target transportation scheme among the preset number of candidate transportation schemes, the method further comprises:

6. The method of claim 5, wherein the determining that the carrier capacity is overloaded comprises:

acquiring the upper limit of the transport capacity of a carrier body;

acquiring the number of the carrying tasks accepted by the carrying main body;

7. The method of claim 4, wherein determining a target transportation solution among the predetermined number of candidate transportation solutions according to at least one of a fastest aging rule, a shortest route rule, and a least cost rule comprises:

determining at least one of an age score, a journey score, and a cost score for each candidate transportation scenario;

8. An apparatus for determining a cargo transportation scheme, the apparatus comprising:

the candidate transportation scheme determining module is used for determining a preset number of candidate transportation schemes according to the starting point position and the ending point position and a segment carrying rule; wherein, the candidate transportation scheme is to divide at least one segment, and each segment is carried by a carrier body;

9. An electronic device, characterized in that the electronic device comprises:

at least one processor; and

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of determining a cargo transportation scheme of any of claims 1-7.

10. A computer-readable storage medium storing computer instructions for causing a processor to perform the method of determining a cargo transportation scenario of any of claims 1-7 when executed.