CN106600036B - Based on Android multiple spot express delivery allocator - Google Patents
Based on Android multiple spot express delivery allocator Download PDFInfo
- Publication number
- CN106600036B CN106600036B CN201610983582.9A CN201610983582A CN106600036B CN 106600036 B CN106600036 B CN 106600036B CN 201610983582 A CN201610983582 A CN 201610983582A CN 106600036 B CN106600036 B CN 106600036B
- Authority
- CN
- China
- Prior art keywords
- address
- dispatching
- express delivery
- route
- current
- 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.)
- Active
Links
- 238000012384 transportation and delivery Methods 0.000 title claims abstract description 90
- 238000000034 method Methods 0.000 claims description 40
- 230000008569 process Effects 0.000 claims description 21
- 230000008859 change Effects 0.000 claims description 9
- 230000004048 modification Effects 0.000 claims description 6
- 238000012986 modification Methods 0.000 claims description 6
- 238000004064 recycling Methods 0.000 claims description 3
- 238000005457 optimization Methods 0.000 abstract description 5
- 230000006870 function Effects 0.000 description 9
- 238000011161 development Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 238000010411 cooking Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000002716 delivery method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000012800 visualization 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/451—Execution arrangements for user interfaces
-
- 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
-
- 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
-
- 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
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Software Systems (AREA)
- Human Computer Interaction (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Navigation (AREA)
Abstract
Based on Android multiple spot express delivery allocator, firstly, starting point, each dispatching address and final destination are deposited into database, in dispatching person's logged-on user interface and after obtaining express delivery distribution information table, a key sending short messages in groups notifies addressee；Secondly the SDK for combining Baidu map application searches out optimal path with local path optimization by the global path optimization in A* algorithm；Then the path planned is shown in the form of text or map, voice broadcast function can also be added, broadcast current optimal dispatching express delivery route；Finally, writing computer software, meet the operation of any mobile terminal Android.The present invention can intelligently realize the planning of Distribution path, provide dispatching efficiency.
Description
Technical field
The present invention relates to a kind of express delivery allocators, optimum path planning are dispensed based on the express delivery of Android multiple spot, for tool
The dispatching environment and dispatching mission requirements of body carry out path planning using A* algorithm, and combine Baidu map, and cooking up can
Enough meet mission requirements, and meet the optimal path of environmental information, to ensure that dispatching person can be efficiently completed specified send with charge free
Task, to improve working efficiency.
Background technique
With the fast development of e-commerce, hot shopping online is brought, express delivery dispatching just becomes a kind of modernization
Circulation style is the tie between supplier and client.However, to be still within heavy dependence artificial for the delivery industry of China at present
Developing stage, especially dispatching link in, the dispatching efficiency variance of each courier is very big, the time of waste and economic cost
It can not estimate, wherein most important problem is the optimization problem of Distribution path.In recent years, with the rise of Internet of Things, information skill
Art is also gradually applied in delivery industry, and has further expedited the emergence of the emerging concept of " Intelligent logistics ".Express delivery dispenses most
Shortest path to accelerate dispatching speed, improve service quality, reduces distribution cost and increase economic benefit have large effect,
And based on the express delivery of Android multiple spot with it is optimal send path planning be simulate express delivery dispatching " last one kilometer " process, make its by
According to short line, the strategy generating distribution route of minimum time, working efficiency is improved, alleviates current logistic industry supply falls short of demand
Status.Therefore, dispatching person how is allowed efficiently to complete dispatching task using Android phone, to improve the stock control of electric business
Ability and one of the hot spot for loading capability being current logistics distribution field.
On the problem of research of the dispatching of express delivery at present is concentrated mainly on transportation cost, and path planning algorithm is that logistics is matched
One of the core technology for sending field, for for the research of specific dispatching environment and the planning of specific worksheet processing task realizing route compared with
It is few.Traditional express delivery dispatching work is compared, Lei Peng is main in the design and realization for dispensing software based on express delivery under android system
Software design level is studied, distribution route method is not studied, in terms of the planning for solving express delivery distribution route
Cannot provide help (based under android system express delivery dispatching software design and realization [D] University of Electronic Science and Technology,
2014.)；He Ping proposes the intelligent express delivery allocator on mobile platform, and this method and the present invention are provided to solve express delivery
Inefficiency, the common objective of the heavy burden of dispatching person are dispensed in delivery process, but do not provide specific application platform and
The SDK of map application, the algorithm of selection are greedy algorithm and the overall situation k-opt method of pulley sheaves to plan optimal distribution route,
They are able to solve some basic tasks in path planning, but they require sequentially to be segmented according to task node sequence
It is planned, planning gained path is influenced by the number and sequence of task node, it not can guarantee the optimality in planning gained path,
Cannot preferably suitable for delivery system complex task (the intelligent express delivery allocator on mobile platform: China,
201510522278.X[P].2015-08-24.)。
Summary of the invention
The present invention will overcome the disadvantages mentioned above of the prior art, and Development and design is based on multiple spot express delivery in Android platform out and matches
Delivery method.The present invention carried out using A* algorithm paths planning method find optimal path, specific process as shown in Figure 1,
It can be divided mainly into and establish bmob database and in conjunction with Baidu map path optimizing two large divisions.Firstly, by starting point, each dispatching
Address and final destination deposit into database, and in dispatching person's logged-on user interface and after obtaining express delivery distribution information table, a key is short
Letter mass-sending notifies addressee；Secondly the SDK for combining Baidu map application is optimized and local road by the global path in A* algorithm
Diameter optimization searches out optimal path；Then the path planned is shown in the form of text or map, can also be added
Voice broadcast function broadcasts current optimal dispatching express delivery route；Finally, writing computer software, it is mobile to meet any Android
The operation at end.Its technical solution is:
Based on Android multiple spot express delivery allocator, comprising the following steps:
Step 1: establishing the database of the mobile terminal bmob, starting point, each dispatching address and final destination are deposited into number
According to library, while dispatching person enters user's login interface, and express delivery is obtained after login account and distributes task list, and carries out one to addressee
Key sending short messages in groups.Include express delivery details table and delivery location information table in database, allows in input process because mistake is defeated
Enter and delete the partial address of typing.
Step 2: the SDK applied in conjunction with Baidu map, optimal matching before being set out using the planning of A* global path optimizing algorithm
Send path.A* algorithm is current most popular heuristic search algorithm, for encountered in search process each new state (or
New node), its best cost assessment values are first calculated by evaluation function, then select the smallest state of assessment values at that time, from
The state starts to continue searching, using the cost assessment values of node as the best-first search of standard.Next optimal route is advised
The method of drawing is described: firstly, Baidu map is called to apply the SDK opened to developer, according to the literal address of input, obtaining
Its corresponding longitude and latitude, is then based on the road information on longitude and latitude and periphery, is calculated between each pair of address and is suitble to express delivery people
The most short delivery of member leads to distance, searches for obtain the global optimum path for meeting mission requirements using A* global path optimizing algorithm, seek
Optimal Distribution path before finding out hair.A* algorithm is first calculated each new state encountered in search process by evaluation function
Its best cost assessment values out, then select the smallest state of assessment values at that time, continue searching since the state, until searching
Rope goes out the biggish terminal of possibility.
Step 3: can not be dispensed for what is occurred in delivery process, dispatching address modification or newly-increased pickup order etc. are asked
Topic reuses A* algorithm and plans current optimal Distribution path again.Some temporarily change when courier learns in delivery process
Become situation, can not such as dispense, dispense address change, or be connected to new pickup order etc., Baidu map need to first be called to apply
SDK obtains the longitude and latitude of current address, and current address is added in address database, deletes the address for no longer needing to dispatching,
Increase the dispatching address of update simultaneously and requires to go the address of pickup；Next, define one it is current plan address set,
Comprising all addresses not yet dispensed, calculates the point in each Adding Address and gather between other addresses and adjust the distance, use A*
Global path optimizing algorithm is that address space left plans an initial distribution route, then using current location as starting point, can advise
It draws and is used as the object of planning in address set, since current location, utilize the optimizing of A* global path in address set that can plan
Algorithm is adjusted the distance according to the point in calculated set, selects next dispatching address, by the address from can plan address set
It is removed in conjunction, and using it as the current address of next round, repeats above step, until can plan that address set is sky, finally
It is connected with destination, forms an initial current express delivery distribution route；Finally, recycling the local paths planning pair of A* algorithm
The original route is further optimized, and local behaviour is carried out within the scope of address set and current location and destination that can plan
Make, and the route to ensure newly to constitute is one and is finally reached destination by that can plan address set from current location
Local route finally obtain current optimal distribution route then by repeating the operation several times until be unable to improve.
Step 4: the optimal route details planned being shown in the form of text and map, it may be necessary to select
Voice broadcast function, the current optimal dispatching express delivery route of real-time broadcasting.
It is carried out finally, above-mentioned steps process passes through the computer software write, which moves suitable for any Android
Moved end is easy to operate but meets dispatching demand, and the result that step 4 is obtained is transferred to the mobile terminal Android of dispatching person's carrying
On.It includes four most of, and first part is to establish mobile client database, and second part is the optimal Distribution path of initial plan,
Part III is to plan current optimal path again, and Part IV is dispatching person's dispatching.Dispatching person does not need incoming task formula
Troublesome operation, starting point, each dispatching address and final destination only need to deposit into database, click planning path,
Operation is simple.Dispatching person need to only select again any traffic work with the mobile terminal Android after getting optimum programming path
Tool can carry out express delivery dispatching.
The present invention develops a application program that express delivery is efficiently dispensed suitable for courier from courier's angle,
Courier can input the address for needing to dispense express delivery in the application program, then go out one most by application program intelligent planning
Excellent route map, courier can be efficiently completed delivery tasks according to the route map searched out, will within the most fast time
Express delivery is dispensed into client's hand, makes customer satisfaction, reduces human and material resources and financial resources of dispatching etc. while can increasing client's amount
Cost.
The present invention is built upon the multiple spot express delivery delivery system on Android mobile platform, including starting point, multiple dispatchings
Address and final destination, in conjunction with the SDK that Baidu map is applied, optimal distribution route before being set out using A* algorithmic rule, and
According to road condition change real time modifying, the details of optimal path are displayed in the form of text and map.The present invention solves
Express delivery dispenses inefficiency, the defect that manpower waste and express delivery dispatching delay.The present invention uses overall situation A* method, can optimize and match
Express delivery distribution route before sending；And part A* method is used, address set can be planned by constructing, and not influence to have already passed through route
On the basis of, re-optimization subsequent path not only makes the dispatching efficiency of express company obtain basic guarantee, but also can be by courier
It frees from the heavy burden that Distribution path is planned, embodies the key point of delivery service quality, realize real wisdom logistics.
The present invention has the following advantages:
(1) this be based on multiple spot express delivery dispatching optimum path planning method on Android mobile platform, can be in dispatching
The different vehicles are selected, it is very low to the configuration requirement of vehicle, it is not required to tricycle etc. can be used, in mode of transportation equipped with GPS
Upper selection is flexible, therefore replicability is stronger.
(2) development platform of the invention is more universal, it is only necessary to carry Android mobile device, facilitate courier
Carrying use；In addition combined with Baidu map application, using map visualization, speech navigation function makes one mesh of distribution route
So, all specific distribution informations are provided for user, it is feature-rich, so that the work quality of dispatching gets rid of human factor as far as possible, reach
To a standardized effect, even if newly arrive the courier for not recognizing road can be very good to complete dispatching task.
(3) some temporary changes events occurred for courier in dispatching, can not such as dispense, dispense address modification, or
Whens person is connected to new pickup order etc., previous Dynamic Programming is typically all the unified arrangement of central delivery system in server-side,
Each vehicle is sent instructions to again.But the characteristics of express delivery is that courier directly acquires first hand information, voluntarily by courier
Schedule, and we this be based on Android mobile platform on multiple spot express delivery dispatching optimum path planning method in this side
Face directly can flexibly be responded by courier, and real-time is very high.
(4) this dispenses optimum path planning method based on A* algorithm based on multiple spot express delivery on Android mobile platform
Global path planning and local paths planning can produce initial solution more better than random or greedy algorithm；Using the A* overall situation
Paths planning method, the express delivery distribution route before dispatching can be optimized；And A* local paths planning method is used, it can by building
It plans address set, on the basis of not influencing to have already passed through route, continues to optimize subsequent path, so that entire Distribution path be made to reach
To optimal.
Detailed description of the invention
Fig. 1 is flow diagram of the present invention
Fig. 2 is user's login interface of the present invention
Fig. 3 is that one key group of short message of the present invention sends out interface
Fig. 4 is that Baidu map of the invention imports figure
Fig. 5 is that surface chart is sent in present invention acquisition with charge free, wherein the school district A Zhejiang Polytechnical University Ping Feng, B Zhejiang University (Zijin port
School district), C Zhejiang University (Yuquan Campus), D Zhejiang Polytechnical University morning sunlight school district, the Hangzhou E automobile northern station.
Fig. 6 is that path planning of the invention realizes result.
Specific embodiment
Below in conjunction with attached drawing to the present invention is based on Android multiple spot express delivery dispatching optimum path planning methods to make simplified example
Make into explanation.Choose A, B, C, D, E as addressee's address in Hangzhou and carry out express delivery dispatching: A point is starting point, has been sent with charge free fast
A point is also finally returned to after passing, is needed on the way by tetra- express delivery distribution points of B, C, D, E.The address of these points is believed first
Into bmob database, dispatching person obtains its information and bulk SMS, mentions after the login account of the mobile terminal Android for breath storage
Preceding informing addressee will have express delivery arrival；Then the acquisition optimal path key to set out on forward play click mobile terminal in A point, is realized out
Path planning before hair shows first optimum point C point；It after dispatching person reaches C point, then clicks and obtains optimal path key, to working as
Planning is made in front position again, until completing the express delivery dispatching of all the points, and returns to A point, specific path planning is as shown in Figure 6.
The present invention is based on Android multiple spot express delivery dispatching optimum path planning methods mainly the following contents: firstly, it is necessary to
Starting point, each dispatching address and final destination are deposited into database, while dispatching person by the database for establishing the mobile terminal bmob
Express delivery, which is obtained, into user's login interface, after login account distributes task list；Then in conjunction with the SDK of Baidu map application, use
A* global path optimizing algorithm plans the optimal Distribution path before setting out；It can not dispense, dispense for what is occurred in delivery process
The problems such as address modification or newly-increased pickup order, reuses A* algorithm and plans current optimal Distribution path again；Finally will
Optimal path details carry out navigate optimal distribution route to show (detailed process is shown in Fig. 1).
The present invention mainly uses Android SDK, Baidu map API, navigation SDK.The task of express delivery dispatching is mainly real
It now reduces distribution cost and meets the needs of client, therefore the Main way that express company considers is how to guarantee visitor
Under the premise of the satisfaction of family, cost is reduced to the greatest extent, and the key for reducing cost is to find an optimal path.And the present invention will
Advanced information technology application is planned to express delivery distribution route, and express company is not only made to obtain the basic guarantor in dispatching efficiency
Barrier, and courier can be freed from Distribution path planning burden, realize real wisdom logistics.Here mainly make
Optimal path before being set out with the planning of A* global path optimizing algorithm, and can not be dispensed for what is occurred in delivery process, it dispenses
It the problems such as address modification or newly-increased pickup order, is combined using A* global path optimizing algorithm and local path optimizing algorithm
Mode cook up current optimal Distribution path again, to keep distribution route in entire delivery process optimal, reduce courier
Dispatching heavy burden.
The present invention is based on Android multiple spot express deliveries to dispense optimum path planning method, and the main following steps of feature are such as schemed
Shown in 1:
Step 1, starting point, each dispatching address and final destination are deposited into number by the database for establishing the mobile terminal bmob
It include express delivery details table and delivery location information table in database according to library.Dispatching person enters user's login interface, such as Fig. 2 simultaneously
It is shown, express delivery is obtained after login account and distributes task list, and a key sending short messages in groups is carried out to addressee, it is facilitated to collect express mail,
Such as Fig. 3.Express delivery details table includes order number, sender's name, sender telephone, origin, sender's better address, sender
Organization, addressee's name, addressee's phone, destination, addressee's better address, addressee's organization, expense amount to,
Payment method, number of packages, posts the part date at weight.The dispatching person for entering software addition address as first time, does not have in the database
Information alert, but dispatching person's input address enters in database, if input same or similar address again, the memory of database
Function will appear prompt, provide the user with conveniently.Allow to delete the part of typing in input process because of mistake input
Address；
Step 2, the SDK applied in conjunction with Baidu map, optimal matching before being set out using the planning of A* global path optimizing algorithm
Send path.Baidu map is called out first, according to the literal address of input, is obtained its corresponding longitude and latitude, is then based on longitude and latitude
Degree and the road information on periphery are positioned, as shown in Figure 4.Then it according to the address information of input, is shown on map,
As shown in figure 5, and calculate between each pair of address be suitble to courier most short delivery lead to distance, use A* global path optimizing calculate
Method searches for obtain the global optimum path for meeting mission requirements, finds the optimal Distribution path before setting out；
Step 3, it can not be dispensed for what dispatching person occurred in delivery process, dispense address modification or newly-increased pickup is ordered
The problems such as single, obtains the longitude and latitude of current address as Fig. 5 needs to re-call the SDK that Baidu map is applied, and adds it to
In address database, the address for no longer needing to dispatching is removed, while increasing the dispatching address of update and requiring to go the address of pickup.Again
It is secondary to plan current optimal Distribution path again using A* algorithm.Next, define one it is current plan address set, include
All addresses not yet dispensed calculate the point in each Adding Address and gather between other addresses and adjust the distance, and use the A* overall situation
Path optimizing algorithm is that address space left plans an initial distribution route, then using current location as starting point, can plan ground
It is used as the object of planning in the set of location, since current location, utilizes A* global path optimizing algorithm in address set that can plan,
It adjusts the distance according to the point in calculated set, selects next dispatching address, by the address from can plan in address set
Remove, and assign it as the current address of next round, repeat above step, until can plan address set be it is empty, finally and mesh
Ground be connected, form an initial current express delivery distribution route；Finally, recycling the local paths planning of A* algorithm first to this
Beginning route is further optimized, and carries out partial operation that can plan within the scope of address set and current location and destination,
And the route to ensure newly to constitute is one and is finally reached destination by that can plan address set from current location
Local route finally obtains current optimal distribution route, such as Fig. 6 institute then by repeating the operation several times up to being unable to improve
Show；
Step 4, the optimal route details planned are shown in the form of text and map, it may be necessary to select
Voice broadcast function, the current optimal dispatching express delivery route of real-time broadcasting；
Step 5, by computer software, meet the operation of any mobile terminal Android, the knot that step 4 is obtained
Fruit is transferred on the mobile terminal Android of dispatching person's carrying.It can be seen that the sequencing and specific route information of dispatching, such as
Distance, time etc..It can also illustrate specific route with detailed text, limitation and much planning ground due to mobile phone screen
The presence of location can show the details list of route by this function, understand so that the route in Baidu map is unfavorable for checking
The sequencing in place.Voice broadcast function can be selected when necessary, and the current optimal dispatching express delivery route of real-time broadcasting will be fast
It passs and is completely dispensed into client's hand rapidly.
Claims (3)
1. being based on Android multiple spot express delivery allocator, comprising the following steps:
Step 1, starting point, each dispatching address and final destination are deposited into database by the database for establishing the mobile terminal bmob,
Dispatching person enters user's login interface simultaneously, and express delivery is obtained after login account and distributes task list, and it is short to carry out a key to addressee
Letter mass-sending, includes express delivery details table and delivery location information table in database, allow in input process because mistake input and
Delete the partial address of typing；
Step 2, the SDK applied in conjunction with Baidu map, the optimal dispatching road before being set out using the planning of A* global path optimizing algorithm
Diameter, optimal route planing method description: firstly, calling Baidu map to apply the SDK opened to developer, according to the text of input
Address obtains its corresponding longitude and latitude；It is then based on the road information on longitude and latitude and periphery, is calculated between each pair of address and fits
The most short delivery for closing courier leads to distance, searches for obtain the global optimum for meeting mission requirements using A* global path optimizing algorithm
The optimal Distribution path before setting out is found in path；A* algorithm first presses appraisal letter for each new state encountered in search process
Number calculates its best cost assessment values, then selects the smallest state of assessment values at that time, continues searching since the state,
Until searching out the biggish terminal of possibility；
Step 3, it can not be dispensed for what is occurred in delivery process, dispense address modification or newly-increased pickup order problem, again
Plan current optimal Distribution path again using A* algorithm: when courier learns some Iterim Change situations in delivery process,
When can not such as dispense, dispense address change, or be connected to new pickup order problem, the SDK of Baidu map application need to be first called
The longitude and latitude of current address is obtained, and current address is added in address database, deletes the address for no longer needing to dispatching, simultaneously
Increase the dispatching address updated and requires to go the address of pickup；Next, define one it is current plan address set, include
All addresses not yet dispensed calculate the point in each Adding Address and gather between other addresses and adjust the distance, and use the A* overall situation
Path optimizing algorithm is that address space left plans an initial distribution route, then using current location as starting point, can plan ground
It is used as the object of planning in the set of location, since current location, utilizes A* global path optimizing algorithm in address set that can plan,
It adjusts the distance according to the point in calculated set, selects next dispatching address, by the address from can plan in address set
Remove, and assign it as the current address of next round, repeat above step, until can plan address set be it is empty, finally and mesh
Ground be connected, form an initial current express delivery distribution route；Finally, recycling the local paths planning of A* algorithm first to this
Beginning route is further optimized, and carries out partial operation that can plan within the scope of address set and current location and destination,
And the route to ensure newly to constitute is one and is finally reached destination by that can plan address set from current location
Local route finally obtains current optimal distribution route then by repeating the operation several times up to being unable to improve；
Step 4, the optimal route details planned are shown in the form of text and map, it may be necessary to select voice
Broadcast function, the current optimal dispatching express delivery route of real-time broadcasting；
Step 5, by computer software, meet the operation of any mobile terminal Android, the result that step 4 is obtained passes
On the defeated mobile terminal Android carried to dispatching person.
2. according to claim 1 be based on Android multiple spot express delivery allocator, it is characterised in that tied in the step 2
The SDK for closing Baidu map application, the optimal Distribution path before being set out using the global path optimizing planning of A* algorithm, and to dispatching
The problems such as express delivery information change occurred in the process, reuses A* global path optimizing algorithm and plans current optimal dispatching again
Path.
3. according to claim 2 be based on Android multiple spot express delivery allocator, it is characterised in that right in the step 3
Some Iterim Change situations are learnt in delivery process in courier, can not such as be dispensed, be dispensed address change, or be connected to new
The express deliveries information such as pickup order change the problems such as, reuse after A* global path optimizing algorithm plan again formed one newly
After current express delivery distribution route, the local paths planning of A* algorithm is recycled further to optimize the original route, In
It can plan and carry out partial operation within the scope of address set and current location and destination, and the route to ensure newly to constitute is one
It is finally reached the local route of destination, then by the way that behaviour is repeated several times from current location by that can plan address set
Make to finally obtain current optimal distribution route up to being unable to improve.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610983582.9A CN106600036B (en) | 2016-11-09 | 2016-11-09 | Based on Android multiple spot express delivery allocator |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610983582.9A CN106600036B (en) | 2016-11-09 | 2016-11-09 | Based on Android multiple spot express delivery allocator |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106600036A CN106600036A (en) | 2017-04-26 |
| CN106600036B true CN106600036B (en) | 2019-10-29 |
Family
ID=58590779
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610983582.9A Active CN106600036B (en) | 2016-11-09 | 2016-11-09 | Based on Android multiple spot express delivery allocator |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106600036B (en) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107133771A (en) * | 2017-06-05 | 2017-09-05 | 北京联合大学 | The unmanned express delivery car delivery system in garden and its automatic delivery method |
| CN109218125A (en) * | 2017-07-07 | 2019-01-15 | 北京京东尚科信息技术有限公司 | A kind of method and system of heartbeat data interaction |
| CN109389237B (en) * | 2017-08-08 | 2022-05-24 | 阿里巴巴集团控股有限公司 | Path planning method and device |
| CN107918850A (en) * | 2017-10-30 | 2018-04-17 | 努比亚技术有限公司 | A kind of express delivery information processing method, terminal and computer-readable recording medium |
| CN108629532A (en) * | 2017-10-31 | 2018-10-09 | 淄博职业学院 | A kind of waybill management method pulled during sending express mail |
| CN108415428B (en) * | 2018-02-11 | 2021-04-30 | 弗徕威智能机器人科技（上海）有限公司 | Global path optimization method of mobile robot |
| CN108627170A (en) * | 2018-04-13 | 2018-10-09 | 上海电机学院 | A kind of path optimization's visualization method |
| CN108710542A (en) * | 2018-05-16 | 2018-10-26 | 黄洲 | A kind of employment dating site of mission mode |
| CN109118006B (en) * | 2018-08-17 | 2021-05-28 | 安吉汽车物流股份有限公司 | Method and device for determining carpooling route, storage medium and computing equipment |
| CN109062256A (en) * | 2018-08-31 | 2018-12-21 | 深圳市研本品牌设计有限公司 | A kind of food delivery unmanned plane |
| CN109242214A (en) * | 2018-10-25 | 2019-01-18 | 中国联合网络通信集团有限公司 | Distribution route planing method and distribution route device for planning |
| CN111815212B (en) * | 2019-04-11 | 2024-06-25 | 北京三快在线科技有限公司 | Path planning method, device and storage medium |
| CN110264126A (en) * | 2019-05-21 | 2019-09-20 | 重庆邮电大学 | The method and system of the express mail parameter online change contract of real-time response user instruction |
| CN110826746B (en) * | 2019-11-01 | 2020-11-10 | 贝壳找房(北京)科技有限公司 | Management method for on-line invited house-viewing and management method for on-line reserved house-viewing |
| CN111723999B (en) * | 2020-06-28 | 2024-10-22 | 北京京东乾石科技有限公司 | Distribution route determining method, device, equipment and storage medium |
| CN111784045B (en) * | 2020-06-29 | 2023-09-22 | 北京百度网讯科技有限公司 | Optimization method, device, equipment and storage medium for delivery vehicle |
| CN114415669A (en) * | 2021-12-27 | 2022-04-29 | 江铃汽车股份有限公司 | Article delivery method, system, storage medium and article delivery robot |
| CN117313979B (en) * | 2023-11-30 | 2024-02-20 | 湖南木屋网络科技有限公司 | Distribution route planning method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315731A (en) * | 2008-07-17 | 2008-12-03 | 上海途锐信息技术有限公司 | System for implementing vehicle monitoring scheduling by GPS intelligent vehicle mounted terminal |
| CN103927639A (en) * | 2014-02-10 | 2014-07-16 | 武汉科技大学 | Steel product logistics system and scheduling method thereof based on real-time information |
| CN105046338A (en) * | 2015-08-24 | 2015-11-11 | 扬州大学 | Intelligent express distribution method on mobile platform |
-
2016
- 2016-11-09 CN CN201610983582.9A patent/CN106600036B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315731A (en) * | 2008-07-17 | 2008-12-03 | 上海途锐信息技术有限公司 | System for implementing vehicle monitoring scheduling by GPS intelligent vehicle mounted terminal |
| CN103927639A (en) * | 2014-02-10 | 2014-07-16 | 武汉科技大学 | Steel product logistics system and scheduling method thereof based on real-time information |
| CN105046338A (en) * | 2015-08-24 | 2015-11-11 | 扬州大学 | Intelligent express distribution method on mobile platform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106600036A (en) | 2017-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106600036B (en) | Based on Android multiple spot express delivery allocator | |
| CN105046338B (en) | Intelligent express delivery allocator on mobile platform | |
| CN104809601B (en) | The mutual auxiliary system of express delivery based on electronic map | |
| CN109034575A (en) | A kind of jockey's intelligent dispatching method | |
| CN105303817A (en) | Travel manner planning method and device | |
| CN107464018A (en) | A kind of Distribution path optimization method and device, computer equipment, storage medium | |
| CN108764765A (en) | One kind sending determining method of path, device, terminal and storage medium with charge free | |
| CN105976038A (en) | Shuttle bus customization system based on user requirements | |
| CN110046749A (en) | It is a kind of based on real-time road electric business package with city o2o wrap up Common Distribution system | |
| US20190303866A1 (en) | Method of providing information about logistics delivery route by using future traffic information and server for performing the same | |
| CN106709678A (en) | Object transportation method and system | |
| CN105069594A (en) | Transport processing method, device, terminal and server | |
| CN114298419A (en) | Multi-type intermodal transportation planning method and device, electronic equipment and storage medium | |
| CN105868939A (en) | Automatic distribution method and system of delivery objects | |
| CN105702017A (en) | Vehicle scheduling method and device | |
| CN109214732A (en) | Method, device and equipment for selecting logistics objects and determining logistics line overload | |
| CN113554387A (en) | Driver preference-based e-commerce logistics order allocation method, device, equipment and storage medium | |
| CN110232542A (en) | A kind of express mail Distribution path planing method of real-time response system variation instruction | |
| CN104063831A (en) | Method and device for providing railway route schemes | |
| Santi et al. | A future of shared mobility | |
| CN112001646A (en) | Material scheduling method and device, storage medium and electronic equipment | |
| Kłodawski et al. | Route planning with dynamic information from the EPLOS system | |
| Puskás et al. | Concepting freight holding problems for platoons in physical internet systems | |
| CN114331342A (en) | Dispatching method, device and equipment for distribution resources | |
| KR101867453B1 (en) | Real-time Sharing Method of Cargo Transportation Information through Cargo Information Sharing Community centered on Cloud Hub with the Enforced Dynamic Routing and State Change Adaptability |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |