CN107403295A - Order dispatch method and device - Google Patents
Order dispatch method and device Download PDFInfo
- Publication number
- CN107403295A CN107403295A CN201710500829.1A CN201710500829A CN107403295A CN 107403295 A CN107403295 A CN 107403295A CN 201710500829 A CN201710500829 A CN 201710500829A CN 107403295 A CN107403295 A CN 107403295A
- Authority
- CN
- China
- Prior art keywords
- order
- dispatching
- dispatching person
- allocated
- person
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 230000004927 fusion Effects 0.000 claims description 21
- 238000009826 distribution Methods 0.000 claims description 17
- 238000003860 storage Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 14
- 230000005055 memory storage Effects 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 description 12
- 230000008569 process Effects 0.000 description 11
- 229910002056 binary alloy Inorganic materials 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 238000011524 similarity measure Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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
-
- 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
Abstract
The embodiment of the present application provides a kind of order dispatch method and device.Order dispatch method includes：Each self-corresponding order to be allocated of at least two class dispatching persons is obtained, forms order set to be allocated；It is determined that Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；It is the Order splitting dispatching person in order set to be allocated from least two class dispatching persons during execution of order allocation flow.The embodiment of the present application can carry out United Dispatching from the angle that order merges to polymorphic type dispatching person, realize the complementation between a variety of transport power, further to improve the dispatching efficiency of order, reduce the probability of order time-out dispatching.
Description
Technical field
The application is related to Internet technical field, more particularly to a kind of order dispatch method and device.
Background technology
With the fast development of Internet technology, the application based on internet is more and more, such as takes out class application, shopping
Class application.Based on these applications, the home-confined article that can be obtained needed for oneself of user.These are applied in the same of convenient user
When, item dispenser problem is also faced with, then logistic dispatching system arises at the historic moment.The main task of logistic dispatching system is to order
Single reasonable distribution is to dispatching person so that order can be sent in user's hand as early as possible, while can save transport power as far as possible.
Under normal conditions, existing logistic dispatching system can ensure the dispatching efficiency of most of order.But at some
In particular cases, for example, under single peak period, because transport power is limited, existing logistic dispatching system also can only preferentially ensure a small amount of order
Dispatching efficiency, most of order, which still exists, dispenses the problem of overtime, therefore up for providing a kind of new order dispatch side
Case, further to improve order dispatching efficiency, reduce the probability of order time-out dispatching.
The content of the invention
The problem of existing for prior art, present inventor is after a series of analyses and research, there is provided one
Kind solution, its cardinal principle are：In polymorphic type dispatching person and the scene deposited, polymorphic type is matched somebody with somebody from the angle of order fusion
The person of sending carries out United Dispatching, realizes the complementation between a variety of transport power, further to improve the dispatching efficiency of order, reduces order and surpasses
When the probability that dispenses.
Based on above-mentioned analysis, the embodiment of the present application provides a kind of order dispatch method, including：
Each self-corresponding order to be allocated of at least two class dispatching persons is obtained, forms order set to be allocated；
It is determined that Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；
It is the order to be allocated from least two class dispatching persons during the Order splitting flow is performed
Order splitting dispatching person in set.
In an optional embodiment, each self-corresponding order to be allocated of at least two class dispatching persons is obtained, is formed to be allocated
Order set, including：
It is determined that with the one-to-one at least two class order ponds of at least two class dispatching persons；
Order to be allocated at least two class order ponds described in obtaining, form the order set to be allocated.
The Order splitting flow described in an optional embodiment is simultaneously single allocation flow, is grouped allocation flow or including simultaneously
The fusion allocation flow of single allocation flow and packet allocation flow.
In an optional embodiment, when the Order splitting flow is merges allocation flow, the order is being performed
It is the Order splitting dispatching in the order set to be allocated from least two class dispatching persons during allocation flow
Member, including：
Still have from least two class dispatching persons in the dispatching person that order needs dispense, be described using simultaneously single allocation flow
Order splitting dispatching person in order set to be allocated；
From at least two class dispatching persons, using in being grouped allocation flow as the order set to be allocated not with and single point
The Order splitting dispatching person dispensed with flow.
In an optional embodiment, still have from least two class dispatching persons in the dispatching person that order needs dispense,
Using simultaneously single allocation flow as the Order splitting dispatching person in the order set to be allocated, including：
According to the priority between at least two class dispatching persons, still there is order to need to dispense from every class dispatching person successively
Dispatching person in, using and single allocation flow as the Order splitting dispatching person in the order set to be allocated.
In an optional embodiment, to the full-time dispatching person at least two class dispatching persons, from the full-time dispatching
Still have in member in the dispatching person that order needs dispense, using simultaneously single allocation flow as the Order splitting in the order set to be allocated
Dispatching person, including：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in full-time dispatching person；
Judge in the full-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the matching degree that the Order splitting is given between the order is directly met first by judged result to exist
The dispatching person required with degree.
In an optional embodiment, to the part-time dispatching person at least two class dispatching persons, from the part-time dispatching
Still have in member in the dispatching person that order needs dispense, using simultaneously single allocation flow as the Order splitting in the order set to be allocated
Dispatching person, including：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in part-time dispatching person；
Judge in the part-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the information of the order is sent to the matching degree between the order and meets first by judged result to exist
The dispatching person of matching degree requirement, so that the matching degree between the order meets dispatching person's competition for orders of the first matching degree requirement；
When there is dispatching person to initiate to rob single operation, the Order splitting is robbed to the dispatching person of single operation to initiation.
In an optional embodiment, from least two class dispatching persons, to be grouped allocation flow to be described to be allocated
Not with the Order splitting dispatching person that simultaneously single allocation flow dispenses in order set, including：
According to the priority between at least two class dispatching persons, successively from every class dispatching person, to be grouped allocation flow
For in the order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow.
In an optional embodiment, to full-time dispatching person at least two class dispatching persons, from the full-time dispatching person
In, using in being grouped allocation flow as the order set to be allocated not with and the Order splitting that dispenses of single allocation flow dispense
Member, including：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the full-time dispatching person between each dispatching person at least one order group
With degree；
According to the matching degree between each dispatching person in each order group and the full-time dispatching person, match somebody with somebody from the sole duty
It is each order group distribution dispatching person in the person of sending.
In an optional embodiment, to part-time dispatching person at least two class dispatching persons, from the part-time dispatching person
In, using in being grouped allocation flow as the order set to be allocated not with and the Order splitting that dispenses of single allocation flow dispense
Member, including：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the part-time dispatching person between each dispatching person at least one order group
With degree；
, will according to the order of the matching degree between each dispatching person in each order group and the part-time dispatching person from high to low
The information of each order group is sent to each dispatching person in the part-time dispatching person, with etc. member's competition for orders to be dispensed；And
To each order group, when there is dispatching person to initiate to rob single operation for the order group, the order group is distributed
The dispatching person of single operation is robbed to initiation.
Correspondingly, the embodiment of the present application also provides a kind of order dispatch device, including：
Acquisition module, for obtaining each self-corresponding order to be allocated of at least two class dispatching persons, form order collection to be allocated
Close；
Determining module, for determining Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；
Distribute module, for during the Order splitting flow is performed, being from least two class dispatching persons
Order splitting dispatching person in the order set to be allocated.
In an optional embodiment, the acquisition module is specifically used for：
It is determined that with the one-to-one at least two class order ponds of at least two class dispatching persons；
Order to be allocated at least two class order ponds described in obtaining, form the order set to be allocated.
In an optional embodiment, the Order splitting flow for and single allocation flow, packet allocation flow or including
And the fusion allocation flow of single allocation flow and packet allocation flow.
In an optional embodiment, when the Order splitting flow is merges allocation flow, the distribute module tool
Body is used for：
Still have from least two class dispatching persons in the dispatching person that order needs dispense, be described using simultaneously single allocation flow
Order splitting dispatching person in order set to be allocated；
From at least two class dispatching persons, using in being grouped allocation flow as the order set to be allocated not with and single point
The Order splitting dispatching person dispensed with flow.
In an optional embodiment, the distribute module is using simultaneously single allocation flow as in the order set to be allocated
Order splitting dispatching person when, be specifically used for：
According to the priority between at least two class dispatching persons, still there is order to need to dispense from every class dispatching person successively
Dispatching person in, using and single allocation flow as the Order splitting dispatching person in the order set to be allocated.
In an optional embodiment, to the full-time dispatching person at least two class dispatching persons, the distribute module tool
Body is used for：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in full-time dispatching person；
Judge in the full-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the matching degree that the Order splitting is given between the order is directly met first by judged result to exist
The dispatching person required with degree.
In an optional embodiment, to the part-time dispatching person at least two class dispatching persons, the distribute module tool
Body is used for：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in part-time dispatching person；
Judge in the part-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the information of the order is sent to the matching degree between the order and meets first by judged result to exist
The dispatching person of matching degree requirement, so that the matching degree between the order meets dispatching person's competition for orders of the first matching degree requirement；
When there is dispatching person to initiate to rob single operation, the Order splitting is robbed to the dispatching person of single operation to initiation.
In an optional embodiment, the distribute module is to be grouped allocation flow as in the order set to be allocated
Not with and single allocation flow dispense Order splitting dispatching person when, be specifically used for：According at least two class dispatching persons it
Between priority, successively from every class dispatching person, using in being grouped allocation flow as the order set to be allocated not with and single point
The Order splitting dispatching person dispensed with flow.
It is specific to full-time dispatching person at least two class dispatching persons, the distribute module in an optional embodiment
For：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the full-time dispatching person between each dispatching person at least one order group
With degree；
According to the matching degree between each dispatching person in each order group and the full-time dispatching person, match somebody with somebody from the sole duty
It is each order group distribution dispatching person in the person of sending.
It is specific to part-time dispatching person at least two class dispatching persons, the distribute module in an optional embodiment
For：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the part-time dispatching person between each dispatching person at least one order group
With degree；
, will according to the order of the matching degree between each dispatching person in each order group and the part-time dispatching person from high to low
The information of each order group is sent to each dispatching person in the part-time dispatching person, with etc. member's competition for orders to be dispensed；And
To each order group, when there is dispatching person to initiate to rob single operation for the order group, the order group is distributed
The dispatching person of single operation is robbed to initiation.
The embodiment of the present application also provides a kind of electronic equipment, including：Memory and processor；The memory storage has one
Bar or a plurality of computer instruction, one or more computer instruction realize the above method reality when by the computing device
Step in the method for example offer is provided.
The embodiment of the present application also provides a kind of computer-readable storage medium for being stored with computer program, the computer program
The step in the method that above method embodiment provides is realized when being performed.
In the embodiment of the present application, each self-corresponding order to be allocated of at least two class dispatching persons is merged, formation is treated
Order set is distributed, United Dispatching is carried out at least two class dispatching persons, using Order splitting flow during United Dispatching, from least
It is the Order splitting dispatching person to be allocated after fusion in two class dispatching persons, polymorphic type dispatching person is carried out from the angle of order fusion
United Dispatching, the complementation between a variety of transport power is realized, be advantageous to further improve the dispatching efficiency of order, reduce order time-out and match somebody with somebody
The probability sent.
Brief description of the drawings
Accompanying drawing described herein is used for providing further understanding of the present application, forms the part of the application, this Shen
Schematic description and description please is used to explain the application, does not form the improper restriction to the application.In the accompanying drawings：
Fig. 1 is the schematic flow sheet for the order dispatch method that the embodiment of the application one provides；
Fig. 2 is the schematic flow sheet for the order dispatch method that another embodiment of the application provides；
Fig. 3 is the structural representation for the order dispatch device that the another embodiment of the application provides.
Embodiment
To make the purpose, technical scheme and advantage of the application clearer, below in conjunction with the application specific embodiment and
Technical scheme is clearly and completely described corresponding accompanying drawing.Obviously, described embodiment is only the application one
Section Example, rather than whole embodiments.Based on the embodiment in the application, those of ordinary skill in the art are not doing
Go out under the premise of creative work the every other embodiment obtained, belong to the scope of the application protection.
Fig. 1 is the schematic flow sheet for the order dispatch method that the embodiment of the application one provides.As shown in figure 1, methods described
Including：
101st, each self-corresponding order to be allocated of at least two class dispatching persons is obtained, forms order set to be allocated.
Order splitting flow when the 102nd, determining to carry out at least two class dispatching persons United Dispatching.
103rd, it is described to be allocated from least two class dispatching persons during the Order splitting flow is performed
Order splitting dispatching person in order set.
In the present embodiment, logistic dispatching system uses polytype dispatching person, and different types of dispatching person mainly bears
Duty dispenses each self-corresponding order.Can be that all kinds of dispatching persons match somebody with somebody respectively for the ease of managing order corresponding to all kinds of dispatching persons
Order pond is put, all kinds of dispatching persons are mainly responsible for the order in the respective corresponding order pond of dispatching.Polytype dispatching person can wrap
Include but be not limited to：Full-time dispatching person and part-time dispatching person.In general, the personnel of full-time dispatching person are relatively more fixed, part-time dispatching
The mobility of people of member is larger, so for part-time dispatching person, the overall delivery service quality of full-time dispatching person is relative
It is higher, but it is also of a relatively high to dispense expense.
Alternatively, dispatching person's type can be selected for the order of oneself by businessman, once businessman selectes dispatching person's type, the business
The order of family will enter corresponding order pond, and wait the scheduling of logistic dispatching system.Or can also be by Logistic Scheduling system
System selects dispatching person's type according to the overall transport power situation of all kinds of dispatching persons for order；When logistic dispatching system is selected for order
Dispatching person's type, the order will enter corresponding order pond, and wait the scheduling of logistic dispatching system.Or Logistic Scheduling
System can also select dispatching person's type according to the dispatching demand of order for order；Match somebody with somebody when logistic dispatching system is that order is selected
The person's of sending type, the order will enter corresponding order pond, and wait the scheduling of logistic dispatching system.
Order dispatch system uses polytype dispatching person, and is directed to different orders, using different types of dispatching
Member, the advantage of all kinds of dispatching persons is made full use of, order dispatching efficiency can be improved to a certain extent.But, if it is possible to more
Type dispatching person simultaneously does further fusion scheduling on the basis of depositing to polymorphic type dispatching person, realizes the fortune between polymorphic type dispatching person
Power is complementary, is beneficial to further improve the dispatching efficiency of order, reduces the probability of order time-out dispatching.
In general, quantity on order is different in the corresponding order pond of different types of dispatching person, it means that inhomogeneity
The busy degree of the dispatching person of type can be different.Based on this, the order dispatch method that the present embodiment provides merges from order
Angle, with reference to dispatching person's United Dispatching thought, realize the fusion scheduling between polymorphic type dispatching person.The order that the present embodiment provides
The flow of dispatching method is as follows：
Each self-corresponding order to be allocated of at least two class dispatching persons is obtained, forms order set to be allocated.Order to be allocated
Set is included at least two class dispatching persons per order to be allocated corresponding to class dispatching person.For example, first kind dispatching person's is to be allocated
Order is order a, order b and order c；The order to be allocated of second class dispatching person is order e, order f and order g, then treats point
Order a, order b, order c, order e, order f and order g are included with order set.It means that at least two class dispatching persons
Corresponding order to be allocated does not distinguish scheduling, but order to be allocated corresponding at least two class dispatching persons is done into United Dispatching,
Merged so as to be realized in order aspect.
Afterwards, Order splitting flow during it is determined that at least two class dispatching persons progress United Dispatching.Determined by execution
It is the Order splitting dispatching person in order set to be allocated from least two class dispatching persons during Order splitting flow.
In the prior art, an Order splitting process can only dispatch a kind of dispatching person, and in the present embodiment, Order splitting requirements of process
It is related at least two class dispatching persons, so Order splitting flow here is different from existing Order splitting flow.In the present embodiment
Order splitting flow in, it is necessary to dispatch at least two class dispatching persons, so as to by the Order splitting in order set to be allocated to each
The dispatching person of relative free in class dispatching person, rather than the order in order set to be allocated is fully allocated to certain one kind and dispensed
Member, reach the purpose that at least two class dispatching persons are carried out with United Dispatching, realize the complementation between a variety of transport power.
In the present embodiment, each self-corresponding order to be allocated of at least two class dispatching persons is merged, formed to be allocated
Order set, United Dispatching is carried out at least two class dispatching persons, using Order splitting flow during United Dispatching, from least two classes
It is the Order splitting dispatching person to be allocated after fusion in dispatching person, unification is carried out to polymorphic type dispatching person from the angle of order fusion
Scheduling, realizes the complementation between a variety of transport power, is advantageous to further improve the dispatching efficiency of order, reduces order time-out dispatching
Probability.
In above-described embodiment or following embodiments, firstly, it is necessary to obtain, at least two class dispatching persons are each self-corresponding to be treated point
With order, order set to be allocated is formed.It is alternatively possible to determine to order with one-to-one at least two classes of at least two class dispatching persons
Dan Chi；The order to be allocated at least two class order ponds is obtained, forms order set to be allocated.For any sort dispatching person,
Order to be allocated corresponding to such dispatching person can be obtained from order pond corresponding to such dispatching person.Per corresponding to class dispatching person
Order to be allocated can be one or more.
Preferably, the priority between at least two class dispatching persons can be set.Based on this, can be dispensed according at least two classes
Priority between member, obtains order to be allocated, so as to be formed from each self-corresponding order pond of at least two class dispatching persons successively
Order set to be allocated.
Alternatively it is also possible to order to be allocated concurrently is obtained from each self-corresponding order pond of at least two class dispatching persons,
So as to form order set to be allocated.
Alternatively it is also possible to the sequencing that new order reaches in order pond is each corresponded to according at least two class dispatching persons,
Order to be allocated is obtained from respective orders pond successively, so as to form order set to be allocated.
In above-described embodiment or following embodiments, at least two class dispatching persons are carried out with Order splitting stream during United Dispatching
Journey can be and single allocation flow, or, can be packet allocation flow, or can be include simultaneously and single allocation flow and
It is grouped the fusion allocation flow of allocation flow.
Wherein, and single allocation flow is actually that a kind of order adds flow, mainly judges whether new order can chase after
Adding to still has order to need the dispatching person dispensed, so that the dispatching person can dispense new order by the way, reach the mesh for saving transport power
's.Packet allocation flow refers to order being grouped, and the process of Order splitting is carried out in units of order group.Merging allocation flow is
Refer to the process that simultaneously single allocation flow carries out Order splitting with packet allocation flow that combines.
When Order splitting flow when carrying out United Dispatching at least two class dispatching persons is fusion allocation flow, it can hold
Row fusion allocation flow, and be order collection to be allocated from least two class dispatching persons during fusion allocation flow is performed
Order splitting dispatching person in conjunction.
In an optional embodiment, one kind fusion allocation flow includes：First carry out and single allocation flow, then perform packet
Allocation flow.
Below to first carry out and single allocation flow, then exemplified by performing the fusion allocation flow of packet allocation flow, illustrate
Perform during merging allocation flow, be the Order splitting dispatching person in order set to be allocated from least two class dispatching persons
Process.
Order splitting flow when carrying out United Dispatching at least two class dispatching persons to first carry out and single allocation flow, then
When performing the fusion allocation flow of packet allocation flow, still there is order to need the dispatching person dispensed from least two class dispatching persons
In, using and single allocation flow as the Order splitting dispatching person in order set to be allocated, i.e., and single allocation flow；Then, from institute
State at least two class dispatching persons, using be grouped in allocation flow order set to be allocated not with and single allocation flow dispense
Order splitting dispatching person, that is, it is grouped allocation flow.
Alternatively, can be in the way of setting, successively from least two class dispatching persons in above-mentioned and single allocation flow
Still have in the dispatching person that order needs dispense, using simultaneously single allocation flow as the Order splitting dispatching person in order set to be allocated.
Here the meaning for referring to, according to certain order, perform one by one " successively ".Wherein, still have from least two class dispatching persons successively
Order is needed in the dispatching person that dispenses, using and single allocation flow as the Order splitting dispatching person in order set to be allocated actually
Refer to：According to certain order, still there is order to need in the dispatching person that dispenses from every class dispatching person, using and single allocation flow as
Order splitting dispatching person in order set to be allocated.
In one embodiment, can be per class dispatching person's Configuration Type ID.Based on this, can match somebody with somebody according at least two classes
The orders of the type ID for the person of sending from small to large, still have from every class dispatching person successively in the dispatching person that order needs dispense, with simultaneously
Single allocation flow is the Order splitting dispatching person in order set to be allocated.
A kind of situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, the type ID of full-time dispatching person
For 00001111 (binary system), the type ID of part-time dispatching person is 00011111 (binary system).Based on this, distribute when entrance and singly
During flow, first can still have from full-time dispatching person in the dispatching person that order needs dispense, using simultaneously single allocation flow to be to be allocated
Order splitting dispatching person in order set；Still have from part-time dispatching person again in the dispatching person that order needs dispense, with simultaneously single
Allocation flow is the Order splitting dispatching person in order set to be allocated.
Another situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, the type of part-time dispatching person
ID is 00001111 (binary system), and the type ID of full-time dispatching person is 00011111 (binary system).Based on this, when enter and single point
During with flow, first can still there is order to need in the dispatching person that dispenses from part-time dispatching person, using and single allocation flow to treat point
With the Order splitting dispatching person in order set；Still have from full-time dispatching person again in the dispatching person that order needs dispense, with simultaneously
Single allocation flow is the Order splitting dispatching person in order set to be allocated.
What deserves to be explained is the type ID of above-mentioned dispatching person is only for example, in practical application, different numerical value can be set simultaneously
And different system modes can be used.
In another embodiment, the priority that can be pre-configured between at least two class dispatching persons., can be with based on this
According to the priority between at least two class dispatching persons, still have from every class dispatching person successively in the dispatching person that order needs dispense,
Using simultaneously single allocation flow as the Order splitting dispatching person in order set to be allocated.
A kind of situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, the priority of full-time dispatching person
Higher than the priority of part-time dispatching person.Based on this, when entrance and single allocation flow, first can still be ordered from full-time dispatching person
Singly need in the dispatching person that dispenses, using and single allocation flow as the Order splitting dispatching person in order set to be allocated；Again from simultaneous
Still have in duty dispatching person in the dispatching person that order needs dispense, using simultaneously single allocation flow as the order in order set to be allocated point
With dispatching person.
Another situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, and part-time dispatching person's is preferential
Level is higher than the priority of full-time dispatching person.Based on this, when entrance and single allocation flow, first can still have from part-time dispatching person
In the dispatching person that order needs dispense, using simultaneously single allocation flow as the Order splitting dispatching person in order set to be allocated；Again from
Still have in full-time dispatching person in the dispatching person that order needs dispense, using simultaneously single allocation flow as the order in order set to be allocated
Distribute dispatching person.
What deserves to be explained is which kind of either above-mentioned situation, according to the difference of dispatching person's type, logistic dispatching system is being held
During row and single allocation flow, the scheduling mode of dispatching person would also vary from.Tune of the logistic dispatching system to dispatching person
Degree mode can include：Assignment mode and rob monotype.
Above-mentioned assignment mode refers to the method for salary distribution that order is directly assigned to corresponding dispatching person by logistic dispatching system.
In assignment mode, dispatching person does not have a decision-making power, and Order splitting efficiency is higher.Correspondingly, above-mentioned monotype of robbing refers to be adjusted by order
The information of order is sent to dispatching person by degree system, decides whether competition for orders by dispatching person, and Order splitting is robbed into middle order
The method of salary distribution of dispatching person.In monotype is robbed, dispatching person has decision-making power, manages more flexible, the free degree of part-time dispatching person
It is higher, be advantageous to improve Order splitting efficiency.
For example, for full-time dispatching person, assignment mode can be used, to ensure Order splitting efficiency；For part-time dispatching
Member, it can use and rob monotype, to ensure Order splitting efficiency.
Scheduling mode with reference to logistic dispatching system to dispatching person, either above-mentioned any situation, to full-time dispatching person
For, appointment mode can be used, still have order to need in the dispatching person that dispenses from full-time dispatching person, with and single allocation flow
For the Order splitting dispatching person in order set to be allocated.Similarly, for part-time dispatching person, competition for orders mode can be used, from
Still have in part-time dispatching person in the dispatching person that order needs dispense, using simultaneously single allocation flow as the order in order set to be allocated
Distribute dispatching person.
For full-time dispatching person, using the mode of appointment, still there is order to need the dispatching person dispensed from full-time dispatching person
In, included using simultaneously single process of the allocation flow as the Order splitting dispatching person in order set to be allocated：Obtain order to be allocated
The unassigned order gone out in set；To each order in the unassigned order gone out in order set to be allocated, meter
Calculate the matching degree between each dispatching person for still there are order needs to dispense in the order and full-time dispatching person；Judge full-time dispatching
In member in each dispatching person for still thering are order needs to dispense, if the matching degree between the order be present and meet the first matching
Spend desired dispatching person；If judged result is has, the matching degree directly given the Order splitting between the order accords with
Close the dispatching person of the first matching degree requirement.
For part-time dispatching person, using competition for orders mode, still there is order to need the dispatching person dispensed from part-time dispatching person
In, included using simultaneously single allocation flow as the Order splitting dispatching person in order set to be allocated：Obtain in order set to be allocated
The unassigned order gone out；To each order in the unassigned order gone out in order set to be allocated, described in calculating
It is each in order and the part-time dispatching person still to there is order to need the matching degree between the dispatching person that dispenses；Judge part-time dispatching person
In each still there is order to need in the dispatching person that dispenses, if the matching degree between the order be present and meet the first matching degree
It is required that dispatching person；If judged result is sent to the matching degree between the order to exist, by the information of the order and accorded with
The dispatching person of the first matching degree requirement is closed, so that the matching degree between the order meets the dispatching person of the first matching degree requirement
Competition for orders；When there is dispatching person to initiate to rob single operation, the Order splitting is robbed to the dispatching person of single operation to initiation.
, it is necessary to calculate the unassigned order gone out and sole duty in order set to be allocated in above-mentioned and single allocation flow
It is each in dispatching person or part-time dispatching person still to there is order to need the matching degree between the dispatching person that dispenses.It is alternatively possible to according to
The attribute of order, such as at least one of user property, trade company's attribute and order self attributes, calculate the order with it is part-time
The similarity for waiting to take between single order of each dispatching person for still thering are order needs to dispense in dispatching person.
Illustrate, it is assumed that the unassigned order gone out there are 5 in order set to be allocated, is designated as order A_1, order
Still there is order to need the dispatching person dispensed in A_2, order A_3, order A_4 and order A_5, full-time dispatching person or part-time dispatching person
For 2, dispatching person P_1 and dispatching person P_2 are designated as, then after above-mentioned Similarity Measure, can be obtained each in 5 orders
Similarity in order and 2 dispatching persons between the order to be dispensed of each dispatching person, is represented by：Sim_A_11、Sim_A_
12nd, Sim_A_21, Sim_A_22, Sim_A_31, Sim_A_32, Sim_A_41, Sim_A_42, Sim_A_51 and Sim_A_
52.Wherein, Sim_A_11 represents the similarity between order A_1 and dispatching person P_1 order to be dispensed；Sim_A_12 represents to order
Similarity between single A_1 and dispatching person P_2 order to be dispensed；Sim_A_21 expressions order A_2 and dispatching person P_1's waits to match somebody with somebody
Send the similarity between order；Sim_A_22 represents the similarity between order A_2 and dispatching person P_2 order to be dispensed；
Sim_A_31 represents the similarity between order A_3 and dispatching person P_1 order to be dispensed；Sim_A_32 represent order A_3 with
Similarity between dispatching person P_2 order to be dispensed；Sim_A_41 represents order A_4 and dispatching person P_1 order to be dispensed
Between similarity；Sim_A_42 represents the similarity between order A_4 and dispatching person P_2 order to be dispensed；Sim_A_51
Represent the similarity between order A_5 and dispatching person P_1 order to be dispensed；Sim_A_52 represents order A_5 and dispatching person P_2
Order to be dispensed between similarity.
Then, in the unassigned each order gone out in order set to be allocated and full-time dispatching person or part-time dispatching person
It is each still to there is order to need the similarity for waiting to take between single order of dispatching person dispensed, calculate in order set to be allocated not by
Each order dispensed and the matching of each dispatching person for still thering are order needs to dispense in full-time dispatching person or part-time dispatching person
Degree.
Alternatively, to still having order in the first order in order set to be allocated and full-time dispatching person or part-time dispatching person
Need for the first dispatching person for dispensing, the similarity between the first order and the order to be taken of the first dispatching person can be carried out
Weighted sum, as the first order and the matching degree of the first dispatching person.Wherein, the first order can be in order set to be allocated
The unassigned any order gone out；Correspondingly, the first dispatching person can still be ordered in full-time dispatching person or part-time dispatching person
Singly need any dispatching person dispensed.
Alternatively, can be in the way of setting, successively from least two class dispatching persons in above-mentioned packet allocation flow
In, using in being grouped allocation flow as order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow.
Here the meaning for referring to, according to certain order, perform one by one " successively ".Wherein, successively from least two class dispatching persons, with
Packet allocation flow be in order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow actually
Refer to：According to certain order, from every class dispatching person, using in being grouped allocation flow as order set to be allocated not with and single point
The Order splitting dispatching person dispensed with flow.
Similar with above-mentioned and single allocation flow, the mode set here can be the type according at least two class dispatching persons
The orders of ID from small to large, successively from every class dispatching person, using in being grouped allocation flow as order set to be allocated not with and it is single
The Order splitting dispatching person that allocation flow dispenses.
A kind of situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, the type ID of full-time dispatching person
For 00001111 (binary system), the type ID of part-time dispatching person is 00011111 (binary system).Based on this, distributed when entering packet
During flow, can first from full-time dispatching person, using in being grouped allocation flow as order set to be allocated not with and single allocation flow
The Order splitting dispatching person dispensed；Again from part-time dispatching person, using in being grouped allocation flow as order set to be allocated not
With the Order splitting dispatching person that simultaneously single allocation flow dispenses.
Another situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, the type of part-time dispatching person
ID is 00001111 (binary system), and the type ID of full-time dispatching person is 00011111 (binary system).Based on this, divide when entering packet
During with flow, can first from part-time dispatching person, using in being grouped allocation flow as order set to be allocated not with and singly distribution flow
The Order splitting dispatching person that journey dispenses；Again from full-time dispatching person, to be grouped allocation flow as in order set to be allocated
Not with and the Order splitting dispatching person that dispenses of single allocation flow.
Similar with above-mentioned and single allocation flow, the mode set here can also be according between at least two class dispatching persons
Priority, successively from every class dispatching person, using in being grouped allocation flow as order set to be allocated not with and single allocation flow
The Order splitting dispatching person dispensed.
A kind of situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, the priority of full-time dispatching person
Higher than the priority of part-time dispatching person., can be first from full-time dispatching person, to divide when entering packet allocation flow based on this
Group allocation flow be in order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow；Again from part-time
In dispatching person, using in being grouped allocation flow as order set to be allocated not with and the Order splitting that dispenses of single allocation flow match somebody with somebody
The person of sending.
Another situation：At least two class dispatching persons include full-time dispatching person and part-time dispatching person, and part-time dispatching person's is preferential
Level is higher than the priority of full-time dispatching person.Based on this, when enter be grouped allocation flow when, can first from part-time dispatching person, with
Packet allocation flow be in order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow；Again from special
In duty dispatching person, using in being grouped allocation flow as order set to be allocated not with and the Order splitting that dispenses of single allocation flow
Dispatching person.
Similarly, which kind of either above-mentioned situation, according to the difference of dispatching person's type, logistic dispatching system is performing packet point
During flow, the scheduling mode of dispatching person would also vary from.Logistic dispatching system can to the scheduling mode of dispatching person
With including：Assignment mode and rob monotype.
For example, for full-time dispatching person, assignment mode can be used, to ensure Order splitting efficiency；For part-time dispatching
Member, it can use and rob monotype, to ensure Order splitting efficiency.
Scheduling mode with reference to logistic dispatching system to dispatching person, either above-mentioned any situation, to full-time dispatching person
For, appointment mode can be used, from full-time dispatching person, using in being grouped allocation flow as order set to be allocated not with and it is single
The Order splitting dispatching person that allocation flow dispenses.Similarly, for part-time dispatching person, competition for orders mode can be used, from simultaneous
In duty dispatching person, using in being grouped allocation flow as order set to be allocated not with and the Order splitting that dispenses of single allocation flow
Dispatching person.
For full-time dispatching person, using assign mode, using in being grouped allocation flow as order set to be allocated not with simultaneously
The Order splitting dispatching person that single allocation flow dispenses, including：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into order set to be allocated
Group；Calculate the matching degree in each order group and full-time dispatching person between each dispatching person at least one order group；According to each
Matching degree in order group and full-time dispatching person between each dispatching person, it is each order group distribution dispatching from full-time dispatching person
Member.
For part-time dispatching person, using competition for orders mode, from part-time dispatching person, ordered using being grouped allocation flow to be to be allocated
Not with the Order splitting dispatching person that simultaneously single allocation flow dispenses in single set, including：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into order set to be allocated
Group；Calculate the matching degree in each order group and part-time dispatching person between each dispatching person at least one order group；According to each
The order of matching degree from high to low in order group and part-time dispatching person between each dispatching person, the information of each order group is sent
To each dispatching person in part-time dispatching person, with etc. member's competition for orders to be dispensed；And to each order group, ordered when there is dispatching person for described
When single group is initiated to rob single operation, the order component dispensing is initiated to rob the dispatching person of single operation.
In above-mentioned packet allocation flow, it is necessary to by order set to be allocated not with and single allocation flow dispense
Order, it is divided at least one order group.It is alternatively possible to according in order set to be allocated not with and the distribution of single allocation flow
The attribute for the order gone out, such as at least one of user property, trade company's attribute and order self attributes, calculate to be allocated
In order set not with and the order that dispenses of single allocation flow between similarity.For example, can be according to two not with simultaneously
The order that single allocation flow dispenses takes single-address, calculate two not with and the order that dispenses of single allocation flow between
Similarity.Two orders take single-address nearer, and two orders are more similar.In another example can according to two not with and single point
The estimated delivery time of the order dispensed with flow, calculate two not with and the order that dispenses of single allocation flow between
Similarity.The estimated delivery time of two orders is closer, and two orders are more similar.In another example can according to two not with
And the estimated delivery time of the order that dispenses of single allocation flow, take single-address, send single-address and lower single time, calculating two
It is individual not with and the order that dispenses of single allocation flow between similarity.It is alternatively possible to sent respectively according to the estimated of order
Up to the time, take single-address, send single-address and lower single time to calculate the sub- similarity of four dimensions, then by four dimensions
Sub- similarity carries out numerical value processing, such as weighted sum, obtain two not with and the order that dispenses of single allocation flow it
Between similarity.
Then, according in order set to be allocated not with and the order that dispenses of single allocation flow between similarity,
At least one order group will not be divided into the order that simultaneously single allocation flow dispenses in order set to be allocated.For example, can
So that order of the similarity in same similarity dimensions is divided into one group.
What deserves to be explained is the Order splitting flow when carrying out United Dispatching at least two class dispatching persons is and singly distributed
During flow, and the implementation procedure of single allocation flow can be found in and above-mentioned still have order to need to dispense from least two class dispatching persons successively
Dispatching person in, using and single allocation flow as the Order splitting dispatching person in order set to be allocated description.When at least two
When Order splitting flow when class dispatching person carries out United Dispatching is packet allocation flow, the implementation procedure for being grouped allocation flow can
Referring to above-mentioned successively from least two class dispatching persons, using in being grouped allocation flow as order set to be allocated not with and singly distribution flow
The description for the Order splitting dispatching person that journey dispenses.
In the application scenarios merged to full-time dispatching person with part-time dispatching person, a kind of flow of order dispatch method
As shown in Fig. 2 comprise the following steps：
201st, full-time dispatching person and each self-corresponding order pond of part-time dispatching person are scanned, collects and treats point from two order ponds
With order, order set to be allocated is formed.
In step 201, order dispatch system is done to the order in full-time dispatching person and the corresponding order pond of part-time dispatching person
United Dispatching.
For example, order pond corresponding to full-time dispatching person can first be scanned, order to be allocated is therefrom obtained；Part-time match somebody with somebody is scanned again
Order pond corresponding to the person of sending, therefrom obtain order to be allocated.
In another example order pond corresponding to part-time dispatching person can first be scanned, order to be allocated is therefrom obtained；Sole duty is scanned again
Order pond corresponding to dispatching person, therefrom obtain order to be allocated.
In another example can with order pond corresponding to order pond corresponding to parallel scan sole duty dispatching person and part-time dispatching person, from
Order to be allocated is obtained in two order ponds.
202nd, under assignment mode and single allocation flow is performed, still to there is order to need what is dispensed to match somebody with somebody from full-time dispatching person
It is the Order splitting dispatching person in order set to be allocated in the person of sending.
Alternatively, under a kind of assignment mode and single allocation flow include：For each ordering in order set to be allocated
It is single, calculate each dispatching person that the order dispenses to still there is order to need in full-time dispatching person wait to take it is similar between single order
Degree；Based on still there is order to need the similarity between waiting to take single order of each dispatching person dispensed in the order and full-time dispatching person,
Calculate the matching degree between each dispatching person for still there are order needs to dispense in the order and full-time dispatching person；Judge full-time dispatching person
In still there is order to need in each dispatching person for dispensing, if exist and meet the requirement of the first matching degree with the matching degree between the order
Dispatching person；If judged result is has, the matching degree that the Order splitting is given between the order is met into the first matching degree will
The dispatching person asked.
203rd, after under performing assignment mode and single allocation flow, judge whether also have not in order set to be allocated
The order of distribution；If so, then perform step 204；If it is not, terminate this time to operate.
204th, perform and rob under monotype and single allocation flow, still to there is order to need what is dispensed to match somebody with somebody from part-time dispatching person
It is remaining unappropriated Order splitting dispatching person in order set to be allocated in the person of sending.
Alternatively, it is a kind of to rob under monotype and single allocation flow and include：Calculate respectively remaining in order set to be allocated
Each order and part-time dispatching person in still there is order to need the similarity for waiting to take between single order of each dispatching person dispensed；Base
Each dispatching person's that remaining each order dispenses with still there is order to need in part-time dispatching person in order set to be allocated treats
The similarity between single order is taken, calculating still has order to need between each dispatching person for dispensing in the order and part-time dispatching person
Matching degree；Judge still to have in part-time dispatching person order to need in each dispatching person for dispensing, if to exist and between the order
Meet the dispatching person of the first matching degree requirement with degree；If the information of the order is sent to and the order by judged result to exist
Between matching degree meet the first matching degree requirement dispatching person, for these dispatching person's competition for orders；Competition for orders is initiated when there is dispatching person
During operation, the Order splitting is robbed to the dispatching person of single operation to initiation.
205th, after under monotype and single allocation flow is robbed in execution, judge whether also exist in order set to be allocated
Unappropriated order；If so, then perform step 206；If it is not, terminate this time to operate.
206th, the packet allocation flow under assignment mode is performed, to be to be remained in order set to be allocated from full-time dispatching person
Remaining unappropriated Order splitting dispatching person.
Alternatively, the packet allocation flow under a kind of assignment mode includes：Residue in order set to be allocated is calculated not divide
Similarity between the order matched somebody with somebody；According to the similarity between these orders, these orders are divided at least one order group.
The matching degree between each dispatching person in each order group and full-time dispatching person is calculated, " each dispatching person " is not limited here, can
To be any dispatching person that can be scheduled under assignment mode.Based on the matching degree between order group and dispatching person, using the overall situation
Order group is associated by optimal algorithm with dispatching person；The order group of a certain dispatching person will be associated with, it is corresponding to add the dispatching person
Indent queue in preserved, to wait the dispatching person to be dispensed.For dispatching person, in the order group that it is currently dispensed
When being near completion, new order group can be read from indent queue and is dispensed.
207th, after the packet allocation flow under performing assignment mode, judge whether also exist in order set to be allocated
Unappropriated order group；If so, then perform step 208；If it is not, terminate this time to operate.
208th, the packet allocation flow robbed under monotype is performed, to be to be remained in order set to be allocated from part-time dispatching person
Remaining unappropriated order group distribution dispatching person, and return and perform step 201.
Alternatively, a kind of packet allocation flow robbed under monotype includes：Residue in order set to be allocated is calculated not divide
Matching degree in each order group matched somebody with somebody and part-time dispatching person between each dispatching person；Based on the matching between order group and dispatching person
Degree, according to the order of the matching degree between each dispatching person and order group from high to low, each dispatching is sent to by the information of order group
Member, with etc. member's competition for orders to be dispensed.For any order group, if there is dispatching person's competition for orders, logistic dispatching system can order this
Single group distributes to the dispatching person for initiating to rob single operation.
Alternatively, can be again if there is no dispatching person's competition for orders in the competition for orders time-out time (such as 12 minutes) of setting
Into next round scheduling process.
What deserves to be explained is the theoretic packet method of salary distribution should include the operation to order packet, but because refer to
Send the packet allocation flow under pattern first, i.e., remaining unappropriated order is grouped in step 206, and step
208 be that the remaining unappropriated order group of step 206 is allocated, therefore in the packet robbed under monotype described in step 208 point
The operation to order packet is not included with flow.Similarly, if the packet allocation flow under robbing monotype is first, rob under monotype
Packet allocation flow can include the operation to order packet, and the packet allocation flow under posterior assignment mode will not include
Operation to order packet.
In the present embodiment, in step 201, the order in full-time dispatching person and the corresponding order pond of part-time dispatching person is entered
Row United Dispatching.In step 202-204, in simultaneously single allocation flow, full-time dispatching person and part-time dispatching person are carried out successively
Scheduling, while dispatching by the way is realized, in the full-time dispatching person transport power deficiency of dispatching by the way, using part-time dispatching person by the way
The transport power of dispatching is supplemented part-time dispatching person, to give full play to the advantage of dispatching by the way, saves transport power, improves dispatching effect
Rate.Further, in step 205-208, in allocation flow is grouped, full-time dispatching person and part-time dispatching person are adjusted successively
Degree, in the case of the transport power deficiency of full-time dispatching person, is supplemented full-time dispatching person using the transport power of part-time dispatching person, real
Complementation between existing two kinds of transport power so that in the case of transport power cost is alap, ensures the dispatching efficiency of order, carry as far as possible
High Consumer's Experience.
It should be noted that the executive agent that above-described embodiment provides each step of method may each be same equipment,
Or this method is also by distinct device as executive agent.For example the executive agent of step 101 to step 103 can be equipment
A；Again for example, step 101 and 102 executive agent can be device A, and the executive agent of step 103 can be equipment B；Etc..
Fig. 3 is the structural representation for the order dispatch device that the another embodiment of the application provides.As shown in figure 3, device bag
Include：Acquisition module 31, determining module 32 and distribute module 33.
Acquisition module 31, for obtaining each self-corresponding order to be allocated of at least two class dispatching persons, form order to be allocated
Set.
Determining module 32, for determining Order splitting flow when at least two class dispatching persons are carried out with United Dispatching.
Distribute module 33, for being to be allocated from least two class dispatching persons during execution of order allocation flow
Order splitting dispatching person in order set.
In an optional embodiment, acquisition module 31 is specifically used for：It is it is determined that one-to-one with least two class dispatching persons
At least two class order ponds；The order to be allocated at least two class order ponds is obtained, forms order set to be allocated.
In an optional embodiment, Order splitting flow is simultaneously single allocation flow, is grouped allocation flow or including simultaneously single
The fusion allocation flow of allocation flow and packet allocation flow.
In an optional embodiment, when Order splitting flow is merges allocation flow, distribute module 33 is specifically used for：
Still have from least two class dispatching persons in the dispatching person that order needs dispense, ordered using simultaneously single allocation flow to be to be allocated
Order splitting dispatching person in single set；
From at least two class dispatching persons, not divided in being grouped allocation flow as order set to be allocated with simultaneously single allocation flow
With the Order splitting dispatching person to go out.
In an optional embodiment, distribute module 33 is using simultaneously single allocation flow as the order in order set to be allocated
When distributing dispatching person, it is specifically used for：
According to the priority between at least two class dispatching persons, still there is order to need what is dispensed to match somebody with somebody from every class dispatching person successively
In the person of sending, using simultaneously single allocation flow as the Order splitting dispatching person in order set to be allocated.
In an optional embodiment, to the full-time dispatching person at least two class dispatching persons, distribute module 33 is specifically used for：
Obtain the unassigned order gone out in order set to be allocated；
To each order in the unassigned order gone out in order set to be allocated, order and full-time dispatching person are calculated
In each still there is order to need the matching degree between the dispatching person that dispenses；
Judge in full-time dispatching person in each dispatching person for still there are order needs to dispense, if between order be present
Meet the dispatching person of the first matching degree requirement with degree；
If Order splitting is directly given the matching degree between order and meets the requirement of the first matching degree by judged result to exist
Dispatching person.
In an optional embodiment, to the part-time dispatching person at least two class dispatching persons, distribute module 33 is specifically used for：
Obtain the unassigned order gone out in order set to be allocated；
To each order in the unassigned order gone out in order set to be allocated, order and part-time dispatching person are calculated
In each still there is order to need the matching degree between the dispatching person that dispenses；
Judge in part-time dispatching person in each dispatching person for still there are order needs to dispense, if between order be present
Meet the dispatching person of the first matching degree requirement with degree；
If judged result is has, the matching degree that the information of order is sent between order is met into the first matching degree will
The dispatching person asked, so that the matching degree between order meets dispatching person's competition for orders of the first matching degree requirement；
When there is dispatching person to initiate to rob single operation, Order splitting is robbed to the dispatching person of single operation to initiation.
In an optional embodiment, distribute module 33 using in being grouped allocation flow as order set to be allocated not with simultaneously
During the Order splitting dispatching person that single allocation flow dispenses, it is specifically used for：
According to the priority between at least two class dispatching persons, successively from every class dispatching person, to be grouped allocation flow to treat
In distribution order set not with and the Order splitting dispatching person that dispenses of single allocation flow.
In an optional embodiment, to full-time dispatching person at least two class dispatching persons, distribute module 33 is specifically used for：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into order set to be allocated
Group；
Calculate the matching degree in each order group and full-time dispatching person between each dispatching person at least one order group；
It is each from full-time dispatching person according to the matching degree between each dispatching person in each order group and full-time dispatching person
Order group distributes dispatching person.
In an optional embodiment, to part-time dispatching person at least two class dispatching persons, distribute module 33 is specifically used for：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into order set to be allocated
Group；
Calculate the matching degree in each order group and part-time dispatching person between each dispatching person at least one order group；
, will be each according to the order of the matching degree between each dispatching person in each order group and part-time dispatching person from high to low
The information of order group is sent to each dispatching person in part-time dispatching person, with etc. member's competition for orders to be dispensed；And
To each order group, when there is dispatching person to initiate to rob single operation for order group, order component dispensing is initiated to rob
The dispatching person of single operation.
The order dispatch device that the present embodiment provides, available for the corresponding flow performed in above method embodiment, it has
Body running principle repeats no more.
The order dispatch device that the present embodiment provides, each self-corresponding order to be allocated of at least two class dispatching persons is melted
Close, form order set to be allocated, United Dispatching is carried out at least two class dispatching persons, using Order splitting stream during United Dispatching
Journey, it is the Order splitting dispatching person to be allocated after fusion from least two class dispatching persons, the angle merged from order is to polymorphic type
Dispatching person carries out United Dispatching, realizes the complementation between a variety of transport power, is advantageous to further improve the dispatching efficiency of order, reduces
The probability of order time-out dispatching.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or computer program
Product.Therefore, the present invention can use the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Apply the form of example.Moreover, the present invention can use the computer for wherein including computer usable program code in one or more
The computer program production that usable storage medium is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of product.
The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that can be by every first-class in computer program instructions implementation process figure and/or block diagram
Journey and/or the flow in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided
The processors of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for real
The device for the function of being specified in present one flow of flow chart or one square frame of multiple flows and/or block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which produces, to be included referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, so as in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
In a typical configuration, computing device includes one or more processors (CPU), input/output interface, net
Network interface and internal memory.
Internal memory may include computer-readable medium in volatile memory, random access memory (RAM) and/or
The forms such as Nonvolatile memory, such as read-only storage (ROM) or flash memory (flash RAM).Internal memory is computer-readable medium
Example.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer-readable instruction, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase transition internal memory (PRAM), static RAM (SRAM), moved
State random access memory (DRAM), other kinds of random access memory (RAM), read-only storage (ROM), electric erasable
Programmable read only memory (EEPROM), fast flash memory bank or other memory techniques, read-only optical disc read-only storage (CD-ROM),
Digital versatile disc (DVD) or other optical storages, magnetic cassette tape, the storage of tape magnetic rigid disk or other magnetic storage apparatus
Or any other non-transmission medium, the information that can be accessed by a computing device available for storage.Define, calculate according to herein
Machine computer-readable recording medium does not include temporary computer readable media (transitory media), such as data-signal and carrier wave of modulation.
It should also be noted that, term " comprising ", "comprising" or its any other variant are intended to nonexcludability
Comprising so that process, method, commodity or equipment including a series of elements not only include those key elements, but also wrapping
Include the other element being not expressly set out, or also include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that wanted including described
Other identical element also be present in the process of element, method, commodity or equipment.
It will be understood by those skilled in the art that embodiments herein can be provided as method, system or computer program product.
Therefore, the application can be using the embodiment in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Form.Deposited moreover, the application can use to can use in one or more computers for wherein including computer usable program code
The shape for the computer program product that storage media is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
Embodiments herein is the foregoing is only, is not limited to the application.For those skilled in the art
For, the application can have various modifications and variations.All any modifications made within spirit herein and principle, it is equal
Replace, improve etc., it should be included within the scope of claims hereof.
The embodiment of the present application discloses A1, a kind of order dispatch method, including：
Each self-corresponding order to be allocated of at least two class dispatching persons is obtained, forms order set to be allocated；
It is determined that Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；
It is the order to be allocated from least two class dispatching persons during the Order splitting flow is performed
Order splitting dispatching person in set.
In A2, the method as described in A1, each self-corresponding order to be allocated of at least two class dispatching persons is obtained, is formed to be allocated
Order set, including：
It is determined that with the one-to-one at least two class order ponds of at least two class dispatching persons；
Order to be allocated at least two class order ponds described in obtaining, form the order set to be allocated.
In A3, the method as described in A1, the Order splitting flow for and single allocation flow, packet allocation flow or including
And the fusion allocation flow of single allocation flow and packet allocation flow.
In A4, the method as described in A3, when the Order splitting flow is merges allocation flow, the order is being performed
It is the Order splitting dispatching in the order set to be allocated from least two class dispatching persons during allocation flow
Member, including：
Still have from least two class dispatching persons in the dispatching person that order needs dispense, be described using simultaneously single allocation flow
Order splitting dispatching person in order set to be allocated；
From at least two class dispatching persons, using in being grouped allocation flow as the order set to be allocated not with and single point
The Order splitting dispatching person dispensed with flow.
In A5, the method as described in A4, still have from least two class dispatching persons in the dispatching person that order needs dispense,
Using simultaneously single allocation flow as the Order splitting dispatching person in the order set to be allocated, including：
According to the priority between at least two class dispatching persons, still there is order to need to dispense from every class dispatching person successively
Dispatching person in, using and single allocation flow as the Order splitting dispatching person in the order set to be allocated.
In A6, the method as described in A5, to the full-time dispatching person at least two class dispatching persons, from the full-time dispatching
Still have in member in the dispatching person that order needs dispense, using simultaneously single allocation flow as the Order splitting in the order set to be allocated
Dispatching person, including：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in full-time dispatching person；
Judge in the full-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the matching degree that the Order splitting is given between the order is directly met first by judged result to exist
The dispatching person required with degree.
In A7, the method as described in A5 or A6, to the part-time dispatching person at least two class dispatching persons, from described part-time
Still have in dispatching person in the dispatching person that order needs dispense, using simultaneously single allocation flow as the order in the order set to be allocated
Dispatching person is distributed, including：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in part-time dispatching person；
Judge in the part-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the information of the order is sent to the matching degree between the order and meets first by judged result to exist
The dispatching person of matching degree requirement, so that the matching degree between the order meets dispatching person's competition for orders of the first matching degree requirement；
When there is dispatching person to initiate to rob single operation, the Order splitting is robbed to the dispatching person of single operation to initiation.
In A8, the method as described in A4, from least two class dispatching persons, to be grouped allocation flow to be described to be allocated
Not with the Order splitting dispatching person that simultaneously single allocation flow dispenses in order set, including：
According to the priority between at least two class dispatching persons, successively from every class dispatching person, to be grouped allocation flow
For in the order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow.
In A9, the method as described in A8, to full-time dispatching person at least two class dispatching persons, from the full-time dispatching person
In, using in being grouped allocation flow as the order set to be allocated not with and the Order splitting that dispenses of single allocation flow dispense
Member, including：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the full-time dispatching person between each dispatching person at least one order group
With degree；
According to the matching degree between each dispatching person in each order group and the full-time dispatching person, match somebody with somebody from the sole duty
It is each order group distribution dispatching person in the person of sending.
In A10, the method as described in A8 or A9, to part-time dispatching person at least two class dispatching persons, from described part-time
In dispatching person, using in being grouped allocation flow as the order set to be allocated not with and the order point that dispenses of single allocation flow
With dispatching person, including：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the part-time dispatching person between each dispatching person at least one order group
With degree；
, will according to the order of the matching degree between each dispatching person in each order group and the part-time dispatching person from high to low
The information of each order group is sent to each dispatching person in the part-time dispatching person, with etc. member's competition for orders to be dispensed；And
To each order group, when there is dispatching person to initiate to rob single operation for the order group, the order group is distributed
The dispatching person of single operation is robbed to initiation.
B11, a kind of order dispatch device is also disclosed in the embodiment of the present application, including：
Acquisition module, for obtaining each self-corresponding order to be allocated of at least two class dispatching persons, form order collection to be allocated
Close；
Determining module, for determining Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；
Distribute module, for during the Order splitting flow is performed, being from least two class dispatching persons
Order splitting dispatching person in the order set to be allocated.
In B12, the device as described in B11, the acquisition module is specifically used for：
It is determined that with the one-to-one at least two class order ponds of at least two class dispatching persons；
Order to be allocated at least two class order ponds described in obtaining, form the order set to be allocated.
In B13, the device as described in B11, the Order splitting flow is simultaneously single allocation flow, packet allocation flow or bag
Include the simultaneously fusion allocation flow of single allocation flow and packet allocation flow.
In B14, the device as described in B13, when the Order splitting flow is merges allocation flow, the distribute module
It is specifically used for：
Still have from least two class dispatching persons in the dispatching person that order needs dispense, be described using simultaneously single allocation flow
Order splitting dispatching person in order set to be allocated；
From at least two class dispatching persons, using in being grouped allocation flow as the order set to be allocated not with and single point
The Order splitting dispatching person dispensed with flow.
In B15, the device as described in B14, the distribute module is using simultaneously single allocation flow as the order collection to be allocated
During Order splitting dispatching person in conjunction, it is specifically used for：
According to the priority between at least two class dispatching persons, still there is order to need to dispense from every class dispatching person successively
Dispatching person in, using and single allocation flow as the Order splitting dispatching person in the order set to be allocated.
In B16, the device as described in B15, to the full-time dispatching person at least two class dispatching persons, the distribute module
It is specifically used for：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in full-time dispatching person；
Judge in the full-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the matching degree that the Order splitting is given between the order is directly met first by judged result to exist
The dispatching person required with degree.
In B17, the device as described in B15 or B16, to the part-time dispatching person at least two class dispatching persons, described point
It is specifically used for module：
Obtain the unassigned order gone out in the order set to be allocated；
To each order in the unassigned order gone out in the order set to be allocated, the order and institute are calculated
State the matching degree between each dispatching person for still there are order needs to dispense in part-time dispatching person；
Judge in the part-time dispatching person in each dispatching person for still there are order needs to dispense, if exist and the order
Between matching degree meet the first matching degree requirement dispatching person；
If the information of the order is sent to the matching degree between the order and meets first by judged result to exist
The dispatching person of matching degree requirement, so that the matching degree between the order meets dispatching person's competition for orders of the first matching degree requirement；
When there is dispatching person to initiate to rob single operation, the Order splitting is robbed to the dispatching person of single operation to initiation.
In B18, the device as described in B14, the distribute module is to be grouped allocation flow as the order collection to be allocated
In conjunction not with and single allocation flow dispense Order splitting dispatching person when, be specifically used for：
According to the priority between at least two class dispatching persons, successively from every class dispatching person, to be grouped allocation flow
For in the order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow.
In B19, the device as described in B18, to full-time dispatching person at least two class dispatching persons, the distribute module tool
Body is used for：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the full-time dispatching person between each dispatching person at least one order group
With degree；
According to the matching degree between each dispatching person in each order group and the full-time dispatching person, match somebody with somebody from the sole duty
It is each order group distribution dispatching person in the person of sending.
In B20, the device as described in B18 or B19, to part-time dispatching person at least two class dispatching persons, the distribution
Module is specifically used for：
, not with the order that simultaneously single allocation flow dispenses, at least one order will be divided into the order set to be allocated
Single group；
Calculate in each order group and the part-time dispatching person between each dispatching person at least one order group
With degree；
, will according to the order of the matching degree between each dispatching person in each order group and the part-time dispatching person from high to low
The information of each order group is sent to each dispatching person in the part-time dispatching person, with etc. member's competition for orders to be dispensed；And
To each order group, when there is dispatching person to initiate to rob single operation for the order group, the order group is distributed
The dispatching person of single operation is robbed to initiation.
C21, a kind of electronic equipment is also disclosed in the embodiment of the present application, including：Memory and processor；The memory storage
There is one or more computer instruction, one or more computer instruction is realized above-mentioned when by the computing device
Step in any one of A1-A10 methods describeds.
D22, a kind of computer-readable storage medium for being stored with computer program, the computer is also disclosed in the embodiment of the present application
The step in any one of above-mentioned A1-A10 methods described is realized when program is performed.
Claims (10)
- A kind of 1. order dispatch method, it is characterised in that including：Each self-corresponding order to be allocated of at least two class dispatching persons is obtained, forms order set to be allocated；It is determined that Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；It is the order set to be allocated from least two class dispatching persons during the Order splitting flow is performed In Order splitting dispatching person.
- 2. according to the method for claim 1, it is characterised in that obtain that at least two class dispatching persons are each self-corresponding to be allocated to order It is single, order set to be allocated is formed, including：It is determined that with the one-to-one at least two class order ponds of at least two class dispatching persons；Order to be allocated at least two class order ponds described in obtaining, form the order set to be allocated.
- 3. according to the method for claim 1, it is characterised in that the Order splitting flow is simultaneously single allocation flow, packet Allocation flow or the fusion allocation flow for including simultaneously single allocation flow and packet allocation flow.
- 4. according to the method for claim 3, it is characterised in that when the Order splitting flow is merges allocation flow, It is in the order set to be allocated from least two class dispatching persons during the Order splitting flow is performed Order splitting dispatching person, including：Still there is order to need in the dispatching person that dispenses from least two class dispatching persons, using and single allocation flow treated as described in point With the Order splitting dispatching person in order set；From at least two class dispatching persons, using in being grouped allocation flow as the order set to be allocated not with and singly distribution flow The Order splitting dispatching person that journey dispenses.
- 5. according to the method for claim 4, it is characterised in that still there is order to need to match somebody with somebody from least two class dispatching persons In the dispatching person sent, using simultaneously single allocation flow as the Order splitting dispatching person in the order set to be allocated, including：According to the priority between at least two class dispatching persons, still there is order to need what is dispensed to match somebody with somebody from every class dispatching person successively In the person of sending, using simultaneously single allocation flow as the Order splitting dispatching person in the order set to be allocated.
- 6. according to the method for claim 5, it is characterised in that to the full-time dispatching person at least two class dispatching persons, Still have from the full-time dispatching person in the dispatching person that order needs dispense, using simultaneously single allocation flow as the order collection to be allocated Order splitting dispatching person in conjunction, including：Obtain the unassigned order gone out in the order set to be allocated；To each order in the unassigned order gone out in the order set to be allocated, calculate the order with it is described specially Matching degree in duty dispatching person between each dispatching person for still thering are order needs to dispense；Judge in the full-time dispatching person in each dispatching person for still there are order needs to dispense, if exist between the order Matching degree meet the first matching degree requirement dispatching person；If the matching degree that the Order splitting is given between the order is directly met the first matching degree by judged result to exist It is required that dispatching person.
- 7. according to the method described in claim any one of 4-6, it is characterised in that from least two class dispatching persons, to divide Group allocation flow is not with the Order splitting dispatching person that simultaneously single allocation flow dispenses, bag in the order set to be allocated Include：According to the priority between at least two class dispatching persons, successively from every class dispatching person, to be grouped allocation flow as institute State in order set to be allocated not with and the Order splitting dispatching person that dispenses of single allocation flow.
- A kind of 8. order dispatch device, it is characterised in that including：Acquisition module, for obtaining each self-corresponding order to be allocated of at least two class dispatching persons, form order set to be allocated；Determining module, for determining Order splitting flow when at least two class dispatching persons are carried out with United Dispatching；Distribute module, for being described from least two class dispatching persons during the Order splitting flow is performed Order splitting dispatching person in order set to be allocated.
- 9. a kind of electronic equipment, it is characterised in that including：Memory and processor；The memory storage has one or more Computer instruction, one or more computer instruction realize any one of claim 1-7 when by the computing device Step in methods described.
- 10. a kind of computer-readable storage medium for being stored with computer program, it is characterised in that when the computer program is performed Realize the step in any one of claim 1-7 methods described.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010812203.6A CN111950959A (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
| CN201710500829.1A CN107403295B (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
| PCT/CN2017/110001 WO2019000780A1 (en) | 2017-06-27 | 2017-11-08 | Method and device for order scheduling, electronic device, and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710500829.1A CN107403295B (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010812203.6A Division CN111950959A (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107403295A true CN107403295A (en) | 2017-11-28 |
| CN107403295B CN107403295B (en) | 2020-08-11 |
Family
ID=60404546
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010812203.6A Withdrawn CN111950959A (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
| CN201710500829.1A Active CN107403295B (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010812203.6A Withdrawn CN111950959A (en) | 2017-06-27 | 2017-06-27 | Order scheduling method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (2) | CN111950959A (en) |
| WO (1) | WO2019000780A1 (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108647892A (en) * | 2018-05-14 | 2018-10-12 | 北京顺丰同城科技有限公司 | A kind of order dispatch method, apparatus and electronic equipment |
| CN108921445A (en) * | 2018-07-13 | 2018-11-30 | 广州餐道信息科技有限公司 | A kind of honeycomb fashion order assigning method |
| CN109242333A (en) * | 2018-09-27 | 2019-01-18 | 深圳市云带网投资科技有限公司 | A kind of materials circulation delivery service system based under PC end pipe reason, APP platform |
| CN110369307A (en) * | 2018-11-06 | 2019-10-25 | 天津京东深拓机器人科技有限公司 | A kind of packages device and method |
| CN110751350A (en) * | 2018-07-23 | 2020-02-04 | 阿里巴巴集团控股有限公司 | Distribution scheduling system, method and device and electronic equipment |
| CN110874700A (en) * | 2018-09-03 | 2020-03-10 | 菜鸟智能物流控股有限公司 | Logistics order matching method and device and electronic equipment |
| CN111008800A (en) * | 2019-10-18 | 2020-04-14 | 拉扎斯网络科技（上海）有限公司 | Data processing method and device for distribution tasks, server and storage medium |
| CN111260240A (en) * | 2020-01-22 | 2020-06-09 | 北京京东振世信息技术有限公司 | Task allocation method and device |
| WO2021238584A1 (en) * | 2020-05-29 | 2021-12-02 | 北京京东拓先科技有限公司 | Prescription order distribution method, system and device, and storage medium |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112862319B (en) * | 2021-02-08 | 2023-10-03 | 北京顺达同行科技有限公司 | Order scheduling method, device, equipment and storage medium |
| CN116341878B (en) * | 2023-05-23 | 2023-08-18 | 苏州万店掌网络科技有限公司 | Task allocation method, device, equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020752A (en) * | 2012-11-22 | 2013-04-03 | 南京途牛科技有限公司 | Automatic order distribution system |
| CN106327085A (en) * | 2016-08-26 | 2017-01-11 | 多点生活(中国)网络科技有限公司 | Order intelligent scheduling method |
| CN106406915A (en) * | 2016-11-18 | 2017-02-15 | 北京小度信息科技有限公司 | Interface display method and device |
| CN106779526A (en) * | 2016-11-23 | 2017-05-31 | 北京小度信息科技有限公司 | Order component formula method and device |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7587345B2 (en) * | 2003-03-03 | 2009-09-08 | Simondelivers.Com, Inc. | Residential delivery system and method |
| US9269103B1 (en) * | 2015-02-19 | 2016-02-23 | Square, Inc. | Combining orders for delivery |
| CN105719110A (en) * | 2015-05-22 | 2016-06-29 | 北京小度信息科技有限公司 | Order processing method and device |
| CN105741020A (en) * | 2016-01-25 | 2016-07-06 | 滴滴（中国）科技有限公司 | Unified order allocation method and device |
-
2017
- 2017-06-27 CN CN202010812203.6A patent/CN111950959A/en not_active Withdrawn
- 2017-06-27 CN CN201710500829.1A patent/CN107403295B/en active Active
- 2017-11-08 WO PCT/CN2017/110001 patent/WO2019000780A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020752A (en) * | 2012-11-22 | 2013-04-03 | 南京途牛科技有限公司 | Automatic order distribution system |
| CN106327085A (en) * | 2016-08-26 | 2017-01-11 | 多点生活(中国)网络科技有限公司 | Order intelligent scheduling method |
| CN106406915A (en) * | 2016-11-18 | 2017-02-15 | 北京小度信息科技有限公司 | Interface display method and device |
| CN106779526A (en) * | 2016-11-23 | 2017-05-31 | 北京小度信息科技有限公司 | Order component formula method and device |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108647892A (en) * | 2018-05-14 | 2018-10-12 | 北京顺丰同城科技有限公司 | A kind of order dispatch method, apparatus and electronic equipment |
| CN108921445A (en) * | 2018-07-13 | 2018-11-30 | 广州餐道信息科技有限公司 | A kind of honeycomb fashion order assigning method |
| CN110751350A (en) * | 2018-07-23 | 2020-02-04 | 阿里巴巴集团控股有限公司 | Distribution scheduling system, method and device and electronic equipment |
| CN110751350B (en) * | 2018-07-23 | 2024-03-19 | 盒马(中国)有限公司 | Distribution scheduling system, method and device and electronic equipment |
| CN110874700A (en) * | 2018-09-03 | 2020-03-10 | 菜鸟智能物流控股有限公司 | Logistics order matching method and device and electronic equipment |
| CN109242333A (en) * | 2018-09-27 | 2019-01-18 | 深圳市云带网投资科技有限公司 | A kind of materials circulation delivery service system based under PC end pipe reason, APP platform |
| CN110369307A (en) * | 2018-11-06 | 2019-10-25 | 天津京东深拓机器人科技有限公司 | A kind of packages device and method |
| CN111008800A (en) * | 2019-10-18 | 2020-04-14 | 拉扎斯网络科技（上海）有限公司 | Data processing method and device for distribution tasks, server and storage medium |
| CN111008800B (en) * | 2019-10-18 | 2024-02-23 | 拉扎斯网络科技（上海）有限公司 | Data processing method, device, server and storage medium for distribution task |
| CN111260240A (en) * | 2020-01-22 | 2020-06-09 | 北京京东振世信息技术有限公司 | Task allocation method and device |
| CN111260240B (en) * | 2020-01-22 | 2023-09-05 | 北京京东振世信息技术有限公司 | Task allocation method and device |
| WO2021238584A1 (en) * | 2020-05-29 | 2021-12-02 | 北京京东拓先科技有限公司 | Prescription order distribution method, system and device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111950959A (en) | 2020-11-17 |
| CN107403295B (en) | 2020-08-11 |
| WO2019000780A1 (en) | 2019-01-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107403295A (en) | Order dispatch method and device | |
| Weidinger et al. | Scattered storage: How to distribute stock keeping units all around a mixed-shelves warehouse | |
| CN107292550A (en) | A kind of dispatching method of logistic resources, equipment and system | |
| CN107292701A (en) | Order group technology and device | |
| CN107480921A (en) | Order dispatch method and device | |
| CN107392412A (en) | Order dispatch method and apparatus | |
| CN106372838B (en) | Inventory sorting method based on knapsack algorithm | |
| CN106779183A (en) | Order is assembled and send sequential program(me) method, route planning method and device | |
| CN107844882A (en) | Dispense task processing method, device and electronic equipment | |
| CN107844879A (en) | Order allocation method and device | |
| CN107909261A (en) | Order method for pushing and device | |
| Jiang et al. | Picking-replenishment synchronization for robotic forward-reserve warehouses | |
| CN106779526A (en) | Order component formula method and device | |
| CN110232537A (en) | Distribute method, apparatus, equipment and the storage medium of data object | |
| CN107146007A (en) | Order dispatch method and apparatus | |
| CN107886245A (en) | Order method for pushing and device | |
| CN109214739A (en) | order processing method and device | |
| CN108846623A (en) | Based on the complete vehicle logistics dispatching method and device of multiple target ant group algorithm, storage medium, terminal | |
| CN109146349B (en) | Order allocation method and device | |
| CN104023042B (en) | Cloud platform resource scheduling method | |
| CN109636227A (en) | Method for allocating tasks, device, electronic equipment and computer readable storage medium | |
| Wu et al. | Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines | |
| CN108154298A (en) | Dispense method for allocating tasks, device, electronic equipment and computer storage media | |
| Gagliardi et al. | Space allocation and stock replenishment synchronization in a distribution center | |
| CN110276568A (en) | It is put in storage resource allocation methods, device and computer system |
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 | ||
| CB02 | Change of applicant information |
Address after: Room 202, 2 / F, 1-3 / F, No. 11, Shangdi Information Road, Haidian District, Beijing 100084 Applicant after: Beijing Xingxuan Technology Co.,Ltd. Address before: 100085 Beijing, Haidian District on the road to the information on the ground floor of the 1 to the 3 floor of the 2 floor, room 11, 202 Applicant before: Beijing Xiaodu Information Technology Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |