CN114186758B

CN114186758B - Cost-optimal-oriented in-plant logistics distribution method

Info

Publication number: CN114186758B
Application number: CN202210135112.2A
Authority: CN
Inventors: 陈德木; 牛乾
Original assignee: Hangzhou JIE Drive Technology Co Ltd
Current assignee: Hangzhou JIE Drive Technology Co Ltd
Priority date: 2022-02-15
Filing date: 2022-02-15
Publication date: 2022-08-05
Anticipated expiration: 2042-02-15
Also published as: CN114186758A

Abstract

The invention discloses an in-plant logistics distribution method oriented to cost optimization, which is claimed to adopt a minimum order splitting principle, considers time window and vehicle load capacity constraints, constructs a mathematical model with the minimum distribution total cost as a target, designs a two-stage genetic algorithm on the basis of the genetic algorithm, takes a P logistics enterprise as an example to carry out application research, utilizes MATLAB programming to solve a distribution scheme based on the minimum order splitting principle, and compares the distribution scheme with a distribution scheme based on the shortest distance order splitting principle. And meanwhile, a payment channel most suitable for the order demand is obtained according to the distribution path and the scene information of the order, so that the fast operation of the life cycle of the order is ensured.

Description

Cost-optimal-oriented in-plant logistics distribution method

Technical Field

The invention belongs to the technical field of logistics, and particularly relates to an in-plant logistics distribution method for optimal cost.

Background

With the improvement of living standard of people, the demand of customers is diversified increasingly, and the rapid development of electronic commerce, the customers tend to shop online more and more, the order quantity is increased greatly, the online orders occupy most market shares of the full channel orders, and in addition, warehouse distribution is irregular, the types of stored commodities are single, the quantity of single commodities is small, a single warehouse cannot meet the actual situation that the order types of the customers are multiple or the quantity of the orders is large (one single multi-commodity or one single multi-commodity) needs to be met by a multi-distribution center, so that multi-warehouse distribution is generated, when the customers purchase the commodities with multiple types or single quantity, and the commodities are stored in multiple warehouses, the order is split.

Most logistics enterprises face the order splitting, the order processing method usually adopts the shortest distance principle to split the order, the shortest distance factor is considered in the order splitting method, the number of vehicles used is easily increased, the distribution path is repeated, the distribution timeliness is poor, the distribution cost is increased, and the customer service experience is poor, so that the order splitting is effectively carried out, the order processing method is researched, the reasonable order splitting principle is selected, the goods taking times, the distribution times and the customer pickup times are effectively reduced, the key problem of the research is solved, the subsequent distribution path planning is carried out on the basis, the distribution cost of the logistics enterprises is reduced, and the customer service experience is improved. Meanwhile, for the network payment mode, the general network payment mode is only carried out by depending on the payment sequence actively selected by the user, but cannot be reasonably selected according to objective scene information, and the subjective payment sequence of the user is very large and cannot reflect objective requirements, so that an objective judgment method is urgently needed for the selection of the payment mode.

Disclosure of Invention

In order to solve the problem of vehicle path with time window and detachable multi-distribution center and the problem of payment mode selection based on scene information, the invention requests to protect an in-plant logistics distribution method with optimal cost, which is used for in-plant logistics scenes and is characterized by comprising the following steps:

acquiring an order to be paid of a transmission system, and extracting metadata of the order to be paid of the transmission system;

constructing a distribution path optimization model based on a minimum order splitting principle according to the metadata of the order to be paid, wherein an objective function is that the distribution total cost is minimum, and the distribution total cost comprises vehicle starting cost, vehicle running distance cost and penalty cost violating a time window;

converting a multi-distribution center problem into a single-distribution center problem, designing a two-stage genetic algorithm by using a layering thought for the purpose of a constructed mathematical model, and solving by using MATLAB programming to obtain the most reasonable distribution scheme;

acquiring scene information of the to-be-paid order of the transmission system according to the most reasonable distribution scheme, acquiring a current payment channel according to the scene information of the to-be-paid order, and selecting an optimized payment channel from the payment channels;

and selecting the semi-finished product materials according to the order, and delivering the semi-finished product materials to a corresponding production line according to the production line for assembly production.

Further, the acquiring the to-be-paid order of the transmission system and extracting the metadata of the to-be-paid order of the transmission system comprise:

the transmission system warehousing end receives a transmission system metadata extraction request message to be warehoused sent by a node to be warehoused, wherein the transmission system metadata extraction request message to be warehoused comprises identification information of first metadata, and the first metadata is a transmission system multi-modal data set to be warehoused;

the transmission system warehousing end determines metadata information of second metadata according to metadata information of first metadata, wherein the second metadata is a transmission system multi-mode data set which has an access incidence relation with the first metadata;

and the transmission system warehousing end sends the metadata information of the first metadata and the metadata information of the second metadata to the node to be warehoused, so that the node to be warehoused adds the metadata information of the first metadata and the metadata information of the second metadata to the cache of the node to be warehoused.

Further, the building of the delivery path optimization model based on the minimum order splitting principle according to the metadata of the order to be paid has an objective function of minimizing a total delivery cost, where the total delivery cost includes a vehicle starting cost, a vehicle travel distance cost, and a penalty cost violating a time window, and the building of the delivery path optimization model further includes:

the established model takes the minimum distribution total cost as an objective function and mainly comprises three parts, namely vehicle starting cost, vehicle running distance cost and time window violation penalty cost;

the vehicle starting cost refers to a one-time fixed expense generated when the vehicle is put into a distribution process, the expense mainly comprises the passing expense, the maintenance expense, the insurance expense, the salary of a driver and the like of the vehicle, and all trucks used in the distribution process are vehicles of a unified type;

the vehicle distance cost refers to the fuel cost consumed by the vehicle in the whole distribution service, and the vehicle distance cost can increase along with the increase of the vehicle distance;

the time window violation penalty cost means that the appointment with the customer cannot be fulfilled, the vehicle cannot be delivered within the service time range specified by the customer, and the early arrival or delay condition occurs, so that the corresponding penalty is given according to the early arrival time or the late arrival time of the vehicle, and the larger the early arrival time or the late arrival time range is, the more the corresponding penalty cost is;

constructing a distribution path model based on a minimum order splitting principle according to the conditions, wherein an objective function is the minimum distribution total cost;

and (3) designing the genetic algorithm by using the two-stage genetic algorithm by combining the advantages of the genetic algorithm and the characteristics of research contents.

Further, the method for converting the multi-distribution center problem into the single-distribution center problem, which is characterized in that a two-stage genetic algorithm is designed by taking a layering thought as a reference for the constructed mathematical model, and a most reasonable distribution scheme is obtained by utilizing MATLAB programming operation, further comprises the following steps:

collecting and sorting data of P logistics enterprises, selecting actual data of the P logistics enterprises in a distribution center of a certain city, solving a distribution scheme based on a minimum order splitting principle by utilizing MATLAB, and comparing the distribution scheme with a distribution scheme based on a shortest-distance order splitting principle;

and analyzing the research effect, and verifying the effectiveness and stability of the model and the algorithm.

Further, the obtaining scene information of the order to be paid of the transmission system according to the most reasonable distribution scheme, obtaining a current payment channel according to the scene information of the order to be paid, and selecting an optimized payment channel from the payment channels further includes:

acquiring a distribution path of the most reasonable distribution scheme according to the most reasonable distribution scheme;

acquiring scene information of the order to be paid of the transmission system from the distribution path of the most reasonable distribution scheme;

carrying out clustering analysis on the scene information of the order to be paid of the transmission system;

acquiring a plurality of current payment channels according to the current distribution path;

and acquiring various scene information according to the clustered orders to be paid, and acquiring an optimized payment channel from a plurality of current payment channels.

Drawings

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

FIG. 1 is a flow chart illustrating a cost-optimized in-plant logistics distribution method according to the present invention;

fig. 2 is a flowchart of a first embodiment of a cost-optimized in-plant logistics distribution method according to the present invention.

Detailed Description

Illustrative embodiments of the present application include, but are not limited to, a cost-optimized in-plant logistics distribution method.

It is understood that, as used herein, the term; a module; a unit; may refer to or comprise an Application Specific Integrated Circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group) and/or memory that execute one or more software or firmware programs, a combinational logic circuit, and/or other suitable hardware components that provide the described functionality, or may be part of these hardware components.

It is to be appreciated that in various embodiments of the present application, the processor may be a microprocessor, a digital signal processor, a microcontroller, or the like, and/or any combination thereof. According to another aspect, the processor may be a single-core processor, a multi-core processor, the like, and/or any combination thereof.

