CN109615133A - A kind of determining method of path and device - Google Patents
A kind of determining method of path and device Download PDFInfo
- Publication number
- CN109615133A CN109615133A CN201811503412.1A CN201811503412A CN109615133A CN 109615133 A CN109615133 A CN 109615133A CN 201811503412 A CN201811503412 A CN 201811503412A CN 109615133 A CN109615133 A CN 109615133A
- Authority
- CN
- China
- Prior art keywords
- position corresponding
- order
- orders
- determining
- preset value
- 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
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
This application provides a kind of determining method of path and devices, this method comprises: determining the number of current order to be dispensed；When determining order number is less than the first preset value, the shortest path for traversing position corresponding to all orders is determined using dynamic programming algorithm, and be shown to dispatching person；When determining order number is not less than the first preset value, and when less than the second preset value, the shortest path for traversing position corresponding to all orders is determined using heuritic approach, and be shown to dispatching person；When determining order number is not less than the second preset value, the shortest path for traversing position corresponding to all orders is determined using greedy algorithm, and be shown to dispatching person.This method can be improved device data processing capacity and user experience.
Description
Technical field
The present invention relates to Internet technical field, in particular to a kind of determining method of path and device.
Background technique
As a dispatching person, also referred to as knight, when there are multiple orders to need to dispense, need to carry out travel path planning.
When existing realization, the position of the order usually dispensed as needed by dispatching person, artificial determining dispatching, which connects, to be ordered
Single path；The path for dispensing all orders in this way does not ensure that most short, can increase distribution cost, reduce dispatching efficiency, with
And reduce user experience.
Summary of the invention
In view of this, the application provides a kind of determining method of path and device, device data processing capacity can be improved, with
And user experience.
In order to solve the above technical problems, the technical solution of the application is achieved in that
A kind of determining method of path, this method comprises:
Determine the number of current order to be dispensed；
When determining order number is less than the first preset value, determine that all orders institutes of traversal are right using dynamic programming algorithm
The shortest path of position is answered, and is shown to dispatching person；
It is true using heuritic approach when determining order number is not less than the first preset value, and when less than the second preset value
Surely the shortest path of position corresponding to all orders is traversed, and is shown to dispatching person；
When determining order number is not less than the second preset value, is determined and traversed corresponding to all orders using greedy algorithm
The shortest path of position, and it is shown to dispatching person.
A kind of path determining device, the device comprise determining that unit, processing unit and display unit；
The determination unit, for determining the number of current order to be dispensed；
The processing unit, when order number for determining when the determination unit is less than the first preset value, using dynamic
State planning algorithm determines the shortest path for traversing position corresponding to all orders；When the determination unit determine order number not
Less than the first preset value, and when less than the second preset value, uses heuritic approach to determine and traverse position corresponding to all orders
Shortest path；When the order number that the determination unit determines is not less than the second preset value, is determined and traversed using greedy algorithm
The shortest path of position corresponding to all orders；
The display unit, the shortest path for determining the processing unit are shown to dispatching person.
As can be seen from the above technical solution, traversal is determined by determining the number of current order to be dispensed in the application
The algorithm of the shortest path of position corresponding to all orders is mentioned automatically with using more suitable algorithm to determine the shortest path of dispatching
The best Distribution path of dispatching person is supplied, can be improved device data processing capacity and user experience.
Detailed description of the invention
Fig. 1 is that path determines flow diagram in the embodiment of the present application；
Fig. 2 is the apparatus structure schematic diagram for being applied to above-mentioned technology in the embodiment of the present application.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and examples,
Technical solution of the present invention is described in detail.
A kind of determining method of path is provided in the embodiment of the present application, by determining the number of current order to be dispensed come really
Surely the algorithm of the shortest path of position corresponding to all orders is traversed, to use more suitable algorithm to determine the shortest path of dispatching,
It is automatically provided to the best Distribution path of dispatching person, can be improved device data processing capacity and user experience.
With reference to the accompanying drawing, realizing route determination process in the embodiment of the present application is described in detail.
It should be noted that terminal involved in the embodiment of the present application can include but is not limited to personal digital assistant
(Personal Digital Assistant, PDA), wireless handheld terminal, mobile phone etc..
The executing subject of following each embodiments can be path determining device, which can be located at answering for above-mentioned terminal
With, or can also be the plug-in unit or Software Development Kit (Software in the application of above-mentioned terminal
Development Kit, SDK) etc. functional units, the embodiment of the present invention is to this without being particularly limited to.
Namely this application involves to terminal have certain computing capability and display capabilities.
Referring to Fig. 1, Fig. 1 is that path determines flow diagram in the embodiment of the present application.Specific steps are as follows:
Step 101, terminal determines the number of current order to be dispensed.
It is with the range of dispatching person's distance default for the order connect that dispatching person provides in the scene of the application application
In range；
For an order, including picking point and delivery point, obtained by related tool or software, such as Amap
The location information of picking point and delivery point, such as two-dimensional coordinate information；And the travel distance between two o'clock, i.e., practical walking away from
From, rather than direct range.
Terminal device according to the information that is currently received orders of dispatching person for logging in Order system, determine the dispatching person currently to
The number of the order of dispatching.
Step 102, when determining order number is less than the first preset value, which is used dynamic programming algorithm determining time
The shortest path of position corresponding to all orders is gone through, and is shown to dispatching person；Terminate this process.
The first preset value in the embodiment of the present application can be arranged according to the actual situation, and such as 9, but this is not limited.
When traversing the shortest path of position corresponding to all orders in this step, this is first traversed for any order guarantee and is ordered
Position corresponding to single picking point, then traverse position corresponding to the delivery point of the order, that is, guarantee available in stock dispense.
When traversing position corresponding to all orders, preferentially from dispatching person position corresponding to the nearest order
Position start.Guarantee that dispatching person preferentially gets the cargo corresponding to the nearest order in this way.
Dynamic programming algorithm calculates the shortest path of current state by calculating the shortest path of Last status, then time
All situations are gone through to find shortest path.
The process described below that shortest path is calculated using dynamic programming algorithm:
Assuming that total n orders to be dispensed；
Initial time, we successively assume first service point for any in picking point 1, picking point 2 ... picking point n
Point can also be determined as the point nearest apart from dispatching person position, and record current location to above-mentioned each picking point distance.
K wheel (k value range is 2 to 2n) is recycled according to following algorithm:
When servicing at i, according to the shortest distance of i-1 point of service, successively finding out last service point is point m's
Shortest path, and recording distance.Wherein, point m is the point not being traversed in the corresponding picking point of all orders and delivery point.
Find out the shortest distance corresponding to the 2n point, the as shortest distance required by us.
Step 103, when determining order number is not less than the first preset value, and when less than the second preset value, which makes
The shortest path for traversing position corresponding to all orders is determined with heuritic approach, and is shown to dispatching person；Terminate this process.
The second preset value in the embodiment of the present application can be arranged according to the actual situation, and such as 60, but this is not limited.
When traversing the shortest path of position corresponding to all orders in this step, this is first traversed for any order guarantee and is ordered
Position corresponding to single picking point, then traverse position corresponding to the delivery point of the order, that is, guarantee available in stock dispense.
When traversing position corresponding to all orders, preferentially from dispatching person position corresponding to the nearest order
Position start.Guarantee that dispatching person preferentially gets the cargo corresponding to the nearest order in this way.
Heuritic approach in this step uses simulated annealing.
The process described below that shortest path is calculated using dynamic programming algorithm:
Initial all picking points and delivery point for order follow an order and first traverse the principle of picking point gives birth at random
At a current path；
Then k wheel (k value range is 1 to 100) is recycled according to following algorithm:
One " the periphery solution " currently solved is generated, wherein " periphery solution " refers to the solution behind one position of current solution displacement, according to
So follow the principle that an order first traverses picking point: if " periphery solution " better than current solution: if should " periphery solution " substitution currently
Solution.
If " periphery solution " is worse than current solution, should " periphery solution " with) the current solution of probability substitution, with) probability keep current solution.Wherein dE refers to distanceCurrent solution-distancePeriphery solution。
Using current solution as optimal solution, i.e., corresponding path is currently solved as shortest path.
Step 104, when determining order number is not less than the second preset value, which determines traversal using greedy algorithm
The shortest path of position corresponding to all orders, and it is shown to dispatching person.
The second preset value in the embodiment of the present application can be arranged according to the actual situation, and such as 60, but this is not limited.
When traversing the shortest path of position corresponding to all orders in this step, this is first traversed for any order guarantee and is ordered
Position corresponding to single picking point, then traverse position corresponding to the delivery point of the order, that is, guarantee available in stock dispense.
When traversing position corresponding to all orders, preferentially from dispatching person position corresponding to the nearest order
Position start.Guarantee that dispatching person preferentially gets the cargo corresponding to the nearest order in this way.
Greedy algorithm is exactly to select nearest point as the next point to be visited every time.
The process described below that shortest path is calculated using greedy algorithm:
Recycle k wheel according to following algorithm (k value range is 1 to 2n)；
Sequentially find current point to nearest all non-service points distance；
It finds a little, as current point.
Recycle the solution that passed through point is the algorithm.
The shortest path that the program determines every time is a picking point or delivery point, prompts dispatching person that can currently go to
Place.
Aforesaid way is able to use reasonable algorithm and provides optimal path for dispatching person, to improve dispatching person's delivery efficiency,
Cost of labor is reduced, user experience is improved.
Based on same inventive concept, a kind of path determining device is provided in the embodiment of the present application.Referring to fig. 2, Fig. 2 is this
Apply for the apparatus structure schematic diagram for being applied to above-mentioned technology in embodiment.The device comprises determining that unit 201, processing unit 202
With display unit 203；
Determination unit 201, for determining the number of current order to be dispensed；
Processing unit 202, for using dynamic when the determining order number of determination unit 201 is less than the first preset value
Planning algorithm determines the shortest path for traversing position corresponding to all orders；When the order number that determination unit 201 determines is not small
In the first preset value, and when less than the second preset value, is determined using heuritic approach and traverse position corresponding to all orders most
Short path；When the order number that determination unit 201 determines is not less than the second preset value, determine that traversal is all using greedy algorithm
The shortest path of position corresponding to order；
Display unit 203, the shortest path for determining processing unit 202 are shown to dispatching person.
Preferably,
Processing unit 202 when shortest path specifically for traversing position corresponding to all orders, is protected for any order
Card first traverses position corresponding to the picking point of the order, then traverses position corresponding to the delivery point of the order；Wherein, one
Order corresponds to picking point and delivery point.
Preferably,
Processing unit 202, when being specifically used for traversing position corresponding to all orders, preferentially from dispatching person position away from
Start from position corresponding to nearest order.
Preferably,
The heuritic approach uses simulated annealing.
Preferably,
The distance is travel distance.
The unit of above-described embodiment can integrate in one, can also be deployed separately；It can be merged into a unit, it can also
To be further split into multiple subelements.
In conclusion the application is determined corresponding to all orders of traversal by determining the number of current order to be dispensed
It is best to be automatically provided to dispatching person to use more suitable algorithm to determine the shortest path of dispatching for the algorithm of the shortest path of position
Distribution path；Aforesaid way is able to use reasonable algorithm and provides optimal path for dispatching person, to improve dispatching person's delivery efficiency,
Cost of labor is reduced, user experience is improved.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the present invention.
Claims (10)
1. a kind of determining method of path, which is characterized in that this method comprises:
Determine the number of current order to be dispensed；
When determining order number is less than the first preset value, is determined using dynamic programming algorithm and traverse position corresponding to all orders
The shortest path set, and it is shown to dispatching person；
When determining order number is not less than the first preset value, and when less than the second preset value, heuritic approach is used to determine time
The shortest path of position corresponding to all orders is gone through, and is shown to dispatching person；
When determining order number is not less than the second preset value, is determined using greedy algorithm and traverse position corresponding to all orders
Shortest path, and be shown to dispatching person.
2. the method according to claim 1, wherein
When the shortest path of position corresponding to all orders of traversal, guarantee the picking for first traversing the order for any order
The corresponding position of point, then traverse position corresponding to the delivery point of the order；Wherein, an order corresponds to picking point and delivery
Point.
3. the method according to claim 1, wherein
When traversing position corresponding to all orders, preferentially from dispatching person position position corresponding to the nearest order
Start.
4. the method according to claim 1, wherein the heuritic approach uses simulated annealing.
5. method according to claim 1-4, which is characterized in that the distance is travel distance.
6. a kind of path determining device, which is characterized in that the device comprises determining that unit, processing unit and display unit；
The determination unit, for determining the number of current order to be dispensed；
The processing unit, for using dynamic to advise when the determining order number of the determination unit is less than the first preset value
Cost-effective method determines the shortest path for traversing position corresponding to all orders；When the order number that the determination unit determines is not less than
First preset value, and when less than the second preset value, it uses heuritic approach to determine and traverses the most short of position corresponding to all orders
Path；When the order number that the determination unit determines is not less than the second preset value, determine that traversal is all using greedy algorithm
The shortest path of position corresponding to order；
The display unit, the shortest path for determining the processing unit are shown to dispatching person.
7. device according to claim 6, which is characterized in that
The processing unit when shortest path specifically for traversing position corresponding to all orders, guarantees for any order
Position corresponding to the picking point of the order is first traversed, then traverses position corresponding to the delivery point of the order；Wherein, it orders for one
Single pair answers picking point and delivery point.
8. device according to claim 6, which is characterized in that
The processing unit, when being specifically used for traversing position corresponding to all orders, preferentially from dispatching person position distance
Position corresponding to nearest order starts.
9. device according to claim 6, which is characterized in that the heuritic approach uses simulated annealing.
10. according to the described in any item devices of claim 6-9, which is characterized in that the distance is travel distance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811503412.1A CN109615133A (en) | 2018-12-10 | 2018-12-10 | A kind of determining method of path and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811503412.1A CN109615133A (en) | 2018-12-10 | 2018-12-10 | A kind of determining method of path and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109615133A true CN109615133A (en) | 2019-04-12 |
Family
ID=66007516
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811503412.1A Pending CN109615133A (en) | 2018-12-10 | 2018-12-10 | A kind of determining method of path and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109615133A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112465180A (en) * | 2019-09-09 | 2021-03-09 | 北京京东振世信息技术有限公司 | Vehicle path planning method and device |
| CN112541716A (en) * | 2019-09-20 | 2021-03-23 | 北京三快在线科技有限公司 | Method and device for selecting task node to be distributed, storage medium and electronic equipment |
| CN113836676A (en) * | 2021-09-27 | 2021-12-24 | 上海电信科技发展有限公司 | Method and system for generating path of optical fiber wiring |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102175256A (en) * | 2010-12-27 | 2011-09-07 | 浙江工业大学 | Path planning determining method based on cladogram topological road network construction |
| CN102830702A (en) * | 2012-09-07 | 2012-12-19 | 无锡普智联科高新技术有限公司 | Mobile robot path planning method used in intensive storage zone |
| CN105046338A (en) * | 2015-08-24 | 2015-11-11 | 扬州大学 | Intelligent express distribution method on mobile platform |
| CN106156897A (en) * | 2016-08-22 | 2016-11-23 | 武汉轻工大学 | Optimum path planning analog systems in logistics distribution |
| CN106500686A (en) * | 2016-10-12 | 2017-03-15 | 北京小度信息科技有限公司 | Navigation interface display packing, logistics air navigation aid and device |
-
2018
- 2018-12-10 CN CN201811503412.1A patent/CN109615133A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102175256A (en) * | 2010-12-27 | 2011-09-07 | 浙江工业大学 | Path planning determining method based on cladogram topological road network construction |
| CN102830702A (en) * | 2012-09-07 | 2012-12-19 | 无锡普智联科高新技术有限公司 | Mobile robot path planning method used in intensive storage zone |
| CN105046338A (en) * | 2015-08-24 | 2015-11-11 | 扬州大学 | Intelligent express distribution method on mobile platform |
| CN106156897A (en) * | 2016-08-22 | 2016-11-23 | 武汉轻工大学 | Optimum path planning analog systems in logistics distribution |
| CN106500686A (en) * | 2016-10-12 | 2017-03-15 | 北京小度信息科技有限公司 | Navigation interface display packing, logistics air navigation aid and device |
Non-Patent Citations (2)
| Title |
|---|
| 张洁 等: "贪心算法与动态规划的比较", 《新乡师范高等专科学校学报》 * |
| 王永静: "基于动态规划法和模拟退火算法求解旅行商问题", 《商丘职业技术学院学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112465180A (en) * | 2019-09-09 | 2021-03-09 | 北京京东振世信息技术有限公司 | Vehicle path planning method and device |
| CN112465180B (en) * | 2019-09-09 | 2023-09-26 | 北京京东振世信息技术有限公司 | Vehicle path planning method and device |
| CN112541716A (en) * | 2019-09-20 | 2021-03-23 | 北京三快在线科技有限公司 | Method and device for selecting task node to be distributed, storage medium and electronic equipment |
| CN113836676A (en) * | 2021-09-27 | 2021-12-24 | 上海电信科技发展有限公司 | Method and system for generating path of optical fiber wiring |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11107019B2 (en) | Arranging a transport service for multiple users | |
| US9441981B2 (en) | Variable bus stops across a bus route in a regional transportation network | |
| US20160300318A1 (en) | Fare determination system for on-demand transport arrangement service | |
| US20150356703A1 (en) | Arranging a transport service based on computed vectors associated with service providers | |
| CN109615133A (en) | A kind of determining method of path and device | |
| US20180038710A1 (en) | Route navigation method and system, terminal, and server | |
| EP2787495A1 (en) | Method and apparatus for determining parking location based on departure time information | |
| US20180225796A1 (en) | Resource Allocation in a Network System | |
| CN107122866A (en) | Passenger is estimated to cancel an order method, equipment and the storage medium of behavior | |
| CN108229864A (en) | Distribution method, device and the electronic equipment of order | |
| US11082529B2 (en) | Prediction engine for a network-based service | |
| US20180075568A1 (en) | Order processing method, apparatus and system | |
| KR101799973B1 (en) | Apparatus and method for recommending meeting place | |
| CN108734317A (en) | Net about vehicle order information processing method and processing device | |
| CN107257379A (en) | Method and apparatus for pushed information | |
| CN112918487B (en) | Unmanned vehicle starting method and device, electronic equipment and computer readable medium | |
| CN107765691A (en) | Method and apparatus for controlling automatic driving vehicle | |
| US20200173789A1 (en) | Systems and methods of routing optimization | |
| CN107515885A (en) | The method and apparatus of information push | |
| CN108090645A (en) | For the method and device of coordination service resource | |
| CN109784506A (en) | A kind of vehicular rescue service system control method, equipment and readable storage medium storing program for executing | |
| CN107704942B (en) | Distribution path determining method, device and equipment | |
| CN111612286B (en) | Order distribution method and device, electronic equipment and storage medium | |
| CN108848463B (en) | Commute route determination method and apparatus | |
| CN109615159B (en) | Request processing method and device |
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 |
Application publication date: 20190412 |
|
| RJ01 | Rejection of invention patent application after publication |