CN116151711A - Order distribution method and device, storage medium and electronic equipment - Google Patents
Order distribution method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN116151711A CN116151711A CN202111372397.3A CN202111372397A CN116151711A CN 116151711 A CN116151711 A CN 116151711A CN 202111372397 A CN202111372397 A CN 202111372397A CN 116151711 A CN116151711 A CN 116151711A
- Authority
- CN
- China
- Prior art keywords
- order
- target
- orders
- delivery
- path
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The disclosure relates to an order distribution method, an order distribution device, a storage medium and electronic equipment. The method comprises the following steps: according to a plurality of to-be-distributed orders and a plurality of distribution operators, obtaining to-be-distributed orders and a pre-planned distribution path corresponding to each distribution operator; determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path; determining candidate dispatchers corresponding to the target order from a plurality of dispatchers; according to the target order, the candidate delivery person and the pre-planned delivery path, a target delivery path is obtained through a preset order allocation optimization model, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model; and reallocating a plurality of orders to be distributed according to the target distribution path. Therefore, the partial orders can be redistributed in a targeted mode, and the target orders can be redistributed efficiently, so that the order distribution efficiency and the user satisfaction are improved.
Description
Technical Field
The disclosure relates to the technical field of computers, and in particular relates to an order distribution method, an order distribution device, a storage medium and electronic equipment.
Background
With the wide popularization of network applications such as express delivery, takeaway delivery and shared treasured delivery, the delivery service volume is larger and larger, and the requirement of users on the delivery service experience is higher and higher, and reasonable allocation is required to order and delivery staff so as to improve the order delivery efficiency.
In the related art, orders may be assigned based on information about the order and the dispatcher (e.g., order location, dispatcher location, predicted arrival time of a pre-order, etc.). However, when the method is used for order distribution, the distribution index of partial orders is still poor, and the order distribution efficiency is affected.
Disclosure of Invention
An object of the present disclosure is to provide an order allocation method, apparatus, storage medium, and electronic device, to partially solve the above-mentioned problems occurring in the related art.
To achieve the above object, a first aspect of the present disclosure provides an order allocation method, the method including:
according to the multiple orders to be distributed and the multiple distributors, obtaining the orders to be distributed and a pre-planned distribution path corresponding to each distributor;
determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path;
Determining candidate dispatchers corresponding to the target order from a plurality of dispatchers;
acquiring a target delivery path through a preset order allocation optimization model according to the target order, the candidate delivery person and the pre-planned delivery path, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model;
and reallocating a plurality of orders to be distributed according to the target distribution path.
Optionally, the determining, according to the pre-planned delivery path, a target order to be redistributed from the plurality of to-be-delivered orders includes:
for each pre-planned delivery path corresponding to each delivery person, taking one or more to-be-delivered orders with a later delivery sequence in the pre-planned delivery path as terminal orders corresponding to the delivery person;
and acquiring the target orders according to the terminal orders corresponding to the plurality of the dispatchers.
Optionally, the one or more orders to be delivered with the delivery sequence later in the pre-planned delivery path are used as the end orders corresponding to the deliverer and include:
dividing the to-be-delivered orders on the pre-planned delivery path according to the order taking position and the unit delivering position of the to-be-delivered orders on the pre-planned delivery path to obtain one or more order sets; the order taking position and the delivery unit of the same order to be distributed are positioned in the same order set;
And taking one or more to-be-delivered orders in the delivery sequence in the pre-planned delivery path in the final order set as end orders corresponding to the delivery staff.
Optionally, the obtaining the target order according to the end orders corresponding to the plurality of the dispatchers includes:
for each of the plurality of the dispensers, taking the end order as a candidate order corresponding to the dispenser when the first delivery index of each to-be-delivered order in the end order corresponding to the dispenser is worse than a preset first delivery index threshold;
and obtaining the target order according to the candidate orders corresponding to the plurality of the distribution operators.
Optionally, the determining, from the plurality of the dispatchers, a candidate dispatcher corresponding to the target order includes:
taking the dispatcher meeting the preset dispatcher screening conditions as a candidate dispatcher corresponding to the target order, wherein the preset dispatcher screening conditions comprise one or more of the following conditions:
the forward-path matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets a preset forward-path matching degree condition;
the direction matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets the preset direction matching degree condition;
The candidate dispatcher does not have overtime orders after adding the target order;
the distribution distance increment of the candidate distributor after adding the target order is smaller than or equal to a preset distance increment threshold;
after the candidate dispatcher increases the target order, the first dispatching index corresponding to the candidate dispatcher is not degraded;
the number of target orders added by the candidate dispatcher is less than or equal to a preset order added number.
Optionally, the preset constraint condition corresponding to the preset order allocation optimization model includes one or more of the following constraint conditions:
the sum value of the first delivery indexes of all the orders to be delivered after adjustment is better than the sum value of the first delivery indexes of all the orders to be delivered before adjustment;
the sum of the second delivery indexes of all the orders to be delivered after adjustment is not different from the sum of the second delivery indexes of all the orders to be delivered before adjustment;
the difference between the sum of the third delivery indexes of all the orders to be delivered after adjustment and the sum of the third delivery indexes of all the orders to be delivered before adjustment does not exceed a preset third index threshold.
Optionally, before the redistributing the plurality of to-be-distributed orders according to the target distribution path, the method further includes:
Respectively calculating a plurality of target delivery indexes of the pre-planned delivery path and the target delivery path;
determining a dominant relationship between the target delivery index of the target delivery path and the target delivery index of the pre-planned delivery path through a preset multi-target optimization algorithm;
the reassigning the plurality of to-be-dispensed orders according to the target dispensing path includes:
and distributing the to-be-distributed order to the distributor according to the target distribution path under the condition that the dominant relationship meets the preset dominant condition.
In a second aspect, the present disclosure provides an order distribution device, the device comprising:
the pre-planning module is used for acquiring the to-be-distributed order and a pre-planned distribution path corresponding to each distributor according to the to-be-distributed orders and the distributors;
the target order determining module is used for determining target orders to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path;
a candidate dispatcher determining module, configured to determine candidate dispatchers corresponding to the target order from a plurality of dispatchers;
the target delivery path acquisition module is used for acquiring a target delivery path through a preset order allocation optimization model according to the target order, the candidate delivery person and the pre-planned delivery path so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model;
And the order distribution module is used for redistributing a plurality of orders to be distributed according to the target distribution path.
Optionally, the target order determining module is configured to, for each of the pre-planned delivery paths corresponding to the delivery person, use one or more to-be-delivered orders with a delivery sequence that is later in the pre-planned delivery path as the terminal order corresponding to the delivery person; and acquiring the target orders according to the terminal orders corresponding to the plurality of the dispatchers.
Optionally, the target order determining module is configured to divide the to-be-delivered order on the pre-planned delivery path according to the order taking position and the unit delivering position of the to-be-delivered order on the pre-planned delivery path, so as to obtain one or more order sets; the order taking position and the delivery unit of the same order to be distributed are positioned in the same order set; and taking one or more to-be-delivered orders in the delivery sequence in the pre-planned delivery path in the final order set as end orders corresponding to the delivery staff.
Optionally, the target order determining module is configured to, for each of the plurality of dispatchers, take the end order as a candidate order corresponding to the dispatcher when a first delivery index of each to-be-delivered order in the end order corresponding to the dispatcher is worse than a preset first delivery index threshold; and obtaining the target order according to the candidate orders corresponding to the plurality of the distribution operators.
Optionally, the candidate dispatcher determining module is configured to use a dispatcher that meets a preset dispatcher screening condition as a candidate dispatcher corresponding to the target order, where the preset dispatcher screening condition includes one or more of the following conditions:
the forward-path matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets a preset forward-path matching degree condition;
the direction matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets the preset direction matching degree condition;
the candidate dispatcher does not have overtime orders after adding the target order;
the distribution distance increment of the candidate distributor after adding the target order is smaller than or equal to a preset distance increment threshold;
after the candidate dispatcher increases the target order, the first dispatching index corresponding to the candidate dispatcher is not degraded;
the number of target orders added by the candidate dispatcher is less than or equal to a preset order added number.
Optionally, the preset constraint condition corresponding to the preset order allocation optimization model includes one or more of the following constraint conditions:
the sum value of the first delivery indexes of all the orders to be delivered after adjustment is better than the sum value of the first delivery indexes of all the orders to be delivered before adjustment;
The sum of the second delivery indexes of all the orders to be delivered after adjustment is not different from the sum of the second delivery indexes of all the orders to be delivered before adjustment;
the difference between the sum of the third delivery indexes of all the orders to be delivered after adjustment and the sum of the third delivery indexes of all the orders to be delivered before adjustment does not exceed a preset third index threshold.
Optionally, the apparatus further comprises:
the multi-objective optimization module is used for respectively calculating a plurality of objective delivery indexes of the pre-planned delivery path and the objective delivery path; determining a dominant relationship between the target delivery index of the target delivery path and the target delivery index of the pre-planned delivery path through a preset multi-target optimization algorithm;
the order distribution module is configured to distribute the to-be-distributed order to the distributor according to the target distribution path when the dominant relationship satisfies a preset dominant condition.
In a third aspect, the present disclosure provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method of the first aspect of the present disclosure.
In a fourth aspect, the present disclosure provides an electronic device comprising: a memory having a computer program stored thereon; a processor for executing the computer program in the memory to implement the steps of the method of the first aspect of the disclosure.
By adopting the technical scheme, according to a plurality of to-be-distributed orders and a plurality of distributors, the to-be-distributed orders and the pre-planned distribution paths corresponding to the distributors are obtained; determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path; determining candidate dispatchers corresponding to the target order from a plurality of dispatchers; according to the target order, the candidate delivery person and the pre-planned delivery path, a target delivery path is obtained through a preset order allocation optimization model, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model; and reallocating a plurality of orders to be distributed according to the target distribution path. Therefore, partial target orders to be redistributed are selected on the basis of the pre-planned distribution path, and candidate distribution operators corresponding to the target orders are determined, so that the target orders can be redistributed efficiently, and the order distribution efficiency and the user satisfaction are improved.
Additional features and advantages of the present disclosure will be set forth in the detailed description which follows.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosure, and are incorporated in and constitute a part of this specification, illustrate the disclosure and together with the description serve to explain, but do not limit the disclosure. In the drawings:
Fig. 1 is a flowchart of an order allocation method provided in an embodiment of the present disclosure.
Fig. 2 is a flowchart illustrating a step S102 according to the embodiment shown in fig. 1.
Fig. 3 is a schematic diagram of dividing orders to be distributed on a pre-planned distribution path to obtain one or more order sets according to an embodiment of the present disclosure.
Fig. 4 is a schematic diagram of a direction matching degree of a pre-planned delivery path and the target order according to an embodiment of the present disclosure.
Fig. 5 is a schematic structural diagram of an order distribution device according to an embodiment of the present disclosure.
Fig. 6 is a schematic structural diagram of another order distribution device according to an embodiment of the present disclosure.
Fig. 7 is a block diagram of an electronic device provided by an embodiment of the present disclosure.
Detailed Description
Specific embodiments of the present disclosure are described in detail below with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating and illustrating the disclosure, are not intended to limit the disclosure.
It should be noted that, in this disclosure, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or order of indication or implying any particular order; the terms "S101", "S102", "S201", "S202", etc. are used to distinguish steps and are not necessarily to be construed as performing the method steps in a particular order or sequence; when the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated.
First, an application scenario of the present disclosure will be described. The present disclosure may be applied to order distribution scenarios, such as those of take-away delivery, express delivery, and the like. Takeaway distribution is a business model of O2O (Online To Offline, offline business opportunity combined with the internet) that has evolved rapidly in recent years. In this business model, order distribution (i.e., a reasonably assigned relationship of orders and dispatchers) determines order distribution efficiency and user experience satisfaction. Thus, order distribution efficiency and user experience satisfaction are core goals of the order distribution algorithm, that is, solving the assignment scheme problem of orders and distributors by the order distribution algorithm is essentially a multi-objective problem. The challenge of the order allocation algorithm is to give a reasonable order allocation scheme in a short time in a scene of huge order size to be allocated, so that an algorithm that does not stop generating a plurality of solutions and obtains an optimal allocation scheme by judging a dominant relationship cannot be adopted.
In the related art, the order allocation algorithm may use a greedy algorithm to find a suitable order allocation scheme, and consider multiple indicators such as order overtime degree, path forward degree, and preset order advance degree in a multi-objective weighting manner. However, the policy of the greedy algorithm can make the order allocation result only consider the allocation of the current order, but not consider the global order allocation result, so that the larger the order size to be allocated is, the less likely the greedy algorithm generates a globally optimal order allocation scheme. Therefore, the method of using greedy algorithm only to provide an assignment scheme and solving the multi-objective problem by using a weighting mode can lead to insufficient algorithm optimization and unreasonable assignment scheme. If the forward-going degree of the distributor is considered, a pre-order in serious advance is distributed to the distributor along the forward-going way, so that the user experience satisfaction degree can be influenced; or the orders are distributed to the detouring distributors in consideration of the advance time of the pre-orders, so that the capacity of the distributors is occupied for a long time, and the distribution efficiency of the subsequent period is reduced.
In order to solve the above problems, the present disclosure provides an order allocation method, an apparatus, a storage medium, and an electronic device, which determine a target order to be redistributed from a plurality of orders to be distributed according to a pre-planned distribution path planned for the first time; determining candidate dispatchers corresponding to the target order from a plurality of dispatchers; according to the target order, the candidate delivery person and the pre-planned delivery path, a target delivery path is obtained through a preset order allocation optimization model, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model; and reassigning the plurality of to-be-dispensed orders according to the target dispensing path. Therefore, partial target orders to be redistributed are selected on the basis of the pre-planned distribution path, and candidate distribution operators corresponding to the target orders are determined, so that the target orders can be redistributed efficiently, and the order distribution efficiency and the user satisfaction are improved.
Specific embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart of an order allocation method according to an embodiment of the present disclosure, as shown in fig. 1, where the method includes:
S101, according to a plurality of to-be-distributed orders and a plurality of distribution operators, obtaining the to-be-distributed orders and the pre-planned distribution paths corresponding to each distribution operator.
In this step, an order pre-planning algorithm may be adopted, and according to a plurality of to-be-delivered orders and a plurality of dispensers, to-be-delivered orders and pre-planned delivery paths corresponding to each dispenser are obtained. The order pre-planning algorithm may be a greedy algorithm, or may be other algorithms determined based on related principles such as operations research, which is not limited in this disclosure.
For example, the order pre-planning algorithm may score the matching degree of the combination of the plurality of to-be-delivered orders and the plurality of delivery operators to obtain a matching degree score, order the plurality of delivery operators with the front ordering corresponding to each to-be-delivered order according to the matching degree score, and then obtain the to-be-delivered order and the pre-planned delivery path corresponding to each delivery operator through multiple rounds of iterative allocation according to the ordering result.
The pre-planned delivery path may include information such as a pick-up position, a delivery position, a target delivery time, and a predicted delivery time of the to-be-delivered order allocated by the dispatcher.
S102, determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path.
The target orders may be one or more, taking the first delivery index as a target index to be optimized as an example, according to the pre-planned delivery path, a first predicted value of the first delivery index may be obtained, and an order to be delivered, of which the first predicted value exceeds a first preset target value, may be taken as a target order to be redistributed; the sorting may be performed according to the difference between the first predicted value and the first preset target value, where the order to be distributed in the first M bits in the difference sorting is used as the target order to be redistributed, and M may be any positive integer greater than 0.
It should be noted that, the first delivery index may include a timeout index, an advance time index, or a trip index of the to-be-delivered order. Wherein: the timeout index may be used to characterize a timeout difference in the predicted arrival time of the order to be dispensed being later than the target arrival time; the advance time index may be used to characterize an advance time difference that the predicted arrival time of the order to be delivered is earlier than the target arrival time, the advance time index may be an index for the order to be delivered, and the index may not be considered for the ordinary delivery order; the trip indicator may be used to characterize the total trip required by the dispatcher to complete the order dispatch based on the pre-planned dispatch path.
The first preset target value may be a target value determined for the first delivery index, for example, if the first delivery index is an advance time index, the first preset target value may be 10 minutes or 5 minutes.
S103, determining candidate dispatchers corresponding to the target order from a plurality of dispatchers.
Wherein each of the plurality of dispatchers may be a candidate dispatcher; a predetermined number of dispatchers may be selected from the plurality of dispatchers as candidate dispatchers.
It should be noted that, because the number of the orders to be distributed and the number of the distributed orders are both large, in order to improve the order distribution efficiency, the distributor corresponding to each target order can be screened, so as to reduce the operand in the subsequent order matching process and improve the efficiency. For example, a candidate dispatcher with a high dispatch probability may be selected from a plurality of dispatchers, and a dispatcher with a low dispatch probability may be filtered out. The dispatcher with high dispatch probability can acquire the target orders according to the front-ranked multiple dispatchers obtained in the order pre-planning algorithm. Illustratively:
first, for each target order, among the N front-ranked dispatchers, other dispatchers than the pre-planned dispatcher corresponding to the target order may be used as pre-candidate dispatchers.
Wherein N can be obtained by the following formula:
N＝min(R L *X％，X)；
wherein R is L And X is the preset selection number of pre-candidate dispensers.
The candidate dispatcher may then be obtained from the pre-candidate dispatcher.
For example, the pre-candidate dispatcher may be the candidate dispatcher; a pre-candidate dispatcher satisfying a preset dispatcher screening condition may be used as the candidate dispatcher.
S104, according to the target order, the candidate dispatcher and the pre-planned delivery path, acquiring a target delivery path through a preset order allocation optimization model, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model.
The preset constraint condition corresponding to the preset order allocation optimization model may include one or more of the following constraint conditions:
the sum of the first delivery indexes of all the orders to be delivered after the adjustment is better than the sum of the first delivery indexes of all the orders to be delivered before the adjustment under the condition 1-1.
And the sum of the second delivery indexes of all the orders to be delivered after the adjustment is not different from the sum of the second delivery indexes of all the orders to be delivered before the adjustment under the condition 1-2.
And the difference value between the sum value of the third delivery indexes of all the orders to be delivered after the adjustment and the sum value of the third delivery indexes of all the orders to be delivered before the adjustment does not exceed the preset third index threshold value under the conditions 1-3.
The first, second and third delivery indexes are different delivery indexes. Illustratively, the delivery service experience may be measured by a plurality of delivery indicators, and in this embodiment, the plurality of delivery indicators may be divided into three categories (including the first delivery indicator, the second delivery indicator, and the third delivery indicator described above):
the first delivery indicator may comprise a target indicator to be optimized, for example, may comprise an advance time indicator of an order to be delivered. Therefore, the condition 1-1 ensures that the sum of the advance time indexes of all the to-be-distributed orders after adjustment is better than the sum of the advance time indexes of all the to-be-distributed orders before adjustment, thereby realizing the optimization of the integral advance time indexes.
The second delivery indicator may include an indicator that requires the indicator value not to be degraded during the optimization process, for example, may include a timeout indicator for the order to be delivered. Thus, by the above condition 1-2, it is ensured that the time-out time after adjustment is not deteriorated.
The third delivery index may include an index whose index value may be degraded in the optimization process, but the difference of the third delivery index required to be degraded cannot exceed an index of a preset third index threshold, for example, may include a range index of an order to be delivered, where the preset third index threshold may be a preset range increment ratio threshold, for example, may be 20%. Thus, by the above conditions 1 to 3, it is ensured that the adjusted course increase is within the preset range, without causing the dispatcher to increase too much course.
Through the preset constraint conditions, the influence on other indexes can be avoided or reduced under the condition of optimizing the first distribution index, so that the distribution service experience of a user can be improved.
Further, the preset order allocation optimization model may be a bipartite graph matching model based on a target optimization algorithm. Illustratively, the target order and candidate dispatcher can be used as an order allocation optimization subspace; and distributing an optimization subspace for the order, abstracting a bipartite graph matching model based on a target optimization algorithm, wherein two sets of bipartite graphs are distributed into a set formed by the plurality of target orders and a set formed by the plurality of candidate delivery members, and the target optimization algorithm is utilized to obtain an optimal matching scheme which meets the preset constraint condition and has an optimal first delivery index. The target optimization algorithm may be, for example, a KM algorithm (Kuhn-Munkres algorithm).
Further, after the matching of the target order and the candidate dispatcher is completed, a target delivery path may be generated according to the matching result.
S105, reallocating a plurality of orders to be distributed according to the target distribution path.
By adopting the method, according to a plurality of orders to be distributed and a plurality of distributors, obtaining the orders to be distributed and a pre-planned distribution path corresponding to each distributor; determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path; determining candidate dispatchers corresponding to the target order from a plurality of dispatchers; according to the target order, the candidate delivery person and the pre-planned delivery path, a target delivery path is obtained through a preset order allocation optimization model, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model; and reallocating a plurality of orders to be distributed according to the target distribution path. Therefore, partial target orders to be redistributed are selected on the basis of the pre-planned distribution path, and candidate distribution operators corresponding to the target orders are determined, so that the target orders can be redistributed efficiently, and the order distribution efficiency and the user satisfaction are improved.
FIG. 2 is a flowchart illustrating a step S102 according to the embodiment shown in FIG. 1. As shown in FIG. 2, the step S102 of determining a target order to be reassigned from a plurality of the to-be-dispensed orders according to the pre-planned dispensing path may include the steps of:
s1021, regarding a pre-planned delivery path corresponding to each delivery person, taking one or more to-be-delivered orders with a later delivery sequence in the pre-planned delivery path as terminal orders corresponding to the delivery person.
For example, the last Y orders to be delivered in the pre-planned delivery path may be taken as the end orders corresponding to the deliverer, where Y may be any preset positive integer greater than 0.
Further, the target order may also be determined in the following manner:
firstly, dividing the to-be-delivered orders on the pre-planned delivery path according to the order taking position and the unit delivering position of the to-be-delivered orders on the pre-planned delivery path to obtain one or more order sets.
The order taking position and the unit sending position of the same order to be distributed are located in the same order set.
The dividing manner may include: coding a taking position and a sending position on a pre-planning delivery path, wherein the coding of each taking position is +1 units, and the coding of each sending position is-1 unit, so that for each taking position, the coding sum of the taking position to the last sending position is calculated, if the coding sum is 0 units, the taking position is taken as an order set starting position, and the sending position before the taking position and the last sending position on the whole pre-planning delivery path are taken as order set ending positions; therefore, the order taking position between the starting position of each order set and the ending position of the next order set and the order to be distributed corresponding to the sending position can be divided into an order set according to the distribution sequence. By the aid of the dividing mode, the fact that the order taking position and the delivery unit of the same order to be distributed are located in the same order set can be achieved.
For example, fig. 3 is a schematic diagram of dividing an order to be delivered on a pre-planned delivery path to obtain one or more order sets, where, as shown in fig. 3, the pre-planned delivery path may include 5 order taking positions A1/A2/A3/A4/A5 and 5 order delivering positions B1/B2/B3/B4/B5. Thus, in the manner described above, A1 and B1 may be taken as the first order set; taking A2, A3, B2 and B3 as a second order set; a4, A5, B5 and B4 are taken as a third order set.
And then, taking one or more to-be-delivered orders in the final order set in the delivery sequence in the pre-planned delivery path as end orders corresponding to the delivery staff.
As shown in FIG. 3, the order to be dispensed in the third set of orders may be taken as the end order for the pre-planned delivery path.
Further, all the orders to be distributed in the last Z order sets in the pre-planned distribution path may be distributed, where Z may be any preset positive integer greater than 0 as the end order corresponding to the distributor, for example, if Z is 2, the orders to be distributed in the third order set and the second order set may be used as the end order of the pre-planned distribution path.
S1022, obtaining the target order according to the terminal orders corresponding to the plurality of dispatchers.
For example, all the to-be-distributed orders in the end orders can be directly taken as target orders; it may also be determined whether to target the end order based on the first delivery indicator.
The means for determining whether to place the end order as the target order based on the first delivery indicator may include:
first, for each of a plurality of the distributors, when the first distribution index of each to-be-distributed order in the end order corresponding to the distributor is worse than a preset first distribution index threshold value, the end order is used as a candidate order corresponding to the distributor.
And then, obtaining a target order according to the candidate orders corresponding to the plurality of dispatchers.
For example, all candidate orders corresponding to a plurality of dispatchers are taken as the target order.
In this way, the target order to be redistributed can be obtained according to the end order corresponding to each distributor, and the influence on the distributors is minimized. It should be noted that, in the related art, when the target order is completely selected by the first delivery index or randomly, the target order is selected from the middle position of the pre-planned delivery path instead of the end position, which has a great influence on the delivery path of the dispenser. Particularly in the case of a pre-order, selecting a target order reassignment from a mid-position on the path may result in a worse lead time indicator for the following pre-order.
In another embodiment of the present disclosure, the step S103, determining a candidate dispatcher corresponding to the target order from the plurality of dispatcher, may include:
taking the dispatcher meeting the preset dispatcher screening conditions as a candidate dispatcher corresponding to the target order, wherein the preset dispatcher screening conditions comprise one or more of the following conditions:
and the forward path matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets the preset forward path matching degree condition under the condition 2-1.
For example, the quotient of the first distance of the multiple routes traveled by the dispatcher after adding the target orders and the second distance of the original pre-planned delivery path may be used as the forward matching degree, and the preset forward matching degree condition may include that the forward matching degree is smaller than a forward matching degree threshold, and the forward matching degree threshold may be any preset value.
Therefore, by judging the forward matching degree in the mode, the influence on efficiency caused by excessive increase of the distance of candidate dispatchers due to increase of the target order can be avoided.
And 2-2, the direction matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets the preset direction matching degree condition.
Wherein, since each target order includes a pick-up location and a send-unit location, the direction matching degree may also include a pick-and-one direction matching degree and a send-and-one direction matching degree. According to the order taking position, the matching degree of the pre-planned distribution path and the direction of the target order can be obtained;
FIG. 4 is a schematic diagram of a direction matching degree of a pre-planned delivery path and the target order according to an embodiment of the present disclosure, where, as shown in FIG. 4, the pre-planned delivery path includes four delivery positions that are formed according to the order of A-B-C-D, and each delivery position may be a unit taking position or a unit delivering position; the unit of the target order is set as the E point, the unit of the target order is set as the F point, the unit of the target order is set between the A position and the B position of the pre-planned delivery path, so that the included angle between the line segment formed by the two points AB and the line segment formed by the two points AE can be used as the single direction matching degree of the target order, the preset direction matching degree condition can comprise a preset single direction matching degree condition, the preset single direction matching degree condition comprises that the single direction matching degree is smaller than or equal to a first preset angle threshold value, and the first preset angle threshold value can be any value larger than 0 degrees and smaller than 180 degrees. For example: the first preset angle threshold may be 90 degrees, so that the alignment degree of the target order shown in fig. 4 is less than 90 degrees, and the alignment degree satisfies the preset alignment degree condition.
Similarly, the delivery unit position F of the target order is planned between the position C and the position D of the pre-planned delivery path, so that an included angle between a line segment formed by two points CF and a line segment formed by two points CD may be used as a delivery direction matching degree of the target order, the preset direction matching degree condition may further include a preset delivery direction matching degree condition, the preset delivery direction matching degree condition includes that the delivery direction matching degree is less than or equal to a second preset angle threshold, and the second preset angle threshold may be the same as or different from the first preset angle threshold, and the second preset angle threshold may be any value greater than 0 degrees and less than 180 degrees. For example: the second preset angle threshold may be 90 degrees such that the send-one direction matching degree of the target order shown in fig. 4 is greater than 90 degrees, and thus the send-one direction matching degree does not satisfy the preset send-one direction matching degree condition.
Further, the preset direction matching degree condition may further include the preset direction matching degree condition and the preset sending direction matching degree condition, and the preset direction matching degree condition can be satisfied only if both conditions are satisfied.
In this way, by judging the direction matching degree in the mode, excessive increase of the distance caused by reverse delivery of the candidate delivery person can be avoided, and therefore the efficiency of influencing the candidate delivery person by the target order can be prevented from being increased.
Condition 2-3, no overtime order occurs after the candidate dispatcher adds the target order.
By way of example, by performing simulated navigation prediction on the new planned delivery path after adding the target order, it is possible to obtain whether a overtime order will appear in the candidate delivery orders. Since the occurrence of a overtime order may result in a decrease in user satisfaction, the condition may avoid affecting the delivery service experience of the candidate delivery person.
And under the condition 2-4, the distribution distance increment of the candidate distributor after adding the target order is smaller than or equal to a preset distance increment threshold.
By the screening condition of the delivery distance increment, the candidate delivery person can be prevented from increasing too much delivery distance, and the delivery duration of the candidate delivery person is prevented from being increased too much.
And under the condition 2-5, after the candidate dispatcher increases the target order, the first dispatching index corresponding to the candidate dispatcher is not degraded.
Conditions 2-6, the number of target orders that the candidate dispatcher adds is less than or equal to a preset order add number.
The preset order adding comb may be any positive integer greater than 0, for example, may be 1. Thus, in one order reassignment, only 1 target order can be added for each candidate dispatcher, so that the candidate dispatcher is prevented from being repeatedly selected to add too many target orders.
Through the one or more conditions, the influence degree of the target order on the candidate dispatcher can be evaluated, the dispatcher with larger influence degree is removed, the influence degree of the target order on the candidate dispatcher is avoided or reduced, and therefore the overall order distribution effect is improved.
In another embodiment of the present disclosure, before the step S105 redistributes the plurality of to-be-distributed orders according to the target distribution path, the method may further include:
first, a plurality of target delivery indexes of the pre-planned delivery path and the target delivery path are respectively calculated.
The target delivery index may include the first delivery index, the second delivery index, and the third delivery index, where the first delivery index may include an advance time index of the order to be delivered, and the second delivery index may include a timeout time index of the order to be delivered. The third delivery indicator may include a trip indicator for the order to be delivered.
Then, a dominant relationship between the target delivery index of the target delivery path and the target delivery index of the pre-planned delivery path is determined through a preset multi-target optimization algorithm.
Illustratively, the preset multi-objective optimization algorithm may be a pareto optimal algorithm; the dominance relationship is used to characterize whether the target delivery indicator of the target delivery path is better than the target delivery indicator of the pre-planned delivery path.
Thus, the step S105 may reassign the plurality of to-be-delivered orders according to the target delivery path, which includes:
and distributing the to-be-distributed order to the distributor according to the target distribution path under the condition that the dominant relationship meets the preset dominant condition.
The preset dominant condition is used for representing that the target delivery index of the target delivery path is better than the target delivery index of the preset delivery path.
In this way, under the condition that the target delivery path is determined to be better than the pre-planned delivery path through the preset multi-target optimization algorithm, the target delivery path is taken as a final order delivery path, and the to-be-delivered order is redistributed for the delivery staff.
Fig. 5 is a schematic structural diagram of an order distribution device according to an embodiment of the present disclosure, as shown in fig. 5, where the device includes:
The pre-planning module 501 is configured to obtain, according to a plurality of to-be-distributed orders and a plurality of distributors, to-be-distributed orders and a pre-planned distribution path corresponding to each distributor;
a target order determining module 502, configured to determine a target order to be redistributed from a plurality of the to-be-distributed orders according to the pre-planned distribution path;
a candidate dispatcher determining module 503, configured to determine a candidate dispatcher corresponding to the target order from a plurality of the dispatchers;
a target delivery path obtaining module 504, configured to obtain a target delivery path through a preset order allocation optimization model according to the target order, the candidate dispatcher and the preset delivery path, so that the target delivery path meets a preset constraint condition corresponding to the preset order allocation optimization model;
an order allocation module 505, configured to reallocate a plurality of the to-be-dispensed orders according to the target dispensing path.
Optionally, the target order determining module 502 is configured to, for each of the pre-planned delivery paths corresponding to the delivery staff, use one or more to-be-delivered orders with a delivery order later in the pre-planned delivery path as the terminal order corresponding to the delivery staff; and acquiring the target order according to the end orders corresponding to the plurality of the dispatchers.
Optionally, the target order determining module 502 is configured to divide the to-be-delivered order on the pre-planned delivery path according to the order taking position and the delivery position of the to-be-delivered order on the pre-planned delivery path, so as to obtain one or more order sets; the order taking position and the unit sending position of the same order to be distributed are positioned in the same order set; and taking one or more to-be-delivered orders in the final order set in the delivery sequence in the pre-planned delivery path as end orders corresponding to the delivery staff.
Optionally, the target order determining module 502 is configured to, for each of the plurality of dispatchers, take the end order as a candidate order corresponding to the dispatcher when the first delivery index of each to-be-delivered order in the end order corresponding to the dispatcher is worse than a preset first delivery index threshold; and obtaining the target order according to the candidate orders corresponding to the plurality of the distributors.
Optionally, the candidate dispatcher determining module 503 is configured to take, as a candidate dispatcher corresponding to the target order, a dispatcher that meets a preset dispatcher screening condition, where the preset dispatcher screening condition includes one or more of the following conditions:
The forward matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets the preset forward matching degree condition;
the direction matching degree of the pre-planning delivery path corresponding to the candidate delivery person and the target order meets the preset direction matching degree condition;
the candidate dispatcher does not have overtime orders after adding the target order;
the distribution distance increment of the candidate distributor after adding the target order is smaller than or equal to a preset distance increment threshold;
after the candidate dispatcher increases the target order, the first dispatching index corresponding to the candidate dispatcher is not degraded;
the number of target orders that the candidate dispatcher adds is less than or equal to a preset order add number.
Optionally, the preset constraint condition corresponding to the preset order allocation optimization model includes one or more of the following constraint conditions:
the sum value of the first delivery indexes of all the orders to be delivered after adjustment is better than the sum value of the first delivery indexes of all the orders to be delivered before adjustment;
the sum of the second delivery indexes of all the orders to be delivered after adjustment is not different from the sum of the second delivery indexes of all the orders to be delivered before adjustment;
the difference between the sum of the third delivery indexes of all the orders to be delivered after adjustment and the sum of the third delivery indexes of all the orders to be delivered before adjustment does not exceed a preset third index threshold.
Optionally, the apparatus further comprises:
a multi-objective optimization module 601, configured to calculate a plurality of objective delivery indexes of the pre-planned delivery path and the objective delivery path, respectively; determining a dominant relationship between the target delivery index of the target delivery path and the target delivery index of the pre-planned delivery path through a preset multi-target optimization algorithm;
the order allocation module 505 is configured to allocate the to-be-allocated order to the dispatcher according to the target allocation path if the dominance relationship satisfies a preset dominance condition.
The specific manner in which the various modules perform the operations in the apparatus of the above embodiments have been described in detail in connection with the embodiments of the method, and will not be described in detail herein.
By adopting the device, according to a plurality of orders to be distributed and a plurality of distributors, obtaining the orders to be distributed and a pre-planned distribution path corresponding to each distributor; determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path; determining candidate dispatchers corresponding to the target order from a plurality of dispatchers; according to the target order, the candidate delivery person and the pre-planned delivery path, a target delivery path is obtained through a preset order allocation optimization model, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model; and reallocating a plurality of orders to be distributed according to the target distribution path. Therefore, partial target orders to be redistributed are selected on the basis of the pre-planned distribution path, and candidate distribution operators corresponding to the target orders are determined, so that the target orders can be redistributed efficiently, and the order distribution efficiency and the user satisfaction are improved.
Fig. 7 is a block diagram of an electronic device 700, according to an example embodiment. For example, the electronic device 700 may be provided as a server. Referring to fig. 7, the electronic device 700 includes a processor 722, which may be one or more in number, and a memory 732 for storing computer programs executable by the processor 722. The computer program stored in memory 732 may include one or more modules each corresponding to a set of instructions. Further, the processor 722 may be configured to execute the computer program to perform the order allocation method described above.
In addition, the electronic device 700 can further include a power component 726 and a communication component 750, the power component 726 can be configured to perform power management of the electronic device 700, and the communication component 750 can be configured to enable communication of the electronic device 700, e.g., wired or wireless communication. In addition, the electronic device 700 may also include an input/output (I/O) interface 758. The electronic device 700 may operate based on an operating system stored in memory 732, such as Windows Server, mac OS, unix, linux, etc.
In another exemplary embodiment, a computer readable storage medium is also provided comprising program instructions which, when executed by a processor, implement the steps of the order allocation method described above. For example, the computer readable storage medium may be the memory 732 described above that includes program instructions executable by the processor 722 of the electronic device 700 to perform the order allocation method described above.
In another exemplary embodiment, a computer program product is also provided, comprising a computer program executable by a programmable apparatus, the computer program having code portions for performing the order allocation method described above when executed by the programmable apparatus.
The preferred embodiments of the present disclosure have been described in detail above with reference to the accompanying drawings, but the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solutions of the present disclosure within the scope of the technical concept of the present disclosure, and all the simple modifications belong to the protection scope of the present disclosure.
In addition, the specific features described in the above embodiments may be combined in any suitable manner without contradiction. The various possible combinations are not described further in this disclosure in order to avoid unnecessary repetition.
Moreover, any combination between the various embodiments of the present disclosure is possible as long as it does not depart from the spirit of the present disclosure, which should also be construed as the disclosure of the present disclosure.
Claims (10)
1. A method of order distribution, the method comprising:
According to the multiple orders to be distributed and the multiple distributors, obtaining the orders to be distributed and a pre-planned distribution path corresponding to each distributor;
determining a target order to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path;
determining candidate dispatchers corresponding to the target order from a plurality of dispatchers;
acquiring a target delivery path through a preset order allocation optimization model according to the target order, the candidate delivery person and the pre-planned delivery path, so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model;
and reallocating a plurality of orders to be distributed according to the target distribution path.
2. The method of claim 1, wherein said determining a target order to be reassigned from a plurality of said orders to be dispensed according to said pre-planned dispensing path comprises:
for each pre-planned delivery path corresponding to each delivery person, taking one or more to-be-delivered orders with a later delivery sequence in the pre-planned delivery path as terminal orders corresponding to the delivery person;
and acquiring the target orders according to the terminal orders corresponding to the plurality of the dispatchers.
3. The method of claim 2, wherein said placing one or more orders to be dispensed in the pre-planned dispensing path in a later order as end orders for the dispenser comprises:
dividing the to-be-delivered orders on the pre-planned delivery path according to the order taking position and the unit delivering position of the to-be-delivered orders on the pre-planned delivery path to obtain one or more order sets; the order taking position and the delivery unit of the same order to be distributed are positioned in the same order set;
and taking one or more to-be-delivered orders in the delivery sequence in the pre-planned delivery path in the final order set as end orders corresponding to the delivery staff.
4. The method of claim 2, wherein said obtaining said target order from a plurality of end orders for said dispatcher comprises:
for each of the plurality of the dispensers, taking the end order as a candidate order corresponding to the dispenser when the first delivery index of each to-be-delivered order in the end order corresponding to the dispenser is worse than a preset first delivery index threshold;
And obtaining the target order according to the candidate orders corresponding to the plurality of the distribution operators.
5. The method of claim 4, wherein said determining a candidate dispatcher for the target order from among a plurality of said dispatchers comprises:
taking the dispatcher meeting the preset dispatcher screening conditions as a candidate dispatcher corresponding to the target order, wherein the preset dispatcher screening conditions comprise one or more of the following conditions:
the forward-path matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets a preset forward-path matching degree condition;
the direction matching degree of the pre-planned delivery path corresponding to the candidate delivery person and the target order meets the preset direction matching degree condition;
the candidate dispatcher does not have overtime orders after adding the target order;
the distribution distance increment of the candidate distributor after adding the target order is smaller than or equal to a preset distance increment threshold;
after the candidate dispatcher increases the target order, the first dispatching index corresponding to the candidate dispatcher is not degraded;
the number of target orders added by the candidate dispatcher is less than or equal to a preset order added number.
6. The method of claim 4, wherein the preset constraints corresponding to the preset order allocation optimization model include one or more of the following constraints:
the sum value of the first delivery indexes of all the orders to be delivered after adjustment is better than the sum value of the first delivery indexes of all the orders to be delivered before adjustment;
the sum of the second delivery indexes of all the orders to be delivered after adjustment is not different from the sum of the second delivery indexes of all the orders to be delivered before adjustment;
the difference between the sum of the third delivery indexes of all the orders to be delivered after adjustment and the sum of the third delivery indexes of all the orders to be delivered before adjustment does not exceed a preset third index threshold.
7. The method of any one of claims 1 to 6, wherein prior to said reassigning a plurality of said to-be-dispensed orders in accordance with said target dispensing path, said method further comprises:
respectively calculating a plurality of target delivery indexes of the pre-planned delivery path and the target delivery path;
determining a dominant relationship between the target delivery index of the target delivery path and the target delivery index of the pre-planned delivery path through a preset multi-target optimization algorithm;
The reassigning the plurality of to-be-dispensed orders according to the target dispensing path includes:
and distributing the to-be-distributed order to the distributor according to the target distribution path under the condition that the dominant relationship meets the preset dominant condition.
8. An order dispensing device, the device comprising:
the pre-planning module is used for acquiring the to-be-distributed order and a pre-planned distribution path corresponding to each distributor according to the to-be-distributed orders and the distributors;
the target order determining module is used for determining target orders to be redistributed from a plurality of orders to be distributed according to the pre-planned distribution path;
a candidate dispatcher determining module, configured to determine candidate dispatchers corresponding to the target order from a plurality of dispatchers;
the target delivery path acquisition module is used for acquiring a target delivery path through a preset order allocation optimization model according to the target order, the candidate delivery person and the pre-planned delivery path so that the target delivery path meets preset constraint conditions corresponding to the preset order allocation optimization model;
and the order distribution module is used for redistributing a plurality of orders to be distributed according to the target distribution path.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the steps of the method according to any one of claims 1 to 7.
10. An electronic device, comprising:
a memory having a computer program stored thereon;
a processor for executing the computer program in the memory to implement the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111372397.3A CN116151711A (en) | 2021-11-18 | 2021-11-18 | Order distribution method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111372397.3A CN116151711A (en) | 2021-11-18 | 2021-11-18 | Order distribution method and device, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116151711A true CN116151711A (en) | 2023-05-23 |
Family
ID=86337584
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111372397.3A Pending CN116151711A (en) | 2021-11-18 | 2021-11-18 | Order distribution method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116151711A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117909601A (en) * | 2024-03-15 | 2024-04-19 | 厦门她趣信息技术有限公司 | Payment social matching method, device, equipment and readable storage medium |
-
2021
- 2021-11-18 CN CN202111372397.3A patent/CN116151711A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117909601A (en) * | 2024-03-15 | 2024-04-19 | 厦门她趣信息技术有限公司 | Payment social matching method, device, equipment and readable storage medium |
| CN117909601B (en) * | 2024-03-15 | 2024-05-17 | 厦门她趣信息技术有限公司 | Payment social matching method, device, equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190026691A1 (en) | Method, apparatus, and system for scheduling logistic resources | |
| Bayram et al. | Unsplittable load balancing in a network of charging stations under QoS guarantees | |
| CN113222305B (en) | Order scheduling method, order scheduling device, storage medium and electronic equipment | |
| EP2962427B1 (en) | Method and system to represent the impact of load variation on service outage over multiple links | |
| CN105809323A (en) | Task allocation method and system | |
| CN111600967B (en) | Access pressure-based load balancing system among block chain nodes | |
| CN106851747B (en) | Dynamic resource allocation method and device in mobile communication system | |
| JP6133447B2 (en) | Power accommodation management system and power accommodation management method | |
| CN111176840B (en) | Distribution optimization method and device for distributed tasks, storage medium and electronic device | |
| CN113191619A (en) | Emergency rescue material distribution and vehicle dispatching dynamic optimization method | |
| Chen et al. | Q-learning based bidding algorithm for spectrum auction in cognitive radio | |
| CN107506910A (en) | The method for assessing electrical changing station service ability | |
| JP2017027448A (en) | Method for requesting demand response, demand response request device, and method for requesting demand system | |
| CN112219191A (en) | Self-configuration of services and servers in a data center | |
| CN110751433A (en) | Order distribution method and device, electronic equipment and storage medium | |
| JPWO2020032082A1 (en) | Control device and control method | |
| CN116151711A (en) | Order distribution method and device, storage medium and electronic equipment | |
| CN109144730A (en) | Task discharging method and device under a kind of cell | |
| CN115134369B (en) | CDN node distribution method and device, electronic equipment and storage medium | |
| Sun et al. | ORC: An online competitive algorithm for recommendation and charging schedule in electric vehicle charging network | |
| Fan et al. | Dynamic pricing over multiple rounds of spectrum leasing in cognitive radio | |
| El-Refaey et al. | Cloud-assisted spectrum management system with trading engine | |
| Jarray et al. | VCG auction-based approach for efficient Virtual Network embedding | |
| CN115168017B (en) | Task scheduling cloud platform and task scheduling method thereof | |
| Korcak et al. | Competition and regulation in a wireless operator market: An evolutionary game perspective |
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 |