CN118014466B

CN118014466B - Digital full supply chain logistics method and system

Info

Publication number: CN118014466B
Application number: CN202410424251.6A
Authority: CN
Inventors: 黄雪; 杨阳
Original assignee: Beijing Boduo International Freight Forwarding Co ltd
Current assignee: Beijing Boduo International Freight Forwarding Co ltd
Priority date: 2024-04-10
Filing date: 2024-04-10
Publication date: 2024-06-25
Anticipated expiration: 2044-04-10
Also published as: CN118014466A

Abstract

The invention discloses a digital full supply chain logistics method and system, comprising the following steps: acquiring all logistics nodes and logistics node associated data as a first logistics database; acquiring first logistics demand data; extracting scheduling data of logistics nodes meeting the first logistics demand from the first logistics database according to the acquired first logistics demand data to serve as a first logistics scheduling scheme; the extracted first stream scheduling scheme is used as a second stream scheduling scheme after being subjected to preferential selection sequencing and screening; and outputting the second stream scheduling scheme to provide an optimized stream scheduling scheme. Through scientific and reasonable screening process, progressively reduce logistics scheduling scheme's scope, can provide more accurate optimized logistics scheduling scheme.

Description

Digital full supply chain logistics method and system

Technical Field

The application belongs to the field of logistics and digital application, and particularly relates to a digital full-supply chain logistics method and system.

Background

With the continuous acceleration of economic development, the logistics industry is used as a key link for connecting the upstream and downstream of an industrial chain, and the efficiency and the intelligence level of the logistics industry directly influence the competitiveness and the market adaptability of enterprises. The conventional logistics system generally depends on manual operation in the aspect of logistics scheduling, and logistics nodes are selected and scheduled through experience of a dispatcher, so that the method is low in working efficiency, and a logistics scheduling scheme with more scientific and reasonable traffic and timeliness cannot be quickly and accurately found, so that the logistics process is difficult to accurately control and manage.

Therefore, the logistics method and the logistics system capable of reasonably and accurately optimizing the logistics scheduling scheme are provided, so that logistics efficiency and intelligence level are improved, and the logistics method and the logistics system become urgent demands for development of the current logistics industry.

Disclosure of Invention

In view of the above problems, the present invention provides the following solutions:

in a first aspect, the invention provides a method of digitizing a full supply chain stream, the method comprising:

Acquiring all logistics nodes and logistics node associated data as a first logistics database;

Acquiring first logistics demand data;

extracting scheduling data of logistics nodes meeting the first logistics demand from the first logistics database according to the acquired first logistics demand data to serve as a first logistics scheduling scheme;

the extracted first stream scheduling scheme is used as a second stream scheduling scheme after being subjected to preferential selection sequencing and screening;

outputting the second stream scheduling scheme and providing an optimized stream scheduling scheme;

the logistics nodes are logistics sites set for logistics enterprises in a logistics database;

Specifically, the associated data of the logistics node is various data related to logistics, including but not limited to: position information of logistics nodes, carrier transportation volume information, carrier quantity, transportation quantity information, transportation speed information, transit time information and the like;

the logistics demand data is related data of logistics transportation capacity required by the current logistics task;

The first logistics node scheduling scheme is to combine logistics nodes on the premise of meeting the first logistics demand to form a specific logistics node scheduling scheme;

the priority selection sequencing is to reorder the first logistics scheduling scheme according to a set rule, and the sequence after sequencing is the priority selection sequence;

According to the first logistics demand data, a logistics scheduling scheme meeting the first logistics demand condition is screened out from a first logistics database to serve as a first logistics scheduling scheme; and then, the first physical flow scheduling scheme is subjected to preferential selection, sequencing and screening to obtain a second physical flow scheduling scheme, and finally, the second physical flow scheduling scheme is used as a final physical flow scheduling scheme which is output after optimization. The process of obtaining the final logistics scheduling scheme is to screen the part of logistics scheduling scheme meeting the first logistics requirement from the first logistics database, then continue to perform priority selection and sorting according to the set rule, further screen the optimized final logistics scheduling scheme according to the screening condition, gradually narrow the range of the logistics scheduling scheme in the whole process, and scientifically and reasonably provide the optimized final logistics scheduling scheme.

Further, the first logistics demand data includes: related data of the articles to be transported and related data of the required transportation capacity;

the first logistics requirement data of the present invention comprises data related to both the object to be transported and the required transportation capacity, for example, the data related to the object to be transported comprises but is not limited to: volume information, quantity information, quality information, etc. of the bag shipping items, and related data of the desired shipping capacity, including, but not limited to: information such as the transport quantity of the required logistics, transport aging and the like; the two aspects are taken as main factors for reflecting the first logistics demand, so that the actual logistics demand can be comprehensively reflected, detailed specific related data can be given, the subsequent screening process is more comprehensive and accurate, and objective and accurate screening standards are provided for determining the first logistics scheduling scheme.

Further, according to the obtained first logistics demand data, extracting scheduling data of logistics nodes meeting the first logistics demand from the first logistics database as a first logistics scheduling scheme, including:

Determining minimum transport volume information and minimum load information which are required to enable the to-be-transported object to be matched with the transport carrier according to the acquired first logistics demand data, and taking the minimum transport volume information and the minimum load information as first transport information;

Screening all logistics nodes and logistics node associated data in the first logistics database according to the first transportation information, and extracting all logistics nodes meeting the first transportation information to serve as a second logistics database;

Determining total transport quantity required by transporting all the articles to be transported to a target position according to the acquired first logistics demand data, and taking the total transport quantity as second transport information;

Scheduling and combining the logistics nodes in the second logistics database according to the second transportation information to form scheduling data of the logistics nodes as a first logistics scheduling scheme;

The scheduling combination is used for screening a logistics scheduling scheme at least comprising one logistics node according to the principle that the sum of the transportation quantity of the logistics nodes in the second logistics database after different combinations meets the second transportation information;

According to the method, two parts of information, namely first transportation information and second transportation information, are obtained from first logistics demand data, wherein the first transportation information is related logistics demand information of an object to be transported, the second transportation information is related logistics demand information of required transportation capacity, all logistics nodes meeting the first transportation information are screened out to serve as a second logistics data base, and then the logistics nodes in the second logistics data base are subjected to scheduling combination according to the second transportation information, so that a logistics scheduling scheme capable of meeting the first logistics demand data is obtained, and the logistics scheduling scheme is used as the first logistics scheduling scheme. The process of determining the first logistics scheduling scheme is to extract logistics nodes capable of meeting the required minimum transportation volume information and the minimum load information through the first transportation information, and schedule and combine the logistics nodes extracted through the second transportation information, so that the scheduling combination of various logistics nodes capable of completely meeting the first logistics demand data is gradually obtained, and the first logistics scheduling scheme is formed together.

Further, after the extracted first stream scheduling scheme is subjected to preferential sorting and screening, the method is used as a second stream scheduling scheme, and comprises the following steps:

acquiring first ordering information of each logistics scheduling scheme in the first logistics scheduling scheme;

determining a first priority index of each logistics scheduling scheme in the first logistics scheduling scheme according to the first ordering information;

Sequencing all the logistics scheduling schemes in the first logistics scheduling scheme according to the sequence from the big to the small of the first priority index, and then using the sequencing as a third logistics scheduling scheme;

Screening all the logistics scheduling schemes meeting the first threshold value requirement from the third logistics scheduling scheme according to the relation between the first priority index and the first threshold value, and taking the logistics scheduling schemes as a second logistics scheduling scheme;

the first ordering information is related data of a logistics scheduling scheme on the traffic and logistics hierarchical structure;

the first priority index is an index which reflects the comprehensive optimization degree of the logistics scheduling scheme on the transportation quantity and the logistics node hierarchical structure and is determined according to the first ordering information;

The logistics node level is a level divided from high to low according to the traffic scale and the transportation coverage of the logistics nodes; specifically, the logistics node level can be divided into levels by adopting the common principles of provincial level, municipal level and county level from high to low in administrative district, or other types of levels according to the traffic scale and the transportation coverage range of the logistics node from high to low;

the first threshold is a set threshold for screening, which corresponds to the first priority index;

According to the invention, according to the related data (namely first ordering information) of the logistics scheduling schemes on the transportation quantity and the logistics node hierarchical structure, a first priority index of each logistics scheduling scheme in the first logistics scheduling scheme is determined, then each logistics scheduling scheme in the first logistics scheduling scheme is ordered according to the size of the first priority index, and finally, a second logistics scheduling scheme is screened out through a first threshold. The specific data of the logistics scheduling schemes on the transportation quantity and the logistics node hierarchical structure are converted into quantifiable indexes (namely first optimization indexes), so that each logistics scheduling scheme can be accurately compared after being quantified under the same standard, and accurate screening results can be obtained through screening of the first threshold value, and therefore a more accurate and optimized logistics scheduling scheme can be provided.

Further, the first sorting information includes the total number of logistics node levels, the number of logistics nodes of each level, the total number of logistics nodes, the standard traffic of the logistics nodes and the number of standard traffic which can be provided by the logistics nodes in the logistics scheduling scheme;

The standard traffic volume of the logistics node is single traffic volume data which can be provided by a main force transportation carrier used by the logistics node;

Specifically, the standard transportation volume of the logistics node is the rated transportation volume which can be provided by the principal transportation vehicle configured at the logistics node by a logistics enterprise, and other non-principal transportation vehicles can be converted into the standard transportation volume with proper quantity according to the set rule, so that the actual transportation capacity of the logistics node is comprehensively, objectively and reasonably measured;

The invention uses the total number of the logistics node layers, the number of the logistics nodes of each layer, the total number of the logistics nodes, the standard traffic of the logistics nodes and the number of the standard traffic which can be provided by the logistics nodes as the first sequencing information, wherein the traffic comprises the standard traffic of the logistics nodes and the number of the standard traffic which can be provided by the logistics nodes, different standard traffic and the number of the different standard traffic can be determined according to the actual condition of each logistics node, and the total traffic of the logistics nodes is accurately represented; the aspect of the logistics node hierarchical structure comprises the hierarchical total number of logistics nodes, the number of logistics nodes of each hierarchical level and the total number of logistics nodes, and the hierarchical structure related parameters of more comprehensive logistics are contained; therefore, the first ordering information is not only comprehensive in selection, but also provides scientific and reasonable parameters for determining the first optimization index.

Further, the first priority index is specifically as follows:

；

Wherein A is a first priority index of a logistics scheduling scheme;

the total number of the levels of the logistics nodes in the logistics scheduling scheme is calculated;

The total number of the logistics nodes in the logistics scheduling scheme;

The total amount of transportation required to meet the logistics task;

For the logistics scheduling scheme, the first/>, in the same-level logistics node A personal logistics node;

the number of the 1 st-level logistics nodes in the logistics scheduling scheme;

Is the 1 st layer logistics node in the logistics scheduling scheme Single standard traffic of individual logistics nodes;

Is the 1 st layer logistics node in the logistics scheduling scheme The number of individual standard traffic that an individual logistics node is capable of providing;

the number of the 2 nd-level logistics nodes in the logistics scheduling scheme;

for the/>, in the 2 nd-level logistics node in the logistics scheduling scheme Single standard traffic of individual logistics nodes;

for the/>, in the 2 nd-level logistics node in the logistics scheduling scheme The number of individual standard traffic that an individual logistics node is capable of providing;

for the/>, in the logistics scheduling scheme The number of hierarchical logistics nodes;

for the/>, in the logistics scheduling scheme First/>, in a hierarchical logistics nodeSingle standard traffic of individual logistics nodes;

for the/>, in the logistics scheduling scheme First/>, in a hierarchical logistics nodeThe number of individual standard traffic that an individual logistics node is capable of providing;

Wherein, ；

The parameters and the specific data are the corresponding parameters and data of the same logistics scheduling scheme.

According to the first optimization index, the total transportation quantity of all logistics nodes and the hierarchical distribution structure of the logistics nodes in the whole logistics scheduling scheme are comprehensively expressed through related parameters and a reasonable model, so that the advantages and disadvantages of each logistics scheduling scheme can be directly compared under a unified standard, the physical distribution system is fit to reality, and the result is accurate.

Further, after screening each logistics scheduling scheme meeting the first threshold requirement according to the relation between the first priority index and the first threshold in the third logistics scheduling scheme, the method further includes:

Taking the selected logistics scheduling schemes meeting the first threshold requirement as a fourth logistics scheduling scheme;

