CN114819755A - Order scheduling method and device, electronic equipment and storage medium - Google Patents
Order scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114819755A CN114819755A CN202210721063.0A CN202210721063A CN114819755A CN 114819755 A CN114819755 A CN 114819755A CN 202210721063 A CN202210721063 A CN 202210721063A CN 114819755 A CN114819755 A CN 114819755A
- Authority
- CN
- China
- Prior art keywords
- order
- scheduled
- target diffusion
- scheduling
- cache
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The embodiment of the disclosure discloses an order scheduling method, an order scheduling device, electronic equipment and a storage medium, wherein the order scheduling method comprises the following steps: acquiring orders to be scheduled from different scheduling areas; in response to the fact that the scheduling time is detected, determining a first target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource; storing the corresponding relation between the order to be scheduled and the first target diffusion distribution resource into a cache; in response to the fact that the scheduling time is detected to arrive again, determining second target diffusion delivery resources of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resources; updating the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resources; and repeatedly acquiring the order to be scheduled, detecting the scheduling time, distributing the order to be scheduled in a diffusion mode and updating the cache data until the scheduling end condition is met.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to an order scheduling method and apparatus, an electronic device, and a storage medium.
Background
With the development of internet technology, more and more service providers provide services through internet platforms, and many internet services need to be distributed by logistics distributors, so the logistics distribution quality and the order distribution efficiency are of great importance to the improvement of the service quality of the internet platforms. In the prior art, crowdsourcing riders can only pull orders with higher matching scores with the riders, so that exposure of some orders is insufficient, distribution of the orders is affected, and further improvement of service quality of an internet platform is hindered.
Disclosure of Invention
The embodiment of the disclosure provides an order scheduling method and device, electronic equipment and a storage medium.
In a first aspect, an embodiment of the present disclosure provides an order scheduling method.
Specifically, the order scheduling method includes:
acquiring orders to be scheduled from different scheduling areas;
in response to the fact that the scheduling time is detected, determining a first target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource;
storing the corresponding relation between the order to be scheduled and the first target diffusion delivery resource into a cache, so that the first target diffusion delivery resource can receive the information of the order to be scheduled when the first target diffusion delivery resource requests for caching diffusion data;
in response to the fact that the scheduling time is detected to arrive again, determining second target diffusion delivery resources of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resources;
updating the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resource so that the second target diffusion delivery resource can receive the latest order information to be scheduled when the second target diffusion delivery resource requests for caching diffusion data;
and repeatedly acquiring the order to be scheduled, detecting the scheduling time, performing diffusion distribution on the order to be scheduled and updating the cache data until the scheduling end condition is met.
With reference to the first aspect, in a first implementation manner of the first aspect, the updating, by using the correspondence between the order to be scheduled and the second target diffusion delivery resource, the correspondence stored in the cache includes:
for the same order to be scheduled, determining whether the corresponding relation between the order to be scheduled and the first target diffusion delivery resources stored in the cache is the same as the corresponding relation between the order to be scheduled and the second target diffusion delivery resources;
if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache;
and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, and storing the corresponding relation into a cache.
With reference to the first aspect and the first implementation manner of the first aspect, in a second implementation manner of the first aspect, the scheduling end condition is that the order to be scheduled is confirmed to be allocated, or the scheduling duration reaches a first preset duration threshold.
With reference to the first aspect, the first implementation manner of the first aspect, and the second implementation manner of the first aspect, in a third implementation manner of the first aspect, an embodiment of the present disclosure further includes:
determining the repeated occurrence times of the target diffusion delivery resources in multiple scheduling;
when the repeated occurrence frequency of the target diffusion delivery resources is smaller than or equal to a first preset frequency threshold value, improving the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset increasing step length;
and when the repeated occurrence frequency of the target diffusion delivery resources is greater than the first preset frequency threshold value, reducing the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset reduction step length.
With reference to the first aspect, the first implementation manner of the first aspect, the second implementation manner of the first aspect, and the third implementation manner of the first aspect, in a fourth implementation manner of the first aspect, the embodiment of the present disclosure further includes:
and when the repeated occurrence frequency of the target diffusion distribution resources reaches a second preset frequency threshold value, deleting the target diffusion distribution resources in the cache.
With reference to the first aspect, the first implementation manner of the first aspect, the second implementation manner of the first aspect, the third implementation manner of the first aspect, and the fourth implementation manner of the first aspect, in a fifth implementation manner of the first aspect, an embodiment of the present disclosure further includes:
and deleting the data with the time length exceeding a second preset time length threshold value in the cache.
In a second aspect, an order scheduling apparatus is provided in the embodiments of the present disclosure.
Specifically, the order scheduling apparatus includes:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is configured to acquire orders to be scheduled from different scheduling areas;
the first determining module is configured to respond to the detection of the arrival of the scheduling time, and determine a first target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource;
the storage module is configured to store the corresponding relation between the order to be scheduled and the first target diffusion delivery resources into a cache, so that the first target diffusion delivery resources can receive the order information to be scheduled when the first target diffusion delivery resources request for caching diffusion data;
the second determining module is configured to determine a second target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource in response to the fact that the scheduling time is detected to arrive again;
the updating module is configured to update the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resource, so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data;
and the iteration module is configured to repeatedly acquire the order to be scheduled, detect the scheduling time, distribute the diffusion of the order to be scheduled and update the cache data until the scheduling end condition is met.
With reference to the second aspect, in a first implementation manner of the second aspect, the update module is configured to:
for the same order to be scheduled, determining whether the corresponding relation between the order to be scheduled and the first target diffusion delivery resources stored in the cache is the same as the corresponding relation between the order to be scheduled and the second target diffusion delivery resources;
if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache;
and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, and storing the corresponding relation into a cache.
With reference to the second aspect and the first implementation manner of the second aspect, in a second implementation manner of the second aspect, the scheduling end condition is that the order to be scheduled is confirmed to be allocated, or the scheduling duration reaches a first preset duration threshold.
With reference to the second aspect, the first implementation manner of the second aspect, and the second implementation manner of the second aspect, in a third implementation manner of the second aspect, an embodiment of the present disclosure further includes an adjusting module, where the adjusting module is configured to:
determining the repeated occurrence times of the target diffusion distribution resources in multiple scheduling;
when the repeated occurrence frequency of the target diffusion delivery resources is smaller than or equal to a first preset frequency threshold value, improving the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset increasing step length;
and when the repeated occurrence frequency of the target diffusion delivery resources is greater than the first preset frequency threshold value, reducing the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset reduction step length.
With reference to the second aspect, the first implementation manner of the second aspect, the second implementation manner of the second aspect, and the third implementation manner of the second aspect, in a fourth implementation manner of the second aspect, the adjusting module is further configured to:
and when the repeated occurrence frequency of the target diffusion distribution resources reaches a second preset frequency threshold value, deleting the target diffusion distribution resources in the cache.
With reference to the second aspect, the first implementation manner of the second aspect, the second implementation manner of the second aspect, the third implementation manner of the second aspect, and the fourth implementation manner of the second aspect, in a fifth implementation manner of the second aspect, an embodiment of the present disclosure further includes a deletion module, where the deletion module is configured to:
and deleting the data with the time length exceeding a second preset time length threshold value in the cache.
In a third aspect, the disclosed embodiments provide an electronic device, comprising a memory and at least one processor, wherein the memory is configured to store one or more computer instructions, and wherein the one or more computer instructions are executed by the at least one processor to implement the method steps of the order scheduling method described above.
In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium for storing computer instructions for an order scheduling apparatus, which includes computer instructions for executing the order scheduling method described above as an order scheduling apparatus.
In a fifth aspect, the present disclosure provides a computer program product comprising a computer program/instructions, wherein the computer program/instructions, when executed by a processor, implement the above order scheduling method.
The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:
according to the technical scheme, the exposure rate of the order is comprehensively improved through the cross-scheduling area of the order, the diffusion without special limitation and a multi-round order scheduling mechanism. The technical scheme is not only beneficial to improving the order distribution efficiency, but also beneficial to improving the service quality of the Internet platform.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
Other features, objects, and advantages of the present disclosure will become more apparent from the following detailed description of non-limiting embodiments when taken in conjunction with the accompanying drawings. The following is a description of the drawings.
FIG. 1 shows a flow diagram of an order scheduling method according to an embodiment of the present disclosure.
Fig. 2 shows a block diagram of an order scheduling apparatus according to an embodiment of the present disclosure.
Fig. 3 shows a block diagram of an electronic device according to an embodiment of the present disclosure.
FIG. 4 is a block diagram of a computer system suitable for implementing an order scheduling method according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, exemplary embodiments of the present disclosure will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily implement them. Also, for the sake of clarity, parts not relevant to the description of the exemplary embodiments are omitted in the drawings.
In the present disclosure, it is to be understood that terms such as "including" or "having," etc., are intended to indicate the presence of the disclosed features, numerals, steps, actions, components, parts, or combinations thereof in the specification, and are not intended to preclude the possibility that one or more other features, numerals, steps, actions, components, parts, or combinations thereof are present or added.
It should be further noted that the embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
According to the technical scheme provided by the embodiment of the disclosure, the exposure rate of the order is comprehensively improved through the cross-scheduling region of the order, the diffusion without special limitation and a multi-round order scheduling mechanism. The technical scheme is not only beneficial to improving the order distribution efficiency, but also beneficial to improving the service quality of the Internet platform.
Fig. 1 shows a flowchart of an order scheduling method according to an embodiment of the present disclosure, as shown in fig. 1, the order scheduling method includes the following steps S101-S106:
in step S101, orders to be scheduled from different scheduling areas are obtained;
in step S102, in response to detecting that the scheduling time is reached, determining a first target diffusion delivery resource of the order to be scheduled according to a matching degree between the order to be scheduled and the available delivery resource;
in step S103, storing the corresponding relationship between the order to be scheduled and the first target diffusion delivery resource into a cache, so that the first target diffusion delivery resource can receive the order information to be scheduled when requesting to cache diffusion data;
in step S104, in response to detecting that the scheduling time is reached again, determining a second target diffusion delivery resource of the order to be scheduled according to a matching degree between the order to be scheduled and the available delivery resource;
in step S105, updating the correspondence stored in the cache by using the correspondence between the order to be scheduled and the second target diffusion delivery resource, so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data;
in step S106, the order to be scheduled, the detection of the scheduling time, the diffusion allocation of the order to be scheduled, and the update of the cache data are repeatedly acquired until the scheduling end condition is satisfied.
As mentioned above, with the development of internet technology, more and more service providers provide services through internet platforms, and many internet services need to be distributed by logistics distributors, so the logistics distribution quality and the order distribution efficiency are very important for improving the service quality of the internet platforms. In the prior art, crowdsourcing riders can only pull orders with higher matching scores with the riders, so that exposure of some orders is insufficient, distribution of the orders is affected, and further improvement of service quality of an internet platform is hindered.
In view of the above drawbacks, in this embodiment, an order scheduling method is provided, in which an exposure rate of an order is comprehensively improved through order cross-scheduling areas, diffusion without special restrictions, and a multi-round order scheduling mechanism. The technical scheme is not only beneficial to improving the order distribution efficiency, but also beneficial to improving the service quality of the Internet platform.
In an embodiment of the present disclosure, the order scheduling method may be applied to a computer, a computing device, an electronic device, a server cluster, and the like.
In an embodiment of the present disclosure, the scheduling area refers to a certain geographical area, such as a certain business circle, etc., which is divided for convenience of scheduling orders as an order scheduling unit.
In an embodiment of the present disclosure, the order to be scheduled refers to an order from a different scheduling area, which has not been allocated with delivery resources and needs to be allocated and scheduled.
In an embodiment of the present disclosure, the scheduling time refers to a preset time for scheduling an order to be scheduled. For example, if polling scheduling is preset every preset time interval, a time point after every preset time interval may be regarded as the scheduling time, where the preset time interval may be set according to the needs of practical applications, for example, the preset time interval may be set to 30 seconds, that is, matching between the order to be scheduled and the delivery resources is performed once every 30 seconds, and the order matched with the delivery resources is spread.
In an embodiment of the present disclosure, the available delivery resources refer to delivery resources that can receive the order to be scheduled, which are determined by considering the back order amount, the distance between the order to be scheduled, and the like.
In an embodiment of the present disclosure, the matching degree between the order to be scheduled and the available delivery resource refers to a matching degree between the order to be scheduled and the available delivery resource, and a higher matching degree indicates that the order to be scheduled is more suitable to be allocated to the available delivery resource. The matching degree between the order to be scheduled and the available delivery resource is also related to the priority displayed on the delivery resource terminal interface when the available delivery resource pulls the order to be allocated, and the higher the matching degree is, the higher the priority displayed on the delivery resource terminal interface of the order to be scheduled is, for example, the higher the display arrangement order of the order to be scheduled is, and the like.
In an embodiment of the present disclosure, the diffusing refers to sending an order to be scheduled, which has a certain matching degree with an available delivery resource, to a delivery resource terminal, or storing the order to be scheduled in a preset cache, so that when a new order is pulled by a delivery resource, that is, when the diffusion data is requested to be cached, the information of the order to be scheduled can be obtained from the cache, so as to further select whether to accept the order displayed on the delivery resource terminal.
In an embodiment of the present disclosure, the first target diffusion delivery resource refers to a delivery resource that is determined according to a matching degree between an order to be scheduled and an available delivery resource, can receive the order to be scheduled, and needs to send the order to be scheduled to a terminal of the terminal or enable the terminal to obtain information of the order to be scheduled during the scheduling.
In an embodiment of the present disclosure, the scheduling end condition refers to a determination condition for ending the scheduling, where the scheduling end condition may be, for example, that the order to be scheduled is confirmed to be allocated, that is, the order to be scheduled is already allocated to a certain delivery resource, at this time, the scheduling flow does not need to be executed for the order, or the scheduling time length reaches a first preset time length threshold, where the first preset time length threshold may be set according to a requirement of an actual application, for example, may be set to 30 minutes.
In the above embodiment, first, orders to be scheduled from different scheduling areas are obtained; then when the fact that the scheduling time is up is detected, determining first target diffusion delivery resources of orders to be scheduled according to matching degrees between the orders to be scheduled from different scheduling areas and available delivery resources, namely determining delivery resources to which the orders to be scheduled are diffused, wherein when the first target diffusion delivery resources are determined, a threshold value of the matching degree can be set, and the delivery resources with the matching degree higher than the threshold value of the matching degree are determined as the first target diffusion delivery resources; then, the corresponding relationship between the order to be scheduled and the first target diffusion delivery resource is stored in a cache, so that when the first target diffusion delivery resource requests to cache diffusion data, for example, when a delivery resource terminal pulls a new order, the relevant information of the order to be scheduled can be received, assuming that the first target diffusion delivery resource corresponding to the order a from the scheduling area 1 is P1, P2, and P3, and the first target diffusion delivery resource corresponding to the order B from the scheduling area 2 is P2, P4, and P5, the corresponding relationship between the order a and the first target diffusion delivery resource thereof is: an order A: the corresponding relationship between the order B and the first target diffused distribution resource is as follows: and (3) order B: delivery resource P2, delivery resource P4, and delivery resource P5; then, if the scheduling time is detected to arrive again, for example, 10 seconds are elapsed from the last scheduling time, similar to the last scheduling, determining a second target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource; then, updating the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resource, so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data, for example, when scheduling this time, the second target diffusion delivery resource corresponding to the order a from the scheduling area 1 is P1, P2, P3, P4, and the second target diffusion delivery resource corresponding to the order B from the scheduling area 2 is still P2, P4, P5, then the latest corresponding relation between the order to be scheduled and the target diffusion delivery resource needs to be used to update the old corresponding relation stored in the cache; and repeating the acquisition of the order to be scheduled, the detection of the scheduling time, the diffusion distribution of the order to be scheduled and the updating of the cache data until the scheduling end condition is met, and finishing the scheduling process. Therefore, the limited diffusion of the order non-scheduling area can be realized, and the exposure rate of the order is comprehensively improved by means of a multi-round order scheduling mechanism.
In an embodiment of the present disclosure, the step S104 of updating the correspondence stored in the cache by using the correspondence between the order to be scheduled and the second target diffusion delivery resource may include the following steps:
for the same order to be scheduled, determining whether the corresponding relation between the order to be scheduled and the first target diffusion delivery resources stored in the cache is the same as the corresponding relation between the order to be scheduled and the second target diffusion delivery resources;
if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache;
and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, and storing the corresponding relation into a cache.
In this embodiment, when the corresponding relationship between the order to be scheduled and the second target diffusion delivery resource is used to update the corresponding relationship stored in the cache, for the same order to be scheduled, first determining whether the corresponding relationship between the order to be scheduled and the first target diffusion delivery resource stored in the cache is the same as the corresponding relationship between the order to be scheduled and the second target diffusion delivery resource; if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache; and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, storing the corresponding relation between the order to be scheduled and the second target diffusion delivery resources into a cache, and deleting the corresponding relation between the order to be scheduled and the first target diffusion delivery resources. For example, for order a in the above example, the correspondence relationship between order a and the first target diffusion delivery resource is: an order A: the corresponding relationship between the distribution resource P1, the distribution resource P2 and the distribution resource P3 and the second target diffusion distribution resource is as follows: an order A: the corresponding relationship generated by two times of scheduling is different among the delivery resource P1, the delivery resource P2, the delivery resource P3 and the delivery resource P4, and the corresponding relationship is: an order A: the delivery resource P1, the delivery resource P2, and the delivery resource P3 are deleted from the cache, and the new correspondence relationship: an order A: delivery resource P1, delivery resource P2, delivery resource P3, and delivery resource P4 are stored in a cache.
In an embodiment of the present disclosure, the method may further include the steps of:
determining the repeated occurrence times of the target diffusion distribution resources in multiple scheduling;
when the repeated occurrence frequency of the target diffusion delivery resources is smaller than or equal to a first preset frequency threshold value, improving the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset increasing step length;
and when the repeated occurrence times of the target diffusion delivery resources are larger than the first preset time threshold, reducing the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset reduction step length.
In order to improve the efficiency of order allocation, in this embodiment, the matching degree between the target diffusion delivery resources and the orders to be scheduled is also adjusted according to the repeated occurrence times of the target diffusion delivery resources in multiple scheduling. Specifically, the repeated occurrence times of the target diffusion delivery resources in multiple scheduling are determined; when the target diffusion delivery resource repeatedly appears and the repeated occurrence number is less than or equal to a first preset number threshold, the matching degree between the delivery resource and the order to be scheduled is considered to be stably at a higher level, and at this time, the delivery resource may not pull an order in time, the order is not seen for some reason, or no order is received after the order is seen for some reason, so that the matching degree between the target diffusion delivery resource and the order to be scheduled may be increased according to a preset increase step length, so that the display priority of the order on the delivery resource terminal is further increased, wherein the preset increase step length may be set according to the needs of the actual application, such as may be set to 5%, wherein the first preset number threshold may be set according to the needs of the actual application, such as for scheduling of 10 times in total, the first preset number threshold may be set to 5 times, at this time, if it is detected that a certain delivery resource appears 2 times as a target diffusion delivery resource, the matching degree between the certain delivery resource and the order to be scheduled is improved by 5%, and if it is detected that the certain delivery resource appears 3 times as a target diffusion delivery resource, the matching degree between the certain delivery resource and the order to be scheduled is improved by 5% again until the repetition frequency reaches 5 times. When the number of repeated occurrences of the target diffused delivery resource is greater than the first preset number threshold, it may be considered that the matching degree between the delivery resource and the order to be scheduled is at a higher level, but the delivery resource may not want to take the order for some reason, at this time, the matching degree between the target diffused delivery resource and the order to be scheduled may be reduced according to a preset reduction step, where, similar to the preset increase step, the preset reduction step may be set according to the needs of practical application, such as may also be set to 5%, that is, if a certain delivery resource is detected to occur as the target diffused delivery resource 6 times, the matching degree between the certain delivery resource and the order to be scheduled is reduced by 5%, if the delivery resource is detected to occur as the target diffused delivery resource 7 times, the matching degree between the certain delivery resource and the order to be scheduled is reduced by 5%, and so on.
Further, if the number of repeated occurrences of the target diffusion delivery resource continuously increases, for example, increases to be greater than or equal to a second preset number threshold, it is considered that the delivery resource may refuse to take the order for some reason, that is, the probability of allocating the order to the delivery resource is very small, and at this time, it may be considered that the target diffusion delivery resource is deleted from the cache or is not stored in the cache, so as to leave the cache space for other delivery resources with high allocation probability, and improve the efficiency of allocating the order.
That is, in an embodiment of the present disclosure, the method may further include the steps of:
and when the repeated occurrence frequency of the target diffusion distribution resources reaches a second preset frequency threshold value, deleting the target diffusion distribution resources in the cache.
The second preset time threshold may be set according to the needs of practical applications, for example, for scheduling 10 times in total, the second preset time threshold may be set to 8 times, that is, if the number of repeated occurrences of a certain distribution resource as a target diffusion distribution resource reaches 8 times, the certain distribution resource is deleted from the cache, or is not stored into the cache.
In an embodiment of the present disclosure, the method may further include the steps of:
and deleting the data with the time length exceeding a second preset time length threshold value in the cache.
In order to improve the timeliness of order allocation, in this embodiment, for data whose storage time in the cache exceeds the second preset time threshold, a deletion operation is performed, that is, data whose storage time in the cache is longer and older is deleted. The second preset duration threshold may be set according to the actual application requirement, for example, the second preset duration threshold may be set to 60 seconds.
The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods.
Fig. 2 shows a block diagram of an order scheduling apparatus according to an embodiment of the present disclosure, which may be implemented as part or all of an electronic device through software, hardware, or a combination of the two. As shown in fig. 2, the order scheduling apparatus includes:
an obtaining module 201 configured to obtain orders to be scheduled from different scheduling areas;
a first determining module 202, configured to determine, in response to detecting that the scheduling time is reached, a first target diffusion delivery resource of the order to be scheduled according to a matching degree between the order to be scheduled and the available delivery resource;
the storage module 203 is configured to store the corresponding relationship between the order to be scheduled and the first target diffusion delivery resource into a cache, so that the first target diffusion delivery resource can receive the order information to be scheduled when requesting for caching diffusion data;
a second determining module 204, configured to determine, in response to detecting that the scheduling time is reached again, a second target diffusion delivery resource of the order to be scheduled according to a matching degree between the order to be scheduled and the available delivery resource;
an updating module 205, configured to update the correspondence stored in the cache by using the correspondence between the order to be scheduled and the second target diffusion delivery resource, so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data;
the iteration module 206 is configured to repeatedly acquire the order to be scheduled, detect the scheduling time, distribute the diffusion of the order to be scheduled, and update the cache data until the scheduling end condition is satisfied.
As mentioned above, with the development of internet technology, more and more service providers provide services through internet platforms, and many internet services need to be distributed by logistics distributors, so the logistics distribution quality and the order distribution efficiency are very important for improving the service quality of the internet platforms. In the prior art, crowdsourcing riders can only pull orders with higher matching scores with the riders, so that exposure of some orders is insufficient, distribution of the orders is affected, and further improvement of service quality of an internet platform is hindered.
In view of the above drawbacks, in this embodiment, an order scheduling apparatus is provided, which comprehensively improves the exposure rate of an order through order cross-scheduling area, diffusion without special restrictions, and a multi-round order scheduling mechanism. The technical scheme is not only beneficial to improving the order distribution efficiency, but also beneficial to improving the service quality of the Internet platform.
In an embodiment of the present disclosure, the order scheduling apparatus may be implemented as a computer, a computing device, an electronic device, a server cluster, or the like.
In an embodiment of the present disclosure, the scheduling area refers to a certain geographical area, such as a certain business circle, etc., which is divided for convenience of scheduling orders as an order scheduling unit.
In an embodiment of the present disclosure, the order to be scheduled refers to an order from a different scheduling area, which has not been allocated with delivery resources and needs to be allocated and scheduled.
In an embodiment of the present disclosure, the scheduling time refers to a preset time for scheduling an order to be scheduled. For example, if polling scheduling is preset every preset time interval, a time point after every preset time interval may be regarded as the scheduling time, where the preset time interval may be set according to the needs of practical applications, for example, the preset time interval may be set to 30 seconds, that is, matching between the order to be scheduled and the delivery resources is performed once every 30 seconds, and the order matched with the delivery resources is spread.
In an embodiment of the present disclosure, the available delivery resources refer to delivery resources that can receive the order to be scheduled, which are determined by considering the back order amount, the distance between the order to be scheduled, and the like.
In an embodiment of the present disclosure, the matching degree between the order to be scheduled and the available delivery resource refers to a matching degree between the order to be scheduled and the available delivery resource, and a higher matching degree indicates that the order to be scheduled is more suitable to be allocated to the available delivery resource. The matching degree between the order to be scheduled and the available delivery resource is also related to the priority displayed on the delivery resource terminal interface when the available delivery resource pulls the order to be allocated, and the higher the matching degree is, the higher the priority displayed on the delivery resource terminal interface of the order to be scheduled is, for example, the higher the display arrangement order of the order to be scheduled is, and the like.
In an embodiment of the present disclosure, the diffusing refers to sending an order to be scheduled, which has a certain matching degree with an available delivery resource, to a delivery resource terminal, or storing the order to be scheduled in a preset cache, so that when a new order is pulled by a delivery resource, that is, when the diffusion data is requested to be cached, the information of the order to be scheduled can be obtained from the cache, so as to further select whether to accept the order displayed on the delivery resource terminal.
In an embodiment of the present disclosure, the first target diffusion delivery resource refers to a delivery resource that is determined according to a matching degree between an order to be scheduled and an available delivery resource, can receive the order to be scheduled, and needs to send the order to be scheduled to a terminal of the terminal or enable the terminal to obtain information of the order to be scheduled during the scheduling.
In an embodiment of the present disclosure, the scheduling end condition refers to a determination condition for ending the scheduling, where the scheduling end condition may be, for example, that the order to be scheduled is confirmed to be allocated, that is, the order to be scheduled is already allocated to a certain delivery resource, at this time, the scheduling flow does not need to be executed for the order, or the scheduling time length reaches a first preset time length threshold, where the first preset time length threshold may be set according to a requirement of an actual application, for example, may be set to 30 minutes.
In the above embodiment, first, orders to be scheduled from different scheduling areas are obtained; then when the scheduling time is detected, determining a first target diffusion delivery resource of an order to be scheduled according to the matching degree between the order to be scheduled from different scheduling areas and available delivery resources, namely determining which delivery resources the order to be scheduled is diffused to, wherein when the first target diffusion delivery resource is determined, a matching degree threshold value can be set, and the delivery resources with the matching degree higher than the matching degree threshold value are determined as the first target diffusion delivery resources; then, the corresponding relationship between the order to be scheduled and the first target diffusion delivery resource is stored in a cache, so that when the first target diffusion delivery resource requests to cache diffusion data, for example, when a delivery resource terminal pulls a new order, the relevant information of the order to be scheduled can be received, assuming that the first target diffusion delivery resource corresponding to the order a from the scheduling area 1 is P1, P2, and P3, and the first target diffusion delivery resource corresponding to the order B from the scheduling area 2 is P2, P4, and P5, the corresponding relationship between the order a and the first target diffusion delivery resource thereof is: an order A: the corresponding relationship between the order B and the first target diffused distribution resource thereof is as follows: and (3) order B: delivery resource P2, delivery resource P4, and delivery resource P5; then, if the scheduling time is detected to arrive again, for example, 10 seconds are elapsed from the last scheduling time, similar to the last scheduling, determining a second target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource; then, updating the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resource, so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data, for example, when scheduling this time, the second target diffusion delivery resource corresponding to the order a from the scheduling area 1 is P1, P2, P3, P4, and the second target diffusion delivery resource corresponding to the order B from the scheduling area 2 is still P2, P4, P5, then the latest corresponding relation between the order to be scheduled and the target diffusion delivery resource needs to be used to update the old corresponding relation stored in the cache; and repeating the acquisition of the order to be scheduled, the detection of the scheduling time, the diffusion distribution of the order to be scheduled and the updating of the cache data until the scheduling end condition is met, and finishing the scheduling process. Therefore, the limited diffusion of the order non-scheduling area can be realized, and the exposure rate of the order is comprehensively improved by means of a multi-round order scheduling mechanism.
In an embodiment of the present disclosure, the update module may be configured to:
for the same order to be scheduled, determining whether the corresponding relation between the order to be scheduled and the first target diffusion delivery resources stored in the cache is the same as the corresponding relation between the order to be scheduled and the second target diffusion delivery resources;
if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache;
and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, and storing the corresponding relation into a cache.
In this embodiment, when the corresponding relationship between the order to be scheduled and the second target diffusion delivery resource is used to update the corresponding relationship stored in the cache, for the same order to be scheduled, first determining whether the corresponding relationship between the order to be scheduled and the first target diffusion delivery resource stored in the cache is the same as the corresponding relationship between the order to be scheduled and the second target diffusion delivery resource; if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache; and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, storing the corresponding relation between the order to be scheduled and the second target diffusion delivery resources into a cache, and deleting the corresponding relation between the order to be scheduled and the first target diffusion delivery resources. For example, for order a in the above example, the correspondence relationship between order a and the first target diffusion delivery resource is: an order A: the distribution resource P1, the distribution resource P2 and the distribution resource P3 have the following corresponding relations with the second target diffusion distribution resource: an order A: the corresponding relationship generated by two times of scheduling is different among the delivery resource P1, the delivery resource P2, the delivery resource P3 and the delivery resource P4, and the corresponding relationship is: an order A: the delivery resource P1, the delivery resource P2, and the delivery resource P3 are deleted from the cache, and the new correspondence relationship: an order A: delivery resource P1, delivery resource P2, delivery resource P3, and delivery resource P4 are stored in a cache.
In an embodiment of the present disclosure, the apparatus may further include an adjustment module, and the adjustment module may be configured to:
determining the repeated occurrence times of the target diffusion delivery resources in multiple scheduling;
when the repeated occurrence frequency of the target diffusion delivery resources is smaller than or equal to a first preset frequency threshold value, improving the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset increasing step length;
and when the repeated occurrence frequency of the target diffusion delivery resources is greater than the first preset frequency threshold value, reducing the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset reduction step length.
In order to improve the efficiency of order allocation, in this embodiment, the matching degree between the target diffusion delivery resources and the order to be scheduled is further adjusted according to the number of repeated occurrences of the target diffusion delivery resources in multiple scheduling. Specifically, the repeated occurrence times of the target diffusion delivery resources in multiple scheduling are determined; when the target diffusion delivery resource repeatedly appears and the repeated occurrence number is less than or equal to a first preset number threshold, the matching degree between the delivery resource and the order to be scheduled is considered to be stably at a higher level, and at this time, the delivery resource may not pull an order in time, the order is not seen for some reason, or no order is received after the order is seen for some reason, so that the matching degree between the target diffusion delivery resource and the order to be scheduled may be increased according to a preset increase step length, so that the display priority of the order on the delivery resource terminal is further increased, wherein the preset increase step length may be set according to the needs of the actual application, such as may be set to 5%, wherein the first preset number threshold may be set according to the needs of the actual application, such as for scheduling of 10 times in total, the first preset number threshold may be set to 5 times, at this time, if it is detected that a certain delivery resource appears 2 times as a target diffusion delivery resource, the matching degree between the certain delivery resource and the order to be scheduled is improved by 5%, and if it is detected that the certain delivery resource appears 3 times as a target diffusion delivery resource, the matching degree between the certain delivery resource and the order to be scheduled is improved by 5% again until the repetition frequency reaches 5 times. When the number of repeated occurrences of the target diffused delivery resource is greater than the first preset number threshold, it may be considered that the matching degree between the delivery resource and the order to be scheduled is at a higher level, but the delivery resource may not want to take the order for some reason, at this time, the matching degree between the target diffused delivery resource and the order to be scheduled may be reduced according to a preset reduction step, where, similar to the preset increase step, the preset reduction step may be set according to the needs of practical application, such as may also be set to 5%, that is, if a certain delivery resource is detected to occur as the target diffused delivery resource 6 times, the matching degree between the certain delivery resource and the order to be scheduled is reduced by 5%, if the delivery resource is detected to occur as the target diffused delivery resource 7 times, the matching degree between the certain delivery resource and the order to be scheduled is reduced by 5%, and so on.
Further, if the number of repeated occurrences of the target diffusion delivery resource continuously increases, for example, increases to be greater than or equal to a second preset number threshold, it is considered that the delivery resource may refuse to take the order for some reason, that is, the probability of allocating the order to the delivery resource is very small, and at this time, it may be considered that the target diffusion delivery resource is deleted from the cache or is not stored in the cache, so as to leave the cache space for other delivery resources with high allocation probability, and improve the efficiency of allocating the order.
That is, in an embodiment of the present disclosure, the adjusting module may be further configured to:
and when the repeated occurrence frequency of the target diffusion distribution resources reaches a second preset frequency threshold value, deleting the target diffusion distribution resources in the cache.
The second preset time threshold may be set according to the needs of practical applications, for example, for scheduling 10 times in total, the second preset time threshold may be set to 8 times, that is, if the number of repeated occurrences of a certain distribution resource as a target diffusion distribution resource reaches 8 times, the certain distribution resource is deleted from the cache, or is not stored into the cache.
In an embodiment of the present disclosure, the apparatus may further include a deletion module, and the deletion module may be configured to:
and deleting the data with the time length exceeding a second preset time length threshold value in the cache.
In order to improve the timeliness of order allocation, in this embodiment, for data whose storage time in the cache exceeds the second preset time threshold, a deletion operation is performed, that is, data whose storage time in the cache is longer and older is deleted. The second preset duration threshold may be set according to the actual application requirement, for example, the second preset duration threshold may be set to 60 seconds.
The present disclosure also discloses an electronic device, fig. 3 shows a block diagram of an electronic device according to an embodiment of the present disclosure, and as shown in fig. 3, the electronic device 300 includes a memory 301 and a processor 302; wherein the content of the first and second substances,
the memory 301 is used to store one or more computer instructions, which are executed by the processor 302 to implement the above-described method steps.
FIG. 4 is a block diagram of a computer system suitable for implementing an order scheduling method according to an embodiment of the present disclosure.
As shown in fig. 4, the computer system 400 includes a processing unit 401 that can execute various processes in the above-described embodiments according to a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the system 400 are also stored. The processing unit 401, ROM402, and RAM403 are connected to each other by a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input portion 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary. The processing unit 401 may be implemented as a CPU, a GPU, a TPU, an FPGA, an NPU, or other processing units.
In particular, the above described methods may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a medium readable thereby, the computer program comprising program code for performing the data inspection method. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present disclosure may be implemented by software or hardware. The units or modules described may also be provided in a processor, and the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.
As another aspect, the present disclosure also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus in the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present disclosure.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is possible without departing from the inventive concept. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Claims (14)
1. An order scheduling method, comprising:
acquiring orders to be scheduled from different scheduling areas;
in response to the fact that the scheduling time is detected, determining a first target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource;
storing the corresponding relation between the order to be scheduled and the first target diffusion delivery resource into a cache, so that the first target diffusion delivery resource can receive the information of the order to be scheduled when the first target diffusion delivery resource requests for caching diffusion data;
in response to the fact that the scheduling time is detected to arrive again, determining second target diffusion delivery resources of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resources;
updating the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resource so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data;
and repeatedly acquiring the order to be scheduled, detecting the scheduling time, distributing the order to be scheduled in a diffusion mode and updating the cache data until the scheduling end condition is met.
2. The method of claim 1, wherein the updating the correspondence stored in the cache by using the correspondence between the order to be scheduled and the second target diffusion delivery resource comprises:
for the same order to be scheduled, determining whether the corresponding relation between the order to be scheduled and the first target diffusion delivery resources stored in the cache is the same as the corresponding relation between the order to be scheduled and the second target diffusion delivery resources;
if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache;
and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, and storing the corresponding relation into a cache.
3. The method according to claim 1 or 2, wherein the scheduling end condition is that the order to be scheduled is confirmed to be allocated, or the scheduling time length reaches a first preset time length threshold value.
4. The method of claim 1 or 2, further comprising:
determining the repeated occurrence times of the target diffusion distribution resources in multiple scheduling;
when the repeated occurrence frequency of the target diffusion delivery resources is smaller than or equal to a first preset frequency threshold value, improving the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset increasing step length;
and when the repeated occurrence frequency of the target diffusion delivery resources is greater than the first preset frequency threshold value, reducing the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset reduction step length.
5. The method of claim 4, further comprising:
and when the repeated occurrence frequency of the target diffusion distribution resources reaches a second preset frequency threshold value, deleting the target diffusion distribution resources in the cache.
6. The method of claim 1 or 2, further comprising:
and deleting the data with the time length exceeding a second preset time length threshold value in the cache.
7. An order scheduling apparatus comprising:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is configured to acquire orders to be scheduled from different scheduling areas;
the first determining module is configured to respond to the detection of the arrival of the scheduling time, and determine a first target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource;
the storage module is configured to store the corresponding relation between the order to be scheduled and the first target diffusion delivery resources into a cache, so that the first target diffusion delivery resources can receive the order information to be scheduled when the first target diffusion delivery resources request for caching diffusion data;
the second determining module is configured to determine a second target diffusion delivery resource of the order to be scheduled according to the matching degree between the order to be scheduled and the available delivery resource in response to the fact that the scheduling time is detected to arrive again;
the updating module is configured to update the corresponding relation stored in the cache by using the corresponding relation between the order to be scheduled and the second target diffusion delivery resource, so that the second target diffusion delivery resource can receive the latest order information to be scheduled when requesting for caching diffusion data;
and the iteration module is configured to repeatedly acquire the order to be scheduled, detect the scheduling time, distribute the diffusion of the order to be scheduled and update the cache data until the scheduling end condition is met.
8. The apparatus of claim 7, the update module configured to:
for the same order to be scheduled, determining whether the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache is the same as the corresponding relation between the order to be scheduled and the second target diffusion delivery resource;
if the order is the same as the first target diffusion delivery resource, reserving the corresponding relation between the order to be scheduled and the first target diffusion delivery resource stored in the cache;
and if the order to be scheduled and the second target diffusion delivery resources are different, replacing the corresponding relation between the order to be scheduled and the first target diffusion delivery resources with the corresponding relation between the order to be scheduled and the second target diffusion delivery resources, and storing the corresponding relation into a cache.
9. The apparatus according to claim 7 or 8, wherein the scheduling end condition is that the order to be scheduled is confirmed to be allocated, or the scheduling time length reaches a first preset time length threshold.
10. The apparatus of claim 7 or 8, further comprising an adjustment module configured to:
determining the repeated occurrence times of the target diffusion distribution resources in multiple scheduling;
when the repeated occurrence frequency of the target diffusion delivery resources is smaller than or equal to a first preset frequency threshold value, improving the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset increasing step length;
and when the repeated occurrence frequency of the target diffusion delivery resources is greater than the first preset frequency threshold value, reducing the matching degree between the target diffusion delivery resources and the order to be scheduled according to a preset reduction step length.
11. The apparatus of claim 10, the adjustment module further configured to:
and when the repeated occurrence frequency of the target diffusion distribution resources reaches a second preset frequency threshold value, deleting the target diffusion distribution resources in the cache.
12. The apparatus of claim 7 or 8, further comprising a deletion module configured to:
and deleting the data with the time length exceeding a second preset time length threshold value in the cache.
13. An electronic device comprising a memory and at least one processor; wherein the memory is to store one or more computer instructions, wherein the one or more computer instructions are to be executed by the at least one processor to implement the method steps of any one of claims 1-6.
14. A computer-readable storage medium having stored thereon computer instructions, characterized in that the computer instructions, when executed by a processor, carry out the method steps of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210721063.0A CN114819755A (en) | 2022-06-24 | 2022-06-24 | Order scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210721063.0A CN114819755A (en) | 2022-06-24 | 2022-06-24 | Order scheduling method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114819755A true CN114819755A (en) | 2022-07-29 |
Family
ID=82521979
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210721063.0A Pending CN114819755A (en) | 2022-06-24 | 2022-06-24 | Order scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114819755A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107464034A (en) * | 2017-06-28 | 2017-12-12 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107563572A (en) * | 2017-09-27 | 2018-01-09 | 北京同城必应科技有限公司 | A kind of order allocation method, device, computer equipment and storage medium |
| CN107909261A (en) * | 2017-11-10 | 2018-04-13 | 北京小度信息科技有限公司 | Order method for pushing and device |
| CN109214551A (en) * | 2018-08-08 | 2019-01-15 | 北京三快在线科技有限公司 | A kind of distribution scheduling method and device |
| CN112232613A (en) * | 2019-07-15 | 2021-01-15 | 拉扎斯网络科技（上海）有限公司 | Task scheduling method and device, electronic equipment and computer readable storage medium |
| CN114372754A (en) * | 2022-01-11 | 2022-04-19 | 拉扎斯网络科技（上海）有限公司 | Order matching method and device and computer equipment |
| WO2022105918A1 (en) * | 2020-11-23 | 2022-05-27 | 拉扎斯网络科技（上海）有限公司 | Group ordering method, server, client and system |
-
2022
- 2022-06-24 CN CN202210721063.0A patent/CN114819755A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107464034A (en) * | 2017-06-28 | 2017-12-12 | 北京小度信息科技有限公司 | Order processing method and apparatus |
| CN107563572A (en) * | 2017-09-27 | 2018-01-09 | 北京同城必应科技有限公司 | A kind of order allocation method, device, computer equipment and storage medium |
| CN107909261A (en) * | 2017-11-10 | 2018-04-13 | 北京小度信息科技有限公司 | Order method for pushing and device |
| CN109214551A (en) * | 2018-08-08 | 2019-01-15 | 北京三快在线科技有限公司 | A kind of distribution scheduling method and device |
| CN112232613A (en) * | 2019-07-15 | 2021-01-15 | 拉扎斯网络科技（上海）有限公司 | Task scheduling method and device, electronic equipment and computer readable storage medium |
| WO2022105918A1 (en) * | 2020-11-23 | 2022-05-27 | 拉扎斯网络科技（上海）有限公司 | Group ordering method, server, client and system |
| CN114372754A (en) * | 2022-01-11 | 2022-04-19 | 拉扎斯网络科技（上海）有限公司 | Order matching method and device and computer equipment |
Non-Patent Citations (1)
| Title |
|---|
| 李建斌等: "货运O2O平台有时间窗同城零担集货匹配优化决策", 《系统工程理论与实践》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112887228B (en) | Cloud resource management method and device, electronic equipment and computer readable storage medium | |
| CN109961331B (en) | Page processing method and system, computer system and readable storage medium | |
| CN102668456A (en) | Method and system for adapting a session timeout period | |
| CN109600414B (en) | Resource allocation method, device, equipment and storage medium | |
| CN112232613A (en) | Task scheduling method and device, electronic equipment and computer readable storage medium | |
| CN110648032A (en) | Information updating method and device | |
| CN114819755A (en) | Order scheduling method and device, electronic equipment and storage medium | |
| CN111309707A (en) | Data processing method and device, electronic equipment and computer readable storage medium | |
| US20090144426A1 (en) | Method and device for user management in presence system and presence system | |
| CN109842665B (en) | Task processing method and device for task allocation server | |
| CN115658347A (en) | Data consumption method, device, electronic equipment, storage medium and program product | |
| CN111385422B (en) | Reserved telephone traffic management method and device | |
| CN114331564A (en) | Member information management method, member information management apparatus, member information management device, member information management storage medium, and program product | |
| CN108683608B (en) | Method and device for distributing flow | |
| CN112799820A (en) | Data processing method, data processing apparatus, electronic device, storage medium, and program product | |
| CN112860432A (en) | Process management method, device and server | |
| CN109547552B (en) | API request processing method and device, storage medium and electronic equipment | |
| CN112632074A (en) | Inventory allocation method and device for database, electronic equipment and medium | |
| CN108492390B (en) | Method and device for concurrently processing charging data | |
| CN111026962A (en) | Hierarchical relation query response time reduction method, server and user front end | |
| CN112241856A (en) | Distribution resource management method, distribution resource management device, electronic equipment and computer storage medium | |
| CN107666497B (en) | Data access method and device | |
| CN113296925A (en) | Storage resource allocation method and device, electronic equipment and readable storage medium | |
| CN113128906B (en) | Live broadcast data processing method and device, electronic equipment and computer readable medium | |
| CN112667726A (en) | Data extraction method, data extraction device, electronic equipment, storage medium and program product |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220729 |