CN109697523A - The method, system and equipment for sending part path are received in optimization - Google Patents
The method, system and equipment for sending part path are received in optimization Download PDFInfo
- Publication number
- CN109697523A CN109697523A CN201710991581.3A CN201710991581A CN109697523A CN 109697523 A CN109697523 A CN 109697523A CN 201710991581 A CN201710991581 A CN 201710991581A CN 109697523 A CN109697523 A CN 109697523A
- Authority
- CN
- China
- Prior art keywords
- shipping address
- latitude
- waybill
- information
- 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
- 238000005457 optimization Methods 0.000 title claims abstract description 34
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000008859 change Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 3
- 230000003993 interaction Effects 0.000 claims description 2
- 238000006243 chemical reaction Methods 0.000 description 4
- 238000002922 simulated annealing Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000006467 substitution reaction 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)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (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 method, system and equipment for sending part path are received in optimization, wherein method, comprising steps of obtaining the essential information of waybill to be sent with charge free, the essential information includes shipping address and timeliness attribute information；Obtain the corresponding latitude and longitude information of each shipping address；According to the latitude and longitude information, the navigation distance of any two waybills shipping address is calculated；The latitude and longitude information, navigation distance and timeliness attribute information are inputted into path planning model, obtain waybill sends sequence with charge free, it is contemplated that arrival time and sends route with charge free.The system and equipment are for realizing method.It can guarantee the timeliness of client's addressee, realize that the best match of task and resource and most convenient and fast route push.
Description
Technical field
The present invention relates to more particularly to logistics field, more particularly to optimization receives the method, system and equipment in part path of sending.
Background technique
Existing work pattern is region contract business mode in logistic industry.So-called region contract business mode are as follows: by ground
It manages position and divides region, each region is contracted is responsible for fixed employee, and the group that the employee or employee take the lead is responsible for oneself area
All receipts of address send task in domain, and each regional scope is relatively fixed, relatively independent between region.In past region contract system
Degree improves the enthusiasm of client in employee's developing target market and maintenance area, but as the variation of industry development and market environment is sent out
Exhibition, region division is unreasonable, and the drawbacks such as coordination ability difference are increasingly significant between region.
Region contract business mode there are the problem of have:
One, employee is accustomed to that receipts is arranged to send path according to oneself, it is difficult to meet customer personalized demand.Secondly line arrangements master
The property seen is strong, can not promise to undertake that client precisely visits the addressee time.
Summary of the invention
In order to solve the above-mentioned technical problem, the present invention proposes that the method, system and equipment for sending part path are received in a kind of optimization, it
It can guarantee the timeliness of client's addressee, realize the best match and most convenient and fast route push etc. of task and resource, thus
The company of improving sends the overall quality of service of part.
To achieve the goals above, the scheme that the present invention uses is:
The method for sending part path is received in optimization, comprising steps of
The essential information of waybill to be sent with charge free is obtained, the essential information includes shipping address and timeliness attribute information；
Obtain the corresponding latitude and longitude information of each shipping address；
According to the latitude and longitude information, the navigation distance of any two waybills shipping address is calculated；
The latitude and longitude information, navigation distance and timeliness attribute information are inputted into path planning model, obtain the group of waybill
Send sequence, it is contemplated that arrival time and send route with charge free.
The timeliness attribute information includes routing iinformation and to vehicle shift time information.
It is described to obtain the corresponding latitude and longitude information of each shipping address, include:
Obtain the shipping address of history waybill；
Shipping address corresponding latitude and longitude information when obtaining above-mentioned history waybill acknowledgement, establishes history shipping address and longitude and latitude
Spend the corresponding relationship of information；
Obtain the shipping address of the corresponding history waybill of waybill shipping address to be sent with charge free using Text Address matching, obtain to
Send the latitude and longitude information of waybill with charge free；Alternatively,
It is described to obtain the corresponding latitude and longitude information of each shipping address, including,
Using map API, waybill shipping address is converted into latitude information.
The navigation distance for calculating any two waybills shipping address, including,
Data are sent with charge free using map API navigation platform, or using own history waybill, obtain any two waybills place of acceptance
The navigation distance of location.
Before the corresponding latitude and longitude information of each shipping address of acquisition, including,
Waybill to be sent with charge free is grouped according to site, vehicle shift time, all waybills of each each shift in site are obtained as one group
Waybill shipping address longitude and latitude under each grouping.
It is described that the latitude and longitude information, navigation distance and timeliness attribute information are inputted into path planning model, obtain waybill
Send with charge free sequence and Expected Arrival Time, including,
According to the latitude and longitude information of input, navigation distance and timeliness attribute information, initial solution is generated using FFD algorithm；
Initial solution is optimized, optimization solution is obtained.
It is described that initial solution is optimized, optimization solution is obtained, including,
S101 chooses task dwell point in original route；
The task dwell point is moved in other routes by S102, or the task that interaction two lines are chosen is stopped
Stationary point generates temporary route；
S103 calculates the general line distance of temporary route, and general line distance is converted to time-consuming；
S104 repeats step S102-S103, assesses the temporary route of all generations, it is minimum to filter out total time-consuming
Structure, as neighborhood optimal route；
S105, if neighborhood optimal route is better than original route, uses neighborhood by original route compared with neighborhood optimal route
Optimal route replaces original route as optimization solution, and otherwise original route is not made to change as optimization solution.
Original route described in step S105 is not made to change as before optimization solution, further includes,
In preset time or default comparison number, if not updating initial solution, stop search, and using initial solution as
Optimization solution.
The system for sending part path is received in optimization, comprising:
For obtaining the essential information on Air Way Bill No. to be sent with charge free, and obtain the longitude and latitude letter of the shipping address of Air Way Bill No.
The device of breath, the essential information include shipping address and timeliness attribute information；
For utilizing the latitude and longitude information, the device of the navigation distance of any two waybills shipping address is calculated；And
For providing dispatching sequence, Expected Arrival Time and the device for sending route with charge free of waybill.
The equipment for sending part path, the computer-readable medium including being stored with computer program, described program quilt are received in optimization
Operation is for executing:
The essential information of waybill to be sent with charge free is obtained, the essential information includes shipping address and timeliness attribute information；
Obtain the latitude and longitude information of each shipping address；
According to the latitude and longitude information, the navigation distance of any two waybills shipping address is calculated；
The dispatching sequence of waybill is provided using path planning model, Expected Arrival Time and sends route with charge free.
The invention has the benefit that path optimizing configures, path is empirically arranged by system arrangement path substitution employee.
Detailed description of the invention
The method flow diagram for sending part path is received in Fig. 1 optimization；
The flow chart of Fig. 2 searching algorithm；
Route map before Fig. 3 task dwell point is not mobile；
Route map after Fig. 4 task dwell point is mobile；
It is time-consuming before Fig. 5 task dwell point is mobile；
It is time-consuming after Fig. 6 task dwell point is mobile；
The structural schematic diagram of Fig. 7 path planning model.
Wherein, A B C D E F Z is task dwell point.
Specific embodiment
In order to be better understood by technical solution of the present invention, the present invention will be further explained below with reference to the attached drawings.
As shown in Figure 1, the method for sending part path is received in optimization, comprising steps of
S1 obtains the essential information of waybill to be sent with charge free, including shipping address, timeliness attribute information, the timeliness attribute letter
Breath includes routing iinformation and vehicle shift time information.Routing iinformation, that is, logistics routing, refers to stream line arrangement, subsequent to pass through
Logistics routing classifies waybill by site, then by vehicle shift time information, obtains same site, the waybill that same shift reaches
Number.
S2 obtains the corresponding latitude and longitude information of shipping address of each waybill.
Step S2 includes that step is realized by two ways:
The first is: obtaining the shipping address of history waybill；
Shipping address corresponding latitude and longitude information when obtaining above-mentioned history waybill acknowledgement, establishes history shipping address and longitude and latitude
Spend the corresponding relationship of information；
Obtain the shipping address of the corresponding history waybill of waybill shipping address to be sent with charge free using Text Address matching, obtain to
Send the latitude and longitude information of waybill with charge free.
Second is: shipping address is Chinese address, and the conversion of Chinese address to longitude and latitude can be integrated by own
(such as Baidu map API, Amap API, Tencent map API, Google Maps API etc. can be realized Chinese by system or third party
Address conversion is latitude and longitude information and the map API that can calculate the distance between different address.) data processing it is flat
Platform, the longitude and latitude by taking own integrated system as an example, when own integrated system preserves history waybill Chinese address and sends part success
Degree coordinate (is collected) by receipts terminal device of dispatching officers, and can accurately obtain Chinese address to sending part by Text Address matching technique
Longitude and latitude conversion.
Waybill routing tag is grabbed according to the routing iinformation of waybill, waybill is classified according to site, shift.Each site is each
As one group, task distribution and path planning carry out all waybills of shift for these groups.
The time tag of waybill is grabbed according to the routing iinformation of waybill, time tag indicates the timeliness requirement of waybill, such as exists
It must be sent to before morning 10:30.Time tag is included in routing iinformation, and time tag includes two kinds: it is expected that reaching net
The time of part is sent in the time of point and plan the latest, wherein it is expected that the time for reaching site is that routing generates, and plans to send the latest
The part time is to be generated to be added in routing iinformation by system.
S3 calculates any two waybill and receives using latitude and longitude information described in navigation Service software and step S2
The navigation distance of address；
Navigation distance is indicated with distance matrix；Latitude and longitude information obtains navigation distance, the navigation that can be provided with third party
(such as Baidu map API, Amap API, Tencent map API, Google Maps API etc. can be realized Chinese address conversion for service
For latitude and longitude information and the map API of the distance between different address can be calculated), or sent with charge free using own history waybill
Data, or obtained from own integrated system, later, time gap is calculated by navigation distance, which can be for big
The empirical data of amount sent with charge free after experience, is also possible to the time of the database by third-party platform, is also possible in real time
Path length and send the ratio between speed with charge free.
S4 calculates the dispatching sequence of waybill using path planning model, Expected Arrival Time and sends route with charge free.It is described
Path planning model is trained path planning model, is the domain model established according to having time window Vehicle Routing Problems.
Its schematic diagram is shown in attached drawing 7.
Having time window Vehicle Routing Problems (vehicle routing problems with time windows,
VRPTW) Vehicle Routing Problem (VRP) is to be put forward for the first time by Dantzig and Ramser in nineteen fifty-nine earliest, it refers to certain amount
Client, the cargo demand of each own different number, home-delivery center to client provide cargo, by a fleet be responsible for send goods
Object, organizes traffic route appropriate, and target is so that the demand of client is met, and can reach all under certain constraint
Such as the purpose of distance is most short, cost minimization, minimum consuming time.
The calculating process of path planning model described in step S4 comprising steps of
S41, by the latitude and longitude information of the shipping address of whole waybills under each of described grouping, it is described when
Between the calculated result of label and step S3 input path planning model among, according to preset screening conditions, use FFD algorithm
Generate an initial solution.
FFD (FirstFitDecreasing) strategy is typical heuristic feasible operator, basic ideas in bin packing
It is to sort from large to small article, then article is successively packed at first the chest that can accommodate the article from front to back.
FFD algorithm example: assuming that there is A, B, C, D, E5 dwell points, each dwell point time-consuming is respectively 30,20,10,5,
3, and the maximum time-consuming of every route is 46.
Step 1: the time-consuming maximum dwell point A of selection.
Step 2: selecting time-consuming maximum dwell point B in remaining dwell point, by A and C in combination to a route.
Step 3: A+B time-consuming is greater than maximum time-consuming 46, then arranges B into next route.
Step 4: selecting time-consuming maximum C in non-selected dwell point,
By A and C in combination into a route.The time-consuming of A+C is 40 less than maximum time-consuming 46.
Step 5: selecting time-consuming maximum D in non-selected dwell point,
A+C and D are incorporated into a route.The time-consuming of A+C+D is 45 less than maximum time-consuming 46.
Step 6: selecting time-consuming maximum E in non-selected dwell point,
A+C+D and E are incorporated into a route.The time-consuming of A+C+D+E is 48 greater than maximum time-consuming 46.Then E is arranged
To in next route.
Step 7: not selected dwell point is repeated to calculated above, final result production two initial lines of A+C+D and B+E
Road.
S42 optimizes initial solution using searching algorithm, obtains optimum results；Use tabu search algorithm (Tabu
Searching), alternative delay receives algorithm (Late Acceptance), simulated annealing (Simulated
Annealing) carry out field search, constraint condition be waybill time tag before must be sent to, target be task total time-consuming most
Few, termination condition is more excellent solution no longer occur in certain step number.Certain step number herein can configure, can be according to address
Quantity and the required precision of result is determined.
(tabu search algorithm (Tabu Searching), alternative delay receive algorithm (Late to above-mentioned three kinds of algorithms
Acceptance), simulated annealing (Simulated Annealing)) it is to be recalculated for what initializaing variable carried out；Prohibit
Avoiding searching algorithm being capable of independent operating；So-called neighborhood search (such algorithm) passes through neighbour from (or one group) initial solution
Domain function generates the neighborhood of solution, then in neighborhood, searches out more preferably solution and replaces current solution, pass through continuous iterative process real
Now solve.
As shown in Fig. 2, the detailed process of searching algorithm comprising steps of
S101 chooses task dwell point in original route；Selection task dwell point is currently random, but can be by strong
Chemistry practises choice of dynamical strategy, improves search and convergent speed.Original route is the corresponding route of initial solution.
S102 chooses the mobile scheme of neighborhood: task dwell point described in step 101 is moved in a route or is handed over
The task dwell point of mutual two lines generates temporary route.In this step, route originally is the initial solution in step S41.
As shown in Figure 3-4, Fig. 3 is the route before task dwell point A mobile, and Fig. 4 is the route after task dwell point A mobile.
The mobile scheme of assessment neighborhood: S103 calculates the general line distance of temporary route described in step S102；The road Bing Jiangzong
Linear distance is converted to time-consuming.
S104 repeats step 102-103, until all possible neighborhoods of task dwell point described in step S101 are mobile
Scheme is evaluated, assesses the temporary route of all generations.
Fig. 5 is respectively the different time-consumings sent with charge free under sequence from Fig. 6.Wherein, Fig. 5 are as follows: A → B → C → D, total time-consuming 50+
30+30+40+50=200min.Fig. 6 are as follows: A → C → B → D, total time-consuming 50+30+30+30+50=190min.
The least structure of total time-consuming is filtered out from the assessment result of step S104, is neighborhood as neighborhood optimal route
Optimal solution.
S105, initial solution described in step S41 (original route) and the resulting neighborhood optimal solution of step S104 is (optimal
Route) compare, if neighborhood optimal solution is better than initial solution, initial solution is replaced with neighborhood optimal solution, otherwise initial solution does not change；
Step above-mentioned steps are repeated, until algorithm runs enough pre-set time or pre-set search cycle-index
Circulation finishes, and does not update initial solution, stops search, and using current initial solution as optimum results.
S43 is provided according to optimum results and is sent route with charge free.
The invention also includes: the result that the path planning model provides is shown by receiving the terminal APP to dispatch officers, is sent
Part person carries out sending part according to the display result of terminal APP.As a result sequence, Expected Arrival Time are sent with charge free including waybill, recommends road
Line.
Fig. 7 show the structure of path planning model, wherein * is to represent multiple, and 1 is to represent 1,0..1 representative have or
Nothing.Arrival time=upper halt+journey time of setting out the moment；Set out the moment=Max (arrival time, ready moment)+
Service duration；The reversing of next client=upper halt；Receipts dispatch officers=Boolean (whether this is to receive to dispatch officers to collect same class)
This: upper one stops checking and accepting dispatching officers.
The system for sending part path is received in optimization, comprising: for obtaining the essential information on Air Way Bill No. to be sent with charge free, and acquisition
The device of the latitude and longitude information of the shipping address of Air Way Bill No., the essential information include shipping address and timeliness attribute letter
Breath；
For utilizing the latitude and longitude information, the device of the navigation distance of any two waybills shipping address is calculated；And
For providing dispatching sequence, Expected Arrival Time and the device for sending route with charge free of waybill.
The equipment for sending part path, the computer-readable medium including being stored with computer program, described program quilt are received in optimization
Operation is for executing:
The essential information of waybill to be sent with charge free is obtained, the essential information includes shipping address and timeliness attribute information；
Obtain the latitude and longitude information of each shipping address；
According to the latitude and longitude information, the navigation distance of any two waybills shipping address is calculated；
The dispatching sequence of waybill is provided using path planning model, Expected Arrival Time and sends route with charge free.
Above-mentioned, although the foregoing specific embodiments of the present invention is described with reference to the accompanying drawings, not protects model to the present invention
The limitation enclosed, those skilled in the art should understand that, based on the technical solutions of the present invention, those skilled in the art are not
Need to make the creative labor the various modifications or changes that can be made still within protection scope of the present invention.
Claims (10)
1. the method for sending part path is received in optimization, which is characterized in that comprising steps of
The essential information of waybill to be sent with charge free is obtained, the essential information includes shipping address and timeliness attribute information；
Obtain the corresponding latitude and longitude information of each shipping address；
According to the latitude and longitude information, the navigation distance of any two waybills shipping address is calculated；
The latitude and longitude information, navigation distance and timeliness attribute information are inputted into path planning model, it is suitable to obtain sending with charge free for waybill
Sequence, it is contemplated that arrival time and send route with charge free.
2. the method for sending part path is received in optimization according to claim 1, which is characterized in that the timeliness attribute information includes
Routing iinformation and to vehicle shift time information.
3. the method for sending part path is received in optimization according to claim 1, which is characterized in that described to obtain each shipping address pair
The latitude and longitude information answered includes:
Obtain the shipping address of history waybill；
Shipping address corresponding latitude and longitude information when obtaining above-mentioned history waybill acknowledgement, establishes history shipping address and longitude and latitude is believed
The corresponding relationship of breath；
The shipping address that the corresponding history waybill of waybill shipping address to be sent with charge free is obtained using Text Address matching, is obtained wait send with charge free
The latitude and longitude information of waybill；Alternatively,
It is described to obtain the corresponding latitude and longitude information of each shipping address, including,
Using map API, waybill shipping address is converted into latitude information.
4. the method for sending part path is received in optimization according to claim 1, which is characterized in that
The navigation distance for calculating any two waybills shipping address, including,
Data are sent with charge free using map API navigation platform, or using own history waybill, obtain any two waybills shipping address
Navigation distance.
5. the method for sending part path is received in optimization according to claim 1, which is characterized in that obtain each shipping address described
Before corresponding latitude and longitude information, including,
Waybill to be sent with charge free is grouped according to site, vehicle shift time, all waybills of each each shift in site obtain each as one group
Waybill shipping address longitude and latitude under grouping.
6. the method for sending part path is received in optimization according to claim 1, which is characterized in that described to believe the longitude and latitude
Breath, navigation distance and timeliness attribute information input path planning model, and obtain waybill sends sequence and Expected Arrival Time, packet with charge free
It includes,
According to the latitude and longitude information of input, navigation distance and timeliness attribute information, initial solution is generated using FFD algorithm；
Initial solution is optimized, optimization solution is obtained.
7. the method for sending part path is received in optimization according to claim 6, which is characterized in that described excellent to initial solution progress
Change, obtains optimization solution, including,
S101 chooses task dwell point in original route；
The task dwell point is moved in other routes by S102, or the task dwell point that interaction two lines are chosen
Generate temporary route；
S103 calculates the general line distance of temporary route, and general line distance is converted to time-consuming；
S104 repeats step S102-S103, assesses the temporary route of all generations, filter out the least knot of total time-consuming
Structure, as neighborhood optimal route；
S105, it is optimal with neighborhood if neighborhood optimal route is better than original route by original route compared with neighborhood optimal route
Route replaces original route as optimization solution, and otherwise original route is not made to change as optimization solution.
8. the method for sending part path is received in optimization according to claim 7, which is characterized in that initial road described in step S105
Line is not made to change as before optimization solution, further includes,
In preset time or default comparison number, if not updating initial solution, stop search, and using initial solution as optimization
Solution.
9. the system for sending part path is received in optimization characterized by comprising
For obtaining the essential information on Air Way Bill No. to be sent with charge free, and obtain the latitude and longitude information of the shipping address of Air Way Bill No.
Device, the essential information include shipping address and timeliness attribute information；
For utilizing the latitude and longitude information, the device of the navigation distance of any two waybills shipping address is calculated；And
For providing dispatching sequence, Expected Arrival Time and the device for sending route with charge free of waybill.
10. the equipment for sending part path is received in optimization, which is characterized in that the computer-readable medium including being stored with computer program,
Described program is run for executing:
The essential information of waybill to be sent with charge free is obtained, the essential information includes shipping address and timeliness attribute information；
Obtain the latitude and longitude information of each shipping address；
According to the latitude and longitude information, the navigation distance of any two waybills shipping address is calculated；
The dispatching sequence of waybill is provided using path planning model, Expected Arrival Time and sends route with charge free.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710991581.3A CN109697523A (en) | 2017-10-23 | 2017-10-23 | The method, system and equipment for sending part path are received in optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710991581.3A CN109697523A (en) | 2017-10-23 | 2017-10-23 | The method, system and equipment for sending part path are received in optimization |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109697523A true CN109697523A (en) | 2019-04-30 |
Family
ID=66226703
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710991581.3A Pending CN109697523A (en) | 2017-10-23 | 2017-10-23 | The method, system and equipment for sending part path are received in optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109697523A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110852683A (en) * | 2019-11-12 | 2020-02-28 | 德邦物流股份有限公司 | Dispatch waybill classification method and device |
| CN111105095A (en) * | 2019-12-24 | 2020-05-05 | 北京顺丰同城科技有限公司 | Distribution route determining method and device and electronic equipment |
| CN111256718A (en) * | 2020-02-12 | 2020-06-09 | 上海东普信息科技有限公司 | Dispatching route planning method, device, system, equipment and storage medium |
| CN111311152A (en) * | 2020-02-12 | 2020-06-19 | 上海东普信息科技有限公司 | Dispatch route recommendation method, device, system, equipment and storage medium |
| CN111325504A (en) * | 2020-02-12 | 2020-06-23 | 上海东普信息科技有限公司 | Dispatching track recommendation method, device, system, equipment and storage medium |
| CN111652439A (en) * | 2020-06-04 | 2020-09-11 | 上海燕汐软件信息科技有限公司 | Method and device for generating delivery quantity of delivery points and computer system |
| CN112434863A (en) * | 2020-11-30 | 2021-03-02 | 上海富勒信息科技有限公司 | Distribution scheduling method |
| CN112567399A (en) * | 2019-09-23 | 2021-03-26 | 阿里巴巴集团控股有限公司 | System and method for route optimization |
| CN112668964A (en) * | 2020-12-23 | 2021-04-16 | 北京京东振世信息技术有限公司 | Transportation certificate routing method, device, equipment and computer readable storage medium |
| CN112990807A (en) * | 2019-12-18 | 2021-06-18 | 顺丰科技有限公司 | Item delivery time consumption analysis method and device, computer equipment and storage medium |
| CN112990813A (en) * | 2021-02-09 | 2021-06-18 | 北京橙心无限科技发展有限公司 | Method and device for determining navigation time |
| CN113537863A (en) * | 2020-04-17 | 2021-10-22 | 顺丰科技有限公司 | Route planning method, route planning device, computer equipment and storage medium |
| CN113761085A (en) * | 2020-06-05 | 2021-12-07 | 北京京东振世信息技术有限公司 | Method and device for processing order data |
| CN113819922A (en) * | 2021-10-29 | 2021-12-21 | 成都清渟科技有限公司 | Intelligent route planning method |
| CN114279455A (en) * | 2021-11-16 | 2022-04-05 | 北京百度网讯科技有限公司 | Path planning method and device, electronic equipment and readable storage medium |
| CN116341781A (en) * | 2023-03-28 | 2023-06-27 | 暨南大学 | Path planning method based on large-scale neighborhood search algorithm and storage medium |
| CN117313979A (en) * | 2023-11-30 | 2023-12-29 | 湖南木屋网络科技有限公司 | Distribution route planning method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002108998A (en) * | 2000-09-28 | 2002-04-12 | Hitachi Software Eng Co Ltd | Method and system for planning transportation |
| JP2005280972A (en) * | 2004-03-31 | 2005-10-13 | Fujitsu Ltd | Collection-and-delivery route setting method and collection-and-delivery route setting program |
| JP2010055150A (en) * | 2008-08-26 | 2010-03-11 | Sakano Kazuhito | Delivery support navigation system, package delivery method, management server, address matching program, and computer-readable recording medium |
| WO2016172974A1 (en) * | 2015-04-30 | 2016-11-03 | 华为技术有限公司 | Service processing method and device |
| CN106871916A (en) * | 2017-01-19 | 2017-06-20 | 华南理工大学 | Method is sent in a kind of express delivery based on independent navigation with charge free |
| CN107230014A (en) * | 2017-05-15 | 2017-10-03 | 浙江仟和网络科技有限公司 | A kind of intelligent dispatching system of the instant logistics in end |
-
2017
- 2017-10-23 CN CN201710991581.3A patent/CN109697523A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002108998A (en) * | 2000-09-28 | 2002-04-12 | Hitachi Software Eng Co Ltd | Method and system for planning transportation |
| JP2005280972A (en) * | 2004-03-31 | 2005-10-13 | Fujitsu Ltd | Collection-and-delivery route setting method and collection-and-delivery route setting program |
| JP2010055150A (en) * | 2008-08-26 | 2010-03-11 | Sakano Kazuhito | Delivery support navigation system, package delivery method, management server, address matching program, and computer-readable recording medium |
| WO2016172974A1 (en) * | 2015-04-30 | 2016-11-03 | 华为技术有限公司 | Service processing method and device |
| CN106871916A (en) * | 2017-01-19 | 2017-06-20 | 华南理工大学 | Method is sent in a kind of express delivery based on independent navigation with charge free |
| CN107230014A (en) * | 2017-05-15 | 2017-10-03 | 浙江仟和网络科技有限公司 | A kind of intelligent dispatching system of the instant logistics in end |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112567399A (en) * | 2019-09-23 | 2021-03-26 | 阿里巴巴集团控股有限公司 | System and method for route optimization |
| CN110852683A (en) * | 2019-11-12 | 2020-02-28 | 德邦物流股份有限公司 | Dispatch waybill classification method and device |
| CN112990807A (en) * | 2019-12-18 | 2021-06-18 | 顺丰科技有限公司 | Item delivery time consumption analysis method and device, computer equipment and storage medium |
| CN111105095A (en) * | 2019-12-24 | 2020-05-05 | 北京顺丰同城科技有限公司 | Distribution route determining method and device and electronic equipment |
| CN111311152A (en) * | 2020-02-12 | 2020-06-19 | 上海东普信息科技有限公司 | Dispatch route recommendation method, device, system, equipment and storage medium |
| CN111325504A (en) * | 2020-02-12 | 2020-06-23 | 上海东普信息科技有限公司 | Dispatching track recommendation method, device, system, equipment and storage medium |
| CN111256718A (en) * | 2020-02-12 | 2020-06-09 | 上海东普信息科技有限公司 | Dispatching route planning method, device, system, equipment and storage medium |
| CN111256718B (en) * | 2020-02-12 | 2023-04-18 | 上海东普信息科技有限公司 | Dispatching route planning method, device, system, equipment and storage medium |
| CN111311152B (en) * | 2020-02-12 | 2023-05-12 | 上海东普信息科技有限公司 | Method, device, system, equipment and storage medium for recommending dispatch route |
| CN113537863A (en) * | 2020-04-17 | 2021-10-22 | 顺丰科技有限公司 | Route planning method, route planning device, computer equipment and storage medium |
| CN111652439A (en) * | 2020-06-04 | 2020-09-11 | 上海燕汐软件信息科技有限公司 | Method and device for generating delivery quantity of delivery points and computer system |
| CN111652439B (en) * | 2020-06-04 | 2024-02-23 | 上海燕汐软件信息科技有限公司 | Method and device for generating dispatch quantity of dispatch points and computer system |
| CN113761085B (en) * | 2020-06-05 | 2023-09-26 | 北京京东振世信息技术有限公司 | Method and device for processing order data |
| CN113761085A (en) * | 2020-06-05 | 2021-12-07 | 北京京东振世信息技术有限公司 | Method and device for processing order data |
| WO2021244233A1 (en) * | 2020-06-05 | 2021-12-09 | 北京京东振世信息技术有限公司 | Method and apparatus for processing order data |
| CN112434863A (en) * | 2020-11-30 | 2021-03-02 | 上海富勒信息科技有限公司 | Distribution scheduling method |
| CN112668964A (en) * | 2020-12-23 | 2021-04-16 | 北京京东振世信息技术有限公司 | Transportation certificate routing method, device, equipment and computer readable storage medium |
| CN112990813A (en) * | 2021-02-09 | 2021-06-18 | 北京橙心无限科技发展有限公司 | Method and device for determining navigation time |
| CN113819922A (en) * | 2021-10-29 | 2021-12-21 | 成都清渟科技有限公司 | Intelligent route planning method |
| CN113819922B (en) * | 2021-10-29 | 2024-05-03 | 成都清渟科技有限公司 | Intelligent route planning method |
| CN114279455A (en) * | 2021-11-16 | 2022-04-05 | 北京百度网讯科技有限公司 | Path planning method and device, electronic equipment and readable storage medium |
| CN116341781A (en) * | 2023-03-28 | 2023-06-27 | 暨南大学 | Path planning method based on large-scale neighborhood search algorithm and storage medium |
| CN117313979A (en) * | 2023-11-30 | 2023-12-29 | 湖南木屋网络科技有限公司 | Distribution route planning method and device |
| CN117313979B (en) * | 2023-11-30 | 2024-02-20 | 湖南木屋网络科技有限公司 | Distribution route planning method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109697523A (en) | The method, system and equipment for sending part path are received in optimization | |
| CN109697524A (en) | Optimization receives and sends part task and resource matched method, system and equipment | |
| CN106600036B (en) | Based on Android multiple spot express delivery allocator | |
| CN109784820A (en) | A kind of express delivery routing intelligence solution, device, terminal device and storage medium | |
| Wang et al. | A pickup and delivery problem for ridesharing considering congestion | |
| Nair et al. | Scheduling and routing models for food rescue and delivery operations | |
| CN111461624A (en) | Logistics line planning method, device, equipment and storage medium | |
| US20170046653A1 (en) | Planning of transportation requests | |
| Repoussis et al. | A web-based decision support system for waste lube oils collection and recycling | |
| JP2014526072A (en) | System and method for multi-vehicle resource allocation and routing solutions | |
| Poeting et al. | Simulation of an optimized last-mile parcel delivery network involving delivery robots | |
| JP6345873B2 (en) | Method and apparatus for building a demand metamodel for high-speed trains | |
| CN109564647A (en) | Evaluating apparatus, evaluation method and assessment process | |
| CN106557474A (en) | Obtain the method and device of POI, database, navigation terminal and automobile on the way | |
| JP2003141222A (en) | Method, system and program for preparing delivery plan | |
| CN104636457B (en) | A kind of method and device of location finding cognition | |
| CN104715675A (en) | GIS (geographic information system) electronic map suitable for physical distribution path optimization | |
| CN104517200A (en) | Fuel consumption calculation method, distribution plan acquisition method and distribution plan acquisition device for logistics distribution | |
| De Giovanni et al. | Algorithms for a vehicle routing tool supporting express freight delivery in small trucking companies | |
| Fleuren et al. | Supply chain–wide optimization at tnt express | |
| KR20190057823A (en) | Set-up of a system for automatic information of delivery schedule in each logistics area | |
| KR102125472B1 (en) | Recommended route guidance system and method for reducing tolerance time | |
| JP5079067B2 (en) | Delivery affiliation determination device and program | |
| JP2020038501A (en) | Information processing device, program and system | |
| CN108846513A (en) | A kind of delivery job order head and the tail optimization method and system based on GIS |
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: 20190430 |
|
| RJ01 | Rejection of invention patent application after publication |