CN106643764A - Method for generating logistics routes - Google Patents
Method for generating logistics routes Download PDFInfo
- Publication number
- CN106643764A CN106643764A CN201611099416.9A CN201611099416A CN106643764A CN 106643764 A CN106643764 A CN 106643764A CN 201611099416 A CN201611099416 A CN 201611099416A CN 106643764 A CN106643764 A CN 106643764A
- Authority
- CN
- China
- Prior art keywords
- time
- consuming
- path
- node
- route
- 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
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
Abstract
The invention provides a method for generating logistics routes. The method comprises the following steps of (1) initializing: reading a list of route time in a historical route time base of a current user, filling the missing value in the list of route time by the average value of all users, and reading a list of route points to be passed; (2) plan screening: for the list of route points, using a road intersection as a node, and calculating each possible node route point plan for passing all route nodes; (3) averaging by sections; (4) calculating by sections; (5) overlapping and summarizing; (6) displaying. The method has the advantages that by utilizing the time calculation method for the individual condition of the current user, the proper optimum route suitable for the user is provided based on the common time conditions of different users, and the pertinence is higher; the relative optimum plan can be given no matter which logistics distribution type is adopted.
Description
Technical field
The present invention relates to a kind of logistics route generation method.
Background technology
In prior art, for the planning of logistics route, typically all based on general consideration, directly using all users
Average time-consuming and present road congestion coefficient is calculated, but in practice, and different user takes for every section
Between it is incomplete same, such as some user's Lu Jing main road spent times are substantially less, and some user's Lu Jing path spent times are bright
It is aobvious less.
The content of the invention
To solve above-mentioned technical problem, the invention provides a kind of logistics route generation method, the logistics route generation side
Method to the typically time-consuming situation of different user by for the time-consuming method of active user's individual cases calculating, being given and be adapted to be somebody's turn to do
The optimal path of user.
The present invention is achieved by the following technical programs.
A kind of logistics route generation method that the present invention is provided, comprises the steps：
1. initialize：The time-consuming table in path in the time-consuming storehouse of historical path of active user is read, to lacking in the time-consuming table in path
It is worth and is filled with the mean value of all users, the path point list passed through needed for reading；
2. screening scheme：For path point list, with road cross as node, every kind of possible, satisfaction is calculated through institute
There is the node path point scheme of path point；
3. segmental averaging：By in each node path point scheme, path point is considered as into node, by between each two node
Path is segmented, and to each segmentation, according to the time-consuming meter in the path of active user time-consuming average is calculated；
4. segmentation is calculated：On the basis of the time-consuming average of each segmentation, the congestion coefficient of the segmentation is multiplied by, obtains estimation consumption
When；
5. superposition collects：It is time-consuming to the estimation of each segmentation to be overlapped by node path point scheme, obtain each node
Total estimation of path point scheme takes；
6. show：Using each node path point scheme as route scheme, take sequence and show according to total estimation and work as
Front user.
3. the time-consuming average of middle calculating takes average weighted mode to calculate to the step.
The beneficial effects of the present invention is：By calculating time-consuming method for active user's individual cases, can be to difference
The general time-consuming situation of user provides the optimal path of the suitable user, and with high specific aim, no matter which kind of user adopts
Logistics distribution mode, can provide relative preferred plan.
Description of the drawings
Fig. 1 is the schematic flow sheet of the present invention.
Specific embodiment
Be described further below technical scheme, but claimed scope be not limited to it is described.
A kind of logistics route generation method as shown in Figure 1, comprises the steps：
1. initialize：The time-consuming table in path in the time-consuming storehouse of historical path of active user is read, to lacking in the time-consuming table in path
It is worth and is filled with the mean value of all users, the path point list passed through needed for reading；
2. screening scheme：For path point list, with road cross as node, every kind of possible, satisfaction is calculated through institute
There is the node path point scheme of path point；
3. segmental averaging：By in each node path point scheme, path point is considered as into node, by between each two node
Path is segmented, and to each segmentation, according to the time-consuming meter in the path of active user time-consuming average is calculated；
4. segmentation is calculated：On the basis of the time-consuming average of each segmentation, the congestion coefficient of the segmentation is multiplied by, obtains estimation consumption
When；
5. superposition collects：It is time-consuming to the estimation of each segmentation to be overlapped by node path point scheme, obtain each node
Total estimation of path point scheme takes；
6. show：Using each node path point scheme as route scheme, take sequence and show according to total estimation and work as
Front user.
3. the time-consuming average of middle calculating takes average weighted mode to calculate to the step.
Thus, technical scheme uses the peculiar data of user first when calculating time-consuming, therefore with use
Family specific aim.Because logistics distribution is usually that everyone is responsible for a panel region, therefore user data collection is easy, and section data
It is relatively fixed, each section is also more through number of times, when also can well avoid user from being intended for single use using average weighted mode
Abnormal conditions cause the time-consuming calculating exception that time-consuming value is ultimately resulted in extremely.
Claims (2)
1. a kind of logistics route generation method, it is characterised in that：Comprise the steps：
1. initialize：Read the time-consuming table in path in the time-consuming storehouse of historical path of active user, to missing values in the time-consuming table in path with
The mean value filling of all users, the path point list passed through needed for reading；
2. screening scheme：For path point list, with road cross as node, every kind of possible, satisfaction is calculated through all roads
The node path point scheme of footpath point；
3. segmental averaging：By in each node path point scheme, path point is considered as into node, by the path between each two node
It is segmented, to each segmentation, time-consuming average is calculated according to the time-consuming meter in the path of active user；
4. segmentation is calculated：On the basis of the time-consuming average of each segmentation, the congestion coefficient of the segmentation is multiplied by, obtains estimation time-consuming；
5. superposition collects：It is time-consuming to the estimation of each segmentation to be overlapped by node path point scheme, obtain each node path
Total estimation of point scheme takes；
6. show：Using each node path point scheme as route scheme, take sequence according to total estimation and show current use
Family.
2. logistics route generation method as claimed in claim 1, it is characterised in that：The step 3. adopt by the time-consuming average of middle calculating
Take average weighted mode to calculate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611099416.9A CN106643764A (en) | 2016-12-02 | 2016-12-02 | Method for generating logistics routes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611099416.9A CN106643764A (en) | 2016-12-02 | 2016-12-02 | Method for generating logistics routes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106643764A true CN106643764A (en) | 2017-05-10 |
Family
ID=58818512
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611099416.9A Pending CN106643764A (en) | 2016-12-02 | 2016-12-02 | Method for generating logistics routes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106643764A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107424426A (en) * | 2017-07-10 | 2017-12-01 | 南京邮电大学 | A kind of logistics route planing method based on deep learning |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164782A (en) * | 2011-12-16 | 2013-06-19 | 招商局国际信息技术有限公司 | Intelligent dispatching system and intelligent dispatching method of container trucks |
| CN104882011A (en) * | 2015-06-02 | 2015-09-02 | 健康宝互联网技术有限公司 | Vehicle quick alarm-receiving and action-taking system and vehicle quick alarm-receiving and action-taking method |
-
2016
- 2016-12-02 CN CN201611099416.9A patent/CN106643764A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164782A (en) * | 2011-12-16 | 2013-06-19 | 招商局国际信息技术有限公司 | Intelligent dispatching system and intelligent dispatching method of container trucks |
| CN104882011A (en) * | 2015-06-02 | 2015-09-02 | 健康宝互联网技术有限公司 | Vehicle quick alarm-receiving and action-taking system and vehicle quick alarm-receiving and action-taking method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107424426A (en) * | 2017-07-10 | 2017-12-01 | 南京邮电大学 | A kind of logistics route planing method based on deep learning |
| CN107424426B (en) * | 2017-07-10 | 2020-07-07 | 南京邮电大学 | Logistics path planning method based on deep learning |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7557729B2 (en) | Method and system for validation, estimation and editing of daily meter read data | |
| US10345770B2 (en) | Power demand estimating apparatus, method, program, and demand suppressing schedule planning apparatus | |
| CN105868949A (en) | Logistics distribution scheduling method and apparatus | |
| CN102156972B (en) | Image tilting correcting method and system | |
| CN104268644A (en) | Method and device for predicting click frequency of advertisement at advertising position | |
| CN103475504A (en) | Virtual network remapping method based on topology awareness | |
| WO2014064913A1 (en) | Operation management device and operation management method | |
| WO2014115399A1 (en) | Water leak estimating device, system, and method | |
| CN106643764A (en) | Method for generating logistics routes | |
| CN103548055B (en) | Moving image area decision maker or its method | |
| CN107194501A (en) | Method based on mess generation path | |
| CN106484845B (en) | Information point area determination method and device based on electronic map | |
| Gardner Jr et al. | Exponential smoothing in the telecommunications data | |
| CN103745388A (en) | Advertisement splitting method and system | |
| CN104966195A (en) | Consumption settlement method and system based on virtual card | |
| CN109284952B (en) | Method and device for positioning home region | |
| CN105718600A (en) | Heterogeneous data set feature quality visualization method | |
| CN106651252A (en) | Logistics delivery and distribution method | |
| Matetic et al. | The CrocodileAgent 2012: Negotiating Agreements in Smart Grid Tariff Market. | |
| CN106643763A (en) | Virtual scene path generation method | |
| CN106625660A (en) | Marching route distribution method of industrial robot | |
| CN111681131B (en) | Water resource management method and management system based on artificial intelligence | |
| CN104318337B (en) | A kind of modeling method of electricity market member economic model and data model | |
| Clegg et al. | Tardis: Stably shifting traffic in space and time | |
| Bjelde et al. | Brief announcement: approximation algorithms for unsplittable resource allocation problems with diseconomies of scale |
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: 20170510 |