CN109919348A - A kind of method for optimizing route, device, equipment, storage medium - Google Patents
A kind of method for optimizing route, device, equipment, storage medium Download PDFInfo
- Publication number
- CN109919348A CN109919348A CN201711373591.7A CN201711373591A CN109919348A CN 109919348 A CN109919348 A CN 109919348A CN 201711373591 A CN201711373591 A CN 201711373591A CN 109919348 A CN109919348 A CN 109919348A
- Authority
- CN
- China
- Prior art keywords
- path
- task
- movement
- initial
- initial path
- 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
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000006378 damage Effects 0.000 claims abstract description 13
- 238000002922 simulated annealing Methods 0.000 claims abstract description 7
- 230000006870 function Effects 0.000 claims description 13
- 238000003780 insertion Methods 0.000 claims description 13
- 230000037431 insertion Effects 0.000 claims description 13
- 230000003044 adaptive effect Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 238000009434 installation Methods 0.000 claims description 3
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
Abstract
A kind of method for optimizing route, device, equipment, storage medium, the method includes the steps: it generates initial path: according to several express mail information of input, generating initial path；Wherein, the initial path includes several paths, and the path includes several object-based movements；It generates intermediate path: will occur to be packaged as task-set in the movement of the same race of identical period, same geographic location in each movement that alternative routing be needed, destruction reconstruction is carried out to the initial path using task-set as minimum unit, obtains intermediate path；Path optimizing: the middle of the road is optimized according to simulated annealing to obtain epicycle optimal path.Described device, equipment and storage medium are for realizing the method.It can greatly simplify the calculating process of algorithm, improve efficiency and speed.
Description
Technical field
The present invention relates to path optimization's strategy in logistics field more particularly to a kind of method for optimizing route, device, set
Standby, storage medium.
Background technique
In the algorithm in path planning field, sequence is assigned to taste the feasible of each movement of each task package
Sound out rope.
In the practical problem of path planning, when problematic amount grade is excessive, such as still with the placement location progress of each movement
It attempts, search space will become huge.
Summary of the invention
In order to solve the above-mentioned technical problem, the present invention proposes a kind of method for optimizing route, device, equipment, storage medium, it
Calculating process is simplified, arithmetic speed and efficiency are improved.
To achieve the goals above, the technical solution of the present invention is as follows:
A kind of method for optimizing route, comprising:
It generates initial path: according to several express mail information of input, generating initial path；Wherein, the initial path packet
Several paths are included, the path includes several object-based movements；
Generate intermediate path: by occur in each movement for needing alternative routing the identical period, same geographic location it is same
Kind movement is packaged as task-set, carries out destruction reconstruction to the initial path using task-set as minimum unit, obtains intermediate road
Diameter；
Path optimizing: the middle of the road is optimized according to simulated annealing to obtain epicycle optimal path.
The generation intermediate path during realization, comprising steps of
On the initial path, radom insertion movement, until the position that the functional value for finding function used in operation is optimal；
It will occur in the identical period, the same action of same position is packaged as task-set；
The task-set is inserted into the optimal position of functional value.
The movement includes picking, delivery.
Function used in the operation is the cost function to send distance with variable a length of when sending with charge free with charge free.Further include:
The destruction Reconstruction Strategy is adjusted according to adaptive algorithm, the generation intermediate path is returned: will need to change road
Occur to be packaged as task-set in the movement of the same race of identical period, same geographic location in each movement of diameter, using task-set as most
Junior unit carries out destruction reconstruction to the initial path, obtains intermediate path.
A kind of Path Optimize Installation, comprising:
Information acquisition unit is configured to several express mail information according to input, generates initial path；Wherein, described first
Beginning path includes several paths, and the path includes several object-based movements；
Destroy reconstruction unit, by occur in each movement for needing alternative routing the identical period, same geographic location it is same
Kind movement is packaged as task-set, carries out destruction reconstruction to the initial path using task-set as minimum unit, obtains intermediate road
Diameter；
Optimize unit, is configured to that the middle of the road is optimized according to simulated annealing to obtain the optimal road of epicycle
Diameter.
A kind of equipment, the equipment include:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of places
It manages device and executes the method for optimizing route.
A kind of computer readable storage medium being stored with computer program, when which is executed by processor described in realization
Method for optimizing route.
The beneficial effects of the present invention are: simplifying search behaviour every time using the geographical location group optimisation strategy based on movement
Make, reduces search space, improve operational capability.
Detailed description of the invention
Fig. 1 shows method flow diagram according to an embodiment of the present application.
Fig. 2 shows the operational flowcharts of large neighborhood search algorithm.
Specific embodiment
In order to be better understood by technical solution of the present invention, 1 the invention will be further described with reference to the accompanying drawing.
It is as shown in Figs. 1-2: a kind of method for optimizing route, comprising: to input the information for courier packages, the start-stop comprising package
Time and address etc..Output is the Route Set of path planning.Detailed process is as follows:
Firstly, generating initial path: according to the information of several courier packages of input, being calculated using extensive neighborhood search
Method calculates initial path at random.
Second, it generates intermediate path: choosing and destroy Reconstruction Strategy, diplomatic destruction is carried out to package, is rebuild, obtain new
Path.Destroy Reconstruction Strategy are as follows: by occur in each movement for needing alternative routing the identical period, same geographic location it is of the same race
Movement (" picking "/" delivery ") is packaged as task-set, and task-set carries out the initial path as minimum unit to destroy weight
It builds, obtains intermediate path；Same action, which refers to, to be all picking or is all delivery.
Usually in destroying reconstruction process, destroys the package for including in route and need to be inserted into existing route, express delivery packet
Wrapping up in task includes two task actions: picking and movement of receiving.After destroying path, the package of original route needs to be inserted into reservation
In route.Assuming that there is N number of task, just there is 2N movement, the insertion position that can be attempted just there are 2N+1.So for a task
HaveKind insertion possibility.When number of tasks N is king-sized, search space is with regard to sharp increase.
Before insertion, it will occur in same position, the movement of identical period merges in an action group, this based on dynamic
The geographical location clan authority optimisation strategy of work can greatly simplify search operation when each insertion, improve operational capability.
Specific step is as follows:
On certain existing paths, radom insertion " picking " and " delivery " the two movements are attempted, are found used in operation
The optimal insertion position of the functional value of function (setting of target function value is usually cost size).
Objective function is cost function (cost function):
Wherein,Indicate that express mail is sent to the distance of the point,Indicate that express delivery is sent to this institute
The duration of consumption；α, β are the adjustable parameter of cost function respectively, and dij indicates distance, Xijk indicated whether this point ... α, β,
It d, is much adjustable parameter in k, K, S, i, j, A.
The two are acted again and carries out action group merging, that is, will occur in same position, the movement of identical period is of the same race dynamic
Work merges in an action group.
The action group is inserted into the optimal position of functional value.
The a plurality of route such as in the random path set R that greedy algorithm calculates, currently has M package, in total by S
Point.A route R in RiPackage collection be combined into { P1,P2,...,Pn, at this moment if destroying RiThis route is needed RiIn
Package is inserted into m-n package, shares n* (C2 2(m-n)+1/ 2) a insertion position.And if there is real-time demand is come in mould
Type, the space of this insertion position are very huge.
At this point, will occur in same position, the same action of identical period merges into an action group, i.e., in some insertion
Moment, the selection of insertion are up to S, can greatly reduce insertion position in this way, that is, can reach the effect for reducing search space.
Path optimizing: third further according to simulated annealing, solves poor road than current to receive one with certain probability
Line reaches global optimum's route, the as optimal route of epicycle.
4th, the destruction Reconstruction Strategy is adjusted according to adaptive algorithm, the generation intermediate path is returned: will need to become
Occur to be packaged as task-set in the movement of the same race of identical period, same geographic location in each movement in more path, task-set is made
Destruction reconstruction is carried out to the initial path for minimum unit, obtains intermediate path.
According to adaptive algorithm, the corresponding resource cost size of the Route Set that third step is obtained adjusts every kind accordingly
The score of strategy, comprehensive lot of experimental data, finally obtains optimal policy, reduces search space, improve operational capability.
A kind of Path Optimize Installation, comprising:
Information acquisition unit is configured to several express mail information according to input, generates initial path；Wherein, described first
Beginning path includes several paths, and the path includes several object-based movements；
Destroy reconstruction unit, by occur in each movement for needing alternative routing the identical period, same geographic location it is same
Kind movement is packaged as task-set, carries out destruction reconstruction to the initial path using task-set as minimum unit, obtains intermediate road
Diameter；
Optimize unit, is configured to that the middle of the road is optimized according to simulated annealing to obtain the optimal road of epicycle
Diameter.
A kind of equipment, the equipment include:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of places
It manages device and executes the method for optimizing route.
A kind of computer readable storage medium being stored with computer program, when which is executed by processor described in realization
Method for optimizing route.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art
Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic
Scheme, while should also cover in the case where not departing from the inventive concept, it is carried out by above-mentioned technical characteristic or its equivalent feature
Any combination and the other technical solutions formed.Such as features described above has similar function with (but being not limited to) disclosed herein
Can technical characteristic replaced mutually and the technical solution that is formed.
Claims (8)
1. a kind of method for optimizing route characterized by comprising
It generates initial path: according to several express mail information of input, generating initial path；Wherein, if the initial path includes
Main line diameter, the path include several object-based movements；
It generates intermediate path: will occur to move in identical period, the of the same race of same geographic location in each movement for needing alternative routing
It is packaged as task-set, destruction reconstruction is carried out to the initial path using task-set as minimum unit, obtains intermediate path；
Path optimizing: the middle of the road is optimized according to simulated annealing to obtain epicycle optimal path.
2. a kind of method for optimizing route according to claim 1, which is characterized in that the generation intermediate path was being realized
Cheng Zhong, comprising steps of
On the initial path, radom insertion movement, until the position that the functional value for finding function used in operation is optimal；
It will occur in the identical period, the same action of same position is packaged as task-set；
The task-set is inserted into the optimal position of functional value.
3. a kind of method for optimizing route according to claim 1, which is characterized in that the movement includes picking, delivery.
4. a kind of method for optimizing route according to claim 2, which is characterized in that function used in the operation is to send with charge free
The cost function of distance and variable a length of when sending with charge free.
5. a kind of method for optimizing route according to claim 1-4, which is characterized in that further include:
The destruction Reconstruction Strategy is adjusted according to adaptive algorithm, the generation intermediate path is returned: alternative routing will be needed
Occur to be packaged as task-set in the movement of the same race of identical period, same geographic location in each movement, using task-set as minimum single
Member carries out destruction reconstruction to the initial path, obtains intermediate path.
6. a kind of Path Optimize Installation characterized by comprising
Information acquisition unit is configured to several express mail information according to input, generates initial path；Wherein, the initial road
Diameter includes several paths, and the path includes several object-based movements；
Reconstruction unit is destroyed, will occur to move in identical period, the of the same race of same geographic location in each movement for needing alternative routing
It is packaged as task-set, destruction reconstruction is carried out to the initial path using task-set as minimum unit, obtains intermediate path；
Optimize unit, is configured to that the middle of the road is optimized according to simulated annealing to obtain epicycle optimal path.
7. a kind of equipment, which is characterized in that the equipment includes:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors
Execute method according to any one of claims 1 to 5.
8. a kind of computer readable storage medium for being stored with computer program, which is characterized in that the program is executed by processor
Shi Shixian method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711373591.7A CN109919348A (en) | 2017-12-12 | 2017-12-12 | A kind of method for optimizing route, device, equipment, storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711373591.7A CN109919348A (en) | 2017-12-12 | 2017-12-12 | A kind of method for optimizing route, device, equipment, storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109919348A true CN109919348A (en) | 2019-06-21 |
Family
ID=66959425
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711373591.7A Pending CN109919348A (en) | 2017-12-12 | 2017-12-12 | A kind of method for optimizing route, device, equipment, storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109919348A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110472918A (en) * | 2019-08-21 | 2019-11-19 | 北京百度网讯科技有限公司 | Method and apparatus for output information |
| CN112129547A (en) * | 2020-09-29 | 2020-12-25 | 北京艾尔动力科技有限公司 | Task generation method for automobile durability unmanned test based on high-precision positioning |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159048A (en) * | 2007-11-05 | 2008-04-09 | 朱道立 | Oil products delivery cistern car scheduling system and method thereof |
| CN101943916A (en) * | 2010-09-07 | 2011-01-12 | 陕西科技大学 | Kalman filter prediction-based robot obstacle avoidance method |
| CN105740979A (en) * | 2016-01-29 | 2016-07-06 | 上海海事大学 | Intelligent dispatching system and method for multi-AGV (Automatic Guided Vehicle) of automatic container terminal |
| CN105956681A (en) * | 2016-04-15 | 2016-09-21 | 合肥工业大学 | Drop-and-pull transport dynamic path planning method based on receding horizon optimization |
| US20170140325A1 (en) * | 2015-11-17 | 2017-05-18 | Service Power Technologies PLC | Methods and apparatuses for quantum annealing tuning |
| US20170236428A1 (en) * | 2016-02-12 | 2017-08-17 | Wal-Mart Stores, Inc. | Systems and methods to allocate unmanned aircraft systems |
| CN107093046A (en) * | 2017-04-21 | 2017-08-25 | 北京京东尚科信息技术有限公司 | Unmanned dispensing vehicle method for allocating tasks, system and unmanned dispensing vehicle |
| CN107194513A (en) * | 2017-05-26 | 2017-09-22 | 中南大学 | A kind of optimization method for solving full channel logistics distribution |
| CN107392374A (en) * | 2017-07-21 | 2017-11-24 | 顺丰科技有限公司 | A kind of task parcel optimization method, system, equipment |
-
2017
- 2017-12-12 CN CN201711373591.7A patent/CN109919348A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159048A (en) * | 2007-11-05 | 2008-04-09 | 朱道立 | Oil products delivery cistern car scheduling system and method thereof |
| CN101943916A (en) * | 2010-09-07 | 2011-01-12 | 陕西科技大学 | Kalman filter prediction-based robot obstacle avoidance method |
| US20170140325A1 (en) * | 2015-11-17 | 2017-05-18 | Service Power Technologies PLC | Methods and apparatuses for quantum annealing tuning |
| CN105740979A (en) * | 2016-01-29 | 2016-07-06 | 上海海事大学 | Intelligent dispatching system and method for multi-AGV (Automatic Guided Vehicle) of automatic container terminal |
| US20170236428A1 (en) * | 2016-02-12 | 2017-08-17 | Wal-Mart Stores, Inc. | Systems and methods to allocate unmanned aircraft systems |
| CN105956681A (en) * | 2016-04-15 | 2016-09-21 | 合肥工业大学 | Drop-and-pull transport dynamic path planning method based on receding horizon optimization |
| CN107093046A (en) * | 2017-04-21 | 2017-08-25 | 北京京东尚科信息技术有限公司 | Unmanned dispensing vehicle method for allocating tasks, system and unmanned dispensing vehicle |
| CN107194513A (en) * | 2017-05-26 | 2017-09-22 | 中南大学 | A kind of optimization method for solving full channel logistics distribution |
| CN107392374A (en) * | 2017-07-21 | 2017-11-24 | 顺丰科技有限公司 | A kind of task parcel optimization method, system, equipment |
Non-Patent Citations (1)
| Title |
|---|
| 丁宝录等: "基于车辆限制的可重复运输路径优化研究", 《科学技术与工程》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110472918A (en) * | 2019-08-21 | 2019-11-19 | 北京百度网讯科技有限公司 | Method and apparatus for output information |
| CN112129547A (en) * | 2020-09-29 | 2020-12-25 | 北京艾尔动力科技有限公司 | Task generation method for automobile durability unmanned test based on high-precision positioning |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101247349A (en) | Network flux fast distribution method | |
| CN104202253B (en) | Network-on-chip jamming control method based on dynamic routing table | |
| CN102737065A (en) | Method and device for acquiring data | |
| CN109919348A (en) | A kind of method for optimizing route, device, equipment, storage medium | |
| CN105302830B (en) | Map tile caching method and device | |
| CN104734962B (en) | A kind of resource search method of non-structural P 2 P network | |
| CN106547683B (en) | A kind of redundant code detection method and device | |
| CN106453460B (en) | File distribution method, device and system | |
| CN104796449A (en) | Content delivery method, device and equipment | |
| CN104199912A (en) | Task processing method and device | |
| CN103793483A (en) | Clock tree generating method and system based on clock node clusters | |
| CN103825946A (en) | Virtual machine placement method based on network perception | |
| CN104717257B (en) | The method and device of data message transmission | |
| CN102075582B (en) | Storage method for data storage model of credible cloud storage system | |
| CN104283966A (en) | Data distribution algorithm and device of cloud storage system | |
| CN106251623B (en) | It is a kind of that the system of road real-time road service is provided | |
| Grimes et al. | Closing the open shop: Contradicting conventional wisdom | |
| US10445080B2 (en) | Methods for adaptive placement of applications and devices thereof | |
| CN107947943A (en) | It is a kind of to circulate non-equilibrium oily vinegar endorsement method offline online | |
| CN105025042A (en) | Method of determining data information, system and proxy servers | |
| CN112187839B (en) | Distribution method, server and storage medium | |
| CN110460634B (en) | Edge computing consensus request management method and system | |
| CN103064901A (en) | Random access memory (RAM), network processing system and RAM table look-up method | |
| CN103440257A (en) | Implementation method and system for data access processing | |
| CN103455549A (en) | Method and system for data processing |
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: 20190621 |