CN108665170A - Order allocation method and device - Google Patents
Order allocation method and device Download PDFInfo
- Publication number
- CN108665170A CN108665170A CN201810457793.8A CN201810457793A CN108665170A CN 108665170 A CN108665170 A CN 108665170A CN 201810457793 A CN201810457793 A CN 201810457793A CN 108665170 A CN108665170 A CN 108665170A
- Authority
- CN
- China
- Prior art keywords
- order
- knight
- dispatching
- target
- history
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063112—Skill-based matching of a person or a group to a task
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides order allocation methods and device, are related to order dispatching field.Order allocation method provided by the invention, volume is dispensed by the distribution information and order that have first got target order, then, the correlation degree of situation is dispensed according to the order information of target order and history knight, candidate knight is calculated in the case where the order of target order dispenses volume as constraints, receive the order probability of target order, finally determines push object according to order probability.Preference of the candidate knight to certain orders has been reacted since history knight dispenses situation, therefore, dispensing situation by history knight can be inferred that candidate knight to target order preference (preference is indicated by order probability), after determining candidate knight to the preference of target order, target order can be pushed to the knight more interesting to target order, the order probability of knight can be improved under conditions of controlling order dispatching volume to a certain extent.
Description
Technical field
The present invention relates to orders to dispense field, in particular to order allocation method and device.
Background technology
In recent years, with the prosperity of Internet technology, logistic industry has obtained quick development, this was but also in recent years
Logistics order volume becomes increasing.The problem of increase of logistics order volume is directly resulted in is exactly to dispense problem, if dispatching is asked
Topic processing is bad also to cause other chain reactions, such as the decline of user's susceptibility etc..In turn, dispatching efficiency how is improved
Just at each businessman concern the most.
Occur some schemes for the purpose of optimizing means of distribution in the related technology, these schemes are to a certain extent
The too low problem of dispatching efficiency can be improved, but still have shortcoming.
Invention content
The purpose of the present invention is to provide order allocation methods and device.
In a first aspect, an embodiment of the present invention provides order allocation methods, including：
The order information of target order is obtained, the order information includes distribution information and order dispatching volume；
The correlation degree that situation is dispensed according to the order information of target order and history knight calculates candidate knight in target
In the case that the order of order dispenses volume as constraints, receive the order probability of target order；History knight dispenses situation
Candidate knight has been reacted under conditions of different distribution informations and different order dispatching volumes, the probability accepted an order；
According to the push object of the order determine the probability target order of candidate knight.
Second aspect, the embodiment of the present invention additionally provide a kind of Order splitting device, including：
Acquisition module, the order information for obtaining target order, the order information include that distribution information and order are matched
Send volume；
First computing module, the correlation degree for dispensing situation according to the order information of target order and history knight,
Candidate knight is calculated in the case where the order of target order dispenses volume as constraints, the order for receiving target order is general
Rate；History knight dispenses situation and has reacted candidate knight under conditions of different distribution informations and different order dispatching volumes, receives
The probability of order；
First determining module is used for the push object of the order determine the probability target order according to candidate knight.
Order allocation method provided in an embodiment of the present invention, by the distribution information and order that have first got target order
Dispatching volume then dispenses the correlation degree of situation according to the order information of target order and history knight, calculates candidate knight
In the case where the order of target order dispenses volume as constraints, receive the order probability of target order, last foundation connects
Single probability determines push object.Preference of the candidate knight to certain orders has been reacted since history knight dispenses situation,
Situation, which is dispensed, by history knight can be inferred that (preference passes through order to candidate knight to target order preference
Probability indicates), after determining candidate knight to the preference of target order, target order can be pushed to target
The more interesting knight of order, to a certain extent can be under conditions of controlling order dispatching volume, and the order for improving knight is general
Rate.
To enable the above objects, features and advantages of the present invention to be clearer and more comprehensible, preferred embodiment cited below particularly, and coordinate
Appended attached drawing, is described in detail below.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to needed in the embodiment attached
Figure is briefly described, it should be understood that the following drawings illustrates only certain embodiments of the present invention, therefore is not construed as pair
The restriction of range for those of ordinary skill in the art without creative efforts, can also be according to this
A little attached drawings obtain other relevant attached drawings.
Fig. 1 shows the basic flow chart for the order allocation method that the embodiment of the present invention is provided；
Fig. 2 shows the optimized flow charts for the order allocation method that the embodiment of the present invention is provided；
Fig. 3 shows the basic module figure for the Order splitting device that the embodiment of the present invention is provided；
Fig. 4 shows the schematic diagram for the computing device that the embodiment of the present invention is provided.
Specific implementation mode
Below in conjunction with attached drawing in the embodiment of the present invention, technical solution in the embodiment of the present invention carries out clear, complete
Ground describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Usually exist
The component of the embodiment of the present invention described and illustrated in attached drawing can be arranged and be designed with a variety of different configurations herein.Cause
This, the detailed description of the embodiment of the present invention to providing in the accompanying drawings is not intended to limit claimed invention below
Range, but it is merely representative of the selected embodiment of the present invention.Based on the embodiment of the present invention, those skilled in the art are not doing
The every other embodiment obtained under the premise of going out creative work, shall fall within the protection scope of the present invention.
Below in conjunction with attached drawing in the embodiment of the present invention, technical solution in the embodiment of the present invention carries out clear, complete
Ground describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Usually exist
The component of the embodiment of the present invention described and illustrated in attached drawing can be arranged and be designed with a variety of different configurations herein.Cause
This, the detailed description of the embodiment of the present invention to providing in the accompanying drawings is not intended to limit claimed invention below
Range, but it is merely representative of the selected embodiment of the present invention.Based on the embodiment of the present invention, those skilled in the art are not doing
The every other embodiment obtained under the premise of going out creative work, shall fall within the protection scope of the present invention.
Present inventor pass through the study found that influence logistic industry dispatching efficiency (i.e. distribution time, distribution time can
To refer to that user places an order to user the time span received between order product) it is many because being known as, for example delivery system connects
Receive user release order efficiency, delivery system to knight assign order efficiency (could also say that knight's order efficiency),
The efficiency of knight's picking (obtain order corresponding to cargo), knight are after picking, by the efficiency etc. of goods handling to destination
Deng.Wherein, knight's order efficiency is an emphasis, that is, shortening knight's time of received orders length can improve object to a certain extent
Popular industry integrally dispenses efficiency.Knight's time of received orders length herein refers to that delivery system starts to order to numerous knights broadcast
Single time span that order is got to knight.
In the related technology, knight's order process is as follows：Delivery system broadcasts new order to whole knights, until some is ridden
Scholar sends out competition for orders request to delivery system, and then, which is just sent out the knight of competition for orders request by delivery system to this, into
And complete the order of knight.In actual use, if each order is broadcasted to whole knights, knight can be occupied
Therefore excessive energy in actual use, typically broadcasts new order, each round is only to one by the way of more wheel broadcast
Part knight broadcasts new order.More wheel broadcast refer to delivery system per at regular intervals by new order to different knight groups
Body is broadcasted, until there is knight to send out competition for orders request.For example, the first round broadcast be at a distance from lower single user be less than 1KM
Knight broadcast；Second wheel broadcast is to the knight's broadcast for being 1KM-2KM at a distance from lower single user；Third round broadcast be to
The knight that the distance of lower single user is 2KM-4KM broadcasts.
Knight not necessarily can directly send out competition for orders request after receiving the new order of broadcast, and knight can integrate and examine
Various factors is considered to decide whether to send out competition for orders request, and therefore, when by the way of more wheel broadcast, former wheel broadcast are not necessarily
Have knight come order (such as knight apart from order too far, it is too low etc. that knight is in dispatching state, the order amount of money), this is also
Cause active broadcast.Knight's order is allowed if delivery system can use the broadcast of fewer number, necessarily can as a result,
Improve knight's order efficiency.
Meanwhile anticipated that, if each order is equipped with dispatching expense (the dispatching expense usually direct payment of great number
To knight's), then inevitable each order can have knight's order, but in fact, dispatching take it is excessively high if, then user and dispatching system
System is unaffordable.Therefore, how dispatching take will not be excessively high in the case of, raising knight's order efficiency just become one
Actual needs solves the problems, such as.
In view of the above-mentioned problems, this application provides order allocation methods, as shown in Figure 1, this method comprises the following steps：
S101, obtains the order information of target order, and order information includes distribution information and order dispatching volume；
S102 dispenses the correlation degree of situation according to the order information of target order and history knight, calculates candidate knight
In the case where the order of target order dispenses volume as constraints, receive the order probability of target order；History knight matches
Condition of giving a present has reacted candidate knight under conditions of different distribution informations and different order dispatching volumes, the probability accepted an order；
S103, according to the push object of the order determine the probability target order of candidate knight.
In step S101, order information is bipartite, is distribution information and order dispatching volume respectively.With delivering letters
Breath describes, information except order dispatching volume in addition to related with target order, for example, distribution information can be picking place,
The information such as distribution time section.Namely distribution information can have many contents, and the number of particular content can be according to different
Depending on situation.Under normal circumstances, distribution information is provided by user's (individual for sending out target order), and distribution information can also
By delivery system active obtaining to or distribution information in a part be customer-furnished, a part is by matching
What the system active obtaining of sending arrived.
Order dispatching volume refers to knight dispensing remuneration that the target order can be got that (it is knight's energy that order, which dispenses volume,
It is enough fully to obtain) or order dispatching volume can reflect remuneration that knight can get to a certain extent (such as order is matched
Sending the part in volume to be knight can obtain, or be to dispense volume by order, and knight can substantially determine oneself
The remuneration that can be obtained).
It can be that user provides that order, which dispenses volume, can also be that delivery system (executes the execution master of step S101-S103
Body) it oneself generates.When order dispatching volume is that delivery system can determine that order dispenses at random when delivery system generates
Volume can also be first to calculate a lower numerical value according to a certain algorithm to dispense volume as order.
In step S102, candidate knight can refer to a part of or whole in whole knights.Make in order dispatching volume
In the case of for constraints, receive the order probability of target order, knight is referred in the case of specified remuneration, if matched
System is sent to distribute (it can be appreciated that sending, broadcast) target order to knight, then knight sends competition for orders request to delivery system
Come strive for dispense target order chance probability.Wherein, specified remuneration refers to if knight receives target order,
It is exactly order dispatching volume that knight, which dispenses the remuneration that target order can be got,；Either, knight dispenses target order institute energy
The remuneration enough got is exactly to dispense the number that volume can be determined substantially according to order.
History knight dispenses situation the case where referring to knight's once competition for orders, or the case where according to knight's once competition for orders
Obtained model.The case where knight's once competition for orders, can reflect knight to certain order (variety classes order to a certain extent
Distribution information and at least one of order dispatching volume be different) fancy grade, in turn, if knight more likes a certain
The order of type, then knight receive the type order probability it is higher.The order information of target order and history knight dispatching
The correlation degree of situation also just refers to that order information and history knight dispense the similarity degree of situation, if target order is ordered
Single information is more similar to the dispatching situation of certain knight in history, then the reference value of the dispatching situation of the secondary knight is just in history
It is higher.
In turn, after having got order information in step S101, in step S102, so that it may with according to knight in history
The case where once carrying out competition for orders judges that fancy grade of the knight to target order, the fancy grade also can be considered as
Receive the probability of target order, or the probability for receiving target order can be calculated according to fancy grade.For example, can be
Following table is pre-established in delivery system：
Table 1
It is candidate by table 1 as it can be seen that if the distribution information of target order meets AAAA, and when order dispatching volume meets WWWW
The probability that knight receives target order is 25%, and when the distribution information of target order meets BBBB, and order dispatching volume meets
When XXXX, the probability that candidate knight receives target order is 80%.The calculation of order probability can also use the side of statistics
Formula carries out, for example, it is AAAA that delivery system once pushed 8 order informations to candidate knight X altogether, and order dispatching volume meets
The order of WWWW, candidate knight X returns the request of competition for orders twice to delivery system, it is, candidate knight X is received and ordered twice
It is single, 6 orders are abandoned, in turn, the order probability determined is 25%.
Mode in addition to using table can also be and prestore knight's competition for orders probabilistic model in delivery system, this is ridden
Scholar's competition for orders probabilistic model is it is also assumed that be to dispense a kind of embodiment of situation according to history knight (knight's competition for orders probabilistic model can be with
The case where competition for orders each according to knight, determines), when delivery system is defeated by the distribution information of target order and order dispatching volume
After entering into the model, so that it may to obtain the probability that candidate knight receives target order.
It can determine that each candidate knight receives the order probability of target order by step S102, in turn, in step
In S103, so that it may with according to the push object of the order determine the probability target order of candidate knight.For example, can be by order probability
Be 0 candidate knight as push object, can also by order probability be more than predetermined threshold value (threshold value can be 20%, or
It is candidate knight conduct push object 30%).On the whole, there are two types of as a result, one is will be in candidate knight by step S103
It is one or more as push object, another situation is that nobody can be used as push object in candidate knight.
Specifically, the main function of distribution information and order dispatching volume is that different orders is classified, if order is believed
It is very careful that breath then can necessarily carry out classification enough, then the specific aim of order probability is also sufficiently strong, but in fact, is not
All order informations are all effective, by the practice and analysis of inventor, it is believed that distribution information may include following appoints
It anticipates one or more information：
The order temperature of target order region (refers to address or the target order of the user for sending out target order
The destination address dispensed), candidate knight does not complete the quantity of order of dispatching currently, candidate knight send the punctual rate of order, mesh
Lower single address properties (such as company, school, house) of mark order, the ship-to attribute of target order (school, live by such as company
Residence), target order dispatching distance, target order the dispatching period whether be peak period.
It, can be using any one in above-mentioned 8 information as order information or by above-mentioned 8 information when specifically used
In any two as order information or by arbitrary three in above-mentioned 8 information as order information or by above-mentioned 8
Any four in information is as order information or by arbitrary five in above-mentioned 8 information as order information or will be above-mentioned
Arbitrary six in 8 information are used as order information as order information or by above-mentioned 8 information.For example, can be by target
The order temperature of order region and candidate knight send the punctual rate of order as order information, can also dispense target order
Candidate knight can not also currently be completed the quantity, target order dispatching distance and target order of the order of dispatching by distance
Whether the dispatching period is peak period as order information.
Similar, history knight dispenses the order dispatching volume that situation may include History Order, and any one following
Or much information：
When receiving History Order, the order temperature of History Order region, when receiving History Order, candidate knight is not complete
At the quantity of the order of dispatching, receive History Order when, candidate knight send the lower single-address category of the punctual rate of order, History Order
Property, the dispatching distance of the ship-to attribute of History Order, History Order, History Order dispatching period when whether being peak
Section.
In general, history knight dispenses the information category in the presence of situation, and is present in the order of target order
In information, for example history knight dispenses and has in situation when receiving History Order, the order temperature of History Order region, then
It should also be as the order temperature for being corresponding with target order region in order information.But, it is noted that target order is ordered
The order dispatching volume of target order is certainly existed in single information, history knight dispenses in situation and also certainly existed History Order
Order dispense volume.
Step S103's as a result, can will in candidate knight it is any one or more as push objects, also may be used certainly
Capable of can not determining push object, (for example, when the order probability of each candidate knight is 0, then being usually cannot be by any one
Candidate knight is as push object).In turn, it can determine that out at least one of candidate knight as push object in step S103
When, then target order can be pushed to push object.When step S103 can not determine push object, then should adjust
The order of whole target order dispenses volume, and re-executes step S102.In general, if can not determine push object,
The amount of money that order dispatching volume should then be improved, in the hope of attracting more knights.
That is, can determine that out at least one of candidate knight as push object, and by target order in step S103
After being pushed to push object, if the order for being not received by push object for target order is asked (in the predetermined time
The order that push object is inside not received by for target order reply is asked), then it should adjust the order dispatching of target order
Volume simultaneously re-executes step S102.
It can be envisioned that as long as improving order dispenses volume, in the case where other conditions are constant, it is possible to improve
Order probability.But if the order dispatching volume once improved is very few (as only improved red cent every time), then there is knight to reply order
The probability of request is still very low, it is, improving order dispatching volume and then broadcasting the target order, the target order quilt
The probability of knight's order is still very low, improve every time in this way it is seldom if, then can waste a large amount of computing resource.Meanwhile such as
Fruit once improves order dispatching volume excessively (for example order dispatching volume is disposably improved several times), although it is general to improve knight's order
Rate, but this can cause cost excessively high.Therefore, the amplitude that volume should be dispensed to improving order every time controls.In turn, the application
In the method provided, in order to reasonably control the amplitude that order dispatching volume improves, method provided herein, in step
After S103, as shown in Fig. 2, further including following steps：
S104 pushes target order to push object；
S105 improves mould if the order for being not received by push object for target order is asked using the order amount of money
Type calculates the practical price markup price of target order；The order amount of money improve model the calculating factor include it is below any one or it is more
Kind：When order dispatching volume (order when not by the order of knight institute dispenses volume), order dispatching distance, order before price markup dispense
Between, knight's quantity around order, whether be in when single address properties, the ship-to attribute of order, dispatching order under order
The order pressure of candidate knight in peak period, the currently average single amount of candidate knight and current region；
S106 dispenses volume using the order of practical price markup price adjustment target order, and re-executes step S102.
Wherein, the factor that the factor refers to influencing final result is calculated.The final output that the order amount of money improves model can be with
It is practical price markup price, which is used for adjusting order dispatching volume.Can be to order when specific calculate
The amount of money improves the estimated price markup price of the order probability calculation mode input in model, then by judging order probability calculation model
(knight's order probability can refer to the order probability of some candidate knight to knight's order probability of output, may also mean that
According to the whole order probability of the calculated all candidate knights of everyone the order probability institute of all candidate knights) it is whether sufficient
Enough height, and then determine whether the price markup price inputted before meets expection, if meeting expection, it is determined that improved to the order amount of money
The estimated price markup price of mode input is practical price markup price, and is matched using the order of the practical price markup price adjustment target order
Send volume.Can also be to the order amount of money improve the estimated knight's order probability of mode input (or knight's order probability raising value,
In general for the balance as possible between guaranteed price and number, knight's order probability raising value general control is in 10%-
15% or so), then the order amount of money improves model and can directly export corresponding practical price markup price (result can be price markup valence
Lattice can also be result of the output after price adjustment of raising the price), and then use the practical price markup price adjustment target order
Order dispenses volume.
In actual work, it may be necessary to repeat step S104 and S105 more times, the order dispatching volume determined in this way
May be very high, thus in step S105 using the order dispatching volume of practical price markup price adjustment target order after, also answer
Whether order dispatching volume after judging adjustment is excessively high, step S102 should not be re-executed if excessively high, or should
Subsequent step can be executed by confirming with the user for sending out target order.
In turn, in method provided herein, after step S106, further include：
Step 1061, judge whether the order dispatching volume after adjustment is more than preset price thresholds；If so, thening follow the steps
Step 1062；S102 is thened follow the steps if not；
Step 1062, current process is terminated, or sends the order after adjustment to the client for sending out target order and dispenses volume,
If receiving the client for sending out target order for the confirmation message of the order dispatching volume after adjustment, S102 is thened follow the steps.
It is, after adjustment order dispatching volume it is excessively high when, then can with termination process (at this time system think the price use
Family can not receive, therefore no longer execute follow-up process).Termination process herein refers to no longer execution step S102,
Advertisement message can also be sent out to the client for sending out target order, to inform current order selling at exorbitant prices.
When order dispatching volume after adjustment is excessively high, ordering after can also sending adjustment to the client for sending out target order
Single dispatching volume, confirms if user replys, illustrates that user thinks that the price can receive, at this point it is possible to continue to execute step
S102。
Preset price thresholds herein can empirically be worth to determine, can also be according to different user come personalized
Execute whether corresponding price thresholds (for example can often send Large Order Number according to user, or whether be passed through according to user
Often the order dispatching of payment great number takes, or is whether to live in high-grade cell according to certain user, to determine corresponding valence
Lattice threshold value).
In turn, in method provided herein, preset price thresholds are the order placement information and ginseng according to target order
Examine the correlation degree determination of order placement information；It is the History Order assigned corresponding to the client of target order with reference to order placement information
Order placement information；
Include any one or more in the following conditions with reference to order placement information：
It is candidate when order placement time, order dispense volume, whether the distribution time section of order is working day, order placement
When knight's quantity, order placement, average single amount of candidate knight, the dispatching distance of order, lower single address properties (company, house
Or school), ship-to attribute (company, house or school), order dispatching when whether in dispatching peak period, order dispatching when
Whether the traffic congestion phase is in.
Think ceiling price that user can pay (or close to most in fact, preset price thresholds are exactly system
One threshold value of high price), the ceiling price that user can pay is determined according under user's history the case where list, in this way can
Ensure the accuracy calculated to a certain extent.
In turn, in method provided herein, the preset price thresholds of determination in order to be more accurate, the application is carried
It can also include following step in the method for confession：
According to the order placement information of target order and assign the letter that places an order of History Order corresponding to the client of target order
Breath, determine different estimated lower single prices with it is expected that lower list probability correspondence；
Single price is descended on the estimation and it is expected that the correspondence of lower list probability determines preset price thresholds.
Wherein, order placement information includes any one or more in the following conditions：
It is candidate when order placement time, order dispense volume, whether the distribution time section of order is working day, order placement
When knight's quantity, order placement, average single amount of candidate knight, the dispatching distance of order, lower single address properties (company, house
Or school), ship-to attribute (company, house or school), order dispatching when whether in dispatching peak period, order dispatching when
Whether the traffic congestion phase is in.
Different estimated lower single prices also may be used with it is expected that the correspondence of lower single probability can be existed in table form
Being existed in the form of two-dimensional curve.Different estimated lower single prices with it is expected that the correspondence of lower single probability has reacted user
The correspondence of possible bid (it is expected that lower list price) and corresponding lower single probability.For example, different estimated lower single prices with
It is expected that it is 90% that the correspondence of lower list probability, which can react the probability that user is target order 8 yuan of freight charges of payment, 10 yuan are paid
The probability of freight charges is 80%, and the probability of 12 yuan of freight charges of payment is 60%, and the probability of 16 yuan of freight charges of payment is 20%, in turn, system
It can be inferred that user is less likely the freight charges of 16 yuan of payment, in turn, preset price thresholds can be 12 yuan.
Certainly, can be that the lower single probability of selection is more than 0, and the maximum lower single price conduct of numerical value for benefit
Preset price thresholds.
The order placement information for assigning the History Order corresponding to the client of target order reflects in history, assigns target and orders
Single client is the price that different types of order is ready payment.Assign the History Order corresponding to the client of target order
Order placement information can be existed in table form, can also be to have that (mathematical model is also can be in the form of mathematical model
It is to be calculated by assigning the order placement information of the History Order corresponding to the user of target order).
What method provided herein can integrate dispenses situation to determine push object, when pushing away according to history knight
It, can also be by way of increasing order and dispensing volume come so that knight is more prone to receive target when sending object there is no order
Order, the mode for also dispensing volume in the prioritization scheme of the application to increasing order are optimized, and have considered efficiency and expense
With the problem of, distribution project is optimized.
Corresponding with the above method, present invention also provides a kind of Order splitting devices, as shown in figure 3, including：
Acquisition module 301, the order information for obtaining target order, the order information include distribution information and order
Dispatching volume；
First computing module 302, the association journey for dispensing situation according to the order information of target order and history knight
Degree calculates candidate knight in the case where the order of target order dispenses volume as constraints, receives the order of target order
Probability；History knight dispenses situation and has reacted candidate knight under conditions of different distribution informations and different order dispatching volumes, connects
By the probability of order；
First determining module 303 is used for the push object of the order determine the probability target order according to candidate knight.
Preferably, history knight dispenses the order dispatching volume that situation includes History Order, and any one following or more
Kind information：
When receiving History Order, the order temperature of History Order region, when receiving History Order, candidate knight is not complete
At the quantity of the order of dispatching, receive History Order when, candidate knight send the lower single-address category of the punctual rate of order, History Order
Property, the dispatching distance of the ship-to attribute of History Order, History Order, History Order dispatching period when whether being peak
Section.
Preferably, which further includes：
Pushing module, for pushing target order to push object；
Second computing module, for when being not received by order request of the push object for target order, using ordering
Single amount of money improves the practical price markup price that model calculates target order；The calculating factor that the order amount of money improves model includes below
Any one or more：Knight's number around order dispatching volume, order dispatching distance, order distribution time, order before price markup
It is whether current in peak period, candidate knight when single address properties, the ship-to attribute of order, dispatching order under amount, order
The order pressure of candidate knight in average single amount and current region；
Module is adjusted, for dispensing volume using the order of practical price markup price adjustment target order, and re-executes step
The correlation degree that situation is dispensed according to the order information of target order and history knight calculates candidate knight's ordering in target order
In the case that single dispatching volume is as constraints, receive the order probability of target order.
Preferably, which further includes：
Judgment module, for judging whether the order dispatching volume after adjustment is more than preset price thresholds；
Sending module, when being more than preset price thresholds for order dispatching volume after the adjustment, to sending out target order
Client send adjustment after order dispense volume；
Drive module, for receiving confirmation of the client for sending out target order for the order dispatching volume after adjustment
When information, driving the first computing module work.
Preferably, preset price thresholds are the order placement information according to target order and the correlation degree with reference to order placement information
Determining；It is to assign the order placement information of the History Order corresponding to the client of target order with reference to order placement information；
Include any one or more in the following conditions with reference to order placement information：
It is candidate when order placement time, order dispense volume, whether the distribution time section of order is working day, order placement
When knight's quantity, order placement, average single amount of candidate knight, the dispatching distance of order, lower single address properties, ship-to category
Property, order dispatching when whether in dispatching peak period, order dispatching when whether be in the traffic congestion phase.
Preferably, which further includes：
Second determining module, for according to the order placement information of target order and assigning corresponding to the client of target order
The order placement information of History Order, determine different estimated lower single prices with it is expected that lower list probability correspondence；
Third determining module, for lower single price on the estimation and it is expected that the correspondence of lower list probability determines preset valence
Lattice threshold value；Wherein, order placement information includes any one or more in the following conditions：The order placement time, orders order dispatching volume
When whether single distribution time section is working day, order placement, when candidate knight's quantity, order placement, candidate knight's is averaged
Whether it is in dispatching peak period when Dan Liang, the dispatching distance of order, lower single address properties, ship-to attribute, order dispatching, orders
Whether it is in the traffic congestion phase when single dispatching.
Corresponding with the above method, present invention also provides a kind of non-volatile program generations that can perform with processor
The computer-readable medium of code, program code make the processor execute the order allocation method provided in above.
As shown in figure 4, the computing device schematic diagram provided by the embodiment of the present application, the computing device 40 include：Processing
Device 41, memory 42 and bus 43, memory 42, which is stored with, to be executed instruction, when computing device is run, processor 41 and storage
Communicated by bus 43 between device 42, processor 41 execute memory 42 in store such as the step of order allocation method.
It, can be with if the function is realized in the form of SFU software functional unit and when sold or used as an independent product
It is stored in a computer read/write memory medium.Based on this understanding, technical scheme of the present invention is substantially in other words
The part of the part that contributes to existing technology or the technical solution can be expressed in the form of software products, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be
People's computer, server or network equipment etc.) it performs all or part of the steps of the method described in the various embodiments of the present invention.
And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), arbitrary access are deposited
The various media that can store program code such as reservoir (RAM, Random Access Memory), magnetic disc or CD.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain
Lid is within protection scope of the present invention.Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. a kind of order allocation method, which is characterized in that including：
The order information of target order is obtained, the order information includes distribution information and order dispatching volume；
The correlation degree that situation is dispensed according to the order information of target order and history knight calculates candidate knight in target order
Order dispense volume as constraints in the case of, receive the order probability of target order；History knight dispenses situation reaction
Candidate knight is the different distribution informations and different order dispatching volumes under conditions of, the probability accepted an order；
According to the push object of the order determine the probability target order of candidate knight.
2. according to the method described in claim 1, it is characterized in that, the order that history knight dispatching situation includes History Order is matched
Send volume, and any one or more following information：
When receiving History Order, the order temperature of History Order region, when receiving History Order, candidate knight, which does not complete, to be matched
The quantity of the order sent, when receiving History Order, candidate knight send the punctual rate of order, History Order lower single address properties, go through
The ship-to attribute of history order, the dispatching distance of History Order, History Order the dispatching period whether be peak period.
3. according to the method described in claim 1, it is characterized in that, further including：
Target order is pushed to push object；
If the order for being not received by push object for target order is asked, improves model using the order amount of money and calculate target
The practical price markup price of order；The order amount of money improve model the calculating factor include it is below any one or more：Before price markup
Order dispatching volume, order dispatching distance, knight's quantity around order distribution time, order, list address properties under order, order
Whether waited in peak period, the currently average single amount of candidate knight and current region when single ship-to attribute, dispatching order
Select the order pressure of knight；
Volume is dispensed using the order of practical price markup price adjustment target order, and re-executes order of the step according to target order
Information and history knight dispense the correlation degree of situation, calculate candidate knight in the order dispatching volume of target order as constraint item
In the case of part, receive the order probability of target order.
4. according to the method described in claim 3, it is characterized in that, using practical price markup price adjustment target order in step
After order dispatching volume, further include：
Judge whether the order dispatching volume after adjustment is more than preset price thresholds；
If the order dispatching volume after adjustment is more than preset price thresholds, after sending adjustment to the client for sending out target order
Order dispense volume；
If receiving the client for sending out target order for the confirmation message of the order dispatching volume after adjustment, root is thened follow the steps
The correlation degree of situation, order of the candidate knight of calculating in target order are dispensed according to the order information of target order and history knight
In the case that dispatching volume is as constraints, receive the order probability of target order.
5. according to the method described in claim 4, it is characterized in that,
Preset price thresholds are that the order placement information according to target order and the correlation degree with reference to order placement information determine；With reference to
Order placement information is to assign the order placement information of the History Order corresponding to the client of target order；
Include any one or more in the following conditions with reference to order placement information：
When order placement time, order dispense volume, whether the distribution time section of order is working day, order placement, candidate knight
When quantity, order placement, average single amount of candidate knight, the dispatching distance of order, lower single address properties, ship-to attribute,
Whether it is in the traffic congestion phase when order dispensing whether in dispatching peak period, order dispatching.
6. according to the method described in claim 4, it is characterized in that, further including：
According to the order placement information of target order and the order placement information of History Order corresponding to the client of target order is assigned, really
Fixed different estimated lower single price with it is expected that lower list probability correspondence；
Single price is descended on the estimation and it is expected that the correspondence of lower list probability determines preset price thresholds；Wherein, order placement information
Including any one or more in the following conditions：The order placement time, order dispatching volume, order distribution time section whether be
When working day, order placement, when candidate knight's quantity, order placement, average single amount of candidate knight, the dispatching distance of order,
Whether it is in traffic when lower list address properties, ship-to attribute, order dispatching whether in dispatching peak period, order dispatching
The congestion phase.
7. a kind of Order splitting device, which is characterized in that including：
Acquisition module, the order information for obtaining target order, the order information include distribution information and order dispatching volume；
First computing module, the correlation degree for dispensing situation according to the order information of target order and history knight, calculates
Candidate knight receives the order probability of target order in the case where the order of target order dispenses volume as constraints；It goes through
History knight dispenses situation and has reacted candidate knight under conditions of different distribution informations and different order dispatching volumes, accepts an order
Probability；
First determining module is used for the push object of the order determine the probability target order according to candidate knight.
8. device according to claim 7, which is characterized in that history knight dispenses the order that situation includes History Order and matches
Send volume, and any one or more following information：
When receiving History Order, the order temperature of History Order region, when receiving History Order, candidate knight, which does not complete, to be matched
The quantity of the order sent, when receiving History Order, candidate knight send the punctual rate of order, History Order lower single address properties, go through
The ship-to attribute of history order, the dispatching distance of History Order, History Order the dispatching period whether be peak period.
9. a kind of computer-readable medium for the non-volatile program code that can perform with processor, which is characterized in that described
Program code makes the processor execute described any the methods of claim 1-6.
10. a kind of computing device includes：Processor, memory and bus, memory, which is stored with, to be executed instruction, when computing device is transported
When row, by bus communication between processor and memory, processor execute stored in memory as claim 1-6 is any
The method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810457793.8A CN108665170A (en) | 2018-05-14 | 2018-05-14 | Order allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810457793.8A CN108665170A (en) | 2018-05-14 | 2018-05-14 | Order allocation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108665170A true CN108665170A (en) | 2018-10-16 |
Family
ID=63778463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810457793.8A Pending CN108665170A (en) | 2018-05-14 | 2018-05-14 | Order allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108665170A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109376942A (en) * | 2018-11-12 | 2019-02-22 | 达疆网络科技(上海)有限公司 | Order processing method, storage medium and device |
| CN110111057A (en) * | 2019-05-10 | 2019-08-09 | 拉扎斯网络科技（上海）有限公司 | Order distribution method and device, readable storage medium and electronic equipment |
| CN110309996A (en) * | 2019-04-12 | 2019-10-08 | 郑州时空隧道信息技术有限公司 | Order with city dispatching dispenses regulator control system |
| CN111127154A (en) * | 2019-12-24 | 2020-05-08 | 拉扎斯网络科技（上海）有限公司 | Order processing method, device, server and nonvolatile storage medium |
| CN111144809A (en) * | 2019-12-23 | 2020-05-12 | 拉货宝网络科技有限责任公司 | Freight automatic settlement method based on safety check and error judgment |
| CN111178647A (en) * | 2018-11-09 | 2020-05-19 | 中移（杭州）信息技术有限公司 | Method, system and computer storage medium for pushing work order |
| CN111353676A (en) * | 2018-12-24 | 2020-06-30 | 北京嘀嘀无限科技发展有限公司 | Order distribution method, system, computer device and computer readable storage medium |
| CN111612173A (en) * | 2020-05-05 | 2020-09-01 | 鹤山市新供销再生资源园区有限公司 | WeChat applet-based online reservation garbage recycling system and method |
| CN111695842A (en) * | 2019-03-11 | 2020-09-22 | 拉扎斯网络科技（上海）有限公司 | Distribution scheme determination method and device, electronic equipment and computer storage medium |
| CN111724089A (en) * | 2019-03-20 | 2020-09-29 | 顺丰科技有限公司 | Order receiving and dispatching distribution method, system, terminal and storage medium |
| CN111768216A (en) * | 2019-04-02 | 2020-10-13 | 拉扎斯网络科技（上海）有限公司 | Order price adjustment method, device, server and storage medium |
| CN114548682A (en) * | 2022-01-19 | 2022-05-27 | 浙江吉利控股集团有限公司 | Order distribution method, order distribution device and computer readable storage medium |
| CN116341839A (en) * | 2023-03-08 | 2023-06-27 | 济南丽阳神州智能科技有限公司 | Order pushing method, equipment and medium for household service personnel |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20030021517A (en) * | 2001-09-06 | 2003-03-15 | 삼성전자주식회사 | Quick-service system and method thereof using 2-WAY pager network |
| CN107220789A (en) * | 2017-05-15 | 2017-09-29 | 浙江仟和网络科技有限公司 | A kind of logistics distribution dispatching method and system |
| CN107230014A (en) * | 2017-05-15 | 2017-10-03 | 浙江仟和网络科技有限公司 | A kind of intelligent dispatching system of the instant logistics in end |
| CN107451878A (en) * | 2017-06-01 | 2017-12-08 | 北京小度信息科技有限公司 | order processing method and device |
| CN107451779A (en) * | 2017-08-01 | 2017-12-08 | 北京同城必应科技有限公司 | A kind of dynamic price adjustment method and apparatus, computer equipment, storage medium |
-
2018
- 2018-05-14 CN CN201810457793.8A patent/CN108665170A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20030021517A (en) * | 2001-09-06 | 2003-03-15 | 삼성전자주식회사 | Quick-service system and method thereof using 2-WAY pager network |
| CN107220789A (en) * | 2017-05-15 | 2017-09-29 | 浙江仟和网络科技有限公司 | A kind of logistics distribution dispatching method and system |
| CN107230014A (en) * | 2017-05-15 | 2017-10-03 | 浙江仟和网络科技有限公司 | A kind of intelligent dispatching system of the instant logistics in end |
| CN107451878A (en) * | 2017-06-01 | 2017-12-08 | 北京小度信息科技有限公司 | order processing method and device |
| CN107451779A (en) * | 2017-08-01 | 2017-12-08 | 北京同城必应科技有限公司 | A kind of dynamic price adjustment method and apparatus, computer equipment, storage medium |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111178647A (en) * | 2018-11-09 | 2020-05-19 | 中移（杭州）信息技术有限公司 | Method, system and computer storage medium for pushing work order |
| CN111178647B (en) * | 2018-11-09 | 2023-09-05 | 中移（杭州）信息技术有限公司 | Method, system and computer storage medium for pushing work order |
| CN109376942A (en) * | 2018-11-12 | 2019-02-22 | 达疆网络科技(上海)有限公司 | Order processing method, storage medium and device |
| CN111353676B (en) * | 2018-12-24 | 2022-09-09 | 北京嘀嘀无限科技发展有限公司 | Order distribution method, system, computer device and computer readable storage medium |
| CN111353676A (en) * | 2018-12-24 | 2020-06-30 | 北京嘀嘀无限科技发展有限公司 | Order distribution method, system, computer device and computer readable storage medium |
| CN111695842A (en) * | 2019-03-11 | 2020-09-22 | 拉扎斯网络科技（上海）有限公司 | Distribution scheme determination method and device, electronic equipment and computer storage medium |
| CN111695842B (en) * | 2019-03-11 | 2023-10-24 | 拉扎斯网络科技（上海）有限公司 | Distribution scheme determining method, distribution scheme determining device, electronic equipment and computer storage medium |
| CN111724089A (en) * | 2019-03-20 | 2020-09-29 | 顺丰科技有限公司 | Order receiving and dispatching distribution method, system, terminal and storage medium |
| CN111724089B (en) * | 2019-03-20 | 2023-04-28 | 顺丰科技有限公司 | Order receiving and dispatching distribution method, system, terminal and storage medium |
| CN111768216A (en) * | 2019-04-02 | 2020-10-13 | 拉扎斯网络科技（上海）有限公司 | Order price adjustment method, device, server and storage medium |
| CN110309996A (en) * | 2019-04-12 | 2019-10-08 | 郑州时空隧道信息技术有限公司 | Order with city dispatching dispenses regulator control system |
| CN110111057A (en) * | 2019-05-10 | 2019-08-09 | 拉扎斯网络科技（上海）有限公司 | Order distribution method and device, readable storage medium and electronic equipment |
| CN111144809A (en) * | 2019-12-23 | 2020-05-12 | 拉货宝网络科技有限责任公司 | Freight automatic settlement method based on safety check and error judgment |
| CN111127154A (en) * | 2019-12-24 | 2020-05-08 | 拉扎斯网络科技（上海）有限公司 | Order processing method, device, server and nonvolatile storage medium |
| CN111612173A (en) * | 2020-05-05 | 2020-09-01 | 鹤山市新供销再生资源园区有限公司 | WeChat applet-based online reservation garbage recycling system and method |
| CN114548682A (en) * | 2022-01-19 | 2022-05-27 | 浙江吉利控股集团有限公司 | Order distribution method, order distribution device and computer readable storage medium |
| CN116341839A (en) * | 2023-03-08 | 2023-06-27 | 济南丽阳神州智能科技有限公司 | Order pushing method, equipment and medium for household service personnel |
| CN116341839B (en) * | 2023-03-08 | 2023-08-22 | 济南丽阳神州智能科技有限公司 | Order pushing method, equipment and medium for household service personnel |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108665170A (en) | Order allocation method and device | |
| JP6720331B2 (en) | Distribution resource scheduling method, device and system | |
| CN108734432A (en) | Order allocation method and device | |
| CN107094165B (en) | Distribution capacity determining method, distribution task obtaining method, distribution resource scheduling method and equipment | |
| CN110472899B (en) | Method and device for distributing articles out of warehouse | |
| CN109636217A (en) | Order scheduling method and device, electronic equipment and storage medium | |
| RU2012142057A (en) | SYSTEMS AND METHODS FOR AUCTIONAL SALE OF ASSETS OF WIRELESS DEVICES AND PROVISION OF WIRELESS DEVICES WITH AN OPTION OF SELECTING THE DISTRIBUTION OF ASSETS | |
| CN106779910B (en) | Distribution order distribution method and device | |
| CN112001681B (en) | Warehouse management method, device, platform and computer readable storage medium | |
| Kumar et al. | A preference-based resource allocation in cloud computing systems | |
| CN107092997A (en) | A kind of Logistic Scheduling method and device | |
| CN108960733A (en) | A kind of shopping allocator and system based on mobile dispensing vehicle | |
| CN112329970A (en) | Order information processing method and device, computer equipment and medium | |
| CN113191713A (en) | Warehouse out-of-stock transferring method, device, equipment and storage medium | |
| CN110490521A (en) | A kind of logistic resources dispatching method | |
| CN109345091A (en) | Complete vehicle logistics dispatching method and device, storage medium, terminal based on ant group algorithm | |
| CN106960266B (en) | Logistics control method and device for pre-selling articles | |
| WO2019000786A1 (en) | Order assigning method and device | |
| CN109741142A (en) | Order allocation method, Order splitting device, readable storage medium storing program for executing and electronic equipment | |
| CN106651553A (en) | Cloud container service-based batch processing auction mechanism | |
| CN114091988A (en) | Method and system for scheduling target articles among bins | |
| CN107153926A (en) | A kind of kinds of goods distribution method based on standard container, system and order management server | |
| CN110334993A (en) | The method, apparatus and computer equipment that a kind of pair of sowing goods yard is managed | |
| CN112308677A (en) | Commodity dispatch single dialing method, device, equipment and readable storage medium | |
| CN110728553A (en) | Method for realizing efficient shopping according to demand prediction |
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: 20181016 |