CN107358326A - A kind of bicycle multiple spot dispenses circuitry processing method - Google Patents
A kind of bicycle multiple spot dispenses circuitry processing method Download PDFInfo
- Publication number
- CN107358326A CN107358326A CN201710597594.2A CN201710597594A CN107358326A CN 107358326 A CN107358326 A CN 107358326A CN 201710597594 A CN201710597594 A CN 201710597594A CN 107358326 A CN107358326 A CN 107358326A
- Authority
- CN
- China
- Prior art keywords
- dispatching
- circuit
- point
- value
- initial
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 8
- 238000012545 processing Methods 0.000 claims abstract description 76
- 238000000034 method Methods 0.000 claims abstract description 50
- 230000002068 genetic effect Effects 0.000 claims abstract description 21
- 230000003044 adaptive effect Effects 0.000 claims description 47
- 230000008521 reorganization Effects 0.000 claims description 11
- 238000011156 evaluation Methods 0.000 claims description 8
- 230000001186 cumulative effect Effects 0.000 claims description 7
- 238000007667 floating Methods 0.000 claims description 4
- 230000000717 retained effect Effects 0.000 claims 1
- 238000005457 optimization Methods 0.000 description 9
- 238000004364 calculation method Methods 0.000 description 5
- 230000035772 mutation Effects 0.000 description 3
- 241000196324 Embryophyta Species 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005553 drilling Methods 0.000 description 2
- 238000011835 investigation Methods 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 101000911390 Homo sapiens Coagulation factor VIII Proteins 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 102000057593 human F8 Human genes 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 229940047431 recombinate Drugs 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of bicycle multiple spot to dispense circuitry processing method, including：Based on map datum, single-point is planned the circuit dispensed more a little using saving algrithm, initial dispatching line parameter circuit value after being planned, described to dispense the two or more dispatching points a little included in logistics distribution process, the single-point refers to dispatching starting point or dispatching terminal in logistics distribution process more；Processing is optimized to the initial dispatching line parameter circuit value using genetic algorithm, obtains actual dispatching line parameter circuit value.The embodiment of the present invention passes through real map road net data, on the basis of the point optimal path of dispatching two-by-two is calculated, pass through the combination of saving algrithm and genetic algorithm, the order for dispensing point is calculated more reasonable, it thus can aid in loglstics enterprise and improve dispatching efficiency, and distribution cost can be effectively saved.
Description
Technical field
The present invention relates to technical field of computer information processing, more particularly to a kind of bicycle multiple spot dispatching circuit processing side
Method.
Background technology
With the fast development of logistic industry, people have higher requirement to the dispatching timeliness of logistics, while logistics passes through
Enterprise of battalion also is intended to improve dispatching efficiency, with enterprise competitiveness.Thus, improve logistics services, reduce logistics
Distribution cost has become the basic demand of distribution routing planning in logistics distribution process.During distribution routing planning, lead to
What is be often related to is the planning of bicycle multiple spot dispatching circuit.
When bicycle multiple spot dispatching circuit refers to that single goods stock dispenses the goods in multiple places, in this case, need
Dispatching point is reasonably sorted, so that dispatching circuit is more reasonable, the distance travelled for saving goods stock is timely
Between, and then improve the purpose of dispatching efficiency.
At present, the dispatching circuit sorting consistence method of generally use is voluntarily completed by goods stock human pilot more, due to
Lack map datum during planning dispenses circuit, thus it can not accomplish to dispense each dispatching point in circuit well
Sequence reasonably optimized, and then have impact on dispatching efficiency.
The content of the invention
It is an object of the invention to provide a kind of bicycle multiple spot to dispense circuitry processing method, so as to based on map datum pair
Each dispatching point is reasonably sorted, and is advantageous to improve logistics distribution efficiency.
The purpose of the present invention is achieved through the following technical solutions：
A kind of bicycle multiple spot dispenses circuitry processing method, including：
Based on map datum, single-point is planned the circuit dispensed more a little using saving algrithm, after being planned
Initial dispatching line parameter circuit value, it is described to dispense the two or more dispatching points a little included in logistics distribution process more, it is described
Single-point refers to dispatching starting point or dispatching terminal in logistics distribution process；
Processing is optimized to the initial dispatching line parameter circuit value using genetic algorithm, obtains actual dispatching line parameter circuit value.
Described the step of being planned using saving algrithm the circuit dispensed more a little single-point, is included：
The single-point is connected with each dispatching point respectively, and calculates and the dispatching is dispensed into by the single-point respectively
First distance value of point；
Two dispatching points in multiple dispatching points are connected, and calculates and matches somebody with somebody as described in the single-point is dispensed into this two successively
Send second distance value a little；
Calculate the second distance value obtained after the described two dispatching points of connection and the difference of first distance value is made
For apart from saving value；
After the completion of by distance saving value calculating corresponding to any two dispatching point in all dispatching points, from big to small
Select described apart from two dispatching points corresponding to saving value, and determined whether according to predetermined condition in described two dispatchings successively
Connection is established between point, processing completion is chosen apart from saving value until all.
The predetermined condition includes：
Whether described two dispatching points are on the circuit formed；Or on the circuit formed, but be not line
The interior point on road；Or be not interior point on the different circuits formed, and one is circuit starting point, another is that circuit is whole
Stand；
And/or
After described two dispatching point connections, if the distribution capacity beyond distribution side limits；
And/or
After described two dispatching point connections, whether the total haulage time of circuit in delivery process meets the requirements；
And/or
After described two dispatching point connections, whether the time for reaching another dispatching point by a dispatching point meets the requirements.
Described the step of optimizing processing to the initial dispatching line parameter circuit value using genetic algorithm, includes：
Initial dispatching line group is created according to the initial dispatching line parameter circuit value, the initial dispatching line group includes a variety of
Dispense circuit；
According to the adaptive value of each dispatching circuit, selection dispenses circuit, the adaptive value in the initial dispatching line group
Refer to the evaluation of estimate for dispensing the dispatching cost of circuit；
Intersection reorganization between dispatching circuit is carried out and with line sending to the dispatching point included in the dispatching circuit of selection
The variation processing on road itself, and calculate the adaptive value of the new dispatching circuit after intersecting restructuring and variation processing；
If the adaptive value of the new dispatching circuit is better than the adaptive value on first wife's line sending road, first wife is replaced with new dispatching
Line sending road, otherwise, retain first wife's line sending road.
Include in the initial dispatching line group the step of selection dispatching circuit：
Produce a random floating point R in section [0,1]；
If R<Q1, then selection initially dispense first dispatching circuit in line group；Otherwise selecting one makes Qi-1<R<
I-th of dispatching circuit that=Qi is set up, wherein, i is more than or equal to 1 and all dispatchings included less than or equal to initial dispatching line group
The total quantity of circuit, Qi are the cumulative probability of each dispatching circuit, and the cumulative probability is the selection according to each dispatching circuit
Probability calculation determines that the select probability is to calculate to determine according to the adaptive value of each dispatching circuit.
The step of intersection reorganization between the dispatching circuit, includes：In currently dispatching circuit, the is come
Outside the optimal dispatching circuit of one, random or sequential selection two is to carrying out intersection restructuring in other dispatching circuits；
The step of variation processing, includes：The dispatching point included to intersecting the dispatching circuit after recombinating randomly chooses two
Swap position processing.
After first wife's line sending road, or reservation first wife's line sending road is replaced with new dispatching, this method also includes：
Again the dispatching point that the dispatching circuit after handling the variation includes enters row variation processing again, pre- until reaching
Fixed variation number of processes；
Again according to the adaptive value of each dispatching circuit in described initial one dispatching circuit of selection in dispensing line group, and
The number re-operated is equal to the dispatching number of, lines that the initial dispatching line group includes.
A kind of bicycle multiple spot dispenses circuit processing unit, including：
Circuit initial plan unit, for based on map datum, using saving algrithm to single-point to dispensing circuit a little more
Planned, the initial dispatching line parameter circuit value after being planned, it is described dispense more a little include two in logistics distribution process or
More than two dispatching points, the single-point refer to dispatching starting point or dispatching terminal in logistics distribution process；
Actual distribution routing planning unit, it is initial for being obtained using genetic algorithm to the circuit initial plan unit
Dispatching line parameter circuit value optimizes processing, obtains actual dispatching line parameter circuit value.
The circuit initial plan unit includes：
First distance value computing module, for the single-point to be connected with each dispatching point respectively, and calculate by institute
State the first distance value that single-point is dispensed into the dispatching point respectively；
Second distance value computing module, for connecting two dispatching points in multiple dispatching points, and calculate by the list
Point is dispensed into the second distance value of this two dispatching points successively；
Apart from saving value computing module, for calculate connect the second distance value computing module calculate obtain second away from
The difference of the first distance value obtained from value with the first distance value computing module calculating saving value as with a distance from；
Initial plant planning module, for it is described apart from saving value computing module by it is all it is described dispatching point in any two
After the completion of distance saving value corresponding to individual dispatching point calculates, select described apart from two corresponding to saving value to match somebody with somebody from big to small successively
Send a little, and according to predetermined condition determine whether it is described two dispatching point between establish connection, until it is all distance section
About it is worth and is chosen processing completion.
The actual distribution routing planning unit includes：
Initial dispatching line group establishes module, for the initial dispatching circuit obtained according to the circuit initial plan unit
Parameter creates initial dispatching line group, and the initial dispatching line group includes a variety of dispatching circuits；
Route choosing module is dispensed, is established for the adaptive value according to each dispatching circuit in the initial dispatching line group
Selection dispatching circuit in the initial dispatching line group that module is established, the adaptive value refer to the dispatching cost for dispensing circuit
Evaluation of estimate；
Cross and variation processing module, for the dispatching included in the dispatching circuit to the dispatching route choosing module selection
Point carries out the variation for intersecting reorganization and dispensing circuit itself processing between dispatching circuit, and calculates and recombinate and become through intersecting
The adaptive value of new dispatching circuit after different processing；
Distribution routing planning module, for the adaptation of the new dispatching circuit obtained according to the cross and variation processing module
Value, judges whether the adaptive value of the new dispatching circuit is better than the adaptive value on first wife's line sending road, if so, then being replaced with new dispatching
First wife's line sending road is changed, otherwise, retains first wife's line sending road.
As seen from the above technical solution provided by the invention, a kind of bicycle multiple spot dispatching provided in an embodiment of the present invention
Circuitry processing method, it is to combine map datum that it dispenses line optimization for bicycle multiple spot, by real map road net data,
On the basis of the point optimal path of dispatching two-by-two is calculated, by the combination of saving algrithm and genetic algorithm, the order of point will be dispensed
Calculate more reasonable, thus can aid in loglstics enterprise and improve dispatching efficiency, and distribution cost can be effectively saved.
Brief description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Accompanying drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the present invention, for this
For the those of ordinary skill in field, on the premise of not paying creative work, other can also be obtained according to these accompanying drawings
Accompanying drawing.
Fig. 1 is method processing procedure schematic diagram provided in an embodiment of the present invention；
Fig. 2 is genetic algorithms approach processing procedure schematic diagram provided in an embodiment of the present invention；
Fig. 3 is the structural representation of device provided in an embodiment of the present invention.
Embodiment
With reference to the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Ground describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.Based on this
The embodiment of invention, the every other implementation that those of ordinary skill in the art are obtained under the premise of creative work is not made
Example, belongs to protection scope of the present invention.
Because genetic algorithm is a kind of random calculation, therefore its result has the characteristics of unstable, and for larger
It can not draw satisfied result in a short time to distribution project, therefore, in the embodiment of the present invention just employ C-W (saving) calculations
The mode that method is combined with GA (heredity) algorithm, gives full play to the stability of C-W algorithms and the overall situation of GA algorithms is had the ability.Also
It is to say to use the GA algorithms of elite retention strategy more sensitive to initial solution, a good initial solution can substantially improve optimization effect
Fruit, therefore using C-W algorithms generation initial solution, then further optimized with GA algorithms again, generate a more excellent satisfactory result.
The embodiments of the invention provide a kind of bicycle multiple spot to dispense circuitry processing method, as shown in figure 1, it can mainly be wrapped
Include following processing step：
Step 11, based on map datum, single-point is planned the circuit dispensed more a little using saving algrithm, advised
Initial dispatching line parameter circuit value after drawing；Wherein, it is described dispense more a little include it is two or more in logistics distribution process
Point is dispensed, the single-point refers to dispatching starting point or dispatching terminal in logistics distribution process
Specifically, described the step of being planned using saving algrithm the circuit dispensed more a little single-point, can include：
(1) map datum is based on, the single-point is connected with each dispatching point respectively, and calculates by the single-point point
The first distance value of the dispatching point is not dispensed into；
Wherein, the single-point can refer to dispense starting point, or can also be dispatching terminal；
(2) two dispatching points in multiple dispatching points are connected, and calculates and two institutes is dispensed into by the single-point successively
State the second distance value of dispatching point；
(3) the second distance value and the difference of first distance value obtained after the described two dispatching points of connection is calculated
As apart from saving value；
(4) by after the completion of distance saving value corresponding to any two dispatching point calculates in all dispatching points, from big
Select described apart from two dispatching points corresponding to saving value to small, and determined whether according to predetermined condition described two successively
Connection is established between dispatching point, processing completion is chosen apart from saving value until all.
In above-mentioned steps (4), the predetermined condition can include any one of following or multinomial：
Whether described two dispatching points are on the circuit formed；Or on the circuit formed, but be not line
The interior point on road；Or be not interior point on the different circuits formed, and one is circuit starting point, another is that circuit is whole
Stand；
After described two dispatching point connections, if the distribution capacity beyond distribution side limits, that is, the goods for needing to dispense is
It is no to carry；
After described two dispatching point connections, whether the total haulage time of circuit in delivery process meets the requirements；
After described two dispatching point connections, whether the time for reaching another dispatching point by a dispatching point meets the requirements,
Such as, if can reaching on the time another dispatching point, or, reach another dispatching point time whether can ensure not surpass
Go out predetermined time range, etc..
Step 12, processing is optimized to the initial dispatching line parameter circuit value using genetic algorithm, obtains reality and match somebody with somebody line sending
Road parameter.
Specifically, the step of optimizing processing to the initial dispatching line parameter circuit value can include：
(1) initial dispatching line group is created according to the initial dispatching line parameter circuit value, the initial dispatching line group includes
A variety of dispatching circuits；
(2) according to the adaptive value of each dispatching circuit, selection dispenses circuit in the initial dispatching line group, described suitable
The evaluation of estimate for the dispatching cost for referring to dispense circuit should be worth, the corresponding evaluation of estimate for dispensing cost needs usual according to dispatching business
It is one or more, etc. in the total time-consuming or total distance or wastage in bulk or weight cost that refer to dispense circuit；
In the step, the processing of dispatching circuit is selected to include in the initial dispatching line group：
Produce a random floating point R in section [0,1]；
If R<Q1, then selection initially dispense first dispatching circuit in line group；Otherwise selecting one makes Qi-1<R<
I-th of dispatching circuit that=Qi is set up, wherein, i is more than or equal to 1 and all dispatchings included less than or equal to initial dispatching line group
The total quantity of circuit, Qi are the cumulative probability of each dispatching circuit, and the cumulative probability is the selection according to each dispatching circuit
Probability calculation determines that the select probability is to calculate to determine according to the adaptive value of each dispatching circuit.
(3) intersection reorganization and the dispatching between dispatching circuit are carried out to the dispatching point included in the dispatching circuit of selection
The variation processing of circuit itself, and calculate the adaptive value of the new dispatching circuit after intersecting restructuring and variation processing；
The step of intersection reorganization between the dispatching circuit, includes：In currently dispatching circuit, the is come
Outside the optimal dispatching circuit of one, random or sequential selection two is to carrying out intersection restructuring in other dispatching circuits.
The step of variation processing, includes：The dispatching point included to intersecting the dispatching circuit after recombinating randomly chooses two
Swap position processing.
(4) if the adaptive value of the new dispatching circuit is better than the adaptive value on first wife's line sending road, replaced with new dispatching
First wife's line sending road, otherwise, retain first wife's line sending road.
Further, this method can also include：
After first wife's line sending road, or reservation first wife's line sending road is replaced with new dispatching, after handling again the variation
The dispatching point that dispatching circuit includes enters row variation processing again, until reaching predetermined variation number of processes；
Again according to the adaptive value of each dispatching circuit in described initial one dispatching circuit of selection in dispensing line group, and
The number re-operated is equal to the dispatching number of, lines that the initial dispatching line group includes.
For ease of the understanding to the embodiment of the present invention, below in conjunction with specific implementation process of the accompanying drawing to the embodiment of the present invention
It is described in further detail.
During concrete application, a kind of technical side of bicycle multiple spot dispatching line optimization provided in an embodiment of the present invention
Case, it specifically may comprise steps of：
(1) map datum comprising national road network is used, the delivery point that lorry needs to dispense is grouped two-by-two, by leading
The calculation pass of boat is held up, and the path computing between two-by-two is good, obtains the actual distance of the point of delivery two-by-two.
(2) it is individually to be connected first by each point with source point 0 (i.e. single-point, can be dispatching starting point herein) using saving algrithm,
Circuit of the l bars only containing a point is formed, total distance is：
Then " the saving value " that point i and j are connected to distance on a circuit is calculated：
S (i, j)=COi+CiO+C0j+CjO mono- (COi+Cij+Cj0)=CiO+COj-Cij；
Cij represents the cost from i points to j points.S (i, j) is bigger, then total distance is reduced when showing to link together i and j
It is more.During construction dispatching circuit, it can be carried out according to the orders of s (i, j) from big to small, can be grasped on table during specific implementation
Make.
Corresponding specific saving algrithm is described as follows：
(1) calculate s (i, j), make M=s (i, j) | s (i, j)>0}.
(2) the order arrangement in M by S (i, j) from big to small.
(3) if M is sky, then it represents that saving algrithm, which terminates, to be completed, and obtains corresponding initial dispatching line parameter circuit value；Otherwise press
Corresponding to s (i, the j) investigations maximum to Section 1 of certain selection strategy (i, j), such as meet one of following condition：
1. task i and task j be not on the circuit formed；
2. task i or task j are not the interior points of circuit on the circuit formed；
3. task i and task j on the different circuits formed, is not interior point, and one is starting point, and one is eventually
Point.Walked under then turning, i.e. step (4), otherwise go to step (8)；
(4) investigation task i connects the load-carrying of rear vehicle with task j and whether volume meets constraints, meets that turning lower walks,
That is step (5), step (8) is otherwise gone to.
(5) the total haulage time TTij of circuit after task i connects with task j is investigated, if TTij<=MaxDuration, then
Turn lower to walk, i.e. step 6, otherwise go to step (8)；Wherein, MaxDuration is the maximum haulage time limit of a dispatching circuit
System, the parameter value can dispense needs according to practical business and be set.
(6) after the circuit where calculating EFj, EFj expressions connection task i and task j, vehicle reaches j time than former line
Vehicle reaches j time retardation amount or lead on road；
1. if EFj=0, goes to step (7)；
If 2. EFj<0, then △ j- are calculated, as EFj≤△ j-, turns (7), otherwise goes to step (8)；
If 3. EFj>0, then △ j+ are calculated, as EFj≤△ j+, turns (7), otherwise goes to step (8).
In the step (6), △ j+ represent the task j arrival times that time-to-violation window does not constrain on circuit behind j
Maximum allowable retardation, △ j- represent that the j that the task on circuit behind j withouts waiting for reaches the maximum of time and can shifted to an earlier date
Amount；
(7) task i and task j is connected, the new time that vehicle reaches each task is calculated, goes to step (8)；
(8) M=M-s (i, j) is made, scratches ith row and jth column, i.e. i points can not arrive other points again, and j points can not be by it
He, which puts, reaches；Go to step (2).
(3) further, show that initial value is (after initial sequence, i.e., corresponding initially to dispense circuit ginseng by saving algrithm
Number) after then depth optimization can be carried out to corresponding initial dispatching line parameter circuit value by genetic algorithm, according to the flow shown in Fig. 2
Figure, the optimization process of corresponding genetic algorithm can include initialization of population, and three big genetic operators selections, intersection,
Variation, the also fitness all the time through whole algorithm calculate, and after repeatedly calculating, finally obtain satisfied dispatching dot sequency
As final actual dispatching line parameter circuit value.
The each processing procedure optimized based on genetic algorithm for dispatching circuit will be elaborated respectively below：
(1) initialization of population
Population Size is POPSIZE (value is specially empirical value, can be needed to carry out size adjustment according to specific business),
POPSIZE individual of generation, the optional dispatching circuit of corresponding one of each individual, in this step, this POPSIZE individual
The initial dispatching line group of composition, the group obtain an individual, remaining POPSIZE-1 individual specifically by above-mentioned saving algrithm
Generated by randomly ordered mode.
(2) selection is handled
For selection opertor, new colony is selected (i.e. in above-mentioned initialization population using based on the probability distribution of adaptive value
New dispatching line group), the selection of the wheel disc progress individual of scale width is adjusted according to adaptive value usually using one.Accordingly
Selection algorithm is as follows:
(21) the adaptive value Ei of each dispatching circuit in initialization population is calculated；
(22) total adaptive value F=E1+E2+ ...+Epop_size of initialization population colony is calculated；
(23) then each the select probability of dispatching circuit is Pi=Ei/F；
(24) the cumulative probability Qi=P1+P2+ ...+Pi of each dispatching circuit is calculated.
It is secondary that pop_size (initializing the individual amount that population includes) is rotated to wheel disc, every time according to following selecting party
Method selects a dispatching circuit as follows as the new member for dispensing line group, system of selection：
First, a random floating point R in section [0,1] is produced；
Afterwards, if R<Q1, select first dispatching circuit；Otherwise selecting one makes Qi-1<R<I-th of=Qi establishments
Dispense circuit (1<=i<=pop_size).
It is in above-mentioned steps when performing selection processing step first it should be noted that in above-mentioned processing procedure
(1) new colony is selected in the initialization population obtained；Afterwards, when circulation performs selection processing step again, then need from it
Selected section dispatching circuit forms new dispatching line group and made in the dispatching circuit result determined in preceding last processing procedure
For corresponding new colony, i.e., handle weight in the dispatching circuit result obtained by above-mentioned steps (4) from last processing procedure
New selected section dispatching circuit forms new dispatching line group.
(3) reorganization is intersected
Based on the member of above-mentioned new dispatching line group, (retain one in addition to the optimal dispatching circuit to make number one
Optimal dispatching circuit, algorithm is avoided not restrain the optimal performance for influenceing result), another mono- 1 dispatching circuits of N are random (or order)
2 dispatching circuits are chosen, and carries out pairing by crossover probability Pc and intersects restructuring.Crossover operation is occurred with probability P c, crossing operation
Using OX ordered crossover operators；Wherein, crossover probability Pc is to be generated by random function.
Specific reorganization process of intersecting includes：At random an exchange area, such as two are selected in parent dispenses circuit
Parent dispenses circuit and exchange area is chosen to be：
A=47 | 8563 | 921, B=83 | 4691 | 257；
Then B exchange area is added to before A, A exchange area is added to before B, is obtained：
A '=4691 | 478563921, B '=8563 | 834691257；
Deleted successively behind self-exchange region in A ', B ' with exchange area identical natural number, obtain final two dispatchings
Circuit is：
A "=469178532, B "=856349127.
(4) variation is handled
A random number can be generated for every circuit, (variation is general if the random number generated at random is less than mutation probability
Rate can be set based on experience value), then mutation operation is carried out to this circuit, the dispatching circuit that need to carry out mutation operation is matched somebody with somebody
Send a progress J exchange.Exchange randomly selects 2 dispatching points and exchanges position every time；If dispensed after exchanging position with former generation
The adaptive value of circuit is compared, and is improved, and is received the dispatching circuit after the exchange, is otherwise abandoned；So circulation is gone down, until
Exchange times reach J times, and corresponding exchange times J is random generation or setting as needed.
As shown in Fig. 2 after above-mentioned variation processing, then fitness can be carried out to the dispatching line group of acquisition and commented
Valency, calculate the adaptive value for determining each dispatching circuit that dispatching line group includes；And then according to the suitable of each dispatching circuit
It should be worth whether the adaptive value for judging to dispense circuit is optimized, if so, then continuing subsequently whether to meet at the judgement of end condition
Reason, otherwise, return to selection processing step and continue executing with corresponding genetic algorithm processing operation, that is, re-execute above-mentioned steps (2)
And carry out follow-up processing operation；Finally, whether evaluating this has whether the dispatching circuit of adaptive optimal control value meets to require, i.e., full
Foot terminates the condition of genetic algorithm processing, if satisfied, then genetic algorithmic procedures result, otherwise, returns to selection processing step and continue
Perform corresponding genetic algorithm processing operation.
In fig. 2, the processing procedure for carrying out solving fitness evaluation accordingly specifically includes：Line group is dispensed for current,
Calculate the adaptive value of each dispatching circuit, adaptive value calculating process generally require the total kilometrage that calculates whole dispatching circuit or it is total when
Between or cost etc., for example, the totle drilling cost of dispatching circuit can be calculated, the fixed costs of corresponding totle drilling cost=all vehicles+
All vehicles run through the expense needed for all nodes.
, can be to obtain optimal dispatching circuit, consequently facilitating matching somebody with somebody according to optimal accordingly by above-mentioned processing procedure
Line sending road carries out the delivery service of single point-to-multipoint.
Bicycle multiple spot provided in an embodiment of the present invention dispenses line optimization method, by combining real Road netting index
According to the real driving distance (not simple air line distance) that calculating dispenses a little two-by-two dispense the optimization of circuit.Test table
It is bright, after the algorithm combined with reference to road network and use C-W with GA, in the case where not increasing processing time, obtain satisfactory result
Satisfaction and stability be greatly improved than in general optimized algorithm.
The embodiment of the present invention additionally provides a kind of bicycle multiple spot dispatching circuit processing unit, and it implements structure such as Fig. 3
It is shown, following processing unit can be included：
Circuit initial plan unit 31, for based on map datum, using saving algrithm to single-point to dispensing line a little more
Planned that the initial dispatching line parameter circuit value after being planned described to dispense two a little included in logistics distribution process more in road
Or more than two dispatching points, the single-point refer to dispatching starting point or dispatching terminal in logistics distribution process；
Actual distribution routing planning unit 32, for what is obtained using genetic algorithm to the circuit initial plan unit 31
Initial dispatching line parameter circuit value optimizes processing, obtains actual dispatching line parameter circuit value.
Further, in above-mentioned bicycle multiple spot dispenses circuit processing unit, the circuit initial plan unit 31 is specific
Following processing module can be included：
First distance value computing module 311, for by the single-point respectively with it is each it is described dispatching point be connected, and calculating by
The single-point is dispensed into the first distance value of the dispatching point respectively；
Second distance value computing module 312, for connecting two dispatching points in multiple dispatching points, and calculate by described
Single-point is dispensed into the second distance value of this two dispatching points successively；
Apart from saving value computing module 313, connect what the calculating of second distance value computing module 312 obtained for calculating
The difference that second distance value calculates the first distance value obtained with the first distance value computing module 311 is used as distance to save
Value；
Initial plant planning module 314, for it is described apart from saving value computing module 313 by it is all it is described dispatching point in
After the completion of distance saving value corresponding to any two dispatching point calculates, select successively from big to small described apart from corresponding to saving value
Two dispatching points, and determined whether according to predetermined condition to establish connection between described two dispatching points, until all
Processing is chosen apart from saving value to complete.
Alternatively, in above-mentioned bicycle multiple spot dispenses circuit processing unit, the actual distribution routing planning unit 32 has
Body can include following processing module：
Initial dispatching line group establishes module 321, initially matches somebody with somebody for what is obtained according to the circuit initial plan unit 31
Line parameter circuit value is sent to create initial dispatching line group, the initial dispatching line group includes a variety of dispatching circuits；
Route choosing module 322 is dispensed, for the adaptive value according to each dispatching circuit in the initial dispatching line group
Selection dispatching circuit in the initial dispatching line group of the foundation of module 321 is established, the adaptive value refers to dispense matching somebody with somebody for circuit
Send the evaluation of estimate of cost；
Cross and variation processing module 323, for being included in the dispatching circuit to the selection of dispatching route choosing module 322
Dispatching point carry out the variation for intersecting reorganization and dispensing circuit itself processing between dispatching circuit, and calculate through intersecting weight
The adaptive value of new dispatching circuit after group and variation processing；
Distribution routing planning module 324, for the new dispatching circuit obtained according to the cross and variation processing module 323
Adaptive value, judge whether the adaptive value of the new dispatching circuit is better than the adaptive value on first wife's line sending road, if so, then with new
First wife's line sending road is replaced in dispatching, otherwise, retains first wife's line sending road.
Said apparatus provided in an embodiment of the present invention calculates the point of dispatching two-by-two by combining real road network data
Real driving distance dispense the optimization of circuit, can be to be satisfied with so as in the case where not increasing processing time
Line optimization result.
The processing mode of the specific use of each processing unit and module in actual application is at it in the said equipment
It has been discussed in detail, has will not be repeated here in the description of preceding embodiment of the method.
The foregoing is only a preferred embodiment of the present invention, but protection scope of the present invention be not limited thereto,
Any one skilled in the art is in the technical scope of present disclosure, the change or replacement that can readily occur in,
It should all be included within the scope of the present invention.Therefore, protection scope of the present invention should be with the protection model of claims
Enclose and be defined.
Claims (10)
1. a kind of bicycle multiple spot dispenses circuitry processing method, it is characterised in that including：
Based on map datum, single-point is planned the circuit dispensed more a little using saving algrithm, it is initial after being planned
Line parameter circuit value is dispensed, it is described to dispense the two or more dispatching points a little included in logistics distribution process, the single-point more
Refer to the dispatching starting point or dispatching terminal in logistics distribution process；
Processing is optimized to the initial dispatching line parameter circuit value using genetic algorithm, obtains actual dispatching line parameter circuit value.
2. according to the method for claim 1, it is characterised in that it is described using saving algrithm to single-point to dispensing line a little more
The step of road is planned includes：
The single-point is connected with each dispatching point respectively, and calculates and the dispatching point is dispensed into by the single-point respectively
First distance value；
Two dispatching points in multiple dispatching points are connected, and calculates and this two dispatching points is dispensed into by the single-point successively
Second distance value；
Calculate obtained second distance value and the differences of first distance value after the described two dispatching points of connection be used as away from
From saving value；
After the completion of by distance saving value calculating corresponding to any two dispatching point in all dispatching points, from big to small successively
Select described apart from two dispatching points corresponding to saving value, and determined whether according to predetermined condition in described two dispatching points
Between establish connection, until it is all apart from saving value be chosen processing complete.
3. according to the method for claim 2, it is characterised in that the predetermined condition includes：
Whether described two dispatching points are on the circuit formed；Or on the circuit formed, but be not circuit
Interior point；Or be not interior point on the different circuits formed, and one is circuit starting point, another is that circuit is stood eventually；
And/or
After described two dispatching point connections, if the distribution capacity beyond distribution side limits；
And/or
After described two dispatching point connections, whether the total haulage time of circuit in delivery process meets the requirements；
And/or
After described two dispatching point connections, whether the time for reaching another dispatching point by a dispatching point meets the requirements.
4. according to the method described in any one of claims 1 to 3, it is characterised in that described to utilize genetic algorithm to described initial
The step of dispatching line parameter circuit value optimizes processing includes：
Initial dispatching line group is created according to the initial dispatching line parameter circuit value, the initial dispatching line group includes a variety of dispatchings
Circuit；
According to the adaptive value of each dispatching circuit, selection dispatching circuit, the adaptive value refer in the initial dispatching line group
Dispense the evaluation of estimate of the dispatching cost of circuit；
Intersection reorganization between dispatching circuit is carried out to the dispatching point included in the dispatching circuit of selection and dispenses circuit certainly
The variation processing of body, and calculate the adaptive value of the new dispatching circuit after intersecting restructuring and variation processing；
If the adaptive value of the new dispatching circuit is better than the adaptive value on first wife's line sending road, first wife's line sending is replaced with new dispatching
Road, otherwise, retain first wife's line sending road.
5. according to the method for claim 4, it is characterised in that the selection dispatching circuit in the initial dispatching line group
Step includes：
Produce a random floating point R in section [0,1]；
If R<Q1, then selection initially dispense first dispatching circuit in line group；Otherwise selecting one makes Qi-1<R<=Qi
I-th of the dispatching circuit set up, wherein, i is more than or equal to 1 and all dispatching circuits included less than or equal to initial dispatching line group
Total quantity, Qi is the cumulative probability of each dispatching circuit, and the cumulative probability is the select probability according to each dispatching circuit
Calculate and determine, the select probability is to be calculated to determine according to the adaptive value of each dispatching circuit.
6. according to the method for claim 4, it is characterised in that
The step of intersection reorganization between the dispatching circuit, includes：In currently dispatching circuit, exclude to make number one
Optimal dispatching circuit outside, random or sequential selection two is to carrying out intersection restructuring in other dispatching circuits；
The step of variation processing, includes：The dispatching point included to intersecting the dispatching circuit after recombinating randomly chooses two progress
Exchange position processing.
7. according to the method for claim 4, it is characterised in that first wife's line sending road is being replaced with new dispatching, or retained former
After dispensing circuit, this method also includes：
Again the dispatching point that the dispatching circuit after handling the variation includes enters row variation processing again, predetermined until reaching
Make a variation number of processes；
Again according to the adaptive value of each dispatching circuit, selection one dispenses circuit in the initial dispatching line group, and described
The number re-operated is equal to the dispatching number of, lines that the initial dispatching line group includes.
8. a kind of bicycle multiple spot dispenses circuit processing unit, it is characterised in that including：
Circuit initial plan unit, for based on map datum, being carried out using saving algrithm to single-point to the circuit dispensed more a little
Planning, the initial dispatching line parameter circuit value after being planned, described dispense more a little include two in logistics distribution process or two
Dispatching point above, the single-point refer to dispatching starting point or dispatching terminal in logistics distribution process；
Actual distribution routing planning unit, for the initial dispatching obtained using genetic algorithm to the circuit initial plan unit
Line parameter circuit value optimizes processing, obtains actual dispatching line parameter circuit value.
9. bicycle multiple spot according to claim 8 dispenses circuit processing unit, it is characterised in that the circuit initial plan
Unit includes：
First distance value computing module, for the single-point to be connected with each dispatching point respectively, and calculate by the list
Point is dispensed into the first distance value of the dispatching point respectively；
Second distance value computing module, for connect it is multiple dispatching point in two dispatching points, and calculate by the single-point according to
The secondary second distance value for being dispensed into this two dispatching points；
Apart from saving value computing module, for calculating the second distance value for connecting the second distance value computing module and calculating acquisition
The difference that the first distance value obtained is calculated with the first distance value computing module is used as apart from saving value；
Initial plant planning module, for matching somebody with somebody any two in all dispatching points apart from saving value computing module described
Send a little corresponding to distance saving value calculate after the completion of, select successively from big to small it is described apart from corresponding to saving value two dispatching
Point, and according to predetermined condition determine whether it is described two dispatching point between establish connection, until it is all distance save
Value is chosen processing and completed.
10. bicycle multiple spot dispatching circuit processing unit according to claim 8 or claim 9, it is characterised in that the actual dispatching
Layout of roads unit includes：
Initial dispatching line group establishes module, for the initial dispatching line parameter circuit value obtained according to the circuit initial plan unit
Initial dispatching line group is created, the initial dispatching line group includes a variety of dispatching circuits；
Route choosing module is dispensed, module is established in the initial dispatching line group for the adaptive value according to each dispatching circuit
Selection dispatching circuit in the initial dispatching line group established, the adaptive value refer to the evaluation for dispensing the dispatching cost of circuit
Value；
Cross and variation processing module, the dispatching for being included in the dispatching circuit to the dispatching route choosing module selection click through
The variation for intersecting reorganization and dispensing circuit itself processing between row dispatching circuit, and calculate through intersecting at restructuring and variation
The adaptive value of new dispatching circuit after reason；
Distribution routing planning module, for the adaptive value of the new dispatching circuit obtained according to the cross and variation processing module,
Judge whether the adaptive value of the new dispatching circuit is better than the adaptive value on first wife's line sending road, if so, then being replaced with new dispatching
First wife's line sending road, otherwise, retain first wife's line sending road.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710597594.2A CN107358326A (en) | 2017-07-20 | 2017-07-20 | A kind of bicycle multiple spot dispenses circuitry processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710597594.2A CN107358326A (en) | 2017-07-20 | 2017-07-20 | A kind of bicycle multiple spot dispenses circuitry processing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107358326A true CN107358326A (en) | 2017-11-17 |
Family
ID=60284325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710597594.2A Pending CN107358326A (en) | 2017-07-20 | 2017-07-20 | A kind of bicycle multiple spot dispenses circuitry processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107358326A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN108592929A (en) * | 2018-03-26 | 2018-09-28 | 海南掌控科技有限公司 | The some method of path planning and transport delivery system between multiple spot |
| CN108846617A (en) * | 2018-07-05 | 2018-11-20 | 北京智行者科技有限公司 | Method of servicing is sent in full-automatic logistics pool with charge free |
| CN108921483A (en) * | 2018-07-16 | 2018-11-30 | 深圳北斗应用技术研究院有限公司 | A kind of logistics route planing method, device and driver arrange an order according to class and grade dispatching method, device |
| CN109558986A (en) * | 2018-12-10 | 2019-04-02 | 北京顺丰同城科技有限公司 | A kind of sort method and device of same city website dispatching sequence |
| CN109919365A (en) * | 2019-02-19 | 2019-06-21 | 清华大学 | A kind of electric vehicle paths planning method and system based on double decision searches |
| CN110263986A (en) * | 2019-06-05 | 2019-09-20 | 四川驹马科技有限公司 | A kind of logistics distribution system and method adapting to complicated traffic variation |
| CN110276467A (en) * | 2018-03-14 | 2019-09-24 | 米思米（中国）精密机械贸易有限公司 | Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system |
| CN110930092A (en) * | 2019-11-06 | 2020-03-27 | 北京三快在线科技有限公司 | Distribution route adjusting method and device, electronic equipment and storage medium |
| CN111191873A (en) * | 2019-11-26 | 2020-05-22 | 浙江数链科技有限公司 | Distribution vehicle scheduling method, device, system, computer equipment and storage medium |
| CN112149921A (en) * | 2020-10-20 | 2020-12-29 | 国网重庆市电力公司营销服务中心 | Large-scale electric logistics vehicle path planning method and system and charging planning method |
| CN112183838A (en) * | 2020-09-22 | 2021-01-05 | 湘潭大学 | Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm |
| CN112801310A (en) * | 2020-11-17 | 2021-05-14 | 北京工业大学 | Vehicle path optimization method based on C-W saving algorithm |
| CN113902359A (en) * | 2020-07-06 | 2022-01-07 | 上海顺如丰来技术有限公司 | Logistics distribution path planning method and device, computer equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001034880A (en) * | 1999-07-26 | 2001-02-09 | Nissan Motor Co Ltd | Delivery schedule supporting device |
| JP2011013708A (en) * | 2009-06-30 | 2011-01-20 | Babcock Hitachi Kk | Apparatus and method for searching a plurality of routes |
| CN105184412A (en) * | 2015-09-21 | 2015-12-23 | 北京农业信息技术研究中心 | Logistics delivery route planning method and system based on geographic positions |
| CN105184417A (en) * | 2015-09-24 | 2015-12-23 | 国家电网公司 | Distribution route optimization method and apparatus for metering devices |
| CN106803136A (en) * | 2017-01-24 | 2017-06-06 | 苏州工业职业技术学院 | A kind of fresh dispatching real-time optimization method based on genetic algorithm |
| CN106951981A (en) * | 2017-02-24 | 2017-07-14 | 河海大学 | A kind of vehicle routing choice method |
-
2017
- 2017-07-20 CN CN201710597594.2A patent/CN107358326A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001034880A (en) * | 1999-07-26 | 2001-02-09 | Nissan Motor Co Ltd | Delivery schedule supporting device |
| JP2011013708A (en) * | 2009-06-30 | 2011-01-20 | Babcock Hitachi Kk | Apparatus and method for searching a plurality of routes |
| CN105184412A (en) * | 2015-09-21 | 2015-12-23 | 北京农业信息技术研究中心 | Logistics delivery route planning method and system based on geographic positions |
| CN105184417A (en) * | 2015-09-24 | 2015-12-23 | 国家电网公司 | Distribution route optimization method and apparatus for metering devices |
| CN106803136A (en) * | 2017-01-24 | 2017-06-06 | 苏州工业职业技术学院 | A kind of fresh dispatching real-time optimization method based on genetic algorithm |
| CN106951981A (en) * | 2017-02-24 | 2017-07-14 | 河海大学 | A kind of vehicle routing choice method |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107977739B (en) * | 2017-11-22 | 2021-07-06 | 深圳北斗应用技术研究院有限公司 | Method, device and equipment for optimizing logistics distribution path |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN110276467A (en) * | 2018-03-14 | 2019-09-24 | 米思米（中国）精密机械贸易有限公司 | Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system |
| CN108592929A (en) * | 2018-03-26 | 2018-09-28 | 海南掌控科技有限公司 | The some method of path planning and transport delivery system between multiple spot |
| CN108846617A (en) * | 2018-07-05 | 2018-11-20 | 北京智行者科技有限公司 | Method of servicing is sent in full-automatic logistics pool with charge free |
| CN108921483A (en) * | 2018-07-16 | 2018-11-30 | 深圳北斗应用技术研究院有限公司 | A kind of logistics route planing method, device and driver arrange an order according to class and grade dispatching method, device |
| CN109558986A (en) * | 2018-12-10 | 2019-04-02 | 北京顺丰同城科技有限公司 | A kind of sort method and device of same city website dispatching sequence |
| CN109919365B (en) * | 2019-02-19 | 2020-12-01 | 清华大学 | Electric vehicle path planning method and system based on double-strategy search |
| CN109919365A (en) * | 2019-02-19 | 2019-06-21 | 清华大学 | A kind of electric vehicle paths planning method and system based on double decision searches |
| CN110263986A (en) * | 2019-06-05 | 2019-09-20 | 四川驹马科技有限公司 | A kind of logistics distribution system and method adapting to complicated traffic variation |
| CN110930092A (en) * | 2019-11-06 | 2020-03-27 | 北京三快在线科技有限公司 | Distribution route adjusting method and device, electronic equipment and storage medium |
| CN111191873A (en) * | 2019-11-26 | 2020-05-22 | 浙江数链科技有限公司 | Distribution vehicle scheduling method, device, system, computer equipment and storage medium |
| CN111191873B (en) * | 2019-11-26 | 2023-06-16 | 浙江数链科技有限公司 | Dispatching method, device, system, computer equipment and storage medium for delivery vehicle |
| CN113902359A (en) * | 2020-07-06 | 2022-01-07 | 上海顺如丰来技术有限公司 | Logistics distribution path planning method and device, computer equipment and storage medium |
| CN112183838A (en) * | 2020-09-22 | 2021-01-05 | 湘潭大学 | Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm |
| CN112183838B (en) * | 2020-09-22 | 2024-02-02 | 湘潭大学 | Method for optimally solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm |
| CN112149921A (en) * | 2020-10-20 | 2020-12-29 | 国网重庆市电力公司营销服务中心 | Large-scale electric logistics vehicle path planning method and system and charging planning method |
| CN112149921B (en) * | 2020-10-20 | 2024-04-19 | 国网重庆市电力公司营销服务中心 | Large-scale electric logistics vehicle path planning method and system and charging planning method |
| CN112801310A (en) * | 2020-11-17 | 2021-05-14 | 北京工业大学 | Vehicle path optimization method based on C-W saving algorithm |
| CN112801310B (en) * | 2020-11-17 | 2024-07-16 | 北京工业大学 | Vehicle path optimization method based on C-W saving algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107358326A (en) | A kind of bicycle multiple spot dispenses circuitry processing method | |
| CN106600036B (en) | Based on Android multiple spot express delivery allocator | |
| CN102542395B (en) | A kind of emergency materials dispatching system and computing method | |
| CN109299810A (en) | A kind of goods stock stowage method | |
| CN107145971A (en) | A kind of express delivery dispatching optimization method of dynamic adjustment | |
| CN107194656A (en) | A kind of method and device for planning of the Distribution path based on standard container order | |
| CN105373909A (en) | Logistics dispensing center addressing method based on simulation software | |
| CN107316167A (en) | A kind of allocator and device based on shops position of distributors | |
| CN105844349A (en) | Method and system for automatically distributing orders | |
| CN107909228B (en) | Dynamic vehicle goods receiving and dispatching path planning method and device based on modular factor calculation | |
| CN105096011A (en) | Improved chromosome coding based logistic transportation and scheduling method | |
| CN102136104A (en) | Load balance and Lin-Kernighan (LK) algorithm based vehicle route planning method | |
| CN107578119A (en) | A kind of resource allocation global optimization method of intelligent dispatching system | |
| CN106803136A (en) | A kind of fresh dispatching real-time optimization method based on genetic algorithm | |
| Shao et al. | Variable neighborhood search and tabu search for auction-based waste collection synchronization | |
| CN108106622A (en) | A kind of riding route method and system for planning | |
| CN105825358A (en) | Vehicle scheduling method for cargo delivery | |
| CN109636213A (en) | Order distribution and evaluation method and device, electronic equipment and storage medium | |
| CN106843270A (en) | Paths planning method is delivered in a kind of unmanned plane express delivery automatically | |
| CN109559062A (en) | A kind of task distribution of cooperative logistical problem and paths planning method | |
| CN108932366A (en) | Coal harbour, which is unloaded, produces artificial intelligence dispatching method and system | |
| US20230384767A1 (en) | Industrial internet of things for determining material transportation paths, control methods and media thereof | |
| CN114399095A (en) | Cloud-side-cooperation-based dynamic vehicle distribution path optimization method and device | |
| CN106203740A (en) | A kind of warehouse logistics vehicle dispatching method and system | |
| CN110084382A (en) | A kind of power distribution network maintenance vehicle dispatching method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171117 |