CN113554372A

CN113554372A - Route generation method, device, equipment and storage medium

Info

Publication number: CN113554372A
Application number: CN202010327473.8A
Authority: CN
Inventors: 杨昌鹏; 陈帆影
Original assignee: Shenzhen SF Taisen Holding Group Co Ltd
Current assignee: Shenzhen SF Taisen Holding Group Co Ltd
Priority date: 2020-04-23
Filing date: 2020-04-23
Publication date: 2021-10-26

Abstract

The embodiment of the application discloses a method, a device, equipment and a storage medium for generating a route. The route generation method comprises the following steps: determining an optional route of each cargo to be transported according to the origin and the destination of each cargo to be transported; determining first route combinations of the cargos to be transported and the number T of first vehicles required by each path arc ij under each first route combination according to preset constraint conditions_ij(ii) a According to the first vehicle number T_ijDetermining a first routing cost for each of said first routing combinations; and acquiring a target first route combination from the first route combination, and outputting a first target route of each to-be-transported cargo under the target first route combination. The embodiment of the application can reduce logistics cost, improve distribution efficiency to a certain extent and accelerate route planning.

Description

Route generation method, device, equipment and storage medium

Technical Field

The embodiment of the application relates to the technical field of logistics, in particular to a route generation method, a device, equipment and a storage medium.

Background

In the field of logistics, route planning is an important link in logistics distribution. The reasonable routing planning can effectively reduce the logistics cost and improve the distribution efficiency. The manual route planning is mainly completed manually by experienced network planning personnel, and the logistics cost can be reduced and the distribution efficiency can be improved to a certain extent through the manual route planning.

However, due to the large amount of cargo involved in the large-scale logistics network, it is difficult to manually perform route planning while taking into account all constraints (such as cargo flow direction, cargo aging, etc.), resulting in a non-optimal route being planned (i.e., it is difficult to effectively reduce logistics cost and effectively improve distribution efficiency). And, the time required for manual planning is long.

Disclosure of Invention

The embodiment of the application provides a route generation method, a device, equipment and a storage medium, which can reduce logistics cost to a certain extent, improve distribution efficiency and accelerate route planning.

In a first aspect, an embodiment of the present application provides a method for generating a route, where the method includes:

determining an optional route of each cargo to be transported according to the origin and the destination of each cargo to be transported, wherein the optional route refers to a plurality of transit fields or operation places which are sequentially passed by the cargo to be transported from the origin to the destination;

determining first route combinations of the cargos to be transported and the number T of first vehicles required by each path arc ij under each first route combination according to preset constraint conditions_ijWherein i belongs to N, j belongs to N, N represents the set of all transition and operation places, and the first route combination refers to the combination of selectable routes of the goods to be transported;

according to the first vehicle number T_ijDetermining a first routing cost for each of said first routing combinations;

and acquiring a target first route combination from the first route combinations, and outputting a first target route of each to-be-transported cargo under the target first route combination, wherein the target first route combination is the first route combination with the smallest first route expenditure.

In some embodiments of the present application, the preset constraint condition includes at least one of defining a maximum cargo amount of each path arc ij, and defining a transportation aging of each of the to-be-transported cargoes, where the transportation aging refers to an earliest time of departure of the to-be-transported cargoes from an origin and a latest time of arrival at a destination.

In some embodiments of the subject application, the first number of vehicles T is based on the first number of vehicles_ijDetermining a first routing cost for each of said first routing combinations, comprising:

mileage according to each path arc ij and the first vehicle number T_ijDetermining the transport expenditure corresponding to each path arc ij, and determining the transfer expenditure of each to-be-transported cargo according to the cargo quantity of each to-be-transported cargo;

determining a first routing cost for each of the first routing combinations based on the transportation costs and the transit costs.

In some embodiments of the present application, the outputting the first target route of each of the goods to be transported in the target first route combination further includes:

determining a second route combination of each first to-be-transported cargo according to the selectable routes of the first to-be-transported cargo, wherein the first to-be-transported cargo refers to the to-be-transported cargo meeting preset conditions, and the second route combination refers to the combination of the selectable routes of each first to-be-transported cargo;

determining a second number of vehicles T required by each path arc ij under each second route combination according to the first target route of the second to-be-transported cargo_i'_jThe second goods to be transported are the goods to be transported which do not meet the preset conditions;

according to the second vehicle number T_i'_jDetermining a second route cost for each of said second route combinations;

and acquiring a target second route combination from the second route combination, and outputting a second target route of each first to-be-transported cargo under the target second route combination and the first target route of the second to-be-transported cargo, wherein the target second route combination is the second route combination with the minimum second route expenditure.

In some embodiments of the present application, the second number of vehicles T 'required for each path arc ij under each of the second routing combinations is determined from the first target route of a second shipment to be transported'_ijThe method comprises the following steps:

determining a first cargo quantity of each path arc ij under each first route combination according to the first target route of a second cargo to be transported, the route of each first cargo to be transported under each second route combination and the cargo quantity of each cargo to be transported;

determining a second vehicle number T 'required by each path arc ij under each first routing combination according to the first cargo amount according to each path arc ij'_ij。

In some embodiments of the present application, the determining a first number of vehicles T required for each path arc ij under each of the first routing combinations_ijThe method comprises the following steps:

determining a second cargo quantity of each path arc ij under each first routing combination according to the route of each cargo to be transported under each first routing combination and the cargo quantity of each cargo to be transported;

determining a first number of vehicles T required by each path arc ij under each first route combination according to the second cargo quantity of each path arc ij_ij。

In some embodiments of the present application, the obtaining a target first routing combination from the first routing combinations further includes:

