CN105719010A - Method and device for processing distribution tasks - Google Patents
Method and device for processing distribution tasks Download PDFInfo
- Publication number
- CN105719010A CN105719010A CN201510441192.4A CN201510441192A CN105719010A CN 105719010 A CN105719010 A CN 105719010A CN 201510441192 A CN201510441192 A CN 201510441192A CN 105719010 A CN105719010 A CN 105719010A
- Authority
- CN
- China
- Prior art keywords
- dispensing
- task
- grouped
- personnel
- grouped task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for processing distribution tasks. The method comprises steps of obtaining N distribution task groups to be distributed, obtaining a matching degree between each distribution task group and each delivery man according to the distribution task data of each distribution task group and distribution task completion data of each delivery man in the P delivery men, distributing the N distribution task groups to the P delivery men according to the matching degrees, and enabling the P delivery men to perform delivery processing on the N distribution task groups. The method is simple in operation and high in accuracy, without people participation in the distribution processing of the distribution tasks, and improves the efficiency and reliability of distribution.
Description
[technical field]
The present invention relates to Internet technology, particularly relate to processing method and the device of a kind of task of providing and delivering.
[background technology]
Along with developing rapidly of China's economy, logistics distribution industry is also constantly developed.At present, the scope of logistics distribution not only includes the logistics distribution between traditional city, is also extended to the logistics distribution of incity, city gradually.It is possible not only to include the home delivery service of large class commodity such as household electrical appliances, furniture with city dispensing, it is also possible to include the dispensing of some small commercial articles, for instance, food delivery, gas delivery, send water, send express mail etc..In prior art, it is possible to by manual type, dispensing task to be allocated is sequentially allocated to dispensing personnel, then, dispensing personnel provides and delivers according to dispensing task.
But, due to the enormous amount of task of providing and delivering, it is entirely through manual type and carries out the dispensing process of dispensing task, complicated operation can be made, and easily make mistakes, thus result in the reduction of the efficiency of dispensing and reliability.
[summary of the invention]
The many aspects of the present invention provide processing method and the device of a kind of task of providing and delivering, in order to improve efficiency and the reliability of dispensing.
An aspect of of the present present invention, it is provided that the processing method of a kind of task of providing and delivering, including:
Obtaining N number of dispensing grouped task to be dispensed, N is the integer more than or equal to 2, and in described N number of dispensing grouped task, each dispensing grouped task includes at least one dispensing task；
In dispensing task data according to described each dispensing grouped task and P dispensing personnel, the dispensing task of each dispensing personnel completes data, it is thus achieved that the matching degree of described each dispensing grouped task and described each dispensing personnel, P is the integer more than or equal to 2；
According to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, N number of dispensing grouped task that described acquisition is to be dispensed, also include before:
Obtaining M dispensing task to be allocated, M is the integer more than or equal to 2；
According to described M dispensing task, it is thus achieved that the similarity of task of providing and delivering between two in described M dispensing task；
Similarity according to described task of providing and delivering between two, carries out packet transaction to described M dispensing task, to obtain described N number of dispensing grouped task.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, the dispensing task data of described each dispensing grouped task includes at least one in following message:
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest；
The dispensing task quantity of described each dispensing grouped task；And
The service data of the dispensing task of described each dispensing grouped task.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, the dispensing task of described each dispensing personnel completes data and includes at least one in following message:
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process；
Described each dispensing personnel complete the time data during dispensing grouped task of dispensing process；And
The service data of described each dispensing personnel.
Aspect as above and arbitrary possible implementation, further provide for a kind of implementation, described according to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel, including:
According to described matching degree, utilize greedy algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree of the dispensing personnel that dispensing grouped task and this dispensing grouped task distribute is more than or equal to the matching degree of other personnel that provide and deliver except this dispensing personnel in this dispensing grouped task and described P dispensing personnel；Or
According to described matching degree, utilize KM algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree sum of the dispensing personnel that each dispensing grouped task and this dispensing grouped task distribute is maximum.
Another aspect of the present invention, it is provided that the process device of a kind of task of providing and delivering, including:
Acquiring unit, for obtaining N number of dispensing grouped task to be dispensed, N is the integer more than or equal to 2, and in described N number of dispensing grouped task, each dispensing grouped task includes at least one dispensing task；
Computing unit, data are completed for the dispensing task of each dispensing personnel in the dispensing task data according to described each dispensing grouped task and P dispensing personnel, obtaining the matching degree of described each dispensing grouped task and described each dispensing personnel, P is the integer more than or equal to 2；
Allocation units, for according to described matching degree, distributing to described P dispensing personnel by described N number of dispensing grouped task, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, described device also includes grouped element, is used for
Obtaining M dispensing task to be allocated, M is the integer more than or equal to 2；
According to described M dispensing task, it is thus achieved that the similarity of task of providing and delivering between two in described M dispensing task；And
Similarity according to described task of providing and delivering between two, carries out packet transaction to described M dispensing task, to obtain described N number of dispensing grouped task.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, the dispensing task data of described each dispensing grouped task includes at least one in following message:
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest；
The dispensing task quantity of described each dispensing grouped task；And
The service data of the dispensing task of described each dispensing grouped task.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, the dispensing task of described each dispensing personnel completes data and includes at least one in following message:
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process；
Described each dispensing personnel complete the time data during dispensing grouped task of dispensing process；And
The service data of described each dispensing personnel.
Aspect as above and arbitrary possible implementation, it is further provided a kind of implementation, described allocation units, specifically for
According to described matching degree, utilize greedy algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree of the dispensing personnel that dispensing grouped task and this dispensing grouped task distribute is more than or equal to the matching degree of other personnel that provide and deliver except this dispensing personnel in this dispensing grouped task and described P dispensing personnel；Or
According to described matching degree, utilize KM algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree sum of the dispensing personnel that each dispensing grouped task and this dispensing grouped task distribute is maximum.
As shown from the above technical solution, the embodiment of the present invention is by obtaining N number of dispensing grouped task to be dispensed, and then complete data according to the dispensing task of each dispensing personnel in the dispensing task data of described each dispensing grouped task and P dispensing personnel, obtain the matching degree of described each dispensing grouped task and described each dispensing personnel, make it possible to according to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel, dispensing without manually participating in dispensing task processes, simple to operate, and accuracy is high, thus improve efficiency and the reliability of dispensing.
Additionally, adopt technical scheme provided by the present invention, owing to automatically similar dispensing task can be divided into a dispensing grouped task, make to be assigned to the dispensing personnel of this dispensing grouped task, the dispensing that can relatively rapid complete this dispensing grouped task processes, in such manner, it is possible to effectively further improve the efficiency of dispensing.
Additionally, adopt technical scheme provided by the present invention, owing to greedy algorithm can be adopted, automatically each dispensing grouped task is distributed to the dispensing personnel of each Self Matching, make to be assigned to the dispensing personnel of certain dispensing grouped task, the dispensing that can relatively rapid complete this dispensing grouped task processes, in such manner, it is possible to effectively further improve the efficiency of dispensing.
Additionally, adopt technical scheme provided by the present invention, owing to KM algorithm can be adopted, grouped task of automatically several being provided and delivered distributes to the dispensing personnel of each Self Matching, make to be assigned to the dispensing personnel of these dispensing grouped task, the dispensing that can relatively rapid complete these dispensing grouped task processes, in such manner, it is possible to effectively further improve the efficiency of dispensing.
It addition, adopt technical scheme provided by the present invention, it is possible to significant increase Consumer's Experience.
[accompanying drawing explanation]
In order to be illustrated more clearly that the technical scheme in the embodiment of the present invention, the accompanying drawing used required in embodiment or description of the prior art will be briefly described below, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the premise not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
The schematic flow sheet of the processing method of the dispensing task that Fig. 1 provides for one embodiment of the invention；
The structural representation processing device of the dispensing task that Fig. 2 provides for another embodiment of the present invention；
The structural representation processing device of the dispensing task that Fig. 3 provides for another embodiment of the present invention.
[detailed description of the invention]
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is a part of embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, other embodiments whole that those of ordinary skill in the art obtain under not making creative work premise, broadly fall into the scope of protection of the invention.
It should be noted that, terminal involved in the embodiment of the present invention can include but not limited to mobile phone, personal digital assistant (PersonalDigitalAssistant, PDA), radio hand-held equipment, panel computer (TabletComputer), PC (PersonalComputer, PC), MP3 player, MP4 player, wearable device (such as, intelligent glasses, intelligent watch, Intelligent bracelet etc.) etc..
It addition, the terms "and/or", being only a kind of incidence relation describing affiliated partner, can there are three kinds of relations in expression, for instance, A and/or B, it is possible to represent: individualism A, there is A and B, individualism B these three situation simultaneously.It addition, character "/" herein, typically represent forward-backward correlation to as if the relation of a kind of "or".
The schematic flow sheet of the processing method of the dispensing task that Fig. 1 provides for one embodiment of the invention, as shown in Figure 1.
101, obtaining N number of dispensing grouped task to be dispensed, N is the integer more than or equal to 2, and in described N number of dispensing grouped task, each dispensing grouped task includes at least one dispensing task.
So-called dispensing task, refers to the request proposed according to user, generating of task.Wherein, the request that user is proposed, is be expected in the time range of distance current time Δ t or be expected to moment T, the appointment commodity provided by trade company A and/or specified services, it is provided that to place B.Such as, user subscribes the dispensing order etc. of canteen.Wherein, the element of each dispensing task can include but not limited to following data: departure place, i.e. merchant location；Place of arrival, i.e. customer location；And expectation delivery time.
102, data are completed according to the dispensing task of each dispensing personnel in the dispensing task data of described each dispensing grouped task and P dispensing personnel, obtaining the matching degree of described each dispensing grouped task and described each dispensing personnel, P is the integer more than or equal to 2.
Dispensing personnel herein, refer to all dispensing personnel on duty, the dispensing personnel not got in touch with including going offline in commercial circle, place, but do not include the dispensing personnel having a rest.
103, according to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel.
It should be noted that, the executive agent of 101～103 can be partly or entirely the application being located locally terminal, or can also be arranged in plug-in unit in the application of local terminal or SDK (SoftwareDevelopmentKit, the functional unit such as SDK), or can also be the process engine being arranged in network side server, or can also being the distributed system being positioned at network side, this be particularly limited by the present embodiment.
It is understood that described application can be mounted in the local program (nativeApp) in terminal, or can also is that a web page program (webApp) of browser in terminal, this is not defined by the present embodiment.
So, by obtaining N number of dispensing grouped task to be dispensed, and then complete data according to the dispensing task of each dispensing personnel in the dispensing task data of described each dispensing grouped task and P dispensing personnel, obtain the matching degree of described each dispensing grouped task and described each dispensing personnel, make it possible to according to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel, dispensing without manually participating in dispensing task processes, simple to operate, and accuracy is high, thus improve efficiency and the reliability of dispensing.
Alternatively, in a possible implementation of the present embodiment, before 101, can also obtaining M dispensing task to be allocated further, M is the integer more than or equal to 2, and then, then can according to described M dispensing task, it is thus achieved that the similarity of task of providing and delivering between two in described M dispensing task.Then, the similarity according to described task of providing and delivering between two, described M dispensing task is carried out packet transaction, to obtain described N number of dispensing grouped task.
In the present invention, after dispensing task generates, it is not distribute dispensing personnel immediately, but the dispensing task generated is added in a dispensing task pool, to wait next step process.
In the implementation that this is possible, specifically from dispensing task pool, can obtaining the whole dispensing tasks in this dispensing task pool or part dispensing task, this is not particularly limited by the present embodiment.If it is understood that obtain the dispensing task of a part, then, after a while, then can continue to obtain again the dispensing task of other parts, until the whole dispensing tasks in this dispensing task pool all obtain complete.
In a concrete implementation process, specifically in the scheduled time, from dispensing task pool, M dispensing task to be allocated can be obtained.
In another concrete implementation process, specifically can interval to pre-set, periodically from dispensing task pool, obtain M dispensing task to be allocated.
In the implementation that this is possible, specifically can according to each dispensing task in described M dispensing task, obtain the expectation delivery time of described each dispensing task, the departure place of described each dispensing task and the arrival ground of described each dispensing task, and then, then can according to the expectation delivery time of described each dispensing task, the departure place of described each dispensing task and the arrival ground of described each dispensing task, obtain the expectation delivery time difference of two dispensing tasks in dispensing task between two, the second distance between the first distance and the arrival ground of two dispensing tasks between the departure place of two dispensing tasks.Then, according to described expectation delivery time difference, described first distance and described second distance, it is thus achieved that the similarity of task of providing and delivering between two.
In this implementation, the first distance is more little, and the similarity of task of providing and delivering between two is more big；Second distance is more little, and the similarity of task of providing and delivering between two is more big；First distance is 0, and second distance is 0, and the similarity of task of providing and delivering between two is maximum.
In the implementation that this is possible, if described expectation delivery time difference is less than or equal to the time threshold pre-set, such as, 30 minutes, and the similarity of described task of providing and delivering between two is more than or equal to the first similarity threshold pre-set, these two dispensing tasks are divided in a dispensing grouped task.If described expectation delivery time difference is more than described time threshold, for instance, 30 minutes, or the similarity of described task of providing and delivering between two is less than described first similarity threshold, these two dispensing tasks is divided in two dispensing grouped task.
So, can pass through to expect that delivery time is close, and the close dispensing task in departure place is divided into a dispensing grouped task, or will expect that delivery time is close, and arrive close dispensing task and be divided into a dispensing grouped task, or will expect that delivery time is close, and departure place is close, arrive close dispensing task and be divided into a dispensing grouped task, make the dispensing personnel being assigned to a dispensing grouped task can travel as far as possible few distance, with the as far as possible short time, complete the whole dispensing tasks in this dispensing grouped task, the efficiency of dispensing can be effectively improved.
In the process dividing dispensing grouped task, in order to be further ensured that the efficiency of dispensing, in addition it is also necessary to consider an important limiting factor, i.e. the maximum dispensing task quantity of each dispensing grouped task.It is to say, dispensing task included in each dispensing grouped task divided, it is impossible to exceed the maximum dispensing task quantity of this dispensing grouped task.
In a concrete implementation process, if dispensing task included in a dispensing grouped task existing the similarity of task of providing and delivering between two less than the second similarity threshold, described second similarity threshold is more than described first similarity threshold, the maximum dispensing task quantity of this dispensing grouped task is the first amount threshold, it is possible to be designated as Nmax.If the similarity of task of providing and delivering between two in dispensing task included in a dispensing grouped task is all higher than or equal to described second similarity threshold, the maximum dispensing task quantity of this dispensing grouped task is the second amount threshold.
That is, if dispensing task included in a dispensing grouped task is respectively provided with significantly high similarity between dispensing task between two, then can suitably relax this dispensing grouped task to maximum dispensing number of tasks quantitative limitation, the bigger numerical value maximum dispensing task quantity as this dispensing grouped task is set.Here it is possible to the second amount threshold to be set to 2 times of the first amount threshold, it is possible to be designated as 2Nmax。
In another concrete implementation process, performing the similarity according to described task of providing and delivering between two, described M dispensing task is carried out packet transaction, with obtain described N number of dispensing grouped task step before, further according to current dispensing situation data, described first similarity threshold can also be set.Wherein, described current dispensing situation data can include but not limited at least one in the dispensing pressure data of dispensing task, the dispensing idle condition data of personnel and history dispensing task data, and this is not particularly limited by the present embodiment.
The dispensing pressure data of described dispensing task, refers to the dispensing task quantity that dispensing personnel are on average not fully complete, and it is relevant to the dispensing total task number being not fully complete and dispensing total number of persons.The dispensing total task number being not fully complete is more many, and total number of persons is more few in dispensing, and the dispensing pressure data of dispensing task is more big.
The idle condition data of described dispensing personnel, refer to the idle condition of dispensing personnel.
The dispensing pressure data of dispensing task is more big, and the first similarity threshold of setting is then more little；The idle condition data of dispensing personnel are more many, and the first similarity threshold of setting is then more big.
Described history dispensing task data, refer to the related data of the history dispensing task being complete, such as, departure place, arrive the master data of ground, the expectation history such as delivery time dispensing tasks and the performance data of the history dispensing task such as actual service time, dispensing grouped task situation data.
Specifically, history dispensing task data specifically can be utilized as training sample, form a training sample set, carry out model training, to set up dispensing model, to determine a regulation coefficient of the first similarity threshold.
In order to improve the efficiency of dispensing further, before the dispensing generated task being added in task dispensing pond, further this dispensing task can also be carried out similarity judgement with the dispensing task in other dispensing grouped task carrying out dispensing process, to determine whether this dispensing task can be appended in other dispensing grouped task carrying out dispensing process.Wherein, other dispensing grouped task carrying out dispensing process herein, refer to that the dispensing personnel of these dispensing grouped task are also in the departure place of dispensing task, do not go to the place of arrival of arbitrary dispensing task.
If it is determined that this dispensing task can be appended in other dispensing grouped task carrying out dispensing process, then this dispensing task is appended in other dispensing grouped task carrying out dispensing process；If it is determined that this dispensing task can not be appended in other dispensing grouped task carrying out dispensing process, then again this dispensing task is added in task dispensing pond, using as a dispensing task to be allocated.
In a concrete implementation process, specifically can adopt the similar approach of packet transaction provided by the present invention, according to this dispensing task, and carrying out each dispensing task in other dispensing grouped task of dispensing process, it is thus achieved that this dispensing task and the similarity of each dispensing task in each dispensing grouped task.Then, according to this dispensing task and the similarity of each dispensing task in each dispensing grouped task, it is determined that whether this dispensing task can be appended in other dispensing grouped task carrying out dispensing process.
Specifically, how according to this dispensing task and the similarity of each dispensing task in each dispensing grouped task, determine whether this dispensing task can be appended in other dispensing grouped task carrying out dispensing process, with the similarity according to described task of providing and delivering between two, described M dispensing task is carried out packet transaction, execution principle to obtain the step of described N number of dispensing grouped task is similar, and detailed description may refer to the present invention related content previously with regard to this step, repeats no more herein.
Alternatively, in a possible implementation of the present embodiment, in 102, specifically can complete data according to the dispensing task of the dispensing task data of described each dispensing grouped task and described each dispensing personnel, each data are carried out scoring treatment, to obtain the matching degree score of each data, and then the matching degree score according to each data, it is thus achieved that the matching degree of described each dispensing grouped task and described each dispensing personnel.
In the present invention, the dispensing task data of described each dispensing grouped task can include but not limited at least one in following message:
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest；
The dispensing task quantity of described each dispensing grouped task；And
The service data of the dispensing task of described each dispensing grouped task.
Wherein,
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest, refers to the remaining time of dispensing task the most urgent in dispensing grouped task.Remaining time is more long, and this dispensing grouped task is more low with the matching degree of dispensing personnel.
The dispensing task quantity of described each dispensing grouped task, refers to the sum of dispensing task included in dispensing grouped task.Dispensing task included in dispensing grouped task is more many, and this dispensing grouped task is more high with the matching degree of dispensing personnel.
The service data of the dispensing task of described each dispensing grouped task, refer to the preferential dispensing grade etc. of dispensing task.The preferential dispensing grade of dispensing task is more high, and this dispensing grouped task is more high with the matching degree of dispensing personnel.
In the present invention, the dispensing task of described each dispensing personnel completes data and can include but not limited at least one in following message:
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process；
Described each dispensing personnel complete the time data during dispensing grouped task of dispensing process；And
The service data of described each dispensing personnel.
Wherein,
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process, refer to that dispensing personnel complete the geographical position at place during the dispensing grouped task of dispensing process.The distance that dispensing personnel complete between the departure place of the geographical position at place during the dispensing grouped task of dispensing process and first dispensing task of dispensing grouped task is more little, and this dispensing grouped task is more big with the matching degree of this dispensing personnel.
Described each dispensing personnel complete dispensing process dispensing grouped task time time data, refer to dispensing personnel complete dispensing process dispensing grouped task time time.Dispensing personnel complete dispensing process dispensing grouped task time time gap current time more near, this dispensing personnel with dispensing task groups matching degree more high.
The service data of described each dispensing personnel, refer to the service quality etc. of dispensing personnel.The service quality of dispensing personnel is more high, and this dispensing personnel are more high with the matching degree of dispensing task groups.
Alternatively, in a possible implementation of the present embodiment, in 103, specifically can according to described matching degree, utilize greedy algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that the matching degree of dispensing personnel distributed of dispensing grouped task and this dispensing grouped task is more than or equal to the matching degree of other personnel that provide and deliver except this dispensing personnel in this dispensing grouped task and described P dispensing personnel.
As such, it is possible to find the allocative decision of optimum in subrange so that dispensing most effective of some dispensing personnel.
Alternatively, in a possible implementation of the present embodiment, in 103, specifically can according to described matching degree, utilize maximum weight matching KM (Kuhn_Munkras) algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that the matching degree sum of dispensing personnel that each dispensing grouped task and this dispensing grouped task distribute is maximum.
As such, it is possible to find the allocative decision of global optimum in a wider context so that the dispensing that dispensing personnel are overall most effective, Consumer's Experience is best.
In the process of distribution dispensing grouped task, if the quantity of dispensing grouped task is more than the quantity of assignable dispensing personnel, so, then whole dispensing grouped task once can be distributed on assignable dispensing personnel, it is to say, each dispensing personnel are assigned with least one set dispensing grouped task, or whole dispensing grouped task can also be distributed to assignable dispensing personnel several times, it is to say, each dispensing personnel once can only be assigned with one group of dispensing grouped task.Not having the dispensing grouped task of distribution, then can be re-used as new dispensing grouped task, for re-executing technical scheme provided by the present invention, grouped task of these being provided and delivered distributes to suitable dispensing personnel.
In the present embodiment, by obtaining M dispensing task to be allocated, and then according to described M dispensing task, obtain the similarity of task of providing and delivering between two in described M dispensing task, make it possible to the similarity according to described task of providing and delivering between two, described M dispensing task is carried out packet transaction, to obtain N number of dispensing grouped task, and each dispensing grouped task in described N number of dispensing grouped task is distributed to dispensing personnel, provide and deliver for described dispensing personnel, dispensing without manually participating in dispensing task processes, simple to operate, and accuracy is high, thus improve efficiency and the reliability of dispensing.
Additionally, adopt technical scheme provided by the present invention, owing to automatically similar dispensing task can be divided into a dispensing grouped task, make to be assigned to the dispensing personnel of this dispensing grouped task, the dispensing that can relatively rapid complete this dispensing grouped task processes, in such manner, it is possible to effectively further improve the efficiency of dispensing.
It addition, adopt technical scheme provided by the present invention, it is possible to significant increase Consumer's Experience.
It should be noted that, for aforesaid each embodiment of the method, in order to be briefly described, therefore it is all expressed as a series of combination of actions, but those skilled in the art should know, the present invention is not by the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or carry out simultaneously.Secondly, those skilled in the art also should know, embodiment described in this description belongs to preferred embodiment, necessary to involved action and the module not necessarily present invention.
In the above-described embodiments, the description of each embodiment is all emphasized particularly on different fields, certain embodiment there is no the part described in detail, it is possible to referring to the associated description of other embodiments.
The structural representation processing device of the dispensing task that Fig. 2 provides for another embodiment of the present invention, as shown in Figure 2.The process device of the dispensing task of the present embodiment can include acquiring unit 21, computing unit 22 and allocation units 23.Wherein, acquiring unit 21, for obtaining N number of dispensing grouped task to be dispensed, N is the integer more than or equal to 2, and in described N number of dispensing grouped task, each dispensing grouped task includes at least one dispensing task；Computing unit 22, data are completed for the dispensing task of each dispensing personnel in the dispensing task data according to described each dispensing grouped task and P dispensing personnel, obtaining the matching degree of described each dispensing grouped task and described each dispensing personnel, P is the integer more than or equal to 2；Allocation units 23, for according to described matching degree, distributing to described P dispensing personnel by described N number of dispensing grouped task, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel.
It should be noted that, the device that processes of the dispensing task that the present embodiment provides can be partly or entirely the application being located locally terminal, or can also be arranged in plug-in unit in the application of local terminal or SDK (SoftwareDevelopmentKit, the functional unit such as SDK), or can also be the process engine being arranged in network side server, or can also being the distributed system being positioned at network side, this be particularly limited by the present embodiment.
It is understood that described application can be mounted in the local program (nativeApp) in terminal, or can also is that a web page program (webApp) of browser in terminal, this is not defined by the present embodiment.
Alternatively, in a possible implementation of the present embodiment, as it is shown on figure 3, the process device of dispensing task that the present embodiment provides can further include grouped element 31, may be used for obtaining M dispensing task to be allocated, M is the integer more than or equal to 2；According to described M dispensing task, it is thus achieved that the similarity of task of providing and delivering between two in described M dispensing task；And the similarity according to described task of providing and delivering between two, described M dispensing task is carried out packet transaction, to obtain described N number of dispensing grouped task.
Alternatively, in a possible implementation of the present embodiment, described computing unit 22, specifically may be used for the dispensing task of the dispensing task data according to described each dispensing grouped task and described each dispensing personnel and complete data, each data are carried out scoring treatment, to obtain the matching degree score of each data, and then the matching degree score according to each data, it is thus achieved that the matching degree of described each dispensing grouped task and described each dispensing personnel.
In the present invention, the dispensing task data of described each dispensing grouped task can include but not limited at least one in following message:
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest；
The dispensing task quantity of described each dispensing grouped task；And
The service data of the dispensing task of described each dispensing grouped task.
In the present invention, the dispensing task of described each dispensing personnel completes data and can include but not limited at least one in following message:
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process；
Described each dispensing personnel complete the time data during dispensing grouped task of dispensing process；And
The service data of described each dispensing personnel.
Alternatively, in a possible implementation of the present embodiment, described allocation units 23, specifically may be used for according to described matching degree, utilize greedy algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that the matching degree of dispensing personnel distributed of dispensing grouped task and this dispensing grouped task is more than or equal to the matching degree of other personnel that provide and deliver except this dispensing personnel in this dispensing grouped task and described P dispensing personnel.
As such, it is possible to find the allocative decision of optimum in subrange so that dispensing most effective of some dispensing personnel.
Alternatively, in a possible implementation of the present embodiment, described allocation units 23, specifically may be used for according to described matching degree, utilize KM algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that the matching degree sum of dispensing personnel that each dispensing grouped task and this dispensing grouped task distribute is maximum.
As such, it is possible to find the allocative decision of global optimum in a wider context so that the dispensing that dispensing personnel are overall most effective, Consumer's Experience is best.
It should be noted that method in embodiment corresponding to Fig. 1, it is possible to the process device of the dispensing task provided by the present embodiment realizes.Detailed description may refer to the related content in embodiment corresponding to Fig. 1, repeats no more herein.
In the present embodiment, M dispensing task to be allocated is obtained by acquiring unit, and then by computing unit according to described M dispensing task, obtain the similarity of task of providing and delivering between two in described M dispensing task, make the allocation units can according to the similarity of described task of providing and delivering between two, described M dispensing task is carried out packet transaction, to obtain N number of dispensing grouped task, and each dispensing grouped task in described N number of dispensing grouped task is distributed to dispensing personnel, provide and deliver for described dispensing personnel, dispensing without manually participating in dispensing task processes, simple to operate, and accuracy is high, thus improve efficiency and the reliability of dispensing.
Additionally, adopt technical scheme provided by the present invention, owing to automatically similar dispensing task can be divided into a dispensing grouped task, make to be assigned to the dispensing personnel of this dispensing grouped task, the dispensing that can relatively rapid complete this dispensing grouped task processes, in such manner, it is possible to effectively further improve the efficiency of dispensing.
It addition, adopt technical scheme provided by the present invention, it is possible to significant increase Consumer's Experience.
Those skilled in the art is it can be understood that arrive, for convenience and simplicity of description, the system of foregoing description, the specific works process of device and unit, it is possible to reference to the corresponding process in preceding method embodiment, do not repeat them here.
In several embodiments provided by the present invention, it should be understood that disclosed system, apparatus and method, it is possible to realize by another way.Such as, device embodiment described above is merely schematic, such as, the division of described unit, being only a kind of logic function to divide, actual can have other dividing mode when realizing, for instance multiple unit or assembly can in conjunction with or be desirably integrated into another system, or some features can ignore, or do not perform.Another point, shown or discussed coupling each other or direct-coupling or communication connection can be through INDIRECT COUPLING or the communication connection of some interfaces, device or unit, it is possible to be electrical, machinery or other form.
The described unit illustrated as separating component can be or may not be physically separate, and the parts shown as unit can be or may not be physical location, namely may be located at a place, or can also be distributed on multiple NE.Some or all of unit therein can be selected according to the actual needs to realize the purpose of the present embodiment scheme.
It addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it is also possible to be that unit is individually physically present, it is also possible to two or more unit are integrated in a unit.Above-mentioned integrated unit both can adopt the form of hardware to realize, it would however also be possible to employ hardware adds the form of SFU software functional unit and realizes.
The above-mentioned integrated unit realized with the form of SFU software functional unit, it is possible to be stored in a computer read/write memory medium.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions with so that a computer equipment (can be personal computer, server, or the network equipment etc.) or processor (processor) perform the part steps of method described in each embodiment of the present invention.And aforesaid storage medium includes: USB flash disk, portable hard drive, read only memory (Read-OnlyMemory, ROM), the various media that can store program code such as random access memory (RandomAccessMemory, RAM), magnetic disc or CD.
Last it is noted that above example is only in order to illustrate technical scheme, it is not intended to limit；Although the present invention being described in detail with reference to previous embodiment, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or wherein portion of techniques feature is carried out equivalent replacement；And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. the processing method of a task of providing and delivering, it is characterised in that including:
Obtaining N number of dispensing grouped task to be dispensed, N is the integer more than or equal to 2, and in described N number of dispensing grouped task, each dispensing grouped task includes at least one dispensing task；
In dispensing task data according to described each dispensing grouped task and P dispensing personnel, the dispensing task of each dispensing personnel completes data, it is thus achieved that the matching degree of described each dispensing grouped task and described each dispensing personnel, P is the integer more than or equal to 2；
According to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel.
2. method according to claim 1, it is characterised in that N number of dispensing grouped task that described acquisition is to be dispensed, also includes before:
Obtaining M dispensing task to be allocated, M is the integer more than or equal to 2；
According to described M dispensing task, it is thus achieved that the similarity of task of providing and delivering between two in described M dispensing task；
Similarity according to described task of providing and delivering between two, carries out packet transaction to described M dispensing task, to obtain described N number of dispensing grouped task.
3. method according to claim 1, it is characterised in that the dispensing task data of described each dispensing grouped task includes at least one in following message:
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest；
The dispensing task quantity of described each dispensing grouped task；And
The service data of the dispensing task of described each dispensing grouped task.
4. method according to claim 1, it is characterised in that the dispensing task of described each dispensing personnel completes data and includes at least one in following message:
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process；
Described each dispensing personnel complete the time data during dispensing grouped task of dispensing process；And
The service data of described each dispensing personnel.
5. the method according to Claims 1 to 4 any claim, it is characterized in that, described according to described matching degree, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel, including:
According to described matching degree, utilize greedy algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree of the dispensing personnel that dispensing grouped task and this dispensing grouped task distribute is more than or equal to the matching degree of other personnel that provide and deliver except this dispensing personnel in this dispensing grouped task and described P dispensing personnel；Or
According to described matching degree, utilize KM algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree sum of the dispensing personnel that each dispensing grouped task and this dispensing grouped task distribute is maximum.
6. the process device of a task of providing and delivering, it is characterised in that including:
Acquiring unit, for obtaining N number of dispensing grouped task to be dispensed, N is the integer more than or equal to 2, and in described N number of dispensing grouped task, each dispensing grouped task includes at least one dispensing task；
Computing unit, data are completed for the dispensing task of each dispensing personnel in the dispensing task data according to described each dispensing grouped task and P dispensing personnel, obtaining the matching degree of described each dispensing grouped task and described each dispensing personnel, P is the integer more than or equal to 2；
Allocation units, for according to described matching degree, distributing to described P dispensing personnel by described N number of dispensing grouped task, so that described N number of dispensing grouped task is carried out dispensing process by described P dispensing personnel.
7. device according to claim 6, it is characterised in that described device also includes grouped element, is used for
Obtaining M dispensing task to be allocated, M is the integer more than or equal to 2；
According to described M dispensing task, it is thus achieved that the similarity of task of providing and delivering between two in described M dispensing task；And
Similarity according to described task of providing and delivering between two, carries out packet transaction to described M dispensing task, to obtain described N number of dispensing grouped task.
8. device according to claim 6, it is characterised in that the dispensing task data of described each dispensing grouped task includes at least one in following message:
Time difference between expectation delivery time and current time that in described each dispensing grouped task, distance current time is nearest；
The dispensing task quantity of described each dispensing grouped task；And
The service data of the dispensing task of described each dispensing grouped task.
9. device according to claim 6, it is characterised in that the dispensing task of described each dispensing personnel completes data and includes at least one in following message:
Described each dispensing personnel complete the position data during dispensing grouped task of dispensing process；
Described each dispensing personnel complete the time data during dispensing grouped task of dispensing process；And
The service data of described each dispensing personnel.
10. the device according to claim 6～9 any claim, it is characterised in that described allocation units, specifically for
According to described matching degree, utilize greedy algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree of the dispensing personnel that dispensing grouped task and this dispensing grouped task distribute is more than or equal to the matching degree of other personnel that provide and deliver except this dispensing personnel in this dispensing grouped task and described P dispensing personnel；Or
According to described matching degree, utilize KM algorithm, described N number of dispensing grouped task is distributed to described P dispensing personnel, so that
The matching degree sum of the dispensing personnel that each dispensing grouped task and this dispensing grouped task distribute is maximum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510441192.4A CN105719010A (en) | 2015-07-24 | 2015-07-24 | Method and device for processing distribution tasks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510441192.4A CN105719010A (en) | 2015-07-24 | 2015-07-24 | Method and device for processing distribution tasks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105719010A true CN105719010A (en) | 2016-06-29 |
Family
ID=56144809
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510441192.4A Pending CN105719010A (en) | 2015-07-24 | 2015-07-24 | Method and device for processing distribution tasks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105719010A (en) |
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106339802A (en) * | 2016-08-24 | 2017-01-18 | 深圳市讯方技术股份有限公司 | Task allocation method, task allocation device and electronic equipment |
| CN106651194A (en) * | 2016-12-29 | 2017-05-10 | 江西博瑞彤芸科技有限公司 | Order form information processing method |
| CN106651193A (en) * | 2016-12-29 | 2017-05-10 | 江西博瑞彤芸科技有限公司 | Order information distribution method |
| CN107092997A (en) * | 2016-07-29 | 2017-08-25 | 北京小度信息科技有限公司 | A kind of Logistic Scheduling method and device |
| CN107230014A (en) * | 2017-05-15 | 2017-10-03 | 浙江仟和网络科技有限公司 | A kind of intelligent dispatching system of the instant logistics in end |
| CN107392412A (en) * | 2017-06-05 | 2017-11-24 | 北京小度信息科技有限公司 | Order dispatch method and apparatus |
| CN107480921A (en) * | 2017-06-27 | 2017-12-15 | 北京小度信息科技有限公司 | Order dispatch method and device |
| CN107688888A (en) * | 2017-06-13 | 2018-02-13 | 平安科技（深圳）有限公司 | Declaration form distribution method, device, storage medium and computer equipment |
| CN107748923A (en) * | 2016-08-29 | 2018-03-02 | 北京三快在线科技有限公司 | Order processing method, apparatus and server |
| CN107749010A (en) * | 2016-08-29 | 2018-03-02 | 北京三快在线科技有限公司 | Order processing method, apparatus and server |
| CN107844882A (en) * | 2017-08-24 | 2018-03-27 | 北京小度信息科技有限公司 | Dispense task processing method, device and electronic equipment |
| CN107844879A (en) * | 2017-06-27 | 2018-03-27 | 北京小度信息科技有限公司 | Order allocation method and device |
| CN107844932A (en) * | 2017-08-17 | 2018-03-27 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107844881A (en) * | 2017-08-22 | 2018-03-27 | 北京小度信息科技有限公司 | Dispense task processing method, device, electronic equipment and storage medium |
| CN107845010A (en) * | 2017-06-13 | 2018-03-27 | 北京小度信息科技有限公司 | Information processing method and device |
| CN107886245A (en) * | 2017-11-10 | 2018-04-06 | 北京小度信息科技有限公司 | Order method for pushing and device |
| CN108074031A (en) * | 2017-06-29 | 2018-05-25 | 北京小度信息科技有限公司 | Order component formula method and device |
| CN108133330A (en) * | 2018-01-12 | 2018-06-08 | 东北大学 | One kind is towards social crowdsourcing method for allocating tasks and its system |
| CN108288167A (en) * | 2018-02-12 | 2018-07-17 | 平安科技（深圳）有限公司 | Pay a return visit method, apparatus, computer equipment and storage medium |
| CN108335071A (en) * | 2018-02-06 | 2018-07-27 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| WO2018137331A1 (en) * | 2017-01-26 | 2018-08-02 | 北京小度信息科技有限公司 | Data processing method, apparatus and device, and computer-readable storage medium |
| CN108364145A (en) * | 2017-01-26 | 2018-08-03 | 北京小度信息科技有限公司 | Information determines method and device |
| CN108694544A (en) * | 2018-05-15 | 2018-10-23 | 北京顺丰同城科技有限公司 | A kind of order dispatch processing method and processing device |
| CN108711020A (en) * | 2018-04-24 | 2018-10-26 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| CN109118310A (en) * | 2017-06-23 | 2019-01-01 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN109165834A (en) * | 2018-08-14 | 2019-01-08 | 上海海勃物流软件有限公司 | A kind of automated guided vehicle task matching process and system |
| CN109214739A (en) * | 2017-07-04 | 2019-01-15 | 北京小度信息科技有限公司 | order processing method and device |
| CN109325671A (en) * | 2018-09-05 | 2019-02-12 | 湖北大学 | A kind of online method for allocating tasks of space-time crowdsourcing and system |
| WO2019056484A1 (en) * | 2017-09-25 | 2019-03-28 | 平安科技（深圳）有限公司 | Insurance product delivery management method and apparatus, computer device, and storage medium |
| CN109636227A (en) * | 2018-12-21 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Method for allocating tasks, device, electronic equipment and computer readable storage medium |
| WO2019071930A1 (en) * | 2017-10-11 | 2019-04-18 | 北京京东尚科信息技术有限公司 | Method and apparatus for sorting goods |
| CN109948874A (en) * | 2017-12-21 | 2019-06-28 | 北京嘀嘀无限科技发展有限公司 | Share-car order allocation method and system |
| CN110232537A (en) * | 2016-11-23 | 2019-09-13 | 北京小度信息科技有限公司 | Distribute method, apparatus, equipment and the storage medium of data object |
| CN111126843A (en) * | 2019-12-24 | 2020-05-08 | 拉扎斯网络科技（上海）有限公司 | Task processing method, system, electronic device and nonvolatile storage medium |
| WO2022206323A1 (en) * | 2021-03-29 | 2022-10-06 | 北京沃东天骏信息技术有限公司 | Scheduling method and apparatus, and electronic device and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982431A (en) * | 2012-11-14 | 2013-03-20 | 上海虹迪物流有限公司 | Express distribution system |
| CN103761639A (en) * | 2014-02-17 | 2014-04-30 | 江苏亲民网络股份有限公司 | Processing method of order allocation in internet electronic commerce logistics management system |
| CN104751272A (en) * | 2015-03-04 | 2015-07-01 | 径圆（上海）信息技术有限公司 | Intelligent order scheduling method and server, electric vehicle, mobile terminal and system |
-
2015
- 2015-07-24 CN CN201510441192.4A patent/CN105719010A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982431A (en) * | 2012-11-14 | 2013-03-20 | 上海虹迪物流有限公司 | Express distribution system |
| CN103761639A (en) * | 2014-02-17 | 2014-04-30 | 江苏亲民网络股份有限公司 | Processing method of order allocation in internet electronic commerce logistics management system |
| CN104751272A (en) * | 2015-03-04 | 2015-07-01 | 径圆（上海）信息技术有限公司 | Intelligent order scheduling method and server, electric vehicle, mobile terminal and system |
Cited By (48)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107092997A (en) * | 2016-07-29 | 2017-08-25 | 北京小度信息科技有限公司 | A kind of Logistic Scheduling method and device |
| CN106339802A (en) * | 2016-08-24 | 2017-01-18 | 深圳市讯方技术股份有限公司 | Task allocation method, task allocation device and electronic equipment |
| CN107748923A (en) * | 2016-08-29 | 2018-03-02 | 北京三快在线科技有限公司 | Order processing method, apparatus and server |
| CN107749010B (en) * | 2016-08-29 | 2021-08-27 | 北京三快在线科技有限公司 | Order processing method and device and server |
| CN107749010A (en) * | 2016-08-29 | 2018-03-02 | 北京三快在线科技有限公司 | Order processing method, apparatus and server |
| CN110232537A (en) * | 2016-11-23 | 2019-09-13 | 北京小度信息科技有限公司 | Distribute method, apparatus, equipment and the storage medium of data object |
| CN106651194A (en) * | 2016-12-29 | 2017-05-10 | 江西博瑞彤芸科技有限公司 | Order form information processing method |
| CN106651193A (en) * | 2016-12-29 | 2017-05-10 | 江西博瑞彤芸科技有限公司 | Order information distribution method |
| CN108960644A (en) * | 2017-01-26 | 2018-12-07 | 北京小度信息科技有限公司 | Data processing method, device and equipment |
| CN108364145A (en) * | 2017-01-26 | 2018-08-03 | 北京小度信息科技有限公司 | Information determines method and device |
| WO2018137331A1 (en) * | 2017-01-26 | 2018-08-02 | 北京小度信息科技有限公司 | Data processing method, apparatus and device, and computer-readable storage medium |
| CN108364145B (en) * | 2017-01-26 | 2021-10-19 | 北京星选科技有限公司 | Information determination method and device |
| CN107230014A (en) * | 2017-05-15 | 2017-10-03 | 浙江仟和网络科技有限公司 | A kind of intelligent dispatching system of the instant logistics in end |
| CN107392412A (en) * | 2017-06-05 | 2017-11-24 | 北京小度信息科技有限公司 | Order dispatch method and apparatus |
| WO2018227864A1 (en) * | 2017-06-13 | 2018-12-20 | 北京小度信息科技有限公司 | Information processing method and apparatus |
| CN107845010A (en) * | 2017-06-13 | 2018-03-27 | 北京小度信息科技有限公司 | Information processing method and device |
| CN107688888B (en) * | 2017-06-13 | 2019-09-24 | 平安科技（深圳）有限公司 | Declaration form distribution method, device, storage medium and computer equipment |
| WO2018227999A1 (en) * | 2017-06-13 | 2018-12-20 | 平安科技（深圳）有限公司 | Insurance policy allocation method and apparatus, storage medium and computer device |
| CN107688888A (en) * | 2017-06-13 | 2018-02-13 | 平安科技（深圳）有限公司 | Declaration form distribution method, device, storage medium and computer equipment |
| CN109118310B (en) * | 2017-06-23 | 2022-03-01 | 北京星选科技有限公司 | Order processing method and device |
| CN109118310A (en) * | 2017-06-23 | 2019-01-01 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107480921A (en) * | 2017-06-27 | 2017-12-15 | 北京小度信息科技有限公司 | Order dispatch method and device |
| CN107844879A (en) * | 2017-06-27 | 2018-03-27 | 北京小度信息科技有限公司 | Order allocation method and device |
| CN108074031A (en) * | 2017-06-29 | 2018-05-25 | 北京小度信息科技有限公司 | Order component formula method and device |
| CN109214739A (en) * | 2017-07-04 | 2019-01-15 | 北京小度信息科技有限公司 | order processing method and device |
| CN107844932A (en) * | 2017-08-17 | 2018-03-27 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107844932B (en) * | 2017-08-17 | 2020-03-27 | 北京星选科技有限公司 | Order processing method and device |
| CN107844881A (en) * | 2017-08-22 | 2018-03-27 | 北京小度信息科技有限公司 | Dispense task processing method, device, electronic equipment and storage medium |
| WO2019037368A1 (en) * | 2017-08-22 | 2019-02-28 | 北京小度信息科技有限公司 | Delivery task processing method and apparatus, electronic device, and computer storage medium |
| CN107844882A (en) * | 2017-08-24 | 2018-03-27 | 北京小度信息科技有限公司 | Dispense task processing method, device and electronic equipment |
| WO2019037367A1 (en) * | 2017-08-24 | 2019-02-28 | 北京小度信息科技有限公司 | Delivery task processing method and apparatus, and electronic device |
| WO2019056484A1 (en) * | 2017-09-25 | 2019-03-28 | 平安科技（深圳）有限公司 | Insurance product delivery management method and apparatus, computer device, and storage medium |
| WO2019071930A1 (en) * | 2017-10-11 | 2019-04-18 | 北京京东尚科信息技术有限公司 | Method and apparatus for sorting goods |
| CN107886245A (en) * | 2017-11-10 | 2018-04-06 | 北京小度信息科技有限公司 | Order method for pushing and device |
| CN109948874A (en) * | 2017-12-21 | 2019-06-28 | 北京嘀嘀无限科技发展有限公司 | Share-car order allocation method and system |
| CN108133330A (en) * | 2018-01-12 | 2018-06-08 | 东北大学 | One kind is towards social crowdsourcing method for allocating tasks and its system |
| CN108335071A (en) * | 2018-02-06 | 2018-07-27 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| CN108335071B (en) * | 2018-02-06 | 2020-09-11 | 北京小度信息科技有限公司 | Distribution task allocation method and device, electronic equipment and computer storage medium |
| CN108288167A (en) * | 2018-02-12 | 2018-07-17 | 平安科技（深圳）有限公司 | Pay a return visit method, apparatus, computer equipment and storage medium |
| CN108711020A (en) * | 2018-04-24 | 2018-10-26 | 北京小度信息科技有限公司 | Dispense method for allocating tasks, device, electronic equipment and computer storage media |
| WO2019205784A1 (en) * | 2018-04-24 | 2019-10-31 | 北京小度信息科技有限公司 | Delivery task allocation method and apparatus, electronic device and computer storage medium |
| CN108694544A (en) * | 2018-05-15 | 2018-10-23 | 北京顺丰同城科技有限公司 | A kind of order dispatch processing method and processing device |
| CN109165834A (en) * | 2018-08-14 | 2019-01-08 | 上海海勃物流软件有限公司 | A kind of automated guided vehicle task matching process and system |
| CN109325671A (en) * | 2018-09-05 | 2019-02-12 | 湖北大学 | A kind of online method for allocating tasks of space-time crowdsourcing and system |
| CN109636227A (en) * | 2018-12-21 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Method for allocating tasks, device, electronic equipment and computer readable storage medium |
| CN111126843A (en) * | 2019-12-24 | 2020-05-08 | 拉扎斯网络科技（上海）有限公司 | Task processing method, system, electronic device and nonvolatile storage medium |
| CN111126843B (en) * | 2019-12-24 | 2021-01-26 | 拉扎斯网络科技（上海）有限公司 | Task processing method, system, electronic device and nonvolatile storage medium |
| WO2022206323A1 (en) * | 2021-03-29 | 2022-10-06 | 北京沃东天骏信息技术有限公司 | Scheduling method and apparatus, and electronic device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105719010A (en) | Method and device for processing distribution tasks | |
| CN105719009A (en) | Method and device for processing distribution tasks | |
| CN107092997A (en) | A kind of Logistic Scheduling method and device | |
| US10171603B2 (en) | User segmentation to provide motivation to perform a resource saving tip | |
| CN103927229B (en) | Method and System for Scheduling Mapreduce Jobs In A Cluster Of Dynamically Available Servers | |
| Ran et al. | A Polling‐Based Dynamic Order‐Picking System considering Priority Orders | |
| CN104156843A (en) | Logistics distribution management system and logistics distribution management method | |
| CN102402423A (en) | Method and equipment for performing multi-task processing in network equipment | |
| US20110187717A1 (en) | Producing Optimization Graphs in Online Advertising Systems | |
| CN107545376B (en) | Method, device and system for issuing task | |
| CN109872116A (en) | Supplier and project matching system | |
| CN107749010A (en) | Order processing method, apparatus and server | |
| CN107545315A (en) | Order processing method and device | |
| CN111639253A (en) | Data duplication judging method, device, equipment and storage medium | |
| CN108898436A (en) | Advertisement placement method and system, server and computer readable storage medium | |
| CN111008800B (en) | Data processing method, device, server and storage medium for distribution task | |
| CN110490511A (en) | A kind of auto form delivering system based on physical distribution model | |
| CN109299883A (en) | A kind of empty driving dispatching method and device | |
| CN108921613A (en) | Advertisement price competing method, system and advertisement placement method, system | |
| CN109426983A (en) | Dodge purchase activity automatic generation method and device, storage medium, electronic equipment | |
| Zhang et al. | Online auction-based incentive mechanism design for horizontal federated learning with budget constraint | |
| CN105279688A (en) | Order form data processing method and system | |
| CN104793925A (en) | Microblog function allocating method and device | |
| CN103607415A (en) | Method, client and server for allocating requested resources | |
| CN108989063A (en) | Processing method, device, equipment and the readable storage medium storing program for executing of group's account data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination |