CN108681861A - A kind of Distribution path method and device for planning - Google Patents
A kind of Distribution path method and device for planning Download PDFInfo
- Publication number
- CN108681861A CN108681861A CN201810631421.2A CN201810631421A CN108681861A CN 108681861 A CN108681861 A CN 108681861A CN 201810631421 A CN201810631421 A CN 201810631421A CN 108681861 A CN108681861 A CN 108681861A
- Authority
- CN
- China
- Prior art keywords
- dispatching
- planned
- point
- priority
- highest
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of Distribution path method and device for planning, by carrying out Allocation plan from the height of priority, the best insertion sequence of current planning point to be dispensed is calculated successively, in the determination of best insertion sequence, consider distance costs and time cost, existing Distribution path planing method is solved based on whole consideration, it is arranged generally by by the sequence of all dispatching points to be planned, and calculate distribution cost, select the Distribution path of least cost, this method can accurately determine planning path when being directed to the dispatching object of smallest number, but it is directed to the more situation of dispatching number of objects, then need the huge computing capability of server, the technical issues of consuming more computing resource.
Description
Technical field
The present invention relates to data processing field more particularly to a kind of Distribution path method and device for planning.
Background technology
Existing Distribution path planing method dispenses the suitable of point based on whole consideration, generally by by all to be planned
Sequence is arranged, and calculates distribution cost, and the Distribution path of least cost, this method is selected to be directed to the dispatching pair of smallest number
As when can accurately determine planning path, but be directed to the more situation of dispatching number of objects, then need server huge
Computing capability consumes more computing resource.
Invention content
A kind of Distribution path planing method provided by the invention solves existing Distribution path planing method and is based on entirety
The considerations of, it is arranged generally by by the sequence of all dispatching points to be planned, and calculate distribution cost, selects least cost
Distribution path, planning path can be accurately determined when this method is directed to the dispatching object of smallest number, but be directed to and match
The technical issues of sending the situation that number of objects is more, then needing the huge computing capability of server, consume more computing resource.
A kind of Distribution path planing method provided by the invention, including：
It determines dispatching starting point, and a dispatching to be planned is chosen in dispatching point to be planned according to initial point selection rule
Point is determined from the dispatching starting point to having planned that dispatching point is initial Distribution path to have planned dispatching point；
Calculate separately when the dispatching of the highest dispatching point to be planned of priority in dispatching point to be planned be set in sequence in it is each
Corresponding time value added and apart from value added before the dispatching sequence of planning dispatching point and after dispatching sequence, the time increasing
It is value added for be arranged all planned after the highest dispatching point to be planned of the priority dispatching point total waiting distribution times and
The difference of total waiting distribution time of dispatching point has all been planned before the highest dispatching point to be planned of the priority is set, it is described
It is total dispatching distance and the setting priority after the highest dispatching to be planned of the setting priority apart from value added
Total dispatching before highest dispatching point to be planned is apart from its difference；
Determine the time value added and the weights apart from value added, and by the time value added and the distance
Value added is weighted to obtain and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of the priority；
It calculates the highest dispatching point to be planned of the priority and dispenses the Direct Distribution cost of starting point to described, and calculate
The difference of the Direct Distribution cost and the distribution cost value obtains dispatching benefit value；
Determine that the corresponding dispatching sequence of the minimum dispatching benefit value is the highest dispatching point to be planned of the priority
Dispatching sequence, be sequentially inserted into the highest dispatching point to be planned of the priority according to the dispatching, and update and described initially match
Path is sent, determines that the highest dispatching point to be planned of the priority is to have planned dispatching point.
Optionally, the time value added is specially following formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newThe total etc. of dispatching point has all been planned after the highest dispatching point to be planned of the priority to be arranged
Time to be dispensed, wrAll to have planned that total waiting of dispatching point is matched before the highest dispatching point to be planned of the priority is arranged
Send the time.
Optionally, it is described apart from value added be specially following formula：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of the priority, and i is the highest dispatching point to be planned of the priority
Planning before setting sequence dispenses point, and j is the rule after the highest dispatching point setting sequence to be planned of the priority
Dispatching point is drawn, d is distance, c11(i (u), u, j (u)) is described apart from value added, and μ is preset constant.
Optionally, the determination time value added and the weights apart from value added, and the time is increased
Value and it is described be weighted to obtain apart from value added it is corresponding with the highest each dispatching sequence of dispatching point to be planned of the priority
Distribution cost value specifically include：
Determine the time value added and the weights apart from value added, and by the time value added and the distance
Value added obtains match corresponding with the highest each dispatching sequence of dispatching point to be planned of the priority according to the first preset formula
Send value at cost, wherein first preset formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is the time value added, and c1 (i, u, j) is described
Distribution cost value.
Optionally, calculate the priority it is highest it is to be planned dispatching point to it is described dispatching starting point Direct Distribution at
This, and the difference of the Direct Distribution cost and the distribution cost value is calculated, it obtains dispatching benefit value and specifically includes：
The highest dispatching point to be planned of the priority is calculated to the Direct Distribution cost for dispensing starting point, and according to
Second preset formula calculates the difference of the Direct Distribution cost and the distribution cost value, obtains dispatching benefit value, wherein described
Second preset formula is specially：
C2 (i (u), u, j (u))=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is the dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is the dispatching benefit value.
A kind of Distribution path device for planning provided by the invention, including：
First determining module, for determining dispatching starting point, and according to initial point selection rule in dispatching point to be planned
It is to have planned dispatching point to choose a dispatching point to be planned, determining initially to match to dispatching point has been planned from the dispatching starting point
Send path；
First computing module, for calculate separately work as it is to be planned dispatching point in priority it is highest it is to be planned dispatching point match
It send before being set in sequence in each dispatching sequence for having planned dispatching point and corresponding time value added and distance after dispatching sequence
Value added, the time value added are that the highest dispatching point to be planned of the setting priority has all planned dispatching point later
Total total waiting for waiting for distribution time and all having planned dispatching point before the highest dispatching point to be planned of the priority is set
The difference of distribution time, it is described apart from value added be the highest dispatching point to be planned of the setting priority after total dispatching distance
And the total dispatching being arranged before the highest dispatching to be planned of the priority is apart from its difference；
Second determining module, for determining the time value added and the weights apart from value added, and will be described when
Between value added and it is described be weighted to obtain apart from value added it is suitable with each dispatching of the highest dispatching point to be planned of the priority
The corresponding distribution cost value of sequence；
Second computing module, for calculating the highest dispatching point to be planned of the priority to the straight of the dispatching starting point
Distribution cost is connect, and calculates the difference of the Direct Distribution cost and the distribution cost value, obtains dispatching benefit value；
Third determining module, for determining the corresponding dispatching sequence of the minimum dispatching benefit value for the priority most
The dispatching sequence of high dispatching point to be planned is sequentially inserted into the highest dispatching point to be planned of the priority according to the dispatching,
And the initial Distribution path is updated, determine that the highest dispatching point to be planned of the priority is to have planned dispatching point.
Optionally, the time value added is specially following formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newThe total etc. of dispatching point has all been planned after the highest dispatching point to be planned of the priority to be arranged
Time to be dispensed, wrAll to have planned that total waiting of dispatching point is matched before the highest dispatching point to be planned of the priority is arranged
Send the time.
Optionally, it is described apart from value added be specially following formula：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of the priority, and i is the highest dispatching point to be planned of the priority
Planning before setting sequence dispenses point, and j is the rule after the highest dispatching point setting sequence to be planned of the priority
Dispatching point is drawn, d is distance, c11(i (u), u, j (u)) is described apart from value added, and μ is preset constant.
Optionally, second determining module is specifically used for：
Determine the time value added and the weights apart from value added, and by the time value added and the distance
Value added obtains match corresponding with the highest each dispatching sequence of dispatching point to be planned of the priority according to the first preset formula
Send value at cost, wherein first preset formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is the time value added, and c1 (i, u, j) is described
Distribution cost value.
Optionally, second computing module is specifically used for：
The highest dispatching point to be planned of the priority is calculated to the Direct Distribution cost for dispensing starting point, and according to
Second preset formula calculates the difference of the Direct Distribution cost and the distribution cost value, obtains dispatching benefit value, wherein described
Second preset formula is specially：
C2 (i (u), u, j (u))=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is the dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is the dispatching benefit value.
As can be seen from the above technical solutions, the present invention has the following advantages：
A kind of Distribution path planing method provided by the invention, including：It determines dispatching starting point, and is chosen according to initial point
It is to have planned dispatching point that rule chooses a dispatching point to be planned in dispatching point to be planned, determine from the dispatching starting point to
Plan that dispatching point is initial Distribution path；It calculates separately when the highest dispatching point to be planned of priority in dispatching point to be planned
Dispatching be set in sequence in before each dispatching sequence for having planned dispatching point and after dispatching sequence corresponding time value added and away from
From value added, the time value added is all to have planned dispatching point after the highest dispatching point to be planned of priority is arranged
Total wait for distribution time and all planned the total etc. of dispatching point before the highest dispatching point to be planned of the priority is set
The difference of time to be dispensed, it is described apart from value added be the highest dispatching point to be planned of the setting priority after it is total dispense away from
From and the highest dispatching point to be planned of the setting priority before it is total dispense with a distance from its difference；Determine the time value added and
The weights apart from value added, and by the time value added and it is described apart from value added be weighted to obtain with it is described preferential
Spend the corresponding distribution cost value of each dispatching sequence of highest dispatching point to be planned；Calculate that the priority is highest to be planned to match
The Direct Distribution cost for a little arriving the dispatching starting point is sent, and calculates the Direct Distribution cost and the distribution cost value
Difference obtains dispatching benefit value；Determine that the corresponding dispatching sequence of the minimum dispatching benefit value waits for for the priority is highest
The dispatching sequence of planning dispatching point, is sequentially inserted into the highest dispatching point to be planned of the priority, and update according to the dispatching
The initial Distribution path determines that the highest dispatching point to be planned of the priority is to have planned dispatching point, by from priority
Height carry out Allocation plan, calculate the best insertion sequence of current planning point to be dispensed successively, determined in best insertion sequence
On, it is contemplated that distance costs and time cost solve existing Distribution path planing method based on whole consideration, usually
By arranging the sequence of all dispatching points to be planned, and distribution cost is calculated, selects the Distribution path of least cost, this
Kind method can accurately determine planning path when being directed to the dispatching object of smallest number, but it is more to be directed to dispatching number of objects
The case where, then the technical issues of needing the huge computing capability of server, consume more computing resource.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention without having to pay creative labor, may be used also for those of ordinary skill in the art
To obtain other attached drawings according to these attached drawings.
Fig. 1 is a kind of flow diagram of one embodiment of Distribution path planing method provided in an embodiment of the present invention；
Fig. 2 is a kind of flow signal of another embodiment of Distribution path planing method provided in an embodiment of the present invention
Figure；
Fig. 3 is a kind of structural schematic diagram of one embodiment of Distribution path device for planning provided in an embodiment of the present invention.
Specific implementation mode
In order to make the invention's purpose, features and advantages of the invention more obvious and easy to understand, below in conjunction with the present invention
Attached drawing in embodiment, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that disclosed below
Embodiment be only a part of the embodiment of the present invention, and not all embodiment.Based on the embodiments of the present invention, this field
All other embodiment that those of ordinary skill is obtained without making creative work, belongs to protection of the present invention
Range.
Fig. 1 is a kind of flow chart of one embodiment of Distribution path planing method provided by the invention, as shown in Figure 1,
The embodiment of the present invention can be applied to server, and Distribution path planing method provided in an embodiment of the present invention may include：
Step S100：It determines dispatching starting point, and one is chosen in dispatching point to be planned according to initial point selection rule
Dispatching point to be planned is to have planned dispatching point, is determined from dispatching starting point to having planned that dispatching point is initial Distribution path；
In the embodiment of the present invention, when carrying out Distribution path planning, it is thus necessary to determine that dispatching starting point, and according to initially clicking
It is to have planned dispatching point to take rule to choose a dispatching point to be planned in dispatching point to be planned, is determined from dispatching starting point to
Planning dispatching point is initial Distribution path；
It should be noted that initial point selection rule can be：
It is farthest preferential, that is, it selects the customer farthest from dispatching starting point to have planned dispatching point, obtains a paths；
It is preferential recently, that is, it selects the customer nearest from dispatching starting point to have planned dispatching point, obtains a paths；
Earliest finish time is preferential, that is, selects time window finish time earliest customer to have planned dispatching point, obtain one
Paths；
Late finish time is preferential, that is, selects the customer of time window finish time at the latest to have planned dispatching point, obtain one
Paths；
Earliest start time is preferential, that is, selects time window time started earliest customer to have planned dispatching point, obtain one
Paths；
Late start time is preferential, that is, selects the customer of time window time started at the latest to have planned dispatching point, obtain one
Paths；
Time window is most short preferential, that is, selects the shortest customer of time window to have planned dispatching point, obtain a paths；
Time window longest is preferential, that is, selects the longest customer of time window to have planned dispatching point, obtain a paths；
At random, that is, it is to have planned dispatching point to randomly choose a customer, obtains a paths；
Step S101, it calculates separately when the dispatching sequence of the highest dispatching point to be planned of priority in dispatching point to be planned is set
Set before the dispatching sequence for respectively having planned dispatching point and after dispatching sequence corresponding time value added and apart from value added, when
Between value added be arranged priority it is highest it is to be planned dispatching point after all planned dispatching point total waiting distribution times and
All plan that the difference of total waiting distribution time of dispatching point, distance increase before the highest dispatching point to be planned of priority is set
Value is the total dispatching distance and the setting highest dispatching to be planned of priority after the highest dispatching to be planned of setting priority
Total dispatching before point is apart from its difference；
It determines dispatching starting point, and a dispatching to be planned is chosen in dispatching point to be planned according to initial point selection rule
Point determines from dispatching starting point to after having planned that dispatching point is initial Distribution path to have planned dispatching point, needs to count respectively
It calculates and dispenses matching for point when the dispatching to be planned for dispensing the highest dispatching point to be planned of priority in point is set in sequence in each planned
It send before sequence and corresponding time value added and apart from value added after dispatching sequence, time value added is that priority is arranged most
All plan that total waiting distribution time and the setting priority of dispatching point are highest to be planned after high dispatching point to be planned
The differences of total waiting distribution times of dispatching point have all been planned in dispatching before, and apart from value added, to be arranged, priority is highest to be waited for
Total total dispatching for dispensing distance and being arranged before the highest dispatching to be planned of priority after planning dispatching is apart from its difference；
It is understood that firstly the need of the highest dispatching point to be planned of priority in determination dispatching point to be planned, preferentially
Degree height can be according to the grade object to be dispensed of the client of dispatching point to be planned significance level or client
Distribution time urgency is determined；
Later, it calculates separately when the dispatching of the highest dispatching point to be planned of priority in dispatching point to be planned is set in sequence in
Corresponding time value added and apart from value added before each dispatching sequence for having planned dispatching point and after dispatching sequence, for example,
When having planned that the dispatching sequence of dispatching point is A-B-C-D, the highest dispatching point to be planned of priority that previous step determines is E, first
First E is arranged before the dispatching sequence of A, i.e. E-A-B-C-D, and calculates time value added and apart from value added, E is arranged later
After the dispatching sequence of A, i.e. A-E-B-C-D, and calculate time value added and apart from value added, and so on, it calculates E and exists
Corresponding time value added and apart from value added before each dispatching sequence for having planned dispatching point and after dispatching sequence；
Optionally, time value added is specially following formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newAll to have planned that total waiting of dispatching point is matched after the highest dispatching point to be planned of setting priority
Send time, wrAll to have planned total waiting distribution time of dispatching point before the highest dispatching point to be planned of setting priority；
Optionally, it is specially following formula apart from value added：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of priority, and i is the highest dispatching point setting sequence to be planned of priority
Planning before dispenses point, and j is that the planning after the highest dispatching point setting sequence to be planned of priority dispenses point, and d is
Distance, c11(i (u), u, j (u)) is apart from value added, and μ is preset constant；
Step S102：Determine time value added and the weights apart from value added, and by time value added and apart from value added
It is weighted to obtain and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority；
It is calculating separately when the dispatching of the highest dispatching point to be planned of priority in dispatching point to be planned is set in sequence in respectively
It has planned before the dispatching sequence of dispatching point and corresponding time value added and apart from value added after dispatching sequence, time increase
Value is all to have planned that total waiting distribution times of dispatching point and setting are excellent after the highest dispatching to be planned of priority is arranged
The difference that total waiting distribution time of dispatching point has all been planned before first spending highest dispatching point to be planned, is to set apart from value added
It sets the highest total dispatching distance to be planned dispensed after putting of priority and is arranged before the highest dispatching point to be planned of priority
It is total dispatching after its difference, it is thus necessary to determine that time value added and the weights apart from value added, and by time value added and away from
It is weighted to obtain and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority from value added；
Optionally it is determined that time value added and the weights apart from value added, and by time value added and apart from value added into
Row weighting obtains specifically including with the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority：
Determine time value added and the weights apart from value added, and pre- according to first by time value added and apart from value added
If formula obtains and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority, wherein first is pre-
If formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is time value added, and c1 (i, u, j) is distribution cost
Value；
Step S103：It calculates the highest dispatching point to be planned of priority and arrives the Direct Distribution cost of dispatching starting point, and count
The difference for calculating Direct Distribution cost and distribution cost value obtains dispatching benefit value；
It is determining time value added and is being weighted apart from the weights of value added, and by time value added and apart from value added
It obtains, with after the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority, needing to calculate priority
Highest dispatching point to be planned arrives the Direct Distribution cost of dispatching starting point, and calculates Direct Distribution cost and distribution cost value
Difference obtains dispatching benefit value；
Optionally, it calculates the highest dispatching point to be planned of priority and arrives the Direct Distribution cost of dispatching starting point, and calculate
The difference of Direct Distribution cost and distribution cost value obtains dispatching benefit value and specifically includes：
The highest dispatching point to be planned of priority is calculated to the Direct Distribution cost for dispensing starting point, and default according to second
Formula calculates the difference of Direct Distribution cost and distribution cost value, obtains dispensing benefit value, wherein the second preset formula is specially：
C2 (i (u), u, j (u))=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is dispatching benefit value；
Step S104：Determine that the corresponding dispatching sequence of minimum dispatching benefit value is the highest dispatching point to be planned of priority
Dispatching sequence, be sequentially inserted into the highest dispatching point to be planned of priority according to dispatching, and update initial Distribution path, determine excellent
It is to have planned dispatching point first to spend highest dispatching point to be planned；
Direct Distribution cost of the highest dispatching point to be planned of priority to dispatching starting point is being calculated, and is calculating and directly matches
The difference for sending cost and distribution cost value, obtain dispatching benefit value after, it is thus necessary to determine that the minimum corresponding dispatching of dispatching benefit value
Sequence is the dispatching sequence of the highest dispatching point to be planned of priority, is sequentially inserted into that priority is highest to be planned to match according to dispatching
It send a little, and updates initial Distribution path, determine that the highest dispatching point to be planned of priority is to have planned dispatching point；
For example, ought plan that the dispatching sequence of dispatching point is A-B-C-D, the priority that previous step determines is highest to be planned
Dispatching point is E, it is minimum to calculate dispatching benefit value of the dispatching sequence of E between CD at this time, it is determined that Distribution path at this time
For A-B-C-E-D, the role of E is also become having planned dispatching point from dispatching point to be planned at this time；
A kind of Distribution path planing method provided in an embodiment of the present invention, including：Determine dispatching starting point, and according to initial
It is to have planned dispatching point that point selection rule chooses a dispatching point to be planned in dispatching point to be planned, is determined from dispatching starting point
Point is dispensed as initial Distribution path to having planned；It calculates separately when the highest dispatching point to be planned of priority in dispatching point to be planned
Dispatching be set in sequence in before each dispatching sequence for having planned dispatching point and after dispatching sequence corresponding time value added with
Apart from value added, time value added is dispatching point has all been planned after the highest dispatching point to be planned of priority is arranged total etc.
Total waiting distribution time of dispatching point has all been planned before time to be dispensed and the highest dispatching point to be planned of setting priority
Difference, apart from value added be arranged priority it is highest it is to be planned dispatching point after total dispatching distance and be arranged priority highest
Dispatching point to be planned before it is total dispatching apart from its difference；Determine time value added and the weights apart from value added, and by the time
Value added and it is weighted to obtain match corresponding with the highest each dispatching sequence of dispatching point to be planned of priority apart from value added
Send value at cost；The highest dispatching point to be planned of priority is calculated to the Direct Distribution cost for dispensing starting point, and calculates and directly matches
The difference for sending cost and distribution cost value obtains dispatching benefit value；Determine that the corresponding dispatching sequence of minimum dispatching benefit value is excellent
The dispatching sequence for first spending highest dispatching point to be planned, the highest dispatching point to be planned of priority is sequentially inserted into according to dispatching, and
Initial Distribution path is updated, determines that the highest dispatching point to be planned of priority is to have planned dispatching point, passes through the height from priority
Low carry out Allocation plan, the best insertion sequence for calculating current planning point to be dispensed successively are examined in the determination of best insertion sequence
Consider distance costs and time cost, solves consideration of the existing Distribution path planing method based on entirety, generally by
The sequence of all dispatching points to be planned is arranged, and calculates distribution cost, selects the Distribution path of least cost, this side
Method can accurately determine planning path when being directed to the dispatching object of smallest number, but be directed to the more feelings of dispatching number of objects
The technical issues of condition then needs the huge computing capability of server, consumes more computing resource.
The above is the detailed description carried out to a kind of one embodiment of Distribution path planing method, will be matched below to one kind
Another embodiment of paths planning method is sent to be described in detail.
Referring to Fig. 2, a kind of another embodiment of Distribution path planing method provided by the invention, including：
Step S200：It determines dispatching starting point, and one is chosen in dispatching point to be planned according to initial point selection rule
Dispatching point to be planned is to have planned dispatching point, is determined from dispatching starting point to having planned that dispatching point is initial Distribution path；
In the embodiment of the present invention, when carrying out Distribution path planning, it is thus necessary to determine that dispatching starting point, and according to initially clicking
It is to have planned dispatching point to take rule to choose a dispatching point to be planned in dispatching point to be planned, is determined from dispatching starting point to
Planning dispatching point is initial Distribution path；
Step S201, it calculates separately when the dispatching sequence of the highest dispatching point to be planned of priority in dispatching point to be planned is set
Set before the dispatching sequence for respectively having planned dispatching point and after dispatching sequence corresponding time value added and apart from value added, when
Between value added be arranged priority it is highest it is to be planned dispatching point after all planned dispatching point total waiting distribution times and
All plan that the difference of total waiting distribution time of dispatching point, distance increase before the highest dispatching point to be planned of priority is set
Value is the total dispatching distance and the setting highest dispatching to be planned of priority after the highest dispatching to be planned of setting priority
Total dispatching before point is apart from its difference, wherein time value added is specially following formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newAll to have planned that total waiting of dispatching point is matched after the highest dispatching point to be planned of setting priority
Send time, wrAll to have planned total waiting distribution time of dispatching point before the highest dispatching point to be planned of setting priority；
It is specially following formula apart from value added：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of priority, and i is the highest dispatching point setting sequence to be planned of priority
Planning before dispenses point, and j is that the planning after the highest dispatching point setting sequence to be planned of priority dispenses point, and d is
Distance, c11(i (u), u, j (u)) is apart from value added, and μ is preset constant；
It determines dispatching starting point, and a dispatching to be planned is chosen in dispatching point to be planned according to initial point selection rule
Point determines from dispatching starting point to after having planned that dispatching point is initial Distribution path to have planned dispatching point, needs to count respectively
It calculates and dispenses matching for point when the dispatching to be planned for dispensing the highest dispatching point to be planned of priority in point is set in sequence in each planned
It send before sequence and corresponding time value added and apart from value added after dispatching sequence, time value added is that priority is arranged most
All plan that total waiting distribution time and the setting priority of dispatching point are highest to be planned after high dispatching point to be planned
The differences of total waiting distribution times of dispatching point have all been planned in dispatching before, and apart from value added, to be arranged, priority is highest to be waited for
Total total dispatching for dispensing distance and being arranged before the highest dispatching to be planned of priority after planning dispatching is apart from its difference；
Step S202：Determine time value added and the weights apart from value added, and by time value added and apart from value added
According to the first preset formula obtain with the corresponding distribution cost value of each dispatching sequence of the highest dispatching point to be planned of priority,
In, the first preset formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is time value added, and c1 (i, u, j) is distribution cost
Value；
It is calculating separately when the dispatching of the highest dispatching point to be planned of priority in dispatching point to be planned is set in sequence in respectively
It has planned before the dispatching sequence of dispatching point and corresponding time value added and apart from value added after dispatching sequence, time increase
Value is all to have planned that total waiting distribution times of dispatching point and setting are excellent after the highest dispatching to be planned of priority is arranged
The difference that total waiting distribution time of dispatching point has all been planned before first spending highest dispatching point to be planned, is to set apart from value added
It sets the highest total dispatching distance to be planned dispensed after putting of priority and is arranged before the highest dispatching point to be planned of priority
It is total dispatching after its difference, it is thus necessary to determine that time value added and the weights apart from value added, and by time value added and away from
It is obtained and the sequentially corresponding dispatching of each dispatching of the highest dispatching point to be planned of priority according to the first preset formula from value added
Value at cost；
Step S203：It calculates the highest dispatching point to be planned of priority and arrives the Direct Distribution cost of dispatching starting point, and press
The difference that Direct Distribution cost and distribution cost value are calculated according to the second preset formula obtains dispatching benefit value, wherein the second default public affairs
Formula is specially：
C2 (i (u), u, j (u))=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is dispatching benefit value；
Determining time value added and apart from the weights of value added, and by time value added and apart from value added according to first
Preset formula obtains, with after the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority, needing to count
The highest point to be planned that dispenses of priority is calculated to calculate directly to the Direct Distribution cost for dispensing starting point, and according to the second preset formula
The difference for connecing distribution cost and distribution cost value obtains dispatching benefit value；
Step S204：Determine that the corresponding dispatching sequence of minimum dispatching benefit value is the highest dispatching point to be planned of priority
Dispatching sequence, be sequentially inserted into the highest dispatching point to be planned of priority according to dispatching, and update initial Distribution path, determine excellent
It is to have planned dispatching point first to spend highest dispatching point to be planned；
Direct Distribution cost of the highest dispatching point to be planned of priority to dispatching starting point is being calculated, and pre- according to second
If formula calculate Direct Distribution cost and distribution cost value difference, obtain dispense benefit value after, it is thus necessary to determine that minimum dispatching
The corresponding dispatching sequence of benefit value is the dispatching sequence of the highest dispatching point to be planned of priority, is sequentially inserted into preferentially according to dispatching
Highest dispatching point to be planned is spent, and updates initial Distribution path, determines that the highest dispatching point to be planned of priority is to have planned
Dispatching point；
A kind of Distribution path planing method provided in an embodiment of the present invention, including：Determine dispatching starting point, and according to initial
It is to have planned dispatching point that point selection rule chooses a dispatching point to be planned in dispatching point to be planned, is determined from dispatching starting point
Point is dispensed as initial Distribution path to having planned；It calculates separately when the highest dispatching point to be planned of priority in dispatching point to be planned
Dispatching be set in sequence in before each dispatching sequence for having planned dispatching point and after dispatching sequence corresponding time value added with
Apart from value added, time value added is dispatching point has all been planned after the highest dispatching point to be planned of priority is arranged total etc.
Total waiting distribution time of dispatching point has all been planned before time to be dispensed and the highest dispatching point to be planned of setting priority
Difference, apart from value added be arranged priority it is highest it is to be planned dispatching point after total dispatching distance and be arranged priority highest
Dispatching point to be planned before it is total dispatching apart from its difference；Determine time value added and the weights apart from value added, and by the time
Value added and apart from value added according to the first preset formula obtain and priority it is highest it is to be planned dispatching point each dispatching sequence
Corresponding distribution cost value；It calculates the highest dispatching point to be planned of priority and arrives the Direct Distribution cost of dispatching starting point, and press
The difference that Direct Distribution cost and distribution cost value are calculated according to the second preset formula obtains dispatching benefit value；Determine minimum dispatching
The corresponding dispatching sequence of benefit value is the dispatching sequence of the highest dispatching point to be planned of priority, is sequentially inserted into preferentially according to dispatching
Highest dispatching point to be planned is spent, and updates initial Distribution path, determines that the highest dispatching point to be planned of priority is to have planned
Point is dispensed, by carrying out Allocation plan from the height of priority, calculates the best insertion sequence of current planning point to be dispensed successively,
In the determination of best insertion sequence, it is contemplated that distance costs and time cost solve existing Distribution path planing method base
In whole consideration, arranged generally by by the sequence of all dispatching points to be planned, and calculate distribution cost, selection is most
The Distribution path of low cost, can accurately determine planning path, but needle when this method is directed to the dispatching object of smallest number
In the case of dispatching number of objects is more, then the huge computing capability of server is needed, the skill of more computing resource is consumed
Art problem.
Referring to Fig. 3, Fig. 3 shows a kind of structural representation of Distribution path device for planning provided in an embodiment of the present invention
Figure, including：
First determining module 301, for determining dispatching starting point, and according to initial point selection rule in dispatching point to be planned
Middle to choose dispatching point to be planned be to have planned dispatching point, is determined from dispatching starting point to dispatching point has been planned initially to dispense
Path；
First computing module 302 works as the highest dispatching point to be planned of priority in dispatching point to be planned for calculating separately
Dispatching be set in sequence in before each dispatching sequence for having planned dispatching point and after dispatching sequence corresponding time value added with
Apart from value added, time value added is dispatching point has all been planned after the highest dispatching point to be planned of priority is arranged total etc.
Total waiting distribution time of dispatching point has all been planned before time to be dispensed and the highest dispatching point to be planned of setting priority
Difference, apart from value added be arranged priority it is highest it is to be planned dispatching point after total dispatching distance and be arranged priority highest
Dispatching point to be planned before it is total dispatching apart from its difference；
Second determining module 303, for determining time value added and apart from the weights of value added, and by time value added and
It is weighted to obtain and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority apart from value added；
Second computing module 304, for calculating priority highest dispatching point directly matching to dispatching starting point to be planned
Cost is sent, and calculates the difference of Direct Distribution cost and distribution cost value, obtains dispatching benefit value；
Third determining module 305, for determining that the corresponding dispatching sequence of minimum dispatching benefit value is that priority is highest
The dispatching sequence of dispatching point to be planned, is sequentially inserted into the highest dispatching point to be planned of priority, and update and initially match according to dispatching
Path is sent, determines that the highest dispatching point to be planned of priority is to have planned dispatching point.
Optionally, time value added is specially following formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newAll to have planned that total waiting of dispatching point is matched after the highest dispatching point to be planned of setting priority
Send time, wrAll to have planned total waiting distribution time of dispatching point before the highest dispatching point to be planned of setting priority.
Optionally, it is specially following formula apart from value added：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of priority, and i is the highest dispatching point setting sequence to be planned of priority
Planning before dispenses point, and j is that the planning after the highest dispatching point setting sequence to be planned of priority dispenses point, and d is
Distance, c11(i (u), u, j (u)) is apart from value added, and μ is preset constant.
Optionally, the second determining module 303 is specifically used for：
Determine time value added and the weights apart from value added, and pre- according to first by time value added and apart from value added
If formula obtains and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of priority, wherein first is pre-
If formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is time value added, and c1 (i, u, j) is distribution cost
Value.
Optionally, the second computing module 304 is specifically used for：
The highest dispatching point to be planned of priority is calculated to the Direct Distribution cost for dispensing starting point, and default according to second
Formula calculates the difference of Direct Distribution cost and distribution cost value, obtains dispensing benefit value, wherein the second preset formula is specially：
C2 (i (u), u, j (u)=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is dispatching benefit value.
Professional further appreciates that, unit described in conjunction with the examples disclosed in the embodiments of the present disclosure
And algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to function in the above description.These
Function is implemented in hardware or software actually, depends on the specific application and design constraint of technical solution.Profession
Technical staff can use different methods to achieve the described function each specific application, but this realization is not answered
Think beyond the scope of this invention.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest range caused.
Claims (10)
1. a kind of Distribution path planing method, which is characterized in that including：
It determines dispatching starting point, and chooses a dispatching point to be planned in dispatching point to be planned according to initial point selection rule and be
Plan that dispatching point, determination are initial Distribution path from the dispatching starting point to having planned that dispatching is put；
It calculates separately and has respectively been planned when the dispatching of the highest dispatching point to be planned of priority in dispatching point to be planned is set in sequence in
It dispenses before the dispatching sequence of point and corresponding time value added and apart from value added, the time value added after dispatching sequence
For total waiting distribution time and the setting of all having planned dispatching point after the highest dispatching point to be planned of the priority is arranged
The difference of total waiting distribution time of dispatching point, the distance have all been planned before the highest dispatching point to be planned of priority
Value added is the total dispatching distance and the setting priority highest after the highest dispatching to be planned of the setting priority
Dispatching point to be planned before it is total dispatching apart from its difference；
It determines the time value added and the weights apart from value added, and the time value added and the distance is increased
Value is weighted to obtain and the sequentially corresponding distribution cost value of each dispatching of the highest dispatching point to be planned of the priority；
The highest dispatching point to be planned of the priority is calculated to the Direct Distribution cost for dispensing starting point, and described in calculating
The difference of Direct Distribution cost and the distribution cost value obtains dispatching benefit value；
Determine that the corresponding dispatching sequence of the minimum dispatching benefit value is matching for the highest dispatching point to be planned of the priority
Sequence is sent, is sequentially inserted into the highest dispatching point to be planned of the priority according to the dispatching, and update the initial dispatching road
Diameter determines that the highest dispatching point to be planned of the priority is to have planned dispatching point.
2. Distribution path planing method according to claim 1, which is characterized in that the time value added is specially as follows
Formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newAll plan that total waiting of dispatching point is matched to be arranged after the highest dispatching point to be planned of the priority
Send time, wrFor all planned before the highest dispatching point to be planned of the priority is set dispatching point it is total etc. to be dispensed when
Between.
3. Distribution path planing method according to claim 2, which is characterized in that described specially as follows apart from value added
Formula：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of the priority, and i is the highest dispatching point setting to be planned of the priority
Planning before sequence dispenses point, and j is that the planning after the highest dispatching point setting sequence to be planned of the priority is matched
It send a little, d is distance, c11(i (u), u, j (u)) is described apart from value added, and μ is preset constant.
4. Distribution path planing method according to claim 3, which is characterized in that the determination time value added and
The weights apart from value added, and by the time value added and it is described apart from value added be weighted to obtain with it is described preferential
The corresponding distribution cost value of each dispatching sequence for spending highest dispatching point to be planned specifically includes：
It determines the time value added and the weights apart from value added, and the time value added and the distance is increased
Value according to the first preset formula obtain with the priority it is highest it is to be planned dispatching point each dispatching sequence it is corresponding dispatching at
This value, wherein first preset formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is the time value added, and c1 (i, u, j) is the dispatching
Value at cost.
5. Distribution path planing method according to claim 4, which is characterized in that calculate that the priority is highest to be waited advising
It draws dispatching point and dispenses the Direct Distribution cost of starting point to described, and calculate the Direct Distribution cost and the distribution cost value
Difference, obtain dispatching benefit value specifically include：
The highest dispatching point to be planned of the priority is calculated to the Direct Distribution cost for dispensing starting point, and according to second
Preset formula calculates the difference of the Direct Distribution cost and the distribution cost value, obtains dispatching benefit value, wherein described second
Preset formula is specially：
C2 (i (u), u, j (u))=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is the dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is the dispatching benefit value.
6. a kind of Distribution path device for planning, which is characterized in that including：
First determining module for determining dispatching starting point, and is chosen according to initial point selection rule in dispatching point to be planned
One dispatching point to be planned is determining initially to dispense road to dispatching point has been planned from the dispatching starting point to have planned dispatching point
Diameter；
First computing module, for calculating separately when the dispatching of the highest dispatching point to be planned of priority in dispatching point to be planned is suitable
Sequence is arranged before the dispatching sequence for respectively having planned dispatching point with corresponding time value added after dispatching sequence and apart from increase
Value, the time value added be all planned after the highest dispatching point to be planned of the setting priority dispatching point always etc.
The total etc. to be dispensed of dispatching point has all been planned before time to be dispensed and the highest dispatching point to be planned of the setting priority
The difference of time, it is described apart from value added be the highest dispatching point to be planned of the setting priority after total dispatching distance and set
Total dispatching before the highest dispatching to be planned of the priority is put is set apart from its difference；
Second determining module increases for determining the time value added and the weights apart from value added, and by the time
It is value added and it is described be weighted to obtain apart from value added it is right with each dispatching sequence of the highest dispatching point to be planned of the priority
The distribution cost value answered；
Second computing module, for calculating the priority highest dispatching point directly matching to the dispatching starting point to be planned
Cost is sent, and calculates the difference of the Direct Distribution cost and the distribution cost value, obtains dispatching benefit value；
Third determining module, for determining that the corresponding dispatching sequence of the minimum dispatching benefit value is that the priority is highest
The dispatching sequence of dispatching point to be planned, is sequentially inserted into the highest dispatching point to be planned of the priority, and more according to the dispatching
The new initial Distribution path determines that the highest dispatching point to be planned of the priority is to have planned dispatching point.
7. Distribution path device for planning according to claim 6, which is characterized in that the time value added is specially as follows
Formula：
c12(i (u), u, j (u))=wr_new-wr；
Wherein, wr_newAll plan that total waiting of dispatching point is matched to be arranged after the highest dispatching point to be planned of the priority
Send time, wrFor all planned before the highest dispatching point to be planned of the priority is set dispatching point it is total etc. to be dispensed when
Between.
8. Distribution path device for planning according to claim 7, which is characterized in that described specially as follows apart from value added
Formula：
c11(i (u), u, j (u))=diu+duj-μdij；
Wherein, u is the highest dispatching point to be planned of the priority, and i is the highest dispatching point setting to be planned of the priority
Planning before sequence dispenses point, and j is that the planning after the highest dispatching point setting sequence to be planned of the priority is matched
It send a little, d is distance, c11(i (u), u, j (u)) is described apart from value added, and μ is preset constant.
9. Distribution path device for planning according to claim 8, which is characterized in that second determining module is specifically used
In：
It determines the time value added and the weights apart from value added, and the time value added and the distance is increased
Value according to the first preset formula obtain with the priority it is highest it is to be planned dispatching point each dispatching sequence it is corresponding dispatching at
This value, wherein first preset formula is specially：
C1 (i, u, j)=a1c11(i(u),u,j(u))+a2c12(i(u),u,j(u))；
a1+a2=1；
a1≥0；
a1≥0；
Wherein, a1And a2For preset constant, c12(i (u), u, j (u)) is the time value added, and c1 (i, u, j) is the dispatching
Value at cost.
10. Distribution path device for planning according to claim 9, which is characterized in that second computing module is specifically used
In：
The highest dispatching point to be planned of the priority is calculated to the Direct Distribution cost for dispensing starting point, and according to second
Preset formula calculates the difference of the Direct Distribution cost and the distribution cost value, obtains dispatching benefit value, wherein described second
Preset formula is specially：
C2 (i (u), u, j (u))=λ d0u-c1(i(u),u,j(u))；
Wherein, 0 is the dispatching starting point, and λ is preset constant, and c2 (i (u), u, j (u)) is the dispatching benefit value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810631421.2A CN108681861A (en) | 2018-06-19 | 2018-06-19 | A kind of Distribution path method and device for planning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810631421.2A CN108681861A (en) | 2018-06-19 | 2018-06-19 | A kind of Distribution path method and device for planning |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108681861A true CN108681861A (en) | 2018-10-19 |
Family
ID=63811441
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810631421.2A Pending CN108681861A (en) | 2018-06-19 | 2018-06-19 | A kind of Distribution path method and device for planning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108681861A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11847596B1 (en) * | 2020-02-13 | 2023-12-19 | Tensorx, Inc. | Systems and methods for optimizing complex systems |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1790398A (en) * | 2005-12-28 | 2006-06-21 | 浙江工业大学 | Particle swarm optimization method for open vehicle routing problem with time windows |
| US20140214715A1 (en) * | 2013-01-30 | 2014-07-31 | Command Alkon Incorporated | Scheduling system and method for distribution of perishable loads of pre-mixed concrete to multiple sites |
| CN105184412A (en) * | 2015-09-21 | 2015-12-23 | 北京农业信息技术研究中心 | Logistics delivery route planning method and system based on geographic positions |
| CN106156897A (en) * | 2016-08-22 | 2016-11-23 | 武汉轻工大学 | Optimum path planning analog systems in logistics distribution |
| CN107203190A (en) * | 2017-05-18 | 2017-09-26 | 广州智能装备研究院有限公司 | A kind of inertial navigation AGV dispatching methods and system based on pahtfinder hard |
| CN107704980A (en) * | 2017-05-24 | 2018-02-16 | 重庆大学 | A kind of multiple agent towards the newly-increased express delivery pickup demand of processing is made decisions on one's own method |
-
2018
- 2018-06-19 CN CN201810631421.2A patent/CN108681861A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1790398A (en) * | 2005-12-28 | 2006-06-21 | 浙江工业大学 | Particle swarm optimization method for open vehicle routing problem with time windows |
| US20140214715A1 (en) * | 2013-01-30 | 2014-07-31 | Command Alkon Incorporated | Scheduling system and method for distribution of perishable loads of pre-mixed concrete to multiple sites |
| CN105184412A (en) * | 2015-09-21 | 2015-12-23 | 北京农业信息技术研究中心 | Logistics delivery route planning method and system based on geographic positions |
| CN106156897A (en) * | 2016-08-22 | 2016-11-23 | 武汉轻工大学 | Optimum path planning analog systems in logistics distribution |
| CN107203190A (en) * | 2017-05-18 | 2017-09-26 | 广州智能装备研究院有限公司 | A kind of inertial navigation AGV dispatching methods and system based on pahtfinder hard |
| CN107704980A (en) * | 2017-05-24 | 2018-02-16 | 重庆大学 | A kind of multiple agent towards the newly-increased express delivery pickup demand of processing is made decisions on one's own method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11847596B1 (en) * | 2020-02-13 | 2023-12-19 | Tensorx, Inc. | Systems and methods for optimizing complex systems |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108846610A (en) | A kind of Distribution path method and device for planning | |
| CN108335071A (en) | Dispense method for allocating tasks, device, electronic equipment and computer storage media | |
| CN107844882A (en) | Dispense task processing method, device and electronic equipment | |
| CN110278288A (en) | Method, apparatus, computer equipment and the storage medium of pre-dispensed vessels IP | |
| US20180308089A1 (en) | Settlement system, server device, terminal device, method and program | |
| CN102930431B (en) | Paying server and payment channel identification method | |
| CN108399103A (en) | A kind of resource data treating method and apparatus | |
| CN108428151A (en) | A kind of single method and apparatus of spelling | |
| CN108270581A (en) | Shared resource charge processing method and device | |
| CN107343023A (en) | Resource allocation methods, device and electronic equipment in a kind of Mesos management cluster | |
| CN103221970A (en) | Management device and management method | |
| CN108881043A (en) | Distribution method, device, equipment and the storage medium of portfolio in shared set meal | |
| EP1191776A2 (en) | Method for automatically changing an access contract between a prepaid contract and a postpaid contract | |
| CN115578199A (en) | Method, apparatus, device, medium, and product for processing row weight data in stock right incentive | |
| CN108681861A (en) | A kind of Distribution path method and device for planning | |
| CN109146444B (en) | Virtual account creating method and device and account information updating method and device | |
| CN109829648A (en) | Performance management method and apparatus | |
| CN112950365A (en) | Method and device for supplementing money between accounts | |
| CN108764853A (en) | Real-time commission computational methods, device, equipment and computer readable storage medium | |
| US11950173B2 (en) | Method of determining shared service index based on shared service of communication credential | |
| CN107016598B (en) | Virtual article charging method and device | |
| CN109190946A (en) | Business revenue data determination method, device, electronic equipment and storage medium | |
| CN112669160B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN115695210A (en) | Cloud server deployment method and device, electronic equipment and storage medium | |
| CN108053044A (en) | A kind of reserving method of banking, device for displaying predetermined and terminal device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181019 |