acquiring second ordering information of each logistics scheduling scheme from the fourth logistics scheduling scheme;

determining a second priority index of each flow scheduling scheme in the fourth flow scheduling scheme according to the second ordering information;

Sequencing all the logistics scheduling schemes in the fourth logistics scheduling scheme according to the sequence from the big to the small of the second priority index, and then using the fourth logistics scheduling scheme as a fifth logistics scheduling scheme;

Screening all the logistics scheduling schemes meeting the second threshold value requirement from the fifth logistics scheduling scheme according to the relation between the second priority index and the second threshold value to serve as a second logistics scheduling scheme;

The second ordering information is related data of the logistics scheduling scheme in terms of transportation timeliness;

the second priority index is an index which reflects the comprehensive optimization degree of the logistics scheduling scheme on the transportation timeliness and is determined according to the second ordering information;

according to the invention, after the first priority index is screened, a second priority index reflecting the transportation timeliness of the logistics scheduling scheme is added, and the screening is performed again, so that not only is the quality of the logistics scheduling scheme accurately compared with the quality of the logistics node hierarchical structure, but also the transportation timeliness can be continuously and further compared, and a more objective and comprehensive screening result is obtained.

Further, the second sorting information comprises the total number of logistics node levels, the number of logistics nodes of each level, the transportation distance between the logistics nodes, the transit time of the logistics nodes and the transportation speed of the logistics nodes in each logistics scheduling scheme;

the transit time of the logistics node is the time spent by a transportation carrier from reaching the logistics node to preparing to go to the next logistics node in the cargo transportation process;

according to the invention, the total number of logistics node levels, the number of logistics nodes at each level, the transportation distance between the logistics nodes, the transit time of the logistics nodes and the transportation speed of the logistics nodes in the logistics scheduling scheme are taken as second ordering information together, so that the transportation timeliness of the logistics scheduling scheme can be accurately represented by determining the data such as the transportation distance, the transit time, the transportation speed and the like between different logistics nodes according to the actual situation of each logistics node in the transportation timeliness aspect; therefore, the second ranking information is not only comprehensive in selection, but also provides scientific and reasonable parameters for determining the second optimization index.

Further, the second priority index is specifically as follows:

；

a second priority index is used for the logistics scheduling scheme;

Standard logistics time consumed for meeting the transportation timeliness of logistics tasks;

for the/>, in the same-level logistics node in a logistics scheduling scheme A personal logistics node;

The number of the logistics nodes of the 1 st level in the logistics scheduling scheme;

is the 1 st item in the logistics node of the 1 st level in the logistics scheduling scheme A maximum value of the transportation path between the individual logistics node and the target logistics node of the next level;

is the 1 st item in the logistics node of the 1 st level in the logistics scheduling scheme Minimum transport speed for individual logistics nodes;

is the 1 st item in the logistics node of the 1 st level in the logistics scheduling scheme Maximum transit time of individual logistics nodes;

the number of the logistics nodes of the 2 nd level in the logistics scheduling scheme;

is the (th) >, of the 2 nd-level logistics nodes in the logistics scheduling scheme A maximum value of the transportation path between the individual logistics node and the target logistics node of the next level;

is the (th) >, of the 2 nd-level logistics nodes in the logistics scheduling scheme Minimum transport speed for individual logistics nodes;

is the (th) >, of the 2 nd-level logistics nodes in the logistics scheduling scheme Maximum transit time of individual logistics nodes;

for the/>, in the logistics scheduling scheme The number of logistics nodes of the hierarchy;

for the/>, in the logistics scheduling scheme In the logistics node of the hierarchyA maximum value of the transportation path between the individual logistics node and the target logistics node of the next level;

for the/>, in the logistics scheduling scheme In the logistics node of the hierarchyMinimum transport speed for individual logistics nodes;

for the/>, in the logistics scheduling scheme In the logistics node of the hierarchyMaximum transit time of individual logistics nodes;

According to the second optimization index disclosed by the invention, the transportation timeliness of the whole logistics scheduling scheme is comprehensively expressed through the related parameters and the reasonable model, so that the advantages and disadvantages of the transportation timeliness of each logistics scheduling scheme can be directly compared under a unified standard, the practical fit is realized, and the result is accurate.