and outputting the actual vehicle number required by each path arc ij under the target first route combination.

In a second aspect, an embodiment of the present application provides a route generation apparatus, where the route generation apparatus includes:

the first determining unit is used for determining an optional route of each cargo to be transported according to the origin and the destination of each cargo to be transported, wherein the optional route refers to a plurality of transit fields or operation places which are sequentially passed by the cargo to be transported from the origin to the destination;

a second determining unit, configured to determine, according to a preset constraint condition, a first route combination of each to-be-transported cargo, and a first number T of vehicles required for each path arc ij under each first route combination_ijWherein i belongs to N, j belongs to N, N represents the set of all transition and operation places, and the first route combination refers to the combination of selectable routes of the goods to be transported;

a third determination unit for determining the number of vehicles T according to the first number of vehicles_ijDetermining a first routing cost for each of said first routing combinations;

a generating unit, configured to obtain a target first route combination from the first route combinations, and output a first target route of each to-be-transported cargo under the target first route combination, where the target first route combination is a first route combination with a smallest first route expenditure.

In some embodiments of the present application, the second determining unit is further specifically configured to:

determining a first route combination of the goods to be transported and a first vehicle number T required by each path arc ij under each first route combination by taking at least one of the maximum cargo quantity for each path arc ij and the transportation time limit for each goods to be transported as the preset constraint condition_ijThe transportation aging refers to the earliest time for the goods to be transported to be sent from the origin and the latest time for the goods to be transported to reach the destination.

In some embodiments of the present application, the third determining unit is further specifically configured to:

In some embodiments of the application, after the step of outputting the first target route of each to-be-transported good under the target first route combination, the generating unit is further specifically configured to:

determining a second number of vehicles T 'required for each path arc ij under each second route combination according to the first target route of a second to-be-transported cargo'_ijThe second goods to be transported are the goods to be transported which do not meet the preset conditions;

according to the second vehicle number T'_ijDetermining a second route cost for each of said second route combinations;

In some embodiments of the present application, the generating unit is further specifically configured to:

In some embodiments of the application, after the step of obtaining the target first routing combination from the first routing combination, the generating unit is further specifically configured to:

In a third aspect, an embodiment of the present application further provides a route generation device, where the route generation device includes a processor and a memory, where the memory stores a computer program, and the processor executes, when calling the computer program in the memory, any one of the steps in the route generation method provided in the embodiment of the present application.

In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is loaded by a processor to execute the steps in the route generation method.

As can be seen from the above, the embodiments of the present application have the following beneficial effects:

the method comprises the steps that all routable routes of the goods to be transported are determined according to the origin and the destination of each goods to be transported; then, according to preset constraint conditions, combining the selectable routes of the cargos to be transported to obtain first route combinations, and determining the required route expenditure under each first route combination; finally, the combination with the minimum route expenditure is selected from all the first route combinations, and the target route of each to-be-transported cargo under the combination is output. On one hand, the routing planning of a large number of transitions and a large number of cargos is realized, the routing expenditure is reduced, and meanwhile, the routing planning is not manually completed, so that the routing planning speed is increased.

On the other hand, the first route combination is determined through preset constraint conditions (such as the transportation time limit of the goods to be transported and the maximum cargo quantity of each path arc ij), so that the generated route can meet the time limit of the goods to be transported, the available vehicles on each path arc ij can meet the transportation requirement, and the like; and at the same time, the data processing amount can be reduced.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic flow chart of an embodiment of a route generation method provided in an embodiment of the present application;

fig. 2 is a schematic diagram of a scenario of a transition involved in route planning in an embodiment of the present application;

FIG. 3 is a schematic flow chart diagram illustrating one embodiment of step 30 provided in an embodiment of the present application;

fig. 4 is a schematic flow chart of another embodiment of a route generation method provided in the embodiment of the present application;

fig. 5 is a schematic structural diagram of an embodiment of a route generation apparatus provided in an embodiment of the present application;

fig. 6 is a schematic structural diagram of an embodiment of a route generation device provided in the embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, 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 application.

In the description of the embodiments of the present application, it should be understood that the terms "first", "second", and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any number of technical features indicated. Thus, features defined as "first", "second", may explicitly or implicitly include one or more of the described features. In the description of the embodiments of the present application, "a plurality" means two or more unless specifically defined otherwise.

The following description is presented to enable any person skilled in the art to make and use the application. In the following description, details are set forth for the purpose of explanation. It will be apparent to one of ordinary skill in the art that the present application may be practiced without these specific details. In other instances, well-known processes have not been described in detail so as not to obscure the description of the embodiments of the present application with unnecessary detail. Thus, the present application is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed in the embodiments herein.

First, before describing the embodiments of the present application, the related contents of the embodiments of the present application with respect to the application context will be described.

The route planning model of the large-scale logistics network is applied to the large-scale logistics network, data such as the quantity of goods, the time efficiency and the product type among all flow directions are given, and the direct or transit paths of the goods among the flow directions are planned so as to reach a target city within the given time efficiency. Wherein, the flow direction refers to a combination of an original city- > a destination city; age refers to the earliest departure time and the latest arrival time, and routing refers to the transit sequence by which the goods arrive at the destination from the origin.

In the past, the goods route planning among the flow directions is mainly completed manually by experienced network planners, the planning complexity is high, the time consumption is long, and uniform planning standards and technical sediment are difficult to form along with the loss of the planners. Meanwhile, with the expansion of services and the enlargement of problem scale, it is difficult for manual work to consider the routing planning of all flow directions from the global perspective so as to optimize the logistics cost, only local adjustment can be performed, the optimal solution cannot be achieved, and the logistics cost is high.

Based on the above-mentioned defects existing in the prior art, the embodiments of the present application provide a route generation method, which overcomes the defects existing in the prior art at least to a certain extent.

The execution main body of the route generation method in the embodiment of the present application may be the route generation apparatus provided in the embodiment of the present application, or different types of route generation devices such as a server device, a physical host, or a User Equipment (UE) integrated with the route generation apparatus, where the route generation apparatus may be implemented in a hardware or software manner, and the UE may specifically be a terminal device such as a smart phone, a tablet computer, a notebook computer, a palm computer, a desktop computer, or a Personal Digital Assistant (PDA).

The route generation device can adopt a working mode of independent operation or a working mode of a device cluster, and by applying the route generation method provided by the embodiment of the application, the logistics cost can be reduced to a certain extent, the distribution efficiency can be improved, and the route planning speed can be accelerated.

In the following, a route generating method provided in an embodiment of the present application is introduced, where a route generating device is used as an execution subject, and for simplicity and convenience of description, the execution subject will be omitted in subsequent method embodiments, and the route generating method includes: determining an optional route of each cargo to be transported according to the origin and the destination of each cargo to be transported; determining first route combinations of the cargos to be transported and the number T of first vehicles required by each path arc ij under each first route combination according to preset constraint conditions_ij(ii) a According to the first vehicle number T_ijDetermining a first routing cost for each of said first routing combinations; and acquiring a target first route combination from the first route combination, and outputting a first target route of each to-be-transported cargo under the target first route combination.

Referring to fig. 1, fig. 1 is a schematic flow chart of a route generation method according to an embodiment of the present application. It should be noted that, although a logical order is shown in the flow chart, in some cases, the steps shown or described may be performed in an order different than that shown or described herein. The route generation method includes steps S10-S40, wherein:

and S10, determining an optional route of each cargo to be transported according to the origin and the destination of each cargo to be transported.

The selectable route refers to a plurality of transfer places or operation places which are sequentially passed by the goods to be transported from the origin to the destination.

Before the detailed description, the transitions, the operating places, and the path arcs ij mentioned in the embodiments of the present application will be explained. The transfer site is a site for transferring goods to be transported passing between an origin and a destination, and the operation site is an origin site (i.e., the origin) or a destination site (i.e., the destination) of the goods to be transported. The staging and operational grounds are for the particular cargo to be transported, and the staging of one cargo to be transported may be the operational grounds of another cargo. For convenience of description, the concepts of the transition and the operation place will not be distinguished in detail in the following, and the transition and the operation place will be collectively referred to as the transition.

The path arc ij refers to a path between two feasible transitions (transition i, transition j), and if not specifically stated, the subsequent path arc ij is used to refer to a path between two feasible transitions in all the transitions involved in the routing planning.

To facilitate an understanding of how to determine the alternative routes for each shipment, an example of a feasible path between two transitions is first presented. For example, referring to FIG. 2, the path from A to E has: a- > B- > D- > E; ② A- > B- > C- > E; ③ A- > B- > D- > B- > C- > E; a- > B- > D- > B- > D- > E; and so on. It follows that the feasible paths from a to E cannot be exhausted because the transit field can repeatedly pass through.

Specifically, first, all feasible paths for each cargo to be transported from its origin (i.e., one of all transitions) to its destination (i.e., one of all transitions) are determined with the constraint that the number of times the same transition passes is less than or equal to 1.

Then, a transit station through which each feasible path of each cargo to be transported passes in sequence is determined. And taking the transit where each feasible path of each to-be-transported goods passes through in sequence as an optional route of each to-be-transported goods. Similarly, all the selectable routes of each cargo to be transported can be determined from all the feasible routes of each cargo to be transported.

An example is given below to illustrate how the alternative route for the goods to be transported can be determined based on the origin and destination of the goods to be transported. Referring to fig. 2, fig. 2 is a schematic view of a scenario of a transition involved in route planning in an embodiment of the present application. A, B, C, D, E, F, G in FIG. 2 indicates transitions, where a line between any two transitions indicates traversable (i.e., a path arc).

For example, if the origin of the cargo 1 is a and the destination is F, and the number of passes of the same transfer is less than or equal to 1 as the constraint condition, all the feasible routes for the cargo 1 to be transported from the origin (a) to the destination (F) are: a- > B- > D- > E- > F; ② A- > B- > C- > E- > F; ③ A- > B- > C- > E- > G- > F; and a- > B- > D- > E- > G- > F.

Thus, cargo 1 has 4 alternative routes, respectively: a- > B- > D- > E- > F; ② A- > B- > C- > E- > F; ③ A- > B- > C- > E- > G- > F; and a- > B- > D- > E- > G- > F.

S20, determining first route combinations of the cargos to be transported according to preset constraint conditions, and determining the number T of first vehicles required by each path arc ij under each first route combination_ij。

Wherein i belongs to N, j belongs to N, N represents the set of all transition and operation places, and the first route combination refers to the combination of selectable routes of each goods to be transported.

Specifically, the "determining the first routing combination of each cargo to be transported" specifically includes the following steps (1) and (2), wherein:

(1) determining all combinations of selectable routes for each cargo to be transported.

For example, cargo 1 has 2 selectable routes (a1, a2), cargo 2 has 2 selectable routes (B1, B2), and cargo 3 has 1 selectable route (C1). The total number of combinations of the optional routes for the respective cargo to be transported (i.e., cargo 1, cargo 2, and cargo 3) is 2 × 1 — 12, which are: the formula of the material comprises (a) 1, B1, C1, (B) 2, B1, C1, (B) 2, B2, C1, (B) 1, B2 and C1.

(2) And finding out a combination which meets preset constraint conditions from all combinations of the selectable routes of the cargos to be transported as a first route combination.

The preset constraint conditions may be various, for example, a maximum cargo amount for each path arc ij is defined, a transportation time limit for each item to be transported is defined, and the transportation time limit refers to the earliest time when the item to be transported is sent from the origin and the latest time when the item to be transported reaches the destination.

Aiming at different constraint conditions, the modes of determining the first route combination in the step (2) are different; specific embodiments of determining the first routing combination according to specific constraints are described in detail in the following steps (a1) - (a3) and steps (b1) - (b), and will not be described herein again.

"determining the number of first vehicles T required for each path arc ij for each first route combination_ijSpecifically, the method comprises the following steps (3) to (5):

(3) and determining the arc of each path passed by each cargo to be transported under the condition of each first route combination.

For example, the cargo to be transported includes cargo 1, cargo 2, and cargo 3. If the first route combination is: alternative route a1(A- > B- > D) for cargo 1, alternative route B1(B- > D- > E) for cargo 2, and alternative route c1(D- > E- > F) for cargo 3, then under this first route combination, the arc of the path traveled by cargo 1 is: AB. BD, the path arc traversed by the cargo 2 is: BD. DE, the arc of the path traversed by the cargo 3 is: DE. And EF. For ease of understanding, reference may be made to fig. 2.

If the first route combination is: alternative route a2(a- > B- > C- > E- > D for cargo 1, alternative route B2(B- > C- > E) for cargo 2, and alternative route C2(D- > E- > G- > F) for cargo 3, then under this first route combination, the arc of the path traveled by cargo 1 is: AB. BC, CE, ED, the path arc traversed by the cargo 2 is: BC. CE, the path arc traversed by cargo 3 is: DE. EG, GF. For ease of understanding, reference may be made to fig. 2.

(4) And under the condition of each first route combination, determining the cargo quantity on each path arc ij according to each path arc passed by each cargo to be transported and the cargo quantity of each cargo to be transported.

For convenience of understanding, the description is continued with the example in the above step (3). For example, if the first route combination is: alternative route a1 for cargo 1 (cargo amount of 200kg), alternative route b1 for cargo 2 (cargo amount of 100kg), and alternative route c1 for cargo 3 (cargo amount of 50 kg).

All transit points involved in this route planning are shown in fig. 2, that is, the path arcs ij involved in this route planning include: AB (via cargo: cargo 1), BC (via cargo: none), CE (via cargo: none), BD (via cargo: cargo 1, cargo 2), DE (via cargo: cargo 2, cargo 3), EG (via cargo: none), EF (via cargo: cargo 3), FG (via cargo: none).

Thus, the amount of cargo on each path arc ij is determined as: AB (cargo amount is 200kg), BC (cargo amount is 0), CE (cargo amount is 0), BD (cargo amount is 200kg +100kg is 300kg), DE (cargo amount is 100kg +50kg is 150kg), EG (cargo amount is 0), EF (cargo amount is 50kg), and FG (cargo amount is 0).

For ease of understanding, the direction of the path arc is not considered in this example. It will be appreciated that further, 2 differently directed path arcs may be formed between the 2 transitions; e.g., transitions m and n, may form path arcs mn and nm.

(5) Under the condition of each first route combination, determining the first vehicle number T required by each path arc ij according to the cargo quantity on each path arc ij and the cargo capacity of each vehicle_ij。

For convenience of understanding, the description is continued following the example in the above step (4). For example, the cargo capacity of each vehicle is 100kg, and each is determinedA first number of vehicles T required for each path arc ij_ijRespectively as follows: AB (200kg/100kg ═ 2, T_AB＝2)、BC(T_BC＝0)、CE(T_CE＝0)、BD(300kg/100kg＝3，T_BD＝3)、DE(150kg/100kg＝1.5，T_DE＝2)、EG(T_EG＝0)、EF(50kg/100kg＝0.5，T_EF＝1)、FG(T_FG0). It can be seen that in actual calculations, there may be decimal situations (the amount of cargo per path arc ij/the amount of cargo per vehicle), so when there are decimal places T_ijThe integer portion (the amount of cargo per arc ij/load per vehicle) is incremented by 1 to ensure that the cargo per arc ij can be transported.

Further, since some goods are not detachable as a whole, in the calculation, T should be determined according to the specific goods quantity of each goods to be transported_ij。

Further, "determine the first number of vehicles T required for each path arc ij_ijThe method specifically comprises the following steps: determining a first number of vehicles required for each path arc ij

Wherein, V represents a vehicle type; for example,

indicating that 3 14 tonnes of cars are required for arc ij of the path.

S30, according to the first vehicle number T_ijDetermining a first routing cost for each of the first routing combinations.

In particular, on the one hand, at each first routing combination, a first number of vehicles T is required according to the fixed payout of each vehicle and each path arc ij_ijAnd determining the fixed expenditure of the vehicle. For example, the path arcs ij involved in this route planning include: AB (T)_ij＝3)、BC(T_ij＝2)、CD(T_ij1), if the fixed expenditure of each vehicle is 200 yuan, the fixed expenditure of the vehicle is (3+2+1) × 200 ═ 1200 yuan.

On the other hand, under each first routing combination, what is required according to each path arc ijFirst number of vehicles T_ijThe mileage of each path arc ij, and the mileage expenditure unit, the mileage expenditure of the vehicle is determined. For example, the path arcs ij involved in this route planning include: AB (mileage of 10 ㎞, T)_ij3), BC (mileage of 15 ㎞, T_ij2), CD (mileage of 20 ㎞, T_ij1), if the unit mileage expenditure is 10 yuan, the mileage expenditure of the vehicle is (10 × 3+15 × 2+20 × 1) × 10 ═ 800 yuan.

