CN112163820A

CN112163820A - Optimal goods-walking path generation method and device

Info

Publication number: CN112163820A
Application number: CN202011152404.4A
Authority: CN
Inventors: 贺雪阳; 田学; 江灵杰; 魏飞翔; 何干
Original assignee: Shanghai Yanxi Software Information Technology Co ltd
Current assignee: Shanghai Yanxi Software Information Technology Co ltd
Priority date: 2020-10-23
Filing date: 2020-10-23
Publication date: 2021-01-01

Abstract

The application provides an optimal goods-walking path generation method and device, which are applied to the field of logistics, and the method comprises the following steps: acquiring goods order information; acquiring the corresponding relation between a business department and an external field and a trunk direct line, and determining all selectable trunk delivery paths corresponding to the routing paths; acquiring the time efficiency connection relation, trunk transportation cost and outfield operation cost of each node corresponding to each optional trunk cargo-moving path, determining the actual time efficiency of the routing path corresponding to the optional trunk cargo-moving path and determining the actual cost of the routing path corresponding to the optional trunk cargo-moving path; and generating an optimal goods-walking path according to all the actual timeliness and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

Description

Optimal goods-walking path generation method and device

Technical Field

The application relates to the field of logistics, in particular to a method and a device for generating an optimal goods-walking path.

Background

With the rapid development of the logistics industry, the quantity of goods required to be transported is increased every day, which causes the variability of transportation lines. Therefore, the route of the cargo transportation needs to be planned according to the network route cargo volume, so as to improve the network cargo volume and reduce the cost.

The existing network planning mode mainly plans a next month network by taking route sub-products as a minimum unit according to monthly goods quantity change, so as to realize network iterative updating. However, this planning method can only show differences in different months, and thus the flexibility of planning the cargo delivery path is low.

Disclosure of Invention

An object of the embodiments of the present application is to provide a method and an apparatus for generating an optimal cargo carrying path, so as to solve the technical problem of low flexibility in planning a cargo carrying path.

In order to achieve the above purpose, the technical solutions provided in the embodiments of the present application are as follows:

in a first aspect, an embodiment of the present application provides an optimal delivery path generating method, including: acquiring goods order information; the goods order information comprises routing paths corresponding to the orders, wherein the routing paths comprise paths from an originating business department to an originating field, from the originating field to an arriving field and from the arriving field to the arriving business department; acquiring the corresponding relation between a business department corresponding to the routing path and an external field and a trunk line straight line; wherein the trunk straight hair path represents a path directly transmitting from one external field to another external field; determining all selectable trunk line goods-passing paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk line direct-sending paths; wherein said selectable trunk travel paths include at least one said trunk direct route between said originating external site to said arriving external site; acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk cargo path; the nodes comprise the business department and the outfield, the timeliness connection relationship of each node comprises transportation timeliness between the business department and the outfield and transportation timeliness between one outfield and another outfield, the trunk transportation cost is the transportation cost corresponding to each trunk straight-hair path, and the outfield operation cost is the operation cost corresponding to each outfield; determining the actual time limit of the routing path corresponding to the optional trunk line cargo-moving path according to the time limit connection relation of each node; determining the actual cost of the routing path corresponding to the selectable trunk line cargo walking path according to the trunk line transportation cost corresponding to the selectable trunk line cargo walking path and the outfield operation cost; and generating an optimal goods-walking path according to all the actual timeliness and the actual cost. In the above scheme, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time delivery path data, the multiple selectable trunk delivery paths corresponding to the routing path and the actual timeliness and the actual cost corresponding to each selectable trunk delivery path are determined, so as to generate the optimal delivery path corresponding to the order according to the actual timeliness and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

In an optional embodiment of the present application, the obtaining the trunk transportation cost corresponding to each optional trunk shipment route includes: obtaining the vehicle type departure times and vehicle type transportation unit prices of the lines corresponding to each trunk straight-sending path in the selectable trunk goods-walking paths; and determining the trunk line transportation cost of the corresponding trunk line straight path according to the vehicle departure times of the vehicle types and the transportation unit prices of the vehicle types. In the scheme, the actual cost can be determined according to the departure times of the vehicle types corresponding to the cargo-moving paths of the optional trunk lines and the transportation unit prices of the vehicle types, so that the cost of the cargo-moving paths of the optional trunk lines can be calculated according to the real-time transportation cost, and the planning accuracy is improved on the basis of improving the flexibility of the planning of the cargo-moving paths.

In an optional embodiment of the present application, the obtaining the outfield operation cost corresponding to each optional trunk road and cargo path includes: obtaining the operation cargo volume and unit operation cost of each outfield corresponding to the optional trunk line cargo walking path; and determining the corresponding outfield operation cost of the outfield according to the operation cargo volume and the unit operation cost. In the scheme, the actual outfield operation cost can be determined according to the operation goods quantity of the outfield corresponding to each optional trunk goods-transporting path and the unit operation cost, so that the cost of each optional trunk goods-transporting path can be calculated according to the real-time operation cost, and the accuracy of planning is improved on the basis of improving the flexibility of planning the goods-transporting paths.

In an optional embodiment of the present application, the generating an optimal shipment path according to all the actual timeliness and the actual cost includes: comparing actual costs corresponding to actual aging meeting the preset aging conditions in all the actual aging; the preset aging condition represents that the actual aging is not larger than the current aging corresponding to the current goods-taking path; and determining the selectable trunk road and cargo path with the minimum actual cost corresponding to the actual aging meeting the preset aging condition as the optimal road and cargo path. In the scheme, the selectable trunk road and cargo paths meeting the time efficiency condition are firstly screened out from at least one selectable trunk road and cargo path, and then one selectable trunk road and cargo path meeting the condition is selected out to serve as the optimal road and cargo path. Therefore, the time efficiency requirement is firstly ensured to improve the user experience, and then the transportation cost is reduced.

In an optional embodiment of the present application, the obtaining a correspondence between a business department corresponding to the routing path and an external field includes: acquiring an optional branch line goods-taking path corresponding to a business department corresponding to the routing path; wherein the branch-line-selectable goods-taking path comprises a path between the business department and an external field; the determining the actual aging of the routing path corresponding to the optional trunk road and goods path according to the aging connection relationship of each node includes: determining the actual aging of the selectable trunk line cargo-moving path and the routing path corresponding to the selectable branch line cargo-moving path according to the aging connection relation of each node; the determining the actual cost of the routing path corresponding to the selectable trunk road and freight path according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk road and freight path includes: and determining the actual cost of the selectable trunk line goods-taking path and the routing path corresponding to the selectable branch line goods-taking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line goods-taking path and the branch line transportation cost corresponding to the selectable branch line goods-taking path. In the above scheme, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time data of the branch-line transportation path, the trunk-line transportation path, and the actual time efficiency and the actual cost of each branch-line transportation path and trunk-line transportation path corresponding to the routing path are determined, so as to generate the optimal transportation path corresponding to the order according to the actual time efficiency and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

In an alternative embodiment of the present application, the method further comprises: and if the cargo quantity and the real-time loading rate of the line are lower than a first preset threshold value, determining the outage line according to the actual aging. In the scheme, when the abnormal condition of line vacancy occurs, the line can be determined to be stopped according to the actual time efficiency so as to reduce the transportation cost.

In an alternative embodiment of the present application, the method further comprises: and if the line cargo volume, the real-time loading rate and the line loading route cargo volume are higher than a second preset threshold value, determining to newly open the line according to the actual aging. In the scheme, when the abnormal condition that the line exceeds the transportation capacity occurs, the newly opened line can be determined according to the actual time effect so as to ensure the transportation time effect and improve the user experience.

In an alternative embodiment of the present application, the method further comprises: and adjusting the line cargo volume, the real-time loading rate and the cargo volume of the line stowage route to the line path corresponding to the line cargo volume and the real-time loading rate lower than the first preset threshold value. In above-mentioned scheme, when the abnormal conditions of circuit deficit and circuit excess capacity appear, can adjust the volume of goods on the excess capacity circuit to on the deficit circuit to reduce the cost of transportation when guaranteeing the transportation ageing.

In a second aspect, an embodiment of the present application provides an optimal delivery path generating apparatus, including: the first acquisition module is used for acquiring the information of the goods order; the goods order information comprises routing paths corresponding to the orders, wherein the routing paths comprise paths from an originating business department to an originating field, from the originating field to an arriving field and from the arriving field to the arriving business department; a second obtaining module, configured to obtain a correspondence between a business department corresponding to the routing path and an external field, and a trunk line straight line; wherein the trunk straight hair path represents a path directly transmitting from one external field to another external field; the first determining module is used for determining all selectable trunk line goods-passing paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk line direct-sending paths; wherein said selectable trunk travel paths include at least one said trunk direct route between said originating external site to said arriving external site; the third acquisition module is used for acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk goods-moving path; the nodes comprise the business department and the outfield, the timeliness connection relationship of each node comprises transportation timeliness between the business department and the outfield and transportation timeliness between one outfield and another outfield, the trunk transportation cost is the transportation cost corresponding to each trunk straight-hair path, and the outfield operation cost is the operation cost corresponding to each outfield; a second determining module, configured to determine, according to the aging connection relationship between the nodes, an actual aging of the routing path corresponding to the optional trunk road-to-cargo path; a third determining module, configured to determine, according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk shipment path, an actual cost of a routing path corresponding to the selectable trunk shipment path; and the generating module is used for generating an optimal goods-walking path according to all the actual timeliness and the actual cost. In the above scheme, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time delivery path data, the multiple selectable trunk delivery paths corresponding to the routing path and the actual timeliness and the actual cost corresponding to each selectable trunk delivery path are determined, so as to generate the optimal delivery path corresponding to the order according to the actual timeliness and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

In an optional embodiment of the present application, the third obtaining module is further configured to: obtaining the vehicle type departure times and vehicle type transportation unit prices of the lines corresponding to each trunk straight-sending path in the selectable trunk goods-walking paths; and determining the trunk line transportation cost of the corresponding trunk line straight path according to the vehicle departure times of the vehicle types and the transportation unit prices of the vehicle types. In the scheme, the actual cost can be determined according to the departure times of the vehicle types corresponding to the cargo-moving paths of the optional trunk lines and the transportation unit prices of the vehicle types, so that the cost of the cargo-moving paths of the optional trunk lines can be calculated according to the real-time transportation cost, and the planning accuracy is improved on the basis of improving the flexibility of the planning of the cargo-moving paths.

In an optional embodiment of the present application, the third obtaining module is further configured to: obtaining the operation cargo volume and unit operation cost of each outfield corresponding to the optional trunk line cargo walking path; and determining the corresponding outfield operation cost of the outfield according to the operation cargo volume and the unit operation cost. In the scheme, the actual outfield operation cost can be determined according to the operation goods quantity of the outfield corresponding to each optional trunk goods-transporting path and the unit operation cost, so that the cost of each optional trunk goods-transporting path can be calculated according to the real-time operation cost, and the accuracy of planning is improved on the basis of improving the flexibility of planning the goods-transporting paths.

In an optional embodiment of the present application, the generating module is further configured to: comparing actual costs corresponding to actual aging meeting the preset aging conditions in all the actual aging; the preset aging condition represents that the actual aging is not larger than the current aging corresponding to the current goods-taking path; and determining the selectable trunk road and cargo path with the minimum actual cost corresponding to the actual aging meeting the preset aging condition as the optimal road and cargo path. In the scheme, the selectable trunk road and cargo paths meeting the time efficiency condition are firstly screened out from at least one selectable trunk road and cargo path, and then one selectable trunk road and cargo path meeting the condition is selected out to serve as the optimal road and cargo path. Therefore, the time efficiency requirement is firstly ensured to improve the user experience, and then the transportation cost is reduced.

In an optional embodiment of the present application, the second obtaining module is further configured to: acquiring an optional branch line goods-taking path corresponding to a business department corresponding to the routing path; wherein the branch-line-selectable goods-taking path comprises a path between the business department and an external field; the determining the actual aging of the routing path corresponding to the optional trunk road and goods path according to the aging connection relationship of each node includes: determining the actual aging of the selectable trunk line cargo-moving path and the routing path corresponding to the selectable branch line cargo-moving path according to the aging connection relation of each node; the determining the actual cost of the routing path corresponding to the selectable trunk road and freight path according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk road and freight path includes: and determining the actual cost of the selectable trunk line goods-taking path and the routing path corresponding to the selectable branch line goods-taking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line goods-taking path and the branch line transportation cost corresponding to the selectable branch line goods-taking path. In the above scheme, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time data of the branch-line transportation path, the trunk-line transportation path, and the actual time efficiency and the actual cost of each branch-line transportation path and trunk-line transportation path corresponding to the routing path are determined, so as to generate the optimal transportation path corresponding to the order according to the actual time efficiency and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

In an optional embodiment of the present application, the optimal travel route generating device further includes: and the fourth determining module is used for determining the stop route according to the actual timeliness if the route cargo volume and the real-time loading rate are lower than a first preset threshold value. In the scheme, when the abnormal condition of line vacancy occurs, the line can be determined to be stopped according to the actual time efficiency so as to reduce the transportation cost.

In an optional embodiment of the present application, the optimal travel route generating device further includes: and the fifth determining module is used for determining a newly opened line according to the actual time effectiveness if the line cargo volume, the real-time loading rate and the line loading route cargo volume are higher than a second preset threshold value. In the scheme, when the abnormal condition that the line exceeds the transportation capacity occurs, the newly opened line can be determined according to the actual time effect so as to ensure the transportation time effect and improve the user experience.

In an optional embodiment of the present application, the optimal travel route generating device further includes: and the adjusting module is used for adjusting the line cargo volume, the real-time loading rate and the cargo volume of the line distribution route to the line path corresponding to the line cargo volume and the real-time loading rate lower than the first preset threshold value, wherein the cargo volume of the line path is higher than the cargo volume of the line path corresponding to the second preset threshold value. In the above scheme, when the abnormal conditions of circuit deficit and circuit excess capacity occur, the live road on the excess capacity line can be adjusted to the deficit line, so that the transportation cost is reduced while the transportation timeliness is ensured.

In a third aspect, an embodiment of the present application provides an electronic device, including: a processor, a memory, and a bus; the processor and the memory are communicated with each other through the bus; the memory stores program instructions executable by the processor, the processor calling the program instructions to be able to perform the optimal path generation method as in the first aspect.

In a fourth aspect, embodiments of the present application provide a non-transitory computer-readable storage medium storing computer instructions that cause the computer to perform the optimal shipment path generation method as in the first aspect.

In order to make the aforementioned objects, features and advantages of the present application more comprehensible, embodiments accompanied with figures are described in detail below.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and that those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.

Fig. 1 is a flowchart of a method for generating an optimal delivery path according to an embodiment of the present disclosure;

fig. 2 is a flowchart of a specific implementation of step S1107 provided in an embodiment of the present application;

fig. 3 is a flowchart of another optimal travel route generation method according to an embodiment of the present disclosure;

fig. 4 is a block diagram of an optimal travel route generation apparatus according to an embodiment of the present disclosure;

fig. 5 is a block diagram of an electronic device according to an embodiment of the present disclosure.

Detailed Description

The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.

Order form: each item corresponds to an order, and each order includes item order information.

Goods order information: including the routing path corresponding to the order.

Routing path: at least one line path is connected end to form a routing path.

A line path: including branch paths and trunk paths.

Trunk path: that is, the main-line logistics refers to logistics generated by main-line transportation such as railways, ships, and line trucks, and includes harbors, airports, cargo stations, and truck terminals that are installed in and out of cities. In other words, it is the path between the goods from the outfield of one city (departure outfield) to the outfield of another city (arrival outfield).

Branch path: the branch logistics is to unload the goods in the residual routes from the nearest place according to the principle of the proximity of the main line transportation route, and then to change the goods to other vehicles for independent processing. In other words, the route between the goods from the originating business to the originating outfield, or the route between the goods from the arriving outfield to the arriving business.

Business department: the goods storage point in an area range can send goods to a business department after a courier takes the goods from a client.

An external field: the goods are delivered to the field from the business department and then delivered to the field of another city from the field.

And (3) node: including the time efficiency nodes of business department and each link of external field (departure, arrival and unloading).

Correspondence between business department and external field: one business department corresponds to a fixed field or one business department corresponds to a plurality of fields, and after the courier sends the goods to the business department, the goods will be sent to a field corresponding to the business department.

Trunk line hair-straightening line: a path directly from one external field to another.

Optional trunk route path: including at least one trunk straight path from the originating external field to the arriving external field.

The time efficiency connection relation of each node is as follows: including transportation aging between business department and external field and transportation aging between one external field and another external field.

Cost of trunk transportation: the transportation cost corresponding to each trunk straight hair path.

Outfield operating cost: operating costs per external field.

Departure times of each vehicle type: including departure date and departure number of each vehicle type on each line.

Transportation unit price of each vehicle type: the cost price per route of goods spent transporting once per vehicle type.

External field operation cargo capacity: the quantity of goods processed by the outfield operation is twice of the quantity of goods flowing through the outfield, and the loading and unloading operations are performed twice in total by the quantity of the goods flowing through the outfield.

Outfield unit operating cost: the outfield spends a cost price of one unit of goods per operation.

Presetting aging conditions: the actual time limit is not larger than the current time limit corresponding to the current goods-taking path.

The current time efficiency corresponding to the current goods-taking path is as follows: and before planning the goods-taking path, the time efficiency corresponding to the last goods-taking path is obtained.

Branch line cargo-walking path selection: including the path between the business office and an external field.

The cargo capacity of the line: total number of goods passing through a line.

Real-time loading rate: the ratio of the number of loads per truck to the number of full loads per truck.

Line loading route cargo volume: the number of loads per route carried on one route.

A complete cargo transportation process: the user places an order, and the courier collects the goods to the originating department, and then the goods are transported to the originating field, and then the goods are transported to the next field. If the outfield is the arrival outfield, the goods are transported to the arrival business department; finally, the courier delivers the goods from the arrival business to the user.

It should be noted that the optimal delivery path generation method provided in the embodiment of the present application may be executed by an electronic device, where the electronic device refers to a device terminal or a server having a function of executing a computer program, and the device terminal includes, for example: a smart phone, a Personal Computer (PC), a tablet computer, a Personal Digital Assistant (PDA), a Mobile Internet Device (MID), a network switch or a network router, and the like.

Referring to fig. 1, fig. 1 is a flowchart of an optimal shipment path generating method according to an embodiment of the present application, where the optimal shipment path generating method may include the following steps:

step S101: and acquiring the goods order information.

Step S102: the corresponding relation between the business department corresponding to the routing path and the external field and the trunk line direct line are obtained.

Step S103: and determining all selectable trunk road and goods paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk direct-sending paths.

Step S104: and acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk goods-passing path.

Step S105: and determining the actual time limit of the routing path corresponding to the optional trunk road and goods path according to the time limit connection relation of each node.

Step S106: and determining the actual cost of the routing path corresponding to the selectable trunk line cargo walking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line cargo walking path.

Step S107: and generating an optimal goods-walking path according to all the actual timeliness and the actual cost.

First, the electronic device may obtain order information of goods corresponding to the route to be planned, where the order information of the goods of the electronic device may be obtained in various manners, for example: the electronic device may receive an order request sent by a user through a user terminal, where the order request carries corresponding goods order information, and the receiving manner includes, but is not limited to: bluetooth, 4G, 5G, wired transmission, etc.; or the electronic equipment can receive acquisition information sent by the courier through the user terminal, wherein the acquisition information carries corresponding goods order information; alternatively, the electronic device may read pre-stored goods order information from a database, and the like, which is not specifically limited in this embodiment of the application.

The goods order information acquired by the electronic device may include information such as a routing path, user information, a goods type, and the like corresponding to the order, where the routing path corresponding to the order may specifically include a routing origin and a routing arrival place.

Then, the electronic device can acquire the correspondence between the business department corresponding to the routing path, namely the originating business department and the arrival business department, and the external field corresponding to the routing path, namely the originating external field and the arrival external field, and the trunk direct line. Since one business department may correspond to one fixed external field or a plurality of external fields, there are various ways of obtaining the correspondence between the business department and the external fields.

For example, in the case that a business department may correspond to a fixed external field, the electronic device may read the pre-stored correspondence from the database; or, the electronic device may receive the correspondence sent by other devices, where the data sending manner includes but is not limited to: bluetooth, 4G, 5G, wired transmission, etc.; alternatively, the electronic device may locally extract a pre-stored correspondence, and the like, which is not specifically limited by those skilled in the art.

For another example, in a case where one business department may correspond to a plurality of external fields, the electronic device may randomly select one of the plurality of external fields as the external field corresponding to the business department; alternatively, the electronic device may determine one of the external fields as the external field corresponding to the business department according to a preset rule (this manner will be described in detail in the following embodiments); alternatively, the electronic device may receive an instruction from a user, and determine one of the external fields as the external field corresponding to the business department, which is not limited in this embodiment of the present application.

Similarly, there are various ways for the electronic device to obtain the trunk straight line, which are not described herein, and those skilled in the art can make appropriate selections by combining the above embodiments and the means used in the art.

Then, the electronic device can determine all selectable trunk-line delivery paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk-line direct-sending paths. For example, for the routing paths a to D, acquiring the corresponding trunk straight line includes: A-B, A-C, B-D and C-D, therefore, the determination of the alternative trunk cargo path corresponding to the routing path comprises: A-B-D and A-C-D.

Then, the electronic device can acquire the time-efficient connection relationship, the trunk transportation cost and the outfield operation cost of each node corresponding to each selectable trunk transportation path. Similarly, there are various ways for the electronic device to obtain the time-efficient connection relationship, the trunk transportation cost, and the outfield operation cost of each node corresponding to each selectable trunk travel path, which are not described herein again, and those skilled in the art may make a suitable selection by combining the above embodiments and the conventional technical means in the art.

As an embodiment, the step of the electronic device obtaining the trunk transportation cost corresponding to each selectable trunk shipment path may include the steps of:

the method comprises the steps of firstly, obtaining vehicle sending times of various vehicle types and transportation unit prices of various vehicle types of lines corresponding to each trunk straight sending path in the optional trunk goods passing paths.

And secondly, determining the trunk line transportation cost of the corresponding trunk line straight path according to the vehicle departure times of the vehicle types and the transportation unit prices of the vehicle types.

The electronic equipment can acquire the vehicle type departure times and the vehicle type transportation unit prices of the lines corresponding to each trunk direct-sending path in the optional trunk goods-passing paths in multiple modes, and after the data are acquired, the electronic equipment can calculate the trunk transportation cost of the corresponding trunk direct-sending path according to the following formula:

the cost of main line transportation is ∑ (departure times of each vehicle model x unit cost of transportation).

Therefore, the actual cost can be determined according to the departure times of all vehicle types corresponding to each optional trunk road cargo path and the transportation unit prices of all vehicle types, so that the cost of each optional trunk road cargo path can be calculated according to the real-time transportation cost, and the accuracy of planning is improved on the basis of improving the flexibility of planning the cargo road cargo path.

As another embodiment, the step of the electronic device obtaining the outfield operation cost corresponding to each selectable trunk shipment path may comprise the steps of:

the method comprises the following steps of firstly, obtaining the operation cargo volume and unit operation cost of each external field corresponding to the optional trunk line cargo walking path.

And secondly, determining corresponding external field operation cost according to the operation cargo volume and the unit operation cost.

The electronic equipment can acquire the operation goods quantity and unit operation cost of each external field corresponding to the optional trunk line goods-passing path in multiple modes, and after the data are acquired, the electronic equipment can calculate the external field operation cost according to the following formula:

the outfield operating cost ∑ (amount of operating goods per outfield × unit operating cost).

Therefore, the actual outfield operation cost can be determined according to the operation freight volume of the outfield corresponding to each optional trunk road and the unit operation cost, so that the cost of each optional trunk road can be calculated according to the real-time operation cost, and the planning accuracy is improved on the basis of improving the flexibility of the planning of the cargo road.

After the actual time efficiency and the actual cost of the routing path corresponding to the optional trunk goods-transporting path are determined, the electronic equipment can generate the optimal goods-transporting path according to all the actual time efficiencies and the actual costs.

As an implementation manner, referring to fig. 2, fig. 2 is a flowchart of a specific implementation manner of step S1107 provided in an embodiment of the present application, and the step (i.e., step S107) of generating, by the electronic device, the optimal shipment path according to all the actual timeliness and the actual cost may include the following steps:

step S201: and comparing the actual cost corresponding to the actual aging meeting the preset aging condition in all the actual aging.

Step S202: and determining the selectable trunk goods-transporting path with the minimum actual cost corresponding to the actual timeliness meeting the preset timeliness conditions as the optimal goods-transporting path.

The electronic equipment compares the actual aging corresponding to the one or more selectable trunk line goods-walking paths with the current aging corresponding to the current goods-walking path, if the aging is not delayed, namely the actual aging is not larger than the current aging, the selectable trunk line goods-walking path can be considered to meet the preset aging condition, at the moment, the actual costs corresponding to the multiple selectable trunk line goods-walking paths meeting the preset aging condition are compared, and one selectable trunk line goods-walking path with the minimum actual cost is selected as the optimal goods-walking path. The goods corresponding to the order can be transported according to the optimal path.

Therefore, in the at least one optional trunk road and cargo path, the optional trunk road and cargo paths meeting the time efficiency condition are firstly screened out, and then one optional trunk road and cargo path meeting the condition is selected out to be used as the optimal road and cargo path. Therefore, the time efficiency requirement is firstly ensured to improve the user experience, and then the transportation cost is reduced.

In the above scheme, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time delivery path data, the multiple selectable trunk delivery paths corresponding to the routing path and the actual timeliness and the actual cost corresponding to each selectable trunk delivery path are determined, so as to generate the optimal delivery path corresponding to the order according to the actual timeliness and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

Further, the following describes an optimal cargo path generation method provided by the embodiment of the present application in a case where the electronic device determines one field from a plurality of fields according to a preset rule as a field corresponding to a business department. Referring to fig. 3, fig. 3 is a flowchart of another optimal shipment path generation method according to an embodiment of the present application, where the optimal shipment path generation method may include the following steps:

step S301: and acquiring the goods order information.

Step S302: and acquiring an optional branch line cargo path and a trunk line straight line corresponding to the business department corresponding to the routing path.

Step S303: and determining all selectable trunk road and goods paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk direct-sending paths.

Step S304: and acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk goods-passing path.

Step S305: and determining the actual aging of the routing paths corresponding to the selectable trunk line goods-taking paths and the selectable branch line goods-taking paths according to the aging connection relation of each node.

Step S306: and determining the actual cost of the selectable trunk line goods-taking path and the routing path corresponding to the selectable branch line goods-taking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line goods-taking path and the branch line transportation cost corresponding to the selectable branch line goods-taking path.

Step S307: and generating an optimal goods-walking path according to all the actual timeliness and the actual cost.

In the above-mentioned optimal path generation method, step S301, step S303 to step S304, and step S307 are similar to the implementation of step S101, step S103 to step S104, and step S107 in the previous embodiment, and are not described again here.

In step S303, the electronic device may select a branch route corresponding to the business department corresponding to the routing route. For example, for an originating business department a, the outsides corresponding to the originating business department a have a1, a2 and a3, and therefore, it can be determined that the branch line travel route corresponding to the business department includes: a-a1, a-a2, and a-a 3.

In step S305, it is necessary to calculate the aging associated with the plurality of trunks calculated in step S105, and it is necessary to calculate the aging associated with the plurality of branches, and then, different branches and different trunks are combined to correspond to one actual aging.

In step S306, it is necessary to calculate the branch transportation cost corresponding to the selectable branch transportation path in addition to the trunk transportation cost and the outfield operation cost calculated in step S106, and then add the branch transportation cost, the trunk transportation cost, and the outfield operation cost to obtain the actual cost of the corresponding routing path.

It is understood that the optimal delivery path generation method and the optimal delivery path generation method in the above embodiments may be replaced with each other. As an implementation manner, when the optimal shipment path obtained by the optimal shipment path generation method in the above embodiment has reached the optimal state and still cannot achieve the optimization goal (the timeliness is lower than the threshold or the cost is lower than the threshold, etc.), the optimal shipment path generation method may be adopted to achieve network full-chain optimal shipment.

In the above scheme, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time data of the branch-line transportation path, the trunk-line transportation path, and the actual time efficiency and the actual cost of each branch-line transportation path and trunk-line transportation path corresponding to the routing path are determined, so as to generate the optimal transportation path corresponding to the order according to the actual time efficiency and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

Furthermore, when special periods such as holidays and promotion marketing are experienced or abnormal conditions such as abnormal weather, traffic jam, abnormal events and ex-field warehouse burst occur, the goods moving path can be adaptively adjusted according to actual conditions.

Aiming at special periods such as holidays, promotion marketing and the like, the fluctuation of the goods quantity is obvious, so that the goods quantity of the line, the real-time loading rate and the goods quantity of the line loading route can be monitored in real time, the emergency response standard is set, and the elastic network is planned.

As an embodiment, if the cargo capacity and the real-time loading rate of the route are lower than the first preset threshold, the route can be determined to be stopped according to the actual time efficiency.

In the scheme, when the abnormal condition of line vacancy occurs, the line can be determined to be stopped according to the actual time efficiency so as to reduce the transportation cost.

