Search

CN-122022617-A - Cross-border logistics cost optimization method, system, equipment, medium and program product

CN122022617ACN 122022617 ACN122022617 ACN 122022617ACN-122022617-A

Abstract

The application discloses a cross-border logistics cost optimization method, a system, equipment, a medium and a program product, and aims to solve the problems of high tail-pass cost and low optimization efficiency in cross-border logistics. The method comprises the steps of obtaining package delivery information and cost parameters such as a head process, a clear gateway and a tail process price card, constructing a feasible delivery path set containing elements such as an originating warehouse and a destination airport for each package according to a preset reachability rule, screening packages which have common feasible delivery paths under the same order and support confluence at the corresponding airport to form a confluence set, constructing an integer programming model with minimum total logistics cost, solving by adopting a branch and bound algorithm, and outputting the optimal delivery path and confluence decision result of each package. According to the method, the overall cost optimization of the cross-border logistics is realized through scientific modeling and efficient solving of the cross-border logistics cost, a large-scale parcel scene is adapted, and the logistics cost management efficiency and reliability can be improved.

Inventors

  • YIN HAO
  • HUO JIANGUANG

Assignees

  • 广州希音国际进出口有限公司
  • 南京希音电子商务有限公司
  • 深圳希音信息技术有限公司

Dates

Publication Date
20260512
Application Date
20251211

Claims (10)

  1. 1. A method of cost optimization for a cross-border stream, comprising: the method comprises the steps of obtaining package delivery information and logistics cost parameters, wherein the package delivery information comprises package numbers, order numbers, an originating warehouse, destination postal codes and package weights, the logistics cost parameters comprise head bill kilogram cost, clearance bill kilogram cost and price card data provided by tail service providers, and the price card data comprises tail service provider names, destination partitions and tail bill kilogram dispatch prices corresponding to all weight segments; Constructing all feasible delivery path sets for each package according to a preset reachability rule, wherein each delivery path comprises an originating warehouse, a destination airport, a tail-path server, a destination partition and a destination zip code; Aiming at a plurality of packages placed in the same order, if any two packages in the plurality of packages have at least one common feasible delivery path and the corresponding destination airports support confluence, forming the corresponding packages into a confluent package set; An integer programming model aiming at minimizing the total logistics cost, wherein the total logistics cost is the sum of the head cost, clearance cost and tail cost corresponding to the delivery route selected by all packages; and solving the integer programming model by adopting a branch-and-bound algorithm, and outputting the optimal delivery path and the confluence decision result of each package.
  2. 2. The cost optimization method of claim 1, wherein the reachability rule comprises: there are available transportation flights between the origin warehouse and the destination airport, the destination zip code belongs to a reachable partition under the destination airport association of the tail service Shang Zaisuo, the destination airport supports tail Cheng Geliu operations.
  3. 3. The cost optimization method of claim 1, wherein the integer programming model uses the following calculation formula: ; Wherein, the In order to minimize the function of the function, Representing a collection of shipping packages, One of which is shown as a package, Representing packages A collection of all of the delivery paths, The representation is one of the ways in which, Representing packages Is added to the package weight of the steel sheet, Representing delivery routes Is provided with a cost of one kilogram of (2), Representing packages Whether to select a delivery route A variable having a value of 0 or 1.
  4. 4. The cost optimization method of claim 1, wherein the integer programming model comprises the following constraints: the merged packages need to select the same delivery way; the total weight of the joined packages needs to fall within the weight range allowed in the selected delivery route; Each package participates in at most one confluence combination; each package can only select one viable delivery route; If the package does not participate in the merge, its weight must fall within the weight segment of the corresponding value card in the selected shipping route.
  5. 5. The cost optimization method of claim 4, wherein the total weight of the joined packages is within the weight range allowed in the selected delivery route, using the following calculation formula: ; ; ; Wherein, the Representing packages And package Whether confluence is carried out or not, and taking a variable with a value of 0 or 1; Representing packages Is a parcel weight of (2); Representing packages Whether to select a delivery route , Representing packages Is wrapped by the confluence of (a) Whether to select a delivery route , And The values of (2) are all 0 or 1 variables; 、 Respectively represent delivery routes Transportable weight segment minimum and maximum; Representing packages Is a confluent parcel collection; Respectively representing packages All delivery path sets; Representing a positive integer, and the value range is larger than 1000000.
  6. 6. The cost optimization method of claim 1, wherein solving the integer programming model using a branch-and-bound algorithm to output an optimal delivery path and a confluence decision result for each package comprises: relaxing the integer programming model into a linear programming model, and solving the linear programming model by adopting a simplex method to obtain a linear programming optimal solution; Sequentially carrying out two-branch processing on each non-integer solution variable in the linear programming optimal solution to generate a corresponding sub-problem; and iteratively calculating the logistics cost of each sub-problem with the minimum logistics cost as a target until an optimal solution meeting integer constraint is obtained.
  7. 7. A system for cost optimization of a cross-border logistics, comprising: the data acquisition module is used for acquiring package delivery information and logistics cost parameters, wherein the package delivery information comprises package numbers, order numbers, an originating warehouse, destination postal codes and package weights, the logistics cost parameters comprise head bill kilogram cost, clearance bill kilogram cost and price card data provided by tail service providers, and the price card data comprises tail service provider names, destination partitions and tail bill kilogram dispatch prices corresponding to all weight segments; The delivery path construction module is used for constructing all feasible delivery path sets for each package according to a preset reachability rule, wherein each delivery path comprises an originating warehouse, a destination airport, a tail-program server, a destination partition and a destination zip code; The parcel converging module is used for aiming at a plurality of parcels placed in the same order, and if any two parcels in the plurality of parcels have at least one common feasible delivery path and the corresponding destination airports support converging, the corresponding parcels form a converging parcel set; The integral planning model construction module is used for constructing an integral planning model aiming at minimizing the total logistics cost, wherein the total logistics cost is the sum of the head cost, clearance cost and tail cost corresponding to the delivery way selected by all packages; And the calculation module is used for solving the integer programming model by adopting a branch-and-bound algorithm and outputting the optimal delivery path and the confluence decision result of each package.
  8. 8. A computer electronic device comprising a memory storing a computer program and a processor implementing the steps of the method of cost optimization of a cross-border logistics of any one of claims 1-6 when the computer program is executed by the processor.
  9. 9. A computer readable storage medium, characterized in that it stores a computer program which, when executed by a processor, implements the steps of the method for cost optimization of a cross-border logistics according to any of claims 1-6.
  10. 10. A computer program product, characterized in that it comprises computer instructions stored in a computer readable storage medium, which are read by a processor of a computer device from the computer readable storage medium, which are executed by the processor, such that the computer device performs the steps of the method for cost optimization of a cross-border logistics according to any of the claims 1-6.

Description

Cross-border logistics cost optimization method, system, equipment, medium and program product Technical Field The application belongs to the technical field of intelligent logistics, and particularly relates to a cross-border logistics cost optimization method, a system, equipment, a medium and a program product. Background The rapid development of cross-border electronic commerce promotes the large-scale expansion of the cross-border logistics industry, and the cross-border logistics is used as a key hub for connecting transaction subjects in different countries, and a plurality of links such as seller national trunk logistics, international logistics, buyer national trunk logistics and the like are integrated, so that a series of processes such as going to the gate for collection, inland transportation, export customs declaration, international transportation, clearance, local distribution and the like are involved. Compared with domestic logistics, the cross-border logistics is influenced by multiple factors such as policy regulations, currency settlement, customs supervision, geographical distance and the like in different countries, the links are more complicated, the cooperative difficulty is higher, the cost structure is more complex, the core modules such as the head-pass transportation cost, the clearance cost, the tail-pass delivery cost and the like are mainly covered, the tail-pass delivery is used as a key link for finally touching a receiver after goods arrive at a destination country, the cost ratio is high, and the influence factors are more (such as destination partition, package weight, dispatching timeliness, service provider pricing and the like), so that the cross-border logistics cost control is core pain. To reduce the total cost of cross-border logistics, the need for tail-end cost optimization within the industry is becoming increasingly stringent. At present, the conventional cross-border logistics tail-pass cost management mainly relies on a mode of combining traditional financial software assistance and manual processing, and the core flow is that a special batch of packages are taken as a management range, limited optimization options such as possible transportation paths, service provider selection and the like are manually exhausted based on logistics cost data recorded by a financial system, and transportation efficiency and cost under different combinations are manually deduced, so that a scheme with lower cost under subjective judgment is finally screened out. However, the prior art has obvious defects and shortcomings, the cost optimization requirement of a large-scale package delivery scene of a current cross-border electronic commerce is difficult to meet, the optimization range of manual processing is limited, combination screening can be performed only in limited options, all possible multi-dimensional schemes such as package delivery paths, confluence combination, service provider selection and the like cannot be covered, the optimization space is seriously compressed, the scientific mathematical model support is lacking, the optimality of a result of manual deduction cannot be proved by quantitative calculation, only local cost reduction can be realized, the goal of global logistics cost minimization is difficult to achieve, the efficiency of manual operation is low and mistakes are easy to occur, the large-scale data processing requirement is difficult to be met by a manual exhaustion and deduction mode along with the rapid increase of the single-day delivery volume of the cross-border package, time and effort are not only consumed, cost decision deviation can be caused by human mistakes, and logistics cost is further increased. Therefore, how to construct a scientific and efficient cross-border logistics cost optimization method integrates multidimensional decision factors such as package delivery paths, confluence combinations, service provider selection and the like through a quantization model, realizes global cost optimization, and simultaneously adapts to the efficiency requirement of a large-scale package delivery scene, so that the method becomes a technical problem to be solved in the current cross-border logistics field. Disclosure of Invention The application aims to solve the technical problem of providing a cross-border logistics cost optimization method, a system, equipment, a medium and a program product, so as to solve the problems that in the prior art, the cost optimization in the cross-border logistics needs manual deduction link transportation and the efficiency is low. In order to solve the technical problems, the application provides the following technical scheme: in a first aspect, the present application provides a method for cost optimization of a cross-border stream, comprising: the method comprises the steps of obtaining package delivery information and logistics cost parameters, wherein the package delivery information comprises package