In a second aspect, the present invention provides a digital full supply chain logistics system, the system comprising:

The logistics data acquisition unit is used for acquiring all logistics nodes and logistics node associated data as a first logistics database;

the logistics demand acquisition unit is used for acquiring first logistics demand data;

The logistics scheme extraction unit is used for extracting scheduling data of logistics nodes meeting the first logistics requirement from the first logistics database according to the acquired first logistics requirement data to serve as a first logistics scheduling scheme;

The logistics scheme screening unit is used for selecting, sorting and screening the extracted first logistics scheduling scheme preferentially and then taking the first logistics scheduling scheme as a second logistics scheduling scheme;

The logistics scheme output unit is used for outputting the second logistics scheduling scheme and providing an optimized logistics scheduling scheme;

and the priority sorting is to reorder the first material flow scheduling scheme according to a rule, wherein the sorted order is the priority order.

In a third aspect, the present invention provides a computer readable storage medium having stored thereon a computer program which when executed by a processor implements the method of the first aspect.

In a fourth aspect, the present invention provides a computer apparatus comprising a memory and a processor; the memory is used for storing a computer program; the processor is configured to implement the method according to the first aspect when executing the computer program.

In summary, according to the first transportation information and the second transportation information of the first logistics demand data, a first logistics scheduling scheme is screened out from a first logistics database; and then, the first physical distribution scheme is subjected to priority selection sequencing and screening of the first priority index and the second priority index to obtain a second physical distribution scheme, and finally, the second physical distribution scheme is used as a final physical distribution scheme which is output after optimization. The process logic for determining the final logistics scheduling scheme is clear, scientific and reasonable, and the process of optimizing and selecting the ordering and screening is round-robin, so that not only is information, index, model, parameter and the like selected to be more comprehensive and objective, but also the result of optimizing and selecting the ordering and screening is more accurate, and the final logistics scheduling scheme can be obtained quickly and accurately. The invention can provide the digitalized full-supply chain logistics method and system with higher efficiency and better intelligent level for logistics enterprises, product manufacturers and logistics users, and the traditional complicated operation flow is efficient, the selection of logistics scheduling is intelligent, so that the logistics process is controlled and managed more accurately.

Drawings

For ease of illustration, the application is described in detail by the following detailed description and the accompanying drawings.

FIG. 1 is a schematic flow chart of the method of the present invention;

FIG. 2 is a second flow chart of the method of the present invention;

FIG. 3 is a schematic diagram of a system architecture of the present invention;

FIG. 4 is a schematic diagram of a computer readable storage medium of the present invention;

FIG. 5 is a schematic diagram of a computer device according to the present invention.

Detailed Description

The following description of the embodiments of the present application will be made clearly and completely with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without any inventive effort, are intended to be within the scope of the application.

Example 1

As shown in fig. 1, the present embodiment provides a method for digitizing a full supply chain stream, which is characterized in that the method includes:

Acquiring first logistics demand data;

Further, as shown in fig. 2, according to the obtained first logistics demand data, the extracting, from the first logistics database, scheduling data of logistics nodes meeting the first logistics demand as a first logistics scheduling scheme includes:

Further, the first priority index is specifically as follows:

；

Wherein A is a first priority index of a logistics scheduling scheme;

The total number of the logistics nodes in the logistics scheduling scheme;

The total amount of transportation required to meet the logistics task;

Wherein, ；

The parameters and the specific data thereof are corresponding parameters and data of the same logistics scheduling scheme;

Further, the second priority index is specifically as follows:

；

a second priority index is used for the logistics scheduling scheme;

Example 2

As shown in fig. 3, the present embodiment provides a digital all-supply-chain logistics system, comprising:

The priority sorting is that the first material flow scheduling scheme is reordered according to rules, and the sorted order is the priority order;

Further, the first priority index is specifically as follows:

；

Wherein A is a first priority index of a logistics scheduling scheme;

The total number of the logistics nodes in the logistics scheduling scheme;

The total amount of transportation required to meet the logistics task;

Wherein, ；

Further, the second priority index is specifically as follows:

；

a second priority index is used for the logistics scheduling scheme;