As another embodiment, if the route cargo volume, the real-time loading rate, and the route cargo volume of the route stowage route are higher than the second preset threshold, the newly opened route may be determined according to the actual time.

In the scheme, when the abnormal condition that the line exceeds the transportation capacity occurs, the newly opened line can be determined according to the actual time effect so as to ensure the transportation time effect and improve the user experience.

As another embodiment, the route cargo volume, the real-time loading rate, and the cargo volume of the route stowage route that is higher than the cargo volume of the route path corresponding to the second preset threshold may be adjusted to the route path that is lower than the first preset threshold.

In the above scheme, when the abnormal conditions of circuit deficit and circuit excess capacity occur, the live road on the excess capacity line can be adjusted to the deficit line, so that the transportation cost is reduced while the transportation timeliness is ensured.

In the above three modes, the first preset threshold and the second threshold may be a fixed value or a variable that changes in real time according to actual conditions, and this embodiment of the present application does not specifically limit this.

The method mainly shows condition limitation aiming at abnormal conditions such as abnormal weather, traffic jam, abnormal events, outfield warehouse explosion and the like, so that goods in a limited area can be temporarily adjusted to be transported in a non-limited area, an alternative path meeting the conditions can be started, and an optimal transporting path is selected according to the real-time line goods quantity.

Referring to fig. 4, fig. 4 is a block diagram illustrating a structure of an optimal delivery path generating apparatus according to an embodiment of the present disclosure, where the optimal delivery path generating apparatus 400 may include: a first obtaining module 401, configured to obtain goods order information; the goods order information comprises routing paths corresponding to the orders, wherein the routing paths comprise paths from an originating business department to an originating field, from the originating field to an arriving field and from the arriving field to the arriving business department; a second obtaining module 402, configured to obtain a correspondence between a business department corresponding to the routing path and an external field and a trunk straight line; wherein the trunk straight hair path represents a path directly transmitting from one external field to another external field; a first determining module 403, configured to determine all selectable trunk travel routes corresponding to the routing route according to the correspondence between the business department and the external field and the trunk direct sending route; wherein said selectable trunk travel paths include at least one said trunk direct route between said originating external site to said arriving external site; a third obtaining module 404, configured to obtain an aging connection relationship, a trunk transportation cost, and an external field operation cost of each node corresponding to each optional trunk transportation path; the nodes comprise the business department and the outfield, the timeliness connection relationship of each node comprises transportation timeliness between the business department and the outfield and transportation timeliness between one outfield and another outfield, the trunk transportation cost is the transportation cost corresponding to each trunk straight-hair path, and the outfield operation cost is the operation cost corresponding to each outfield; a second determining module 405, configured to determine an actual time limit of the routing path corresponding to the optional trunk road-to-cargo path according to the time limit connection relationship of each node; a third determining module 406, configured to determine an actual cost of a routing path corresponding to the selectable trunk transportation path according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk transportation path; and the generating module 407 is configured to generate an optimal shipment path according to all the actual timeliness and the actual cost.

In the embodiment of the application, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time delivery path data, a plurality of selectable trunk delivery paths corresponding to the routing path and the actual timeliness and the actual cost corresponding to each selectable trunk delivery path are determined, so that the optimal delivery path corresponding to the order is generated according to the actual timeliness and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

Further, the third obtaining module 404 is further configured to: obtaining the vehicle type departure times and vehicle type transportation unit prices of the lines corresponding to each trunk straight-sending path in the selectable trunk goods-walking paths; and determining the trunk line transportation cost of the corresponding trunk line straight path according to the vehicle departure times of the vehicle types and the transportation unit prices of the vehicle types.

In the embodiment of the application, the actual cost can be determined according to the departure times of all vehicle types corresponding to each optional trunk road cargo path and the transportation unit prices of all vehicle types, so that the cost of each optional trunk road cargo path can be calculated according to the real-time transportation cost, and the accuracy of planning is improved on the basis of improving the flexibility of planning the cargo road cargo path.

Further, the third obtaining module 404 is further configured to: obtaining the operation cargo volume and unit operation cost of each outfield corresponding to the optional trunk line cargo walking path; and determining the corresponding outfield operation cost of the outfield according to the operation cargo volume and the unit operation cost.

In the embodiment of the application, the actual outfield operation cost can be determined according to the operation goods quantity of the outfield corresponding to each optional trunk goods-transporting path and the unit operation cost, so that the cost of each optional trunk goods-transporting path can be calculated according to the real-time operation cost, and the accuracy of planning is improved on the basis of improving the flexibility of the planning of the goods-transporting paths.

Further, the generating module 407 is further configured to: comparing actual costs corresponding to actual aging meeting the preset aging conditions in all the actual aging; the preset aging condition represents that the actual aging is not larger than the current aging corresponding to the current goods-taking path; and determining the selectable trunk road and cargo path with the minimum actual cost corresponding to the actual aging meeting the preset aging condition as the optimal road and cargo path.

In the embodiment of the application, in at least one optional trunk road and goods path, the optional trunk road and goods paths with time effectiveness meeting the conditions are firstly screened out, and then one optional trunk road and goods path meeting the conditions is selected out to be used as the optimal road and goods path. Therefore, the time efficiency requirement is firstly ensured to improve the user experience, and then the transportation cost is reduced.

Further, the second obtaining module 402 is further configured to: acquiring an optional branch line goods-taking path corresponding to a business department corresponding to the routing path; wherein the branch-line-selectable goods-taking path comprises a path between the business department and an external field; the determining the actual aging of the routing path corresponding to the optional trunk road and goods path according to the aging connection relationship of each node includes: determining the actual aging of the selectable trunk line cargo-moving path and the routing path corresponding to the selectable branch line cargo-moving path according to the aging connection relation of each node; the determining the actual cost of the routing path corresponding to the selectable trunk road and freight path according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk road and freight path includes: and determining the actual cost of the selectable trunk line goods-taking path and the routing path corresponding to the selectable branch line goods-taking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line goods-taking path and the branch line transportation cost corresponding to the selectable branch line goods-taking path.

In the embodiment of the application, when the information of the order of each goods is acquired, according to the routing path corresponding to the order and the real-time data of the branch-line-walking path, the branch-line-walking paths corresponding to the routing path, the trunk-line-walking paths corresponding to the routing path, and the actual time efficiency and the actual cost of each group of branch-line-walking paths and trunk-line-walking paths corresponding to the trunk-line-walking paths are determined, so that the optimal walking path corresponding to the order is generated according to the actual time efficiency and the actual cost. Therefore, the goods delivery path can be flexibly planned according to each order, so that the flexibility of planning the goods delivery path is improved.

Further, the optimal travel route generating device 400 further includes: and the fourth determining module is used for determining the stop route according to the actual timeliness if the route cargo volume and the real-time loading rate are lower than a first preset threshold value.

In the embodiment of the application, when the abnormal condition of the circuit vacancy occurs, the circuit can be determined to be stopped according to the actual time efficiency so as to reduce the transportation cost.

Further, the optimal travel route generating device 400 further includes: and the fifth determining module is used for determining a newly opened line according to the actual time effectiveness if the line cargo volume, the real-time loading rate and the line loading route cargo volume are higher than a second preset threshold value.

In the embodiment of the application, when the abnormal condition that the line exceeds the transportation capacity occurs, the newly opened line can be determined according to the actual time effect, so that the transportation time effect is ensured, and the user experience is improved.

Further, the optimal travel route generating device 400 further includes: and the adjusting module is used for adjusting the line cargo volume, the real-time loading rate and the cargo volume of the line distribution route to the line path corresponding to the line cargo volume and the real-time loading rate lower than the first preset threshold value, wherein the cargo volume of the line path is higher than the cargo volume of the line path corresponding to the second preset threshold value.

In this application embodiment, when the unusual condition of circuit deficit and circuit excess capacity appears, can adjust the way of living on the excess capacity circuit to on the deficit circuit to reduce the cost of transportation when guaranteeing the transportation ageing.

Referring to fig. 5, fig. 5 is a block diagram of an electronic device according to an embodiment of the present disclosure, where the electronic device 500 includes: at least one processor 501, at least one communication interface 502, at least one memory 503, and at least one communication bus 504. Wherein, the communication bus 504 is used for realizing direct connection communication of these components, the communication interface 502 is used for communicating signaling or data with other node devices, and the memory 503 stores machine readable instructions executable by the processor 501. When the electronic device 500 is running, the processor 501 communicates with the memory 503 through the communication bus 504, and the machine readable instructions are called by the processor 501 to execute the optimal delivery path generation method.

For example, the processor 501 of the embodiment of the present application may read the computer program from the memory 503 through the communication bus 504 and execute the computer program to implement the following method: step S101: and acquiring the goods order information. Step S102: the corresponding relation between the business department corresponding to the routing path and the external field and the trunk line direct line are obtained. Step S103: and determining all selectable trunk road and goods paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk direct-sending paths. Step S104: and acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk goods-passing path. Step S105: and determining the actual time limit of the routing path corresponding to the optional trunk road and goods path according to the time limit connection relation of each node. Step S106: and determining the actual cost of the routing path corresponding to the selectable trunk line cargo walking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line cargo walking path. Step S107: and generating an optimal goods-walking path according to all the actual timeliness and the actual cost.

The processor 501 may be an integrated circuit chip having signal processing capabilities. The Processor 501 may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field-Programmable Gate arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. Which may implement or perform the various methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The Memory 503 may include, but is not limited to, Random Access Memory (RAM), Read Only Memory (ROM), Programmable Read Only Memory (PROM), Erasable Read Only Memory (EPROM), electrically Erasable Read Only Memory (EEPROM), and the like.

It will be appreciated that the configuration shown in FIG. 5 is merely illustrative and that electronic device 500 may include more or fewer components than shown in FIG. 5 or have a different configuration than shown in FIG. 5. The components shown in fig. 5 may be implemented in hardware, software, or a combination thereof. In this embodiment, the electronic device 500 may be, but is not limited to, an entity device such as a desktop, a laptop, a smart phone, an intelligent wearable device, and a vehicle-mounted device, and may also be a virtual device such as a virtual machine. In addition, the electronic device 500 is not necessarily a single device, but may also be a combination of multiple devices, such as a server cluster, and the like.

Embodiments of the present application further provide a computer program product, including a computer program stored on a non-transitory computer-readable storage medium, where the computer program includes program instructions, and when the program instructions are executed by a computer, the computer can perform the steps of the optimal delivery path generation method in the foregoing embodiments, for example, including: acquiring goods order information; the goods order information comprises routing paths corresponding to the orders, wherein the routing paths comprise paths from an originating business department to an originating field, from the originating field to an arriving field and from the arriving field to the arriving business department; acquiring the corresponding relation between a business department corresponding to the routing path and an external field and a trunk line straight line; wherein the trunk straight hair path represents a path directly transmitting from one external field to another external field; determining all selectable trunk line goods-passing paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk line direct-sending paths; wherein said selectable trunk travel paths include at least one said trunk direct route between said originating external site to said arriving external site; acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk cargo path; the nodes comprise the business department and the outfield, the timeliness connection relationship of each node comprises transportation timeliness between the business department and the outfield and transportation timeliness between one outfield and another outfield, the trunk transportation cost is the transportation cost corresponding to each trunk straight-hair path, and the outfield operation cost is the operation cost corresponding to each outfield; determining the actual time limit of the routing path corresponding to the optional trunk line cargo-moving path according to the time limit connection relation of each node; determining the actual cost of the routing path corresponding to the selectable trunk line cargo walking path according to the trunk line transportation cost corresponding to the selectable trunk line cargo walking path and the outfield operation cost; and generating an optimal goods-walking path according to all the actual timeliness and the actual cost.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.

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

Furthermore, the functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.

The above description is only an example of the present application and is not intended to limit the scope of the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. An optimal delivery path generation method is characterized by comprising the following steps:

acquiring goods order information; the goods order information comprises routing paths corresponding to the orders, wherein the routing paths comprise paths from an originating business department to an originating field, from the originating field to an arriving field and from the arriving field to the arriving business department;

acquiring the corresponding relation between a business department corresponding to the routing path and an external field and a trunk line straight line; wherein the trunk straight hair path represents a path directly transmitting from one external field to another external field;

determining all selectable trunk line goods-passing paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk line direct-sending paths; wherein said selectable trunk travel paths include at least one said trunk direct route between said originating external site to said arriving external site;

acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk cargo path; the nodes comprise the business department and the outfield, the timeliness connection relationship of each node comprises transportation timeliness between the business department and the outfield and transportation timeliness between one outfield and another outfield, the trunk transportation cost is the transportation cost corresponding to each trunk straight-hair path, and the outfield operation cost is the operation cost corresponding to each outfield;

determining the actual time limit of the routing path corresponding to the optional trunk line cargo-moving path according to the time limit connection relation of each node;

determining the actual cost of the routing path corresponding to the selectable trunk line cargo walking path according to the trunk line transportation cost corresponding to the selectable trunk line cargo walking path and the outfield operation cost;

and generating an optimal goods-walking path according to all the actual timeliness and the actual cost.

2. The optimal shipment path generation method according to claim 1, wherein the obtaining of the trunk transportation cost corresponding to each selectable trunk shipment path comprises:

obtaining the vehicle type departure times and vehicle type transportation unit prices of the lines corresponding to each trunk straight-sending path in the selectable trunk goods-walking paths;

and determining the trunk line transportation cost of the corresponding trunk line straight path according to the vehicle departure times of the vehicle types and the transportation unit prices of the vehicle types.

3. The optimal delivery path generation method according to claim 1, wherein the obtaining of the outfield operation cost corresponding to each selectable trunk delivery path comprises:

obtaining the operation cargo volume and unit operation cost of each outfield corresponding to the optional trunk line cargo walking path;

and determining the corresponding outfield operation cost of the outfield according to the operation cargo volume and the unit operation cost.

4. The optimal shipment path generation method according to claim 1, wherein the generating the optimal shipment path according to all the actual aging and the actual cost includes:

comparing actual costs corresponding to actual aging meeting the preset aging conditions in all the actual aging; the preset aging condition represents that the actual aging is not larger than the current aging corresponding to the current goods-taking path;

and determining the selectable trunk road and cargo path with the minimum actual cost corresponding to the actual aging meeting the preset aging condition as the optimal road and cargo path.

5. The optimal shipment path generation method according to claim 1, wherein the acquiring of the correspondence between the business department corresponding to the routing path and the external field includes:

acquiring an optional branch line goods-taking path corresponding to a business department corresponding to the routing path; wherein the branch-line-selectable goods-taking path comprises a path between the business department and an external field;

the determining the actual aging of the routing path corresponding to the optional trunk road and goods path according to the aging connection relationship of each node includes:

determining the actual aging of the selectable trunk line cargo-moving path and the routing path corresponding to the selectable branch line cargo-moving path according to the aging connection relation of each node;

the determining the actual cost of the routing path corresponding to the selectable trunk road and freight path according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk road and freight path includes:

and determining the actual cost of the selectable trunk line goods-walking path and the routing path corresponding to the selectable branch line goods-walking path according to the trunk line transportation cost and the outfield operation cost corresponding to the selectable trunk line goods-walking path and the branch line transportation cost corresponding to the selectable branch line goods-walking path.

6. The optimal shipment path generation method according to claim 1, further comprising:

if the cargo quantity and the real-time loading rate of the line are lower than a first preset threshold value, determining a stop line according to the actual aging;

and if the line cargo volume, the real-time loading rate and the line loading route cargo volume are higher than a second preset threshold value, determining to newly open the line according to the actual aging.

7. The optimal shipment path generation method according to claim 1, further comprising:

and adjusting the line cargo volume, the real-time loading rate and the cargo volume of the line stowage route to the line path corresponding to the line cargo volume and the real-time loading rate lower than the first preset threshold value.

8. An optimal travel route generation device, comprising:

the first acquisition module is used for acquiring the information of the goods order; the goods order information comprises routing paths corresponding to the orders, wherein the routing paths comprise paths from an originating business department to an originating field, from the originating field to an arriving field and from the arriving field to the arriving business department;

a second obtaining module, configured to obtain a correspondence between a business department corresponding to the routing path and an external field, and a trunk line straight line; wherein the trunk straight hair path represents a path directly transmitting from one external field to another external field;

the first determining module is used for determining all selectable trunk line goods-passing paths corresponding to the routing paths according to the corresponding relation between the business department and the external field and the trunk line direct-sending paths; wherein said selectable trunk travel paths include at least one said trunk direct route between said originating external site to said arriving external site;

the third acquisition module is used for acquiring the time efficiency connection relation, the trunk transportation cost and the outfield operation cost of each node corresponding to each optional trunk goods-moving path; the nodes comprise the business department and the outfield, the timeliness connection relationship of each node comprises transportation timeliness between the business department and the outfield and transportation timeliness between one outfield and another outfield, the trunk transportation cost is the transportation cost corresponding to each trunk straight-hair path, and the outfield operation cost is the operation cost corresponding to each outfield;

a second determining module, configured to determine, according to the aging connection relationship between the nodes, an actual aging of the routing path corresponding to the optional trunk road-to-cargo path;

a third determining module, configured to determine, according to the trunk transportation cost and the outfield operation cost corresponding to the selectable trunk shipment path, an actual cost of a routing path corresponding to the selectable trunk shipment path;

and the generating module is used for generating an optimal goods-walking path according to all the actual timeliness and the actual cost.

9. An electronic device, comprising: a processor, a memory, and a bus;

the processor and the memory are communicated with each other through the bus;

the memory stores program instructions executable by the processor, the processor calling the program instructions to be able to execute the optimal shipment path generation method according to any one of claims 1 to 7.

10. A non-transitory computer-readable storage medium storing computer instructions which, when executed by a computer, cause the computer to perform the optimal shipment path generation method according to any one of claims 1 to 7.