CN106600180A - Method and system of transportation route optimization of logistics management system - Google Patents

Abstract

The present invention relates to a method and system of transportation route optimization of a logistics management system. The method comprises the following steps: reading the route between a starting node and a target node and a cost value corresponding to each route from the logistics transportation network of the logistics management system; generating a cost matrix according to the route and the cost value; selecting the transportation vehicle set corresponding to the routes from the vehicle matching table of the logistics management system; constructing the stowage functions corresponding to the routes according to the transportation vehicle set, and combining a weight matrix between the starting node and the target node according to the stowage function and the cost matrix ; and calculating the route with the lowest weight cost value according to the weight matrix to obtain an optimal route between the starting node and the target node. The method and system of transportation route optimization of the logistics management system can effectively improve the route optimization effect in the logistics management system.

Description

The transportation route optimization method of logistic management system and system

Technical field

The present invention relates to the transportation route optimization method of logistics management technical field, more particularly to logistic management system and System.

Background technology

With the raising of production technology and administrative skill, the competition between enterprise, transport, storage, packaging, dress Unload, the logistics activity field such as circulation and process is increasingly subject to people's attention.Logistic management system is above-mentioned logistics activity field Important component part, according to above-mentioned logistic management system, the logistics transportation networks being made up of each city can be read Take, the corresponding vehicle match table of above-mentioned logistics transportation networks can also be read, such as, the path between which city node can To match the vehicle etc. of which type.The planning technology of logistics route or transportation route to the operation of logistic management system into This and operational efficiency have decisive role.Under normal circumstances, transportation route can enter according to the experience in conventional transportation Row determines, it is also possible to directly obtain from map, and the historical data that can be preserved with reference relevant historical data storehouse, acquisition is set out Chosen from above-mentioned historical path to the multiple historical paths between destination on ground.

In above-mentioned traditional path planning scheme, departure place is little to the optional scope of transportation route between destination, has Certain limitation, so as to cause logistic management system in path optimization's effect it is poor.

The content of the invention

Based on this, it is necessary to cause the technical problem of effect of optimization difference in path in logistic management system for traditional scheme, The transportation route optimization method and system of a kind of logistic management system are provided.

A kind of transportation route optimization method of logistic management system, comprises the steps：

Path between start node and purpose node and each is read from the logistics transportation networks of logistic management system The corresponding value at cost in individual path；

According to the path and value at cost manufacturing cost matrix；

The corresponding transport trainset in the path is chosen from the vehicle match table of logistic management system；

The corresponding prestowage function in the path is built according to the transport trainset, according to the prestowage function and Cost matrix Weight matrix between synthesis start node and purpose node；Wherein, transport trainset described in the prestowage function representation is corresponding Vehicle when maximum return value is got in respective paths operation, the letter between the corresponding financial value of the transport trainset and transport trainset Number relation；

The minimum path of weight value at cost is calculated according to the weight matrix, obtain the start node and purpose node it Between path optimizing；Wherein, shown weight value at cost is that the corresponding integrated cost of corresponding transport trainset is run on the path Value.

A kind of transportation route optimization system of logistic management system, including：

First read module, for reading start node and purpose node from the logistics transportation networks of logistic management system Between the corresponding value at cost in path and each path；

Generation module, for according to the path and value at cost manufacturing cost matrix；

Module is chosen, for choosing the corresponding transport trainset in the path from the vehicle match table of logistic management system；

Module is built, for building the corresponding prestowage function in the path according to the transport trainset, according to the prestowage Weight matrix between function and Cost matrix synthesis start node and purpose node；Wherein, described in the prestowage function representation The corresponding vehicle of transport trainset when maximum return value is got in respective paths operation, the corresponding financial value of the transport trainset and fortune Functional relation between defeated car group；

Computing module, for calculating the minimum path of weight value at cost according to the weight matrix, obtains the starting knot Path optimizing between point and purpose node；Wherein, shown weight value at cost is that corresponding transport trainset is run on the path Corresponding integrated cost value.

The transportation route optimization method of above-mentioned logistic management system and system, can be from the logistics transportation of logistic management system The corresponding value at cost in all paths and each path between start node and purpose node is read in network, it is above-mentioned to generate Path and the corresponding Cost matrix of value at cost, can be corresponding to choose the path from the vehicle match table of logistic management system Transport trainset, the corresponding prestowage function in the path is built, according to the prestowage function and Cost matrix synthesis start node With the weight matrix between purpose node, the minimum path of weight value at cost is calculated further according to above-mentioned weight matrix, to obtain The path optimizing between start node and purpose node is stated, start node and purpose node are covered in the acquisition of above-mentioned path optimizing Between the corresponding transport trainset in all possible path and each path, the factor of institute's reference comprehensively, effectively increases logistics Path optimization's effect in management system.

Description of the drawings

Fig. 1 is the transportation route optimization method flow chart of the logistic management system of one embodiment；

Fig. 2 optimizes system structure diagram for the transportation route of the logistic management system of one embodiment.

Specific embodiment

The transportation route optimization method of logistic management system to the present invention and being embodied as system below in conjunction with the accompanying drawings Mode is described in detail.

With reference to Fig. 1, Fig. 1 show the transportation route optimization method flow chart of the logistic management system of one embodiment, bag Include following steps：

S10, path between start node and purpose node is read from the logistics transportation networks of logistic management system with And the corresponding value at cost in each path；

Above-mentioned logistics transportation networks include multiple nodes, and each node corresponds to a city or a transport dwell point (related service station etc.).The initial city of above-mentioned start node correspondence logistics transportation, the purpose of purpose node correspondence logistics transportation City.Path between start node and purpose node can include it is multiple, each path can be through logistics transportation networks Multiple nodes, the node corresponding to each path is incomplete same, the corresponding value at cost in above-mentioned path include from start node to In all nodes of purpose node, corresponding value at cost between two nodes of arbitrary neighborhood, above-mentioned value at cost can include current Expense or other road transport expenses etc..The value at cost in one path is generally equivalent to two nodes of arbitrary neighborhood in the path Corresponding value at cost sum.

S20, according to the path and value at cost manufacturing cost matrix；

Above-mentioned Cost matrix includes each corresponding value at cost sum of path any two neighborhood of nodes.Cost matrix includes All paths between start node and purpose node, and the corresponding value at cost in above-mentioned each path.

S30, chooses the corresponding transport trainset in the path from the vehicle match table of logistic management system；

Which type above-mentioned vehicle match table can correspond to including between any two neighborhood of nodes of logistics transportation networks The information such as vehicle.Path between above-mentioned start node and purpose node, some nodes in possible some of which path pass through Type of vehicle restricted (current etc. such as more than multiple stationary vehicle), now, just can be from above-mentioned vehicle match table It is middle to read corresponding path and pass through the vehicle of which type, to determine the corresponding transport trainset in above-mentioned path.Said one Transport trainset can include various vehicles (including multiple car loads, multiple transport vehicles etc.), wherein every kind of vehicle can pass through Each node of respective paths.

S40, builds the corresponding prestowage function in the path, according to the prestowage function and cost according to the transport trainset Matrix synthesizes the weight matrix between start node and purpose node；Wherein, transport trainset pair described in the prestowage function representation The vehicle answered when maximum return value is got in respective paths operation, between the corresponding financial value of the transport trainset and transport trainset Functional relation；

Working step S40, can first set up the corresponding prestowage model of transport trainset, each using above-mentioned prestowage pattern acquiring The corresponding prestowage function in individual path.Above-mentioned prestowage function can represent the corresponding various vehicles of the transport trainset in respective paths Operation is when getting maximum return value, the functional relation between the corresponding financial value of the transport trainset and transport trainset, above-mentioned receipts What beneficial value can refer to that corresponding vehicle can obtain take in and the difference of its cost for consuming.By the corresponding prestowage function in path and cost Matrix is synthesized, and resulting weight matrix can be included in each path and be separately operable after the vehicle of respective type, is produced The corresponding weight value at cost of vehicle cost and road cost information, i.e. each path.

S50, according to the weight matrix the minimum path of weight value at cost is calculated, and is obtained the start node and is tied with purpose Path optimizing between point；Wherein, shown weight value at cost is that the corresponding synthesis of corresponding transport trainset is run on the path Value at cost.

In above-mentioned steps S50, weight value at cost can include that the corresponding vehicle cost of respective paths and road cost etc. are comprehensive Value at cost is closed, above-mentioned weight value at cost gets minimum, may indicate that corresponding path cost performance is high.

The transportation route optimization method of the logistic management system that the present embodiment is provided, can be from the logistics of logistic management system The corresponding value at cost in all paths and each path between start node and purpose node is read in transportation network, to generate Above-mentioned path and the corresponding Cost matrix of value at cost, can be choosing the path from the vehicle match table of logistic management system Corresponding transport trainset, builds the corresponding prestowage function in the path, according to the prestowage function and Cost matrix synthesis starting Weight matrix between node and purpose node, calculates the minimum path of weight value at cost, to obtain further according to above-mentioned weight matrix The path optimizing between the start node and purpose node is taken, start node and purpose are covered in the acquisition of above-mentioned path optimizing The corresponding transport trainset in all possible path and each path between node, the factor of institute's reference comprehensively, is effectively increased Path optimization's effect in logistic management system.

In one embodiment, the transportation route optimization method of above-mentioned logistic management system, can also include：

Obtain the corresponding numbering of the transport trainset；

According to the unit dress numbered and the transport trainset is read in the vehicle registration table of the logistic management system Put number, model parameter, yield parameter and consume parameter；

The prestowage model of transport trainset is built according to the cell arrangement number, model parameter, unit cost and consumption parameter；

The corresponding vehicle of the transport trainset is obtained according to the prestowage model and gets maximum return in respective paths operation Prestowage function during value.

In the present embodiment, a transport trainset corresponds to a numbering, and one of transport trainset can be with polytype Vehicle, such as one transport trainset can include n car load, m transport vehicle etc..Said units device number can refer to corresponding transport Che Zuzhong, the quantity corresponding to various types of vehicles.Above-mentioned model parameter can include the model of various types of vehicles (such as Length and width is high), above-mentioned yield parameter can include the corresponding income of various types of vehicles, and consuming parameter can include all kinds of cars Produce expense (such as manpower take, oil take and toll).

Above-mentioned allocation models be include being born interest in corresponding transport trainset and all consumption difference model.As one Embodiment, above-mentioned prestowage model can be：

Wherein, x_ijk∈Z,

N be car load number of types, m be transport vehicle quantity, R_kFor transport vehicle entrucking row, f_ijkIt is in transport vehicle k jth row The income of middle car load type i, x_ijkBe transport vehicle k jth row in car load type i quantity, Cr_kManpower for transport vehicle k takes With Co_kOily for transport vehicle k takes, Cf_kFor the toll of transport vehicle k, N_iFor car load type class quantity, l_iFor the length of car load i Degree, w_iFor the width of car load i, h_iFor the height of car load i, L_jkFor the cargo length of transport vehicle k jth row, H_kFor transport vehicle k bottoms Highly, W_kFor the width of transport vehicle k, G_kFor transport vehicle k standard load-carryings, f is transport vehicle k over-loading coefficients,

Used as one embodiment, above-mentioned prestowage function can be：

Wherein, x_ijk∈Z,

x_i3k(p_i=0, -1)