It is to be appreciated that a cost-optimized in-plant logistics distribution method provided herein can be implemented on a variety of electronic devices, including, but not limited to, a server, a distributed server cluster of multiple servers, a cell phone, a tablet computer, a laptop computer, a desktop computer, a wearable device, a head-mounted display, a mobile email device, a portable game console, a portable music player, a reader device, a personal digital assistant, a virtual reality or augmented reality device, a television with one or more processors embedded or coupled therein, and the like.

Referring to fig. 1, the present invention requests to protect a cost-optimized in-plant logistics distribution method for in-plant logistics scenarios, which is characterized by comprising:

The transmission system comprises friction belt transmission and meshing belt transmission, and is divided into a flat belt, a V belt, a poly-wedge belt, a circular belt and a synchronous belt according to the section shape of the transmission belt; the design criteria of the belt drive are that it does not slip when transmitting the prescribed power, and at the same time has sufficient fatigue strength and a certain service life.

The invention adopts a special method to realize the graph query task and is realized by a program. This method must tabulate the graph, i.e., reflect the numbers in the graph with a table, so that the results can be automatically searched using a program. Arrays and a series of loop judgment statements are used in the program to complete the task of the whole query.

Specifically, for example, the first metadata at least includes power data of a transmission system, the second metadata at least includes small pulley rotation speed data of the transmission system, and the first metadata and the second metadata have an image corresponding association relationship.

The main parameters of the transmission system product include motor power, transmission ratio, rotating speed, torque, installation size, workload, working environment and impact strength, but different parameters are slightly different, taking NGW as an example, the detailed parameters are as follows: NGW series: model, base number, transmission ratio, transmission order, power, rotating speed, price and the like; NGW-LDF series: model, base number, transmission ratio, transmission order, power, rotating speed, price and the like; NGW-S series, model number, base number, transmission ratio, transmission order, power, assembly mode, rotation speed, price, etc.; NGW-Z series: model, base number, transmission ratio, transmission stage number, power and assembly mode.

The main external parts of the transmission system comprise a machine body, a machine shell, a rear machine cover, a front machine cover and the like;

calculating rated power according to the input parameters, wherein the selected power is required to be smaller than nominal input power; the nominal power is calculated by selecting power = actual input power and using a coefficient x to start a coefficient x reliability coefficient < nominal input power.

Thermal balance checking to determine whether a cooling device needs to be installed; the allowable power formula for heat balance test is that the actual input power x the environment temperature coefficient x the running period coefficient x the power utilization coefficient < the heat balance power.

The user can find out the relevant products meeting the requirements (possibly a plurality of products meet the conditions) only by inputting the relevant parameters; if no relevant product is found, the relevant product is automatically recorded into the system in detail, and a design department can quickly design a product expected by a user by inquiring the design system;

The specific geographic coordinates and quantity of the distribution center are known, the product type and quantity of the distribution center are known, and the vehicles

The number of vehicles, the maximum load capacity, the type and quantity of the goods on the order, the specific geographic coordinates of the customer, the maximum load capacity, the type and quantity of the goods on the order, the maximum load capacity, the type and quantity of the goods on the order, the maximum load capacity, the specific geographic coordinates of the customer, the maximum load capacity, the type and quantity of the goods on the order, the maximum load capacity, the type and the quantity of the goods, the type and the quantity of the order,

The demand, service time window is known.

(1) Distribution center hypothesis

The specific location coordinates, commodity type and quantity of each distribution center are known and customer order requirements can be met by the distribution centers.

(2) Vehicle assumption

Firstly, each vehicle is specified to start from a distribution center, and needs to return to the distribution center after the order demands of all customer points are distributed;

secondly, each vehicle is of the same type, and the number of goods delivered by each vehicle cannot be larger than the maximum load of the vehicle;

the order demand of each customer point can be distributed by more than or equal to 1 vehicle, and the sum of the required vehicles cannot be larger than that of the vehicles owned by a distribution center;

fourthly, the running distance of each vehicle cannot be larger than the limit of the specified maximum running distance of the vehicle;

the loading volume of each vehicle cannot be larger than the maximum volume of the specified vehicle;

sixthly, the goods loaded on each vehicle cannot be larger than the size of the carriage;

the driving speed of each vehicle is the same.

(3) Customer assumptions

Firstly, knowing specific position coordinates, demand, service duration and required service time window of each client;