is the (th) >, of the 2 nd-level logistics nodes in the logistics scheduling scheme Minimum transport speed for individual logistics nodes; /(I)

Is the (th) >, of the 2 nd-level logistics nodes in the logistics scheduling schemeMaximum transit time of individual logistics nodes;

Example 3

As shown in fig. 4, the present embodiment provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method as described in embodiment 1.

Example 4

As shown in fig. 5, the present embodiment provides a computer apparatus including a memory and a processor; the memory is used for storing a computer program; the processor, when configured to execute the computer program, implements the method according to embodiment 1.

It will be clearly understood by those skilled in the art that, for convenience and brevity of description, specific working processes of the above-described systems, media, devices, modules and units may refer to corresponding processes in the foregoing method embodiments, which are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and the division of the modules or units, for example, is merely a logical function division, and there may be additional divisions when actually implemented, for example, multiple modules or units may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the illustrated or discussed connection may be formed directly or indirectly via some interface, device or unit, or may be in the form of an electrical, mechanical, or other connection.

The modules or units described as separate components may or may not be physically separate, and components shown as modules or units may or may not be physical modules or units, may be located in one place, or may be distributed over a plurality of network modules or units. Some or all of the modules or units may be selected according to actual needs to achieve the purpose of the embodiment.

In addition, each functional module or unit in the embodiments of the present application may be integrated in one processing module or unit, or each module or unit may exist alone physically, or two or more modules or units may be integrated in one module or unit. The integrated modules or units described above may be implemented in hardware or in software functional units.

The integrated system, module, unit, etc. may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as a stand alone product. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a storage medium, including instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

Finally, it should be noted that the above embodiments are merely illustrative of the technical solution of the present application, and not limiting thereof; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method of digitizing a full supply chain stream, the method comprising:

Acquiring first logistics demand data;

After the extracted first stream scheduling scheme is subjected to preferential selection ordering and screening, the first stream scheduling scheme is used as a second stream scheduling scheme, and the method comprises the following steps:

The logistics node level is a level divided from high to low according to the traffic scale and the transportation coverage of the logistics nodes;

the first sorting information comprises the total number of logistics node levels, the number of logistics nodes of each level, the total number of logistics nodes, the standard traffic of the logistics nodes and the number of standard traffic which can be provided by the logistics nodes in a logistics scheduling scheme;

The first priority index is specifically as follows:

；

Wherein A is a first priority index of a logistics scheduling scheme;

The total number of the logistics nodes in the logistics scheduling scheme;

The total amount of transportation required to meet the logistics task;

Wherein, ；

2. The digitized full supply chain stream method of claim 1 wherein said first stream demand data comprises: related data of the item to be transported and related data of the required transport capacity.

3. The method according to claim 1, wherein the extracting, from the first logistics database, scheduling data of logistics nodes meeting the first logistics demand as a first logistics scheduling scheme according to the acquired first logistics demand data comprises:

And the scheduling combination is used for screening a logistics scheduling scheme at least comprising one logistics node according to the principle that the sum of the transportation quantity of the logistics nodes in the second logistics database after different combinations meets the second transportation information.

4. The method according to claim 1, wherein after screening each flow scheduling scheme satisfying the first threshold requirement according to the relation between the first priority index and the first threshold from the third flow scheduling schemes, the method further comprises:

The second priority index is an index which reflects the comprehensive optimization degree of the logistics scheduling scheme on the transportation timeliness and is determined according to the second ordering information.

5. The method of claim 4, wherein the second ordering information includes total number of logistics node levels, number of logistics nodes of each level, transportation distance between logistics nodes, transit time of logistics nodes, transportation speed of logistics nodes in each logistics scheduling scheme;

The transit time of the logistics node is the time spent by the transportation carrier from reaching the logistics node to preparing to go to the next logistics node in the cargo transportation process.

6. The method of digitizing a full supply chain stream according to claim 5, wherein the second priority indicator is specifically as follows:

；

a second priority index is used for the logistics scheduling scheme;

7. A digital all supply chain logistics system, said system comprising:

The first priority index is specifically as follows:

；

Wherein A is a first priority index of a logistics scheduling scheme;

The total number of the logistics nodes in the logistics scheduling scheme;

The total amount of transportation required to meet the logistics task;

Wherein, ；