N and m represent respectively cell arrangement number, and such as n can be car load number of types, and m can be transport vehicle quantity, R_kTable Show the entrucking row of k-th cell arrangement, f_ijkRepresent the receipts of the cell arrangement of i-th model in k-th cell arrangement jth row Benefit, x_ijkRepresent the quantity of the cell arrangement of i-th model in k-th cell arrangement jth row, Cr_k、Co_kAnd Cf_kRepresent and consume Parameter, N_iRepresent the species number of cell arrangement, l_i、w_iAnd h_iThe model of i-th cell arrangement, L are represented respectively_jkRepresent k-th list Cargo length, the H of element apparatus jth row_kRepresent the bottom height of k-th cell arrangement, W_kThe width of k-th cell arrangement is represented, G_kThe standard load-carrying of k-th cell arrangement is represented, f represents over-loading coefficient, and Z represents sum, and above-mentioned symbol " max " represents corresponding Function or model get maximum.

In one embodiment, the step of above-mentioned prestowage function corresponding according to the transport trainset structure path can To include：

Prestowage model is built according to the transport trainset, the optimal value of the prestowage model is set；

According to branch rule, a node is selected from prestowage node as selected prestowage node, and matched somebody with somebody in described selecting The corresponding unit prestowage node of the selected prestowage node is set in the next stratum for carrying node；

Calculate the corresponding income lower limit of the unit prestowage node；

According to the income lower limit unit prestowage node is carried out knowing condition test clearly, it is pre-conditioned to meeting Unit prestowage node is rejected；

Continue to select a selected prestowage node from other prestowage nodes, and in the lower single order of the selected prestowage node The corresponding unit prestowage node of the selected prestowage node is set in layer, until all prestowage nodes complete unit prestowage node Setting and know condition test clearly；

Prestowage income is searched in the unit prestowage node retained after rejecting and gets the corresponding unit prestowage node of maximum；

Unit prestowage node according to searching determines the maximum prestowage node of financial value, is determined according to the prestowage node and is matched somebody with somebody Carry function.

Above-mentioned prestowage node, can include the transport trainset information corresponding to each path, and a path is corresponding one Transport trainset one prestowage node of correspondence, said one path can correspond to multiple prestowage nodes.One prestowage node can be right Multiple unit prestowage nodes, said one unit prestowage node are answered to correspond to a kind of vehicle.

It is above-mentioned pre-conditioned to include as one embodiment：

The income lower limit is more than or equal to the optimal value；

Or corresponding unit prestowage node can not possibly include feasible solution.

As one embodiment, the step of the above-mentioned calculating unit prestowage node corresponding income lower limit after can be with Including：

Feasible solution of the income lower limit in the prestowage model is obtained, and determines that the feasible solution is corresponding feasible Solution financial value；

In optimal value of the feasible solution financial value less than the prestowage model, by the optimal value of the prestowage model more It is newly feasible solution financial value.

Above-mentioned feasible solution refers to corresponding income lower limit in all transport trainsets corresponding to respective paths.Feasible solution financial value Refer to that the corresponding transport trainset of income lower limit runs corresponding financial value in the path.

Above-described embodiment can carry out the determination of prestowage function using branch and bound, and its step is as described below：

Step one：Can according to associated cost value minimize principle, then set current optimal solution value (prestowage model Optimal value) Z=∞；

Step 2：According to branch rule (Branching rule), from not yet being known clearly (Fathomed) node (local Solution) one node of middle selection, and it is divided into several new nodes in next stratum of this node；

Step 3：Calculate the lower limit (income lower limit, Lower bound, LB) of each new branch node out；

Step 4：Each node is carried out to know condition test clearly, if node meets following any one condition, this node Can know clearly and no longer be considered：

The lower limit of this node is more than or equal to Z values.

Find in this node, had the feasible solution of smallest limit value；If this condition is set up, need to compare this feasible solution with Z values, if the former is less, need to update Z values, as the value of feasible solution；

This node can not possibly include feasible solution.

Step 5：Judge whether still there is the node not yet known clearly, if it has, step 2 is then carried out, if without not yet The node known clearly, then calculation stops, and obtains optimal solution.

In one embodiment, the transportation route optimization method of above-mentioned logistic management system, can also include：

Weighted Directed Graph is set according to the logistics transportation networks, and sets up S set and U set；

Start node is obtained in the Weighted Directed Graph, the start node is stored in into S set, will be except the starting knot Other city nodes beyond point are stored in U set；

The city node k minimum with start node distance is chosen from U set, the city node k is moved Move to S set,

If shorter than predeterminable range to the distance of purpose node through city node k from start node, predeterminable range is updated；

Continue from U set to choose the city node minimum with city node k distances, and the node that will be chosen S set is moved to, until whole cities node is all moved to S set；

The prestowage circuit between start node and purpose node is determined according to the mobile order of city node.

The present embodiment mainly carries out the determination of above-mentioned prestowage circuit, above-mentioned dijkstra's algorithm bag using dijkstra's algorithm Include：Weighted Directed Graph (can also be non-directed graph, non-directed graph is the special case of digraph) G=(V, E) is set, (the knot of summit in figure Point) set V is divided into two groups：First group is that the vertex set for having obtained shortest path (is represented, only one of which rises in S when initial with S Initial point, often tries to achieve a shortest path later, in just adding it to set S, until whole summits are all added in S)；Second Group does not determine the vertex set (being represented with U) of shortest path for remaining, by the increasing order of shortest path length successively second The summit of group is added in S.During addition, the shortest path length on each summit is not more than in always keeping from starting point v to S The shortest path length on any summit in from starting point v to U.One distance of each vertex correspondence, the distance on the summit in S is exactly From v to the shortest path length on this summit, the distance on the summit in U is that summit in S is only included from v to this summit for centre The current shortest path length on summit.Determine that the process of prestowage circuit includes using dijkstra's algorithm：

First, when initial, S only includes start node v, i.e. the distance of S={ v }, v is 0.U includes other tops in addition to v Point, u distances in summit are in upper power (if v and u has) or (if u is not v goes out side abutment points) in U.

Second, one is chosen from U apart from v minimum summit k, (the selected distance is exactly v to k's in k addition S Shortest path length).

3rd, it is the new intermediate node point for considering with k, change the distance on each summit in U；If from starting point v to summit u's Distance (through summit k) than original distance (, the then distance value of modification summit u short without summit k), amended distance value The distance of summit k adds the power on top.

4th, repeat step second step and the 3rd step are until all summits are included in S.

With reference to Fig. 2, Fig. 2 show the transportation route optimization system architecture of the logistic management system of one embodiment and illustrates Figure, including：

First read module 10, ties for reading start node from the logistics transportation networks of logistic management system with purpose The corresponding value at cost in path and each path between point；

Generation module 20, for according to the path and value at cost manufacturing cost matrix；

Module 30 is chosen, for choosing the corresponding transport vehicle in the path from the vehicle match table of logistic management system Group；

Module 40 is built, for building the corresponding prestowage function in the path according to the transport trainset, is matched somebody with somebody according to described Carry the weight matrix between function and Cost matrix synthesis start node and purpose node；Wherein, the prestowage function representation institute The corresponding vehicle of transport trainset is stated when maximum return value is got in respective paths operation, the corresponding financial value of the transport trainset with Functional relation between transport trainset；

Computing module 50, for calculating the minimum path of weight value at cost according to the weight matrix, obtains the starting Path optimizing between node and purpose node；Wherein, shown weight value at cost is that corresponding transport vehicle is run on the path The corresponding integrated cost value of group.

In one embodiment, the transportation route optimization system of above-mentioned logistic management system, can also include：

First acquisition module, for obtaining the corresponding numbering of the transport trainset；

Second read module, described in being read in the vehicle registration table of the logistic management system according to the numbering The cell arrangement number of transport trainset, model parameter, yield parameter and consume parameter；

Model construction module, for building fortune according to the cell arrangement number, model parameter, unit cost and consumption parameter The prestowage model of defeated car group；

Second acquisition module, for obtaining the corresponding vehicle of the transport trainset in respective paths according to the prestowage model Prestowage function during maximum return value is got in operation.

In one embodiment, above-mentioned prestowage function can be：

Wherein, x_ijk∈Z,

x_i3k(p_i=0, -1)

N and m represent respectively cell arrangement number, R_kRepresent the entrucking row of k-th cell arrangement, f_ijkRepresent k-th unit The income of the cell arrangement of i-th model, x in device jth row_ijkRepresent the list of i-th model in k-th cell arrangement jth row The quantity of element apparatus, Cr_k、Co_kAnd Cf_kRepresent and consume parameter, N_iRepresent the species number of cell arrangement, l_i、w_iAnd h_iDifference table Show the model of i-th cell arrangement, L_jkRepresent cargo length, the H of k-th cell arrangement jth row_kRepresent k-th cell arrangement Bottom height, W_kRepresent the width of k-th cell arrangement, G_kThe standard load-carrying of k-th cell arrangement is represented, f represents overload system Number, Z represents sum.

The logistic management system that the transportation route optimization system of the logistic management system that the present invention is provided is provided with the present invention Transportation route optimization method correspond, the logistic management system transportation route optimization method embodiment illustrate Technical characteristic and its advantage optimize the embodiment of system suitable for the transportation route of logistic management system, hereby sound It is bright.

Each technical characteristic of embodiment described above can be combined arbitrarily, to make description succinct, not to above-mentioned reality Apply all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited In contradiction, the scope of this specification record is all considered to be.

Embodiment described above only expresses the several embodiments of the present invention, and its description is more concrete and detailed, but and Can not therefore be construed as limiting the scope of the patent.It should be pointed out that for one of ordinary skill in the art comes Say, without departing from the inventive concept of the premise, some deformations and improvement can also be made, these belong to the protection of the present invention Scope.Therefore, the protection domain of patent of the present invention should be defined by claims.

Claims (10)

1. the transportation route optimization method of a kind of logistic management system, it is characterised in that comprise the steps：

The path and each road between start node and purpose node is read from the logistics transportation networks of logistic management system The corresponding value at cost in footpath；

According to the path and value at cost manufacturing cost matrix；

The corresponding transport trainset in the path is chosen from the vehicle match table of logistic management system；

The corresponding prestowage function in the path is built according to the transport trainset, is synthesized according to the prestowage function and Cost matrix Weight matrix between start node and purpose node；Wherein, the corresponding vehicle of transport trainset described in the prestowage function representation When maximum return value is got in respective paths operation, the function between the corresponding financial value of the transport trainset and transport trainset is closed System；

The minimum path of weight value at cost is calculated according to the weight matrix, is obtained between the start node and purpose node Path optimizing；Wherein, shown weight value at cost is that the corresponding integrated cost value of corresponding transport trainset is run on the path.

2. the transportation route optimization method of logistic management system according to claim 1, it is characterised in that also include：

Obtain the corresponding numbering of the transport trainset；

According to it is described number read in the vehicle registration table of the logistic management system transport trainset cell arrangement number, Model parameter, yield parameter and consumption parameter；

The prestowage model of transport trainset is built according to the cell arrangement number, model parameter, unit cost and consumption parameter；

According to the corresponding vehicle of the prestowage model acquisition transport trainset when maximum return value is got in respective paths operation Prestowage function.

3. the transportation route optimization method of logistic management system according to claim 2, it is characterised in that the prestowage letter Number is：

$max\underset{k=1}{\overset{m}{\Σ}}\[\left(\underset{j=1}{\overset{R_k}{\Σ}}\underset{i=1}{\overset{n}{\Σ}}{f}_{ijk}{x}_{ijk}\right)-({\mathrm{Cr}}_k+{\mathrm{Co}}_k+{\mathrm{Cf}}_k)\];$

Wherein,

$\underset{k=1}{\overset{m}{\Σ}}\underset{j=1}{\overset{R_k}{\Σ}}{x}_{ijk}\≤N_i,\∀i=1,2,...,n,$

$\underset{i=1}{\overset{n}{\Σ}}{l}_i{x}_{ijk}\≤L_{jk},\∀k=1,2,...,m;\∀j=1,2,3,$

$x_{i3k}(p_i-1)=0,\∀i=1,2,...,n;\∀k=1,2,...,m;,$

$\underset{i=1}{\overset{n}{\Σ}}\underset{j=1}{\overset{R_k}{\Σ}}{w}_i{x}_{ijk}+W_k\≤{\mathrm{fG}}_k,\∀k=1,2,...,m;$

$p_i:p_i=\left\{\begin{array}{c}0,if{h}_i\&GreaterEqual;H_k\\ 1,if{h}_i<H_k\end{array}\right.,$

N and m represent respectively cell arrangement number, R_kRepresent the entrucking row of k-th cell arrangement, f_ijkRepresent k-th cell arrangement The income of the cell arrangement of i-th model, x in jth row_ijkRepresent the unit dress of i-th model in k-th cell arrangement jth row The quantity put, Cr_k、Co_kAnd Cf_kRepresent and consume parameter, N_iRepresent the species number of cell arrangement, l_i、w_iAnd h_iI-th is represented respectively The model of individual cell arrangement, L_jkRepresent cargo length, the H of k-th cell arrangement jth row_kRepresent the bottom of k-th cell arrangement Highly, W_kRepresent the width of k-th cell arrangement, G_kThe standard load-carrying of k-th cell arrangement is represented, f represents over-loading coefficient, Z tables Show sum.

4. the transportation route optimization method of logistic management system according to claim 3, it is characterised in that described according to institute Stating the step of transport trainset builds the corresponding prestowage function in the path includes：

Prestowage model is built according to the transport trainset, the optimal value of the prestowage model is set；

According to branch rule, a node is selected from prestowage node as selected prestowage node, and tied in the selected prestowage The corresponding unit prestowage node of the selected prestowage node is set in next stratum of point；

Calculate the corresponding income lower limit of the unit prestowage node；

According to the income lower limit unit prestowage node is carried out knowing condition test clearly, to meeting pre-conditioned unit Prestowage node is rejected；

Continue to select a selected prestowage node from other prestowage nodes, and in next stratum of the selected prestowage node The corresponding unit prestowage node of the selected prestowage node is set, until all prestowage nodes complete setting for unit prestowage node Determine and know clearly condition test；

Prestowage income is searched in the unit prestowage node retained after rejecting and gets the corresponding unit prestowage node of maximum；

Unit prestowage node according to searching determines the maximum prestowage node of financial value, and according to the prestowage node prestowage letter is determined Number.

5. the transportation route optimization method of logistic management system according to claim 4, it is characterised in that the default bar Part includes：

The income lower limit is more than or equal to the optimal value.

6. the transportation route optimization method of logistic management system according to claim 4, it is characterised in that the calculating institute Also include after the step of stating unit prestowage node corresponding income lower limit：

Feasible solution of the income lower limit in the prestowage model is obtained, and determines that the corresponding feasible solution of the feasible solution is received Benefit value；

In optimal value of the feasible solution financial value less than the prestowage model, the optimal value of the prestowage model is updated to Feasible solution financial value.

7. the transportation route optimization method of the logistic management system according to any one of claim 1 to 6, it is characterised in that Also include：

Weighted Directed Graph is set according to the logistics transportation networks, and sets up S set and U set；

Obtain start node in the Weighted Directed Graph, by the start node be stored in S set, will except the start node with Other outer city nodes are stored in U set；

The city node k minimum with start node distance is chosen from U set, the city node k is moved to into S Set,

If shorter than predeterminable range to the distance of purpose node through city node k from start node, predeterminable range is updated；

The city node minimum with city node k distances is chosen in continuation from U set, and the node chosen is moved To S set, until whole cities node is all moved to S set；

The prestowage circuit between start node and purpose node is determined according to the mobile order of city node.

8. a kind of transportation route of logistic management system optimizes system, it is characterised in that include：

First read module, for reading between start node and purpose node from the logistics transportation networks of logistic management system The corresponding value at cost in path and each path；

Generation module, for according to the path and value at cost manufacturing cost matrix；

Module is chosen, for choosing the corresponding transport trainset in the path from the vehicle match table of logistic management system；

Module is built, for building the corresponding prestowage function in the path according to the transport trainset, according to the prestowage function And the weight matrix between Cost matrix synthesis start node and purpose node；Wherein, transport described in the prestowage function representation The corresponding vehicle of car group when maximum return value is got in respective paths operation, the corresponding financial value of the transport trainset and transport vehicle Functional relation between group；

Computing module, for calculating the minimum path of weight value at cost according to the weight matrix, obtain the start node with Path optimizing between purpose node；Wherein, shown weight value at cost is that corresponding transport trainset correspondence is run on the path Integrated cost value.

9. the transportation route of logistic management system according to claim 8 optimizes system, it is characterised in that also include：

First acquisition module, for obtaining the corresponding numbering of the transport trainset；

Second read module, for reading the transport in the vehicle registration table of the logistic management system according to the numbering The cell arrangement number of car group, model parameter, yield parameter and consume parameter；

Model construction module, for building transport vehicle according to the cell arrangement number, model parameter, unit cost and consumption parameter The prestowage model of group；

Second acquisition module, runs for obtaining the corresponding vehicle of the transport trainset according to the prestowage model in respective paths Get prestowage function during maximum return value.

10. the transportation route of logistic management system according to claim 9 optimizes system, it is characterised in that the prestowage Function is：

$max\underset{k=1}{\overset{m}{\&Sigma;}}\&lsqb;\left(\underset{j=1}{\overset{R_k}{\&Sigma;}}\underset{i=1}{\overset{n}{\&Sigma;}}{f}_{ijk}{x}_{ijk}\right)-({\mathrm{Cr}}_k+{\mathrm{Co}}_k+{\mathrm{Cf}}_k)\&rsqb;;$

Wherein,

$\underset{k=1}{\overset{m}{\&Sigma;}}\underset{j=1}{\overset{R_k}{\&Sigma;}}{x}_{ijk}\&le;N_i,\&ForAll;i=1,2,...,n,$

$\underset{i=1}{\overset{n}{\&Sigma;}}{l}_i{x}_{ijk}\&le;L_{jk},\&ForAll;k=1,2,...,m;\&ForAll;j=1,2,3,$

$x_{i3k}(p_i-1)=0,\&ForAll;i=1,2,...,n;\&ForAll;k=1,2,...,m;,$

$\underset{i=1}{\overset{n}{\&Sigma;}}\underset{j=1}{\overset{R_k}{\&Sigma;}}{w}_i{x}_{ijk}+W_k\&le;{\mathrm{fG}}_k,\&ForAll;k=1,2,...,m;$

$p_i:p_i=\left\{\begin{array}{c}0,if{h}_i\&GreaterEqual;H_k\\ 1,if{h}_i<H_k\end{array}\right.,$

N and m represent respectively cell arrangement number, R_kRepresent the entrucking row of k-th cell arrangement, f_ijkRepresent k-th cell arrangement The income of the cell arrangement of i-th model, x in jth row_ijkRepresent the unit dress of i-th model in k-th cell arrangement jth row The quantity put, Cr_k、Co_kAnd Cf_kRepresent and consume parameter, N_iRepresent the species number of cell arrangement, l_i、w_iAnd h_iI-th is represented respectively The model of individual cell arrangement, L_jkRepresent cargo length, the H of k-th cell arrangement jth row_kRepresent the bottom of k-th cell arrangement Highly, W_kRepresent the width of k-th cell arrangement, G_kThe standard load-carrying of k-th cell arrangement is represented, f represents over-loading coefficient, Z tables Show sum.