Finally, it is determined that the first route payout is the sum of the fixed payout of the vehicle and the mileage payout of the vehicle at each of the first route combinations.

S40, obtaining a target first route combination from the first route combinations, and outputting the first target route of each to-be-transported goods under the target first route combination.

Wherein the target first route combination refers to the first route combination with the smallest first route payout. The first target route refers to an optional route for each cargo to be transported in the case of a target first route combination. The first target route is used for indicating a route planning result of the goods to be transported.

For ease of understanding, a specific example is illustrated.

For example, the first route combinations of the respective goods to be transported (goods 1 and goods 2) are 3 kinds, which are: the materials include (i) A1, B1, (ii) A2, B1, and (iii) A2, B2. The first route of the first route combination (r) A1 and B1 is paid out 200 yuan, the first route of the first route combination (r) A2 and B1 is paid out 300 yuan, and the first route of the first route combination (r) A2 and B2 is paid out 400 yuan.

First, a first route combination (r a1, B1) having the smallest first route payout is acquired from among the first route combinations (r a1, B1, r a2, B1, r a2, B2) as a target first route combination.

Then, the alternative routes (alternative route a1 for cargo 1, alternative route B1 for cargo 2) for each of the cargos to be transported (cargo 1 and cargo 2) in the case of the target first route combination are output, and thus, the routing planning of the cargos to be transported is completed.

Specifically, in some embodiments of the present application, the manner of outputting the first target route of each to-be-transported goods may be that the first target route of each to-be-transported goods is output by the following formula value, where the formula is:

wherein the content of the first and second substances,

indicating whether the first target route for item k traverses path arc ij. If it is

The first target route representing cargo k traverses path arc ij (i.e., the route generated for cargo k traverses path arc ij). If it is

It indicates that the first target route for cargo k does not traverse path arc ij (i.e., the route generated for cargo k does not traverse path arc ij).

In the embodiment of the application, all the routable routes of the goods to be transported are determined according to the origin and the destination of each goods to be transported; then, according to preset constraint conditions, combining the selectable routes of the cargos to be transported to obtain first route combinations, and determining the required route expenditure under each first route combination; finally, the combination with the minimum route expenditure is selected from all the first route combinations, and the target route of each to-be-transported cargo under the combination is output. On one hand, the routing planning of a large number of transitions and a large number of cargos is realized, the routing expenditure is reduced, and meanwhile, the routing planning is not manually completed, so that the routing planning speed is increased.

Because there may be multiple selectable routes for each to-be-transported cargo and multiple total to-be-transported cargo, the number of first route combinations is large, and if a target first route combination with the smallest route expenditure needs to be found from all the first route combinations, the route expenditure corresponding to the first route combination with the large number needs to be calculated, which takes a long time, and further results in a low route generation speed.

In some embodiments of the present application, the obtaining a target first routing combination from the first routing combinations further includes: and outputting the actual vehicle number required by each path arc ij under the target first route combination. The actual number of vehicles required by each path arc ij under the target first route combination refers to the first number of vehicles T required by each path arc ij under the condition of the route combination_ij。

In the embodiment of the application, the planned route of the goods to be transported is output, and the number of vehicles required by each path arc ij is also output, so that reference is provided for the layout of the logistics distribution vehicles, and the situations of insufficient vehicles and vehicle redundancy are avoided.

In some embodiments of the present application, in order to accelerate the route generation speed, the preset constraint conditions include at least one of defining a maximum cargo amount of each path arc ij, and defining a transportation aging of each of the to-be-transported cargoes, where the transportation aging refers to an earliest time when the to-be-transported cargoes are sent from an origin and a latest time when the to-be-transported cargoes reach a destination.

When the preset constraint condition is "defining the maximum cargo amount per path arc ij", the above step (2) specifically includes (a1) to (a3), in which:

(a1) and determining each path arc passed by each cargo to be transported under the condition of each route combination of the selectable routes of each cargo to be transported.

(a2) And under the condition of each route combination of the selectable routes of the cargos to be transported, determining the cargo quantity on each path arc ij according to each path arc passed by each cargo to be transported and the cargo quantity of each cargo to be transported.

The specific manner of determining the cargo quantity on each path arc ij in steps (a1) and (a2) may refer to steps (3) and (4) above, and will not be described herein again.

(a3) And searching out a first route combination from all combinations of the selectable routes of the cargos to be transported according to the maximum cargo volume of each path arc ij. Wherein the first route combination satisfies: in the case of this route combination, the cargo volume on each path arc ij is less than or equal to the maximum cargo volume for that path ij.

When the preset constraint condition is "defining the transportation timeliness of each cargo to be transported", the step (1) specifically includes (b1) to (b3), wherein:

(b1) and under the condition of each route combination of the selectable routes of the goods to be transported, determining the transit time length of each transit of the goods to be transported and the transport time length of each path arc of the selectable routes.

(b2) And under the condition of each route combination of the selectable routes of the goods to be transported, determining the total transportation time length of each goods to be transported according to the transit time length of each transit of each goods to be transported and the transportation time length of each path arc of the selectable routes (the total transportation time length is the sum of the transit time lengths of each transit and the transportation time length of each path arc).

(b3) And searching for the first route combination from all combinations of the selectable routes of the cargos to be transported according to the transportation time limit of each cargo to be transported. Wherein the first route combination satisfies: in the case of the route combination, the total transport time length of each of the cargoes to be transported is less than or equal to the difference between the earliest time to be sent from the origin and the latest time to reach the destination (or the total transport time length of each of the cargoes to be transported is less than or equal to the difference between the earliest time to be sent from the origin and the latest time to reach the destination + a preset time length).

In the embodiment of the application, by limiting the maximum cargo capacity of each path arc ij, on one hand, the cargo capacity on a single path arc ij is prevented from being larger than the cargo capacity of an available vehicle; on the other hand, the number of the first route combination is reduced, so that the data processing amount spent on subsequently determining the first route of the first route combination is reduced, and the route generation speed is further accelerated.

By limiting the transportation timeliness of each cargo to be transported, on one hand, the transportation timeliness of each cargo to be transported is ensured; on the other hand, the number of the first route combination is reduced, so that the data processing amount spent on subsequently determining the first route of the first route combination is reduced, and the route generation speed is further accelerated.

In some embodiments of the present application, in order to improve the calculation accuracy of the first routing cost, referring to fig. 3, fig. 3 is a schematic flowchart of an embodiment of step 30 provided in the embodiments of the present application, and step S30 includes the following steps S31 to S32, where:

s31, mileage according to each path arc ij and the first vehicle number T_ijDetermining the transport expenditure corresponding to each path arc ij, and determining the transfer expenditure of each to-be-transported cargo according to the cargo quantity of each to-be-transported cargo.

On the one hand, in each case of the first route combination, the mileage per route arc ij, the required transport expenditure per unit mileage, and the first number of vehicles T required per route arc ij are used as a function of the mileage per route arc ij, the required transport expenditure per unit mileage, and the required first number of vehicles T per route arc ij_ijThe transportation expense for each route arc ij is determined (specifically, the transportation expense for each route arc ij is the mileage per route arc ij per unit mileage, and the first number of vehicles T per route arc ij is determined_ij)

Or, in the case of each first route combination, according to the mileage per route arc ij, the required transport expenditure per unit mileage, the required first number of vehicles T per route arc ij_ijAnd determining a transport expense for each route arc ij (specifically, the transport expense for each route arc ij is the transport expense required by mileage per route arc ij per unit mileage per route arc ij per first number of vehicles T required by each route arc ij per fixed expense for each vehicle_ij+ fixed payout per vehicle-first number of vehicles T required per path arc ij_ij)。

On the other hand, in each case of the first route combination, the transfer cost of each cargo to be transported is determined based on the cargo amount of each cargo to be transported, the transfer count, and the transfer cost per unit cargo amount (specifically, the transfer cost per cargo is the cargo amount per unit cargo amount and the transfer count).

S32, determining a first routing expenditure of each first routing combination according to the transportation expenditure and the transit expenditure.

In each first route combination, the first route payout of the first route combination is determined according to the transportation payout corresponding to each route arc ij and the transfer payout of each to-be-transported cargo (specifically, the first route payout is the sum of the transportation payouts corresponding to all the route arcs ij plus the transfer payout of all the to-be-transported cargo).

In the embodiment of the application, the transportation expenditure and the transfer expenditure are considered, the first route expenditure is determined, the calculation accuracy of the first route expenditure is improved, and the cost is effectively saved.

In some embodiments of the present application, after initially generating a route of a to-be-transported cargo, in order to further optimize the route of the to-be-transported cargo to save routing expenditure, referring to fig. 4, which is a flowchart illustrating another embodiment of the route generation method provided in an embodiment of the present application, after step S40, steps a10 to a40 are further included, where:

a10, determining a second route combination of the first to-be-transported goods according to the alternative routes of the first to-be-transported goods.

The first goods to be transported are the goods to be transported which meet preset conditions, and the second route combination is the combination of selectable routes of the first goods to be transported.

Specifically, first, the first to-be-transported cargo is determined. For example: first, a destination cargo quantity of each transfer involved in the routing plan is determined (wherein the destination cargo quantity of each transfer refers to the total cargo quantity of the to-be-transported cargoes of the transfer, and the destination is the to-be-transported cargoes of the transfer). Then, the first n transitions with the largest destination cargo amount are found out from all transitions involved in the routing plan. Finally, determining the goods to be transported with the destinations of the first n transit stations as the goods to be transported which meet the preset conditions; otherwise, determining the goods to be transported which do not meet the preset conditions.

For another example: first, the origin cargo quantity of each transfer involved in the routing plan is determined (where the origin cargo quantity of each transfer is the total cargo quantity of the to-be-transported cargoes of the to-be-transported transfer). Then, the first n transitions with the largest initial cargo quantity are found out from all transitions involved in the routing plan. Finally, determining the goods to be transported with the origin being the first n transit points as the goods to be transported meeting the preset conditions; otherwise, determining the goods to be transported which do not meet the preset conditions.

Therefore, the preset conditions can be various and can be limited according to specific experience so as to achieve the purpose of optimizing the initially generated route of the goods to be transported.

Then, all combinations of the selectable routes of the first item to be transported are determined as second route combinations. Further, a combination meeting a preset constraint condition is determined and selected from all combinations of the selectable routes of the first goods to be transported to serve as a second route combination. Specifically, the specific implementation of "determining the second route combination of the first to-be-transported goods" in the step a10 may refer to the implementation of "determining the first route combination of each to-be-transported goods" in the step S20, and will not be described herein again.

A20, determining a second vehicle number T 'required by each path arc ij under each second route combination according to the first target route of the second to-be-transported goods'_ij。

The second goods to be transported refers to the goods to be transported which do not meet the preset conditions.

In some embodiments of the present application, step a20 specifically includes the following steps a 21-a 22, wherein:

a21, determining a first cargo amount of each path arc ij under each first route combination according to the first target route of the second cargo to be transported, the route of each first cargo to be transported under each second route combination and the cargo amount of each cargo to be transported.

Firstly, on one hand, according to the first target route of the second goods to be transported, determining each path arc passed by each second goods to be transported. On the other hand, under each second routing combination, according to the route of each first to-be-transported goods, determining each path arc which each first to-be-transported goods passes through.

Then, in each case of the second route combination, the first cargo amount on each path arc ij is determined according to each path arc through which each second cargo to be transported passes, each path arc through which each first cargo to be transported passes, and the cargo amount of each cargo to be transported (including the first cargo to be transported and the second cargo to be transported).

A22, determining a second vehicle number T 'required by each path arc ij under each first routing combination according to the first cargo quantity according to each path arc ij'_ij。

Finally, under each second route combination condition, determining a second vehicle number T 'required by each path arc ij according to the first cargo quantity on each path arc ij and the cargo loading quantity of each vehicle'_ij。

In the embodiment of the application, the first cargo quantity of each path arc ij is determined according to the cargo quantity and the route of each cargo to be transported, and then the second vehicle number T 'required by each path arc is accurately determined'_ijAccurate data basis is provided for subsequent determination of the second routing cost.

Specifically, in step A20, "second vehicle number T 'required for each path arc ij is determined'_ij"the first number of vehicles T required for determining each of the path arcs ij" in the above steps (3) to (5) may be referred to_ij"will not be described in detail herein.

A30 is counted according to the second vehicle number T'_ijDetermining a second route cost for each of the second route combinations.

Specifically, the specific implementation of step a30 "determining the second route cost for each second route combination" is similar to the implementation of step S30 "determining the first route cost for each first route combination", and is not described herein again.

A40, obtaining a target second route combination from the second route combination, and outputting a second target route of each first to-be-transported goods under the target second route combination and the first target route of the second to-be-transported goods.

Wherein the target second route combination refers to the second route combination with the smallest second route expenditure. The second target route refers to an alternative route for each first item to be transported in the case of a target second route combination. The second target route is used for indicating a route planning result of the first goods to be transported.

The specific implementation of step a40 "obtaining the target second routing combination from the second routing combination" is similar to the implementation of step S40 "obtaining the target first routing combination from the first routing combination", and is not described herein again.

The specific implementation of the step a40 "outputting the second target route of each first to-be-transported good under the target second route combination" is similar to the implementation of the step S40 "outputting the first target route of each first to-be-transported good under the target first route combination", and is not described herein again.

Step a40, "output the first target route of the second to-be-transported item," may refer to step S40, and is not described herein again.

Due to the fact that the cargo to be transported which meets the preset conditions (such as the same destination or origin) is high in possibility of being spliced, in the embodiment of the application, the cargo to be transported which meets the preset conditions is found out to serve as the first cargo to be transported, and the route of the first cargo to be transported is regenerated, so that the effect of optimizing the route of the cargo to be transported can be achieved, and further the route expenditure is saved.

In some embodiments of the present application, the obtaining a target second routing combination from the second routing combination further includes: and outputting the actual vehicle number required by each path arc ij under the target second route combination. Wherein the target second wayThe actual number of vehicles required by each path arc ij in the combination refers to the second number of vehicles T 'required by each path arc ij in the case of the route combination'_ij。

In some embodiments of the present application, the determining a first number of vehicles T required for each path arc ij under each of the first routing combinations_ijSpecifically comprises steps B10-B20, wherein:

and B10, determining a second cargo quantity of each path arc ij under each first routing combination according to the route of each cargo to be transported under each first routing combination and the cargo quantity of each cargo to be transported.

Specifically, in each first route combination, first, each path arc through which each cargo to be transported passes is determined according to the route of each cargo to be transported. Then, the second cargo quantity on each path arc ij is determined according to each path arc passed by each cargo to be transported and the cargo quantity of each cargo to be transported.

The "determining the second cargo amount per each path arc ij" in the step B10 may refer to the specific embodiment of "determining the cargo amount per each path arc ij" in the above step (4).

B20, determining the first vehicle number T required by each path arc ij under each first route combination according to the second cargo quantity of each path arc ij_ij。

"determining the first number of vehicles T required for each of the path arcs ij" in step B20_ij"and the first number of vehicles T required for determining each of the path arcs ij" in the above step (5)_ij"the same, which will not be described in detail herein.

In the embodiment of the application, the second cargo quantity of each path arc ij is determined according to the cargo quantity and the route of each cargo to be transported, so that the second cargo quantity of each path arc ij is accurately determinedThe first number of vehicles T required for each path arc_ijAnd accurate data basis is provided for the subsequent determination of the first route expenditure.

In order to better implement the route generating method in the embodiment of the present application, on the basis of the route generating method, an embodiment of the present application further provides a route generating device, as shown in fig. 5, which is a schematic structural diagram of an embodiment of the route generating device in the embodiment of the present application, where the route generating device 500 includes:

a first determining unit 501, configured to determine, according to an origin and a destination of each to-be-transported cargo, an optional route of each to-be-transported cargo, where the optional route refers to multiple transit fields or operation places through which the to-be-transported cargo is transported from the origin to the destination in sequence;

a second determining unit 502, configured to determine, according to preset constraint conditions, first route combinations of the respective goods to be transported, and a first number T of vehicles required by each path arc ij under each first route combination_ijWherein i belongs to N, j belongs to N, N represents the set of all transition and operation places, and the first route combination refers to the combination of selectable routes of the goods to be transported;

a third determining unit 503 for determining the number of vehicles T according to the first number of vehicles T_ijDetermining a first routing cost for each of said first routing combinations;

a generating unit 504, configured to obtain a target first route combination from the first route combinations, and output a first target route of each to-be-transported cargo under the target first route combination, where the target first route combination is a first route combination with a smallest first route expenditure.

In some embodiments of the present application, the second determining unit 502 is further specifically configured to:

determining a first route combination of the goods to be transported by taking at least one of the maximum goods amount of each path arc ij and the transportation time limit of each goods to be transported as the preset constraint condition, and determining the route combination of each path arc ij under each first route combinationThe first number of vehicles required T_ijThe transportation aging refers to the earliest time for the goods to be transported to be sent from the origin and the latest time for the goods to be transported to reach the destination.

In some embodiments of the present application, the third determining unit 503 is further specifically configured to:

In some embodiments of the application, after the step of outputting the first target route of each to-be-transported good under the target first route combination, the generating unit 504 is further specifically configured to:

In some embodiments of the present application, the generating unit 504 is further specifically configured to:

In some embodiments of the present application, after the step of obtaining the target first routing combination from the first routing combinations, the generating unit 504 is further specifically configured to:

In addition, in order to better implement the route generating method in the embodiment of the present application, based on the route generating method, an embodiment of the present application further provides a route generating device, referring to fig. 6, fig. 6 shows a schematic structural diagram of the route generating device in the embodiment of the present application, specifically, the route generating device in the embodiment of the present application includes a processor 601, and when the processor 601 is used to execute a computer program stored in a memory 602, each step of the route generating method in any embodiment corresponding to fig. 1 to fig. 4 is implemented; alternatively, the processor 601 is configured to implement the functions of the units in the corresponding embodiment of fig. 5 when executing the computer program stored in the memory 602.

Illustratively, a computer program may be partitioned into one or more modules/units, which are stored in the memory 602 and executed by the processor 601 to implement embodiments of the present application. One or more modules/units may be a series of computer program instruction segments capable of performing certain functions, the instruction segments being used to describe the execution of a computer program in a computer device.

The route generation device may include, but is not limited to, a processor 601, a memory 602. Those skilled in the art will appreciate that the illustration is merely an example of a route generation device, and does not constitute a limitation of the route generation device, and may include more or less components than those illustrated, or combine some components, or different components, for example, the route generation device may further include an input-output device, a network access device, a bus, etc., and the processor 601, the memory 602, the input-output device, the network access device, etc., are connected via the bus.

The Processor 601 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, the processor being the control center of the route generation apparatus, and various interfaces and lines connecting the various parts of the entire route generation apparatus.

The memory 602 may be used for storing computer programs and/or modules, and the processor 601 may implement various functions of the computer apparatus by executing or executing the computer programs and/or modules stored in the memory 602 and calling data stored in the memory 602. The memory 602 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, video data, etc.) created according to the use of the route generation apparatus, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.

It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the route generation apparatus, the device and the corresponding units thereof described above may refer to the description of the route generation method in any embodiment corresponding to fig. 1 to 4, and are not described herein again in detail.

It will be understood by those skilled in the art that all or part of the steps of the methods of the above embodiments may be performed by instructions or by associated hardware controlled by the instructions, which may be stored in a computer readable storage medium and loaded and executed by a processor.

To this end, an embodiment of the present application provides a computer-readable storage medium, where a plurality of instructions are stored, and the instructions can be loaded by a processor to execute steps in the route generation method in any embodiment corresponding to fig. 1 to 4 in the present application, and specific operations may refer to descriptions of the route generation method in any embodiment corresponding to fig. 1 to 4, and are not described herein again.

Wherein the computer-readable storage medium may include: read Only Memory (ROM), Random Access Memory (RAM), magnetic or optical disks, and the like.

Because the instructions stored in the computer-readable storage medium can execute the steps in the route generation method in any embodiment corresponding to fig. 1 to 4, the beneficial effects that can be achieved by the route generation method in any embodiment corresponding to fig. 1 to 4 can be achieved, which are described in detail in the foregoing description and are not described again here.

The route generation method, apparatus, device and storage medium provided in the embodiments of the present application are described in detail above, and a specific example is applied in the present application to explain the principle and the implementation of the present application, and the description of the above embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for those skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims

1. A method for route generation, the method comprising:

2. The route generation method according to claim 1, wherein the preset constraint conditions include at least one of a maximum cargo amount defining each path arc ij, and a transportation aging defining each of the to-be-transported cargoes, the transportation aging being an earliest time at which the to-be-transported cargoes are sent from an origin and a latest time at which the to-be-transported cargoes reach a destination.

3. The route generation method according to claim 1, wherein the first number of vehicles T is the number of vehicles_ijDetermining a first routing cost for each of said first routing combinations, comprising:

4. The route generation method according to claim 1, wherein the outputting the first target route of each of the to-be-transported goods under the target first route combination further comprises:

5. The route generation method according to claim 4, wherein the second number of vehicles T 'required for each path arc ij at each of the second route combinations is determined according to the first target route of the second to-be-transported cargo'_ijThe method comprises the following steps:

6. The route generation method according to claim 1, wherein the determination of the first number of vehicles T required for each path arc ij in each of the first route combinations_ijThe method comprises the following steps:

7. The route generation method according to any of claims 1 to 6, wherein the obtaining a target first routing combination from the first routing combination further comprises:

8. A route generation apparatus, characterized in that the route generation apparatus comprises:

9. A route generation device characterized by comprising a processor and a memory, the memory having stored therein a computer program, the processor executing the route generation method according to any one of claims 1 to 7 when calling the computer program in the memory.

10. A computer-readable storage medium, having stored thereon a computer program which is loaded by a processor for performing the steps of the route generation method of any one of claims 1 to 7.