the service time requirement of each customer point must be met as much as possible, and a certain time window violation cost must be paid when the service time exceeds the upper limit and the lower limit of the customer service time range;

the requirement of each client can be split to the minimum unit;

and fourthly, the time window after the requirement of each client is split is unchanged.

(4) Assumption of delivery cost

The distribution cost of the distribution center to each customer site is related to the vehicle enablement cost, the vehicle distance traveled cost, and the time window violation cost.

Compared with the 'shortest distance' order splitting principle, the order splitting principle based on the minimum order can reduce the number of vehicles used and the vehicle starting cost, each client can carry out multiple vehicle dispatching visits, the number of vehicle dispatching times can be increased to a certain extent, the distribution route is repeated, the distribution distance is increased, the reduction of the distribution total cost caused by the reduction of the number of vehicles used can be reduced due to the increase of the vehicle running distance cost, the order demands of the same customer are split to different distribution vehicles after splitting, the arrival time points of different vehicles loading the same customer order are inconsistent, the delivery within the distribution time range required by the client can not be timely easily generated, based on the minimum order splitting principle, the early arrival time or late arrival time of the vehicles can be greatly reduced, the penalty cost of a time window can be effectively reduced, and the increase of the distribution total cost caused by the increase of the running distance cost due to the increase of the vehicle running distance can be compensated, thereby achieving the purpose of reducing the distribution cost. There is a conflicting relationship between the vehicle start-up cost, the vehicle distance-traveled cost and the time window violation cost, and therefore, the objective is to find an optimal delivery scheme based on the minimum order splitting principle, so as to minimize the sum of the vehicle start-up cost, the vehicle distance-traveled cost and the time window violation cost.

For the multi-distribution center problem, the problem is usually converted into a single-distribution center problem for solution, therefore, a virtual distribution center is provided herein, and assuming that the cost (distance, time, etc.) from the virtual distribution center to each actual distribution center is 0, the vehicles first start from the virtual distribution center, sequentially select customer points through the actual distribution center, and then return to the virtual yard through the actual distribution center, thereby converting the multi-distribution center problem into the single-distribution center problem.

Further, the converting a multi-distribution center problem into a single-distribution center problem, designing a two-stage genetic algorithm by referring to a layering idea aiming at a constructed mathematical model, and obtaining the most reasonable distribution scheme by using MATLAB programming operation, further comprises:

collecting and sorting data of P logistics enterprises, selecting actual data of the P logistics enterprises in a distribution center of a certain city, solving a distribution scheme based on a minimum order splitting principle by using MATLAB, and comparing the distribution scheme with a distribution scheme based on a shortest distance order splitting principle;

In the first stage of the two-stage genetic algorithm, order splitting and order vehicle distribution are carried out based on a minimum order splitting principle, an order vehicle distribution feasible set is generated, the number of used vehicles and the number of distribution centers are determined, order numbers, product types and the number of the order numbers and the product types loaded on each vehicle are determined, and the number of the used vehicles is reduced as much as possible; and in the second stage, the vehicle distribution feasible set of the result order obtained in the first stage is used as an initial solution of path planning in the second stage, time window and vehicle capacity constraint are considered, distribution path optimization is carried out, and the purpose of lowest distribution total cost is achieved on the basis of the first stage.

In the first stage, under the principle of minimum order splitting, the order vehicle distribution problem is solved, and the goods and the quantity of which orders are transported by each vehicle from which distribution center are determined, namely the vehicle quantity, the distribution center quantity, the order number, the product type and the quantity thereof are determined.

(1) Encoding and decoding

The chromosome adopts a natural number coding mode, and the structure is as follows: the virtual distribution center code + (the actual distribution center code from the vehicle) + the vehicle code + the order code + the product type condition + the actual distribution center code from the return + the virtual distribution center code. Wherein, 0 represents the virtual distribution center code, 1,2, a, M represents the actual distribution center code, 1,2, a, K represents the vehicle code, the order number and the product type condition are coded in a combined mode, that is, the order code + "[ ]" + each product delivery quantity, 0,1, a, N represents the order code, and each order product quantity is used and connected.

(2) Population initialization

All order numbers and vehicle numbers are coded and are natural numbers, the order numbers are generated by a random method, and the order codes are randomly arranged, so that the initial population is a chromosome coding string which is randomly generated, and the scale is not too large or too small.

(3) Selection operation

The basic idea is to transmit the better individual selection to the next generation, and the roulette strategy is adopted in the stage, and the steps are as follows:

calculating fitness f of chromosome i _i ；

n chromosome fitness values are accumulated, and the formula is shown as follows;

F=∑f _i

calculation of chromosome selection probability p _i The formula is shown as follows;

p _i =f _i /F

randomly generating a value r of [0,1] every time, judging whether the selection is needed or not according to the size of the chromosome fitness function value, setting a proper threshold value c, if the value r > c, selecting and retaining, otherwise, not selecting and retaining, namely, the higher the fitness value is, the higher the chance of selecting and retaining the individuals is.

(4) Crossover operation

Adopting partial matching intersection, and performing intersection operation according to the following steps:

step 1: randomly selecting two parent chromosomes R1 and R2;

step 2: randomly selecting two cross points a and b on parent chromosomes R1 and R2, and taking the region between the two points as a matching region;

step 3: crossing the two parent chromosome matching regions to obtain child chromosomes A1 and B1;

step 4: performing conflict detection on the offspring chromosomes A1 and B1 to obtain two new offspring chromosomes A2 and B2;

step 5: checking whether the child chromosomes A2 and B2 meet the minimum order splitting principle and the vehicle load capacity constraint condition, and if not, deleting; if yes, reserving and generating an order vehicle distribution feasible set;

step 6: repeat Step1-Step5, update order vehicle allocation feasible set.

(5) Mutation operation

Two-point cross variation is adopted, one chromosome P1 is randomly selected from the order vehicle distribution feasible set, two variation points x and y are randomly generated, the two variation points are interchanged to form a new chromosome P2, the chromosomes meeting the minimum order splitting principle and the vehicle load constraint condition are reserved, and the order vehicle distribution feasible set is updated.

The second stage, solving the path problem, and taking the vehicle distribution feasible set of the result order obtained in the first stage as the feasible set

Inputting an initial solution of the second stage of path optimization, considering time window and load constraint, planning a distribution path,

on the basis of the first stage, the goal of minimum total distribution cost is realized, so that the maximum distribution path planning is obtained

And (4) optimizing the solution.

Further, referring to fig. 2, the acquiring scene information of the to-be-paid order of the transmission system according to the most reasonable distribution scheme, acquiring a current payment channel according to the scene information of the to-be-paid order, and selecting an optimized payment channel from the payment channels further includes:

Acquiring position information of each node in a distribution path of the most reasonable distribution scheme, setting an effective radius for the position information of each node in the distribution path, acquiring effective financial institutions within the effective radius, and performing cluster statistical analysis on the effective financial institutions;

the valid financial institutions are legal banks, savings and loan financial institutions, and the valid financial institutions can legally issue electronic payment debit cards or credit cards.

Acquiring scene information of the order to be paid of the transmission system according to the effective financial institution subjected to the cluster statistical analysis;

the scene information of the order to be paid of the transmission system comprises the priority sequence of each effective financial institution, and the priority sequence integrates the number of the financial institutions in the effective radius nearby and the distance setting from each node position in the distribution path;

performing cluster analysis on the scene information of the orders to be paid of the transmission system to perform cluster analysis on debit cards and credit cards according to the priority sequence of each effective financial institution;

acquiring a plurality of current payment channels according to a current distribution path, wherein the current payment channels comprise payment financial institutions and payment card types;

acquiring scene information of various orders to be paid according to the clustering, and acquiring an optimized payment channel from a plurality of current payment channels;

specifically, effective payment financial institutions are selected according to the priority sequence, the debit cards of the effective financial institutions are paid in sequence firstly, and when the payment cannot be completed after the payment is tried, the credit cards of the effective payment financial institutions are selected according to the priority sequence to be paid in sequence.

It should be noted that, in the embodiments of the apparatuses in the present application, each unit/module is a logical unit/module, and physically, one logical unit/module may be one physical unit/module, or may be a part of one physical unit/module, and may also be implemented by a combination of multiple physical units/modules, where the physical implementation manner of the logical unit/module itself is not the most important, and the combination of the functions implemented by the logical unit/module is the key to solve the technical problem provided by the present application. Furthermore, in order to highlight the innovative part of the present application, the above-mentioned device embodiments of the present application do not introduce units/modules which are not so closely related to solve the technical problems presented in the present application, which does not indicate that no other units/modules exist in the above-mentioned device embodiments.

It is noted that, in the examples and descriptions of the present application, relational terms such as first and second, and the like are 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. Also, the term; comprises the following steps of; starting the process; comprises the following components; or any other variation thereof, is intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, by statement; comprises one; a defined element does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the defined element.

While the present application has been shown and described with reference to certain preferred embodiments thereof, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present application.

Claims

1. An optimal-cost-oriented in-plant logistics distribution method is used for in-plant logistics scenes, and is characterized by comprising the following steps:

the method comprises the steps of obtaining an order to be paid of a transmission system, and extracting metadata of the order to be paid of the transmission system;

picking semi-finished products according to orders, and delivering the semi-finished products to corresponding production lines according to production lines for assembly production;

the transmission system warehousing end sends the metadata information of the first metadata and the metadata information of the second metadata to the node to be warehoused, so that the node to be warehoused adds the metadata information of the first metadata and the metadata information of the second metadata to the cache of the node to be warehoused;

the transmission system comprises friction belt transmission and meshing belt transmission, and is divided into a flat belt, a V belt, a poly-wedge belt, a circular belt and a synchronous belt according to the section shape of the transmission belt; the design criteria of the belt transmission are that the belt transmission does not slip when transmitting specified power, and simultaneously has enough fatigue strength and certain service life;

the first metadata at least comprises power data of a transmission system, the second metadata at least comprises small pulley rotating speed data of the transmission system, and the first metadata and the second metadata have image corresponding incidence relation;

the main parameters of the transmission system product comprise motor power, transmission ratio, rotating speed, torque, installation size, working load, working environment and impact strength;

NGW series: model, base number, transmission ratio, transmission stage number, power, rotating speed and price;

NGW-LDF series: model, base number, transmission ratio, transmission stage number, power, rotating speed and price;

NGW-S series including model, base number, transmission ratio, transmission stage number, power, assembly mode, rotation speed and price;

NGW-Z series: model, base number, transmission ratio, transmission stage number, power and assembly mode;

the transmission system mainly comprises external parts including a machine body, a machine shell, a rear machine cover and a front machine cover;

the main internal components comprise a low-speed shaft, a high-speed shaft, a gear and a shaft sleeve;

calculating rated power according to the input parameters, wherein the selected power is required to be smaller than nominal input power; the rated power is calculated by selecting power = actual input power and using a coefficient x to start a coefficient x reliability coefficient < nominal input power;

thermal balance checking to determine whether a cooling device needs to be installed; the formula of the allowable power for heat balance test is that the actual input power x the environmental temperature coefficient x the running period coefficient x the power utilization coefficient < the heat balance power;

the user can find out the relevant products meeting the requirements only by inputting the relevant parameters; if no relevant product is found, the relevant product is automatically recorded into the system in detail, and a design department can quickly design a product expected by a user by inquiring the design system;

the effective financial institution is a legal bank, deposit and debit financial institution, and can legally issue an electronic payment debit card or credit card;

the method comprises the following steps of obtaining scene information of an order to be paid of the transmission system according to the most reasonable distribution scheme, obtaining a current payment channel according to the scene information of the order to be paid, and selecting an optimized payment channel from the payment channels, and further comprises the following steps:

acquiring scene information of various orders to be paid according to the clustering, and acquiring scene information of optimized payment channels according to the orders to be paid of the transmission system by effective financial institutions after the clustering is performed and the optimized payment channels are analyzed;

specifically, effective payment financial institutions are selected according to the priority sequence, the debit cards of the effective financial institutions are paid in sequence firstly, and when the payment cannot be completed after the payment is tried, the credit cards of the effective payment financial institutions are selected according to the priority sequence to be paid in sequence;

the above-mentioned delivery path optimization model based on the minimum order splitting principle is constructed according to the metadata of the order to be paid, the objective function is that the total delivery cost is minimum, the total delivery cost includes vehicle starting cost, vehicle driving distance cost and penalty cost violating the time window, and the method further includes:

the genetic algorithm is designed by using a two-stage genetic algorithm by combining the advantages of the genetic algorithm and the characteristics of research contents;

the method for converting the multi-distribution center problem into the single-distribution center problem includes that a two-stage genetic algorithm is designed by referring to a layering thought aiming at a constructed mathematical model, and a most reasonable distribution scheme is obtained by utilizing MATLAB programming operation, and the method further includes the following steps: