CN112288340A - Logistics order dispatching method and device, computer equipment and storage medium - Google Patents
Logistics order dispatching method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112288340A CN112288340A CN202011572906.2A CN202011572906A CN112288340A CN 112288340 A CN112288340 A CN 112288340A CN 202011572906 A CN202011572906 A CN 202011572906A CN 112288340 A CN112288340 A CN 112288340A
- Authority
- CN
- China
- Prior art keywords
- real
- order
- time logistics
- dispatching
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
- G06Q10/063112—Skill-based matching of a person or a group to a task
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to a logistics order dispatching method, a logistics order dispatching device, computer equipment and a storage medium. The method comprises the following steps: when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located; when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode; acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set; acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set; and performing union dispatching and/or grouping dispatching on the real-time logistics orders in the real-time logistics order set by the target knight determined according to the idle transportation value and the actual transportation value. By adopting the method, the logistics order distribution efficiency can be improved.
Description
Technical Field
The present application relates to the field of logistics technologies, and in particular, to a method and an apparatus for dispatching a logistics order, a computer device, and a storage medium.
Background
With the development of logistics technology, an instant logistics order distribution technology appears, namely, instant logistics orders are distributed to appropriate distribution personnel (such as knight) through a logistics platform according to an instant logistics order distribution mode; and dispatching the pulled instant logistics orders to the hands of the users through the distribution personnel.
However, in the current crowdsourcing scenario, when a new logistics order is received by the logistics platform, the evaluation score of a delivery person is obtained, the order is preferentially distributed to the delivery person with a high evaluation score, and then the order is distributed according to preset time and distance, so that the order distribution efficiency is low.
Disclosure of Invention
In view of the above, it is necessary to provide a method, an apparatus, a computer device and a storage medium for distributing logistics orders, which can improve logistics order distribution efficiency.
A method of logistics order dispatch, the method comprising:
when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located;
when the operation index value is larger than or equal to an operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode;
acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set;
acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set;
and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the idle transportation value and the actual transportation value.
In one embodiment, the method further comprises:
when the operation index value is smaller than the operation index threshold value, determining that the real-time logistics order is dispatched in a second dispatching mode;
based on the second dispatch mode, determining a target rider for the real-time logistics order dispatch according to recommended strategy data.
In one embodiment, the determining the target knight of the real-time logistics order assignment according to recommended strategy data based on the second assignment mode comprises:
determining a sequential road value between a rider carrying a dispatching task and the real-time logistics order according to recommended strategy data based on the second dispatching mode;
determining a trail rider with the trail value greater than or equal to a trail threshold value as a candidate rider;
when the number of the candidate knights is larger than or equal to the total recommended number of knights threshold value in the recommendation strategy data, sorting the road degree values in an order from big to small, and determining the candidate knights with the total recommended number of knights threshold value from the candidate knights as target knights.
In one embodiment, the method further comprises:
when the number of the candidate knights is smaller than the total recommended number of knights threshold in the recommendation strategy data, acquiring the number of recommended single idle knights in a specified area;
determining a target rider from the recommended list of idle riders when a difference between the total recommended rider number threshold and the number of candidate riders is greater than or equal to the number of recommended list of idle riders.
In one embodiment, the performing order-sharing and/or group-sharing assignment of the real-time logistics orders in the real-time logistics order set according to the idle capacity value and the actual capacity value by the target knight comprises:
when the idle transportation value is smaller than the actual transportation value, acquiring order attributes of the real-time logistics order;
performing order-combining dispatching on the real-time logistics order according to the order dispatching path information of the order attributes, and dispatching the order to a target rider carrying an order with the same real-time logistics order dispatching path information;
and if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders.
In one embodiment, the method further comprises:
and detecting that unprocessed real-time logistics orders still exist after the order combining dispatching and/or the grouping dispatching, and executing the step of determining that the real-time logistics orders are dispatched in a second dispatching mode.
In one embodiment, the method further comprises:
when the fact that the real-time logistics order is not read by the terminal where the target knight is located within the preset time is detected, determining that the real-time logistics order is dispatched in a third dispatching mode; the third order sending mode is to send the real-time logistics orders to terminals held by knight in a preset number in the target area.
A logistics order dispatching apparatus, the apparatus comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring an operation index value of a target area where a target merchant is located when the generation of a real-time logistics order is detected;
the dispatching mode determining module is used for determining that the real-time logistics order is dispatched in a first dispatching mode when the operation index value is larger than or equal to an operation index threshold value;
the order pressing module is used for acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set;
the second acquisition module is used for acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set;
and the order assignment module is used for performing order combination assignment and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transport force value and the actual transport force value.
A computer device comprising a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:
when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located;
when the operation index value is larger than or equal to an operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode;
acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set;
acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set;
and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the idle transportation value and the actual transportation value.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located;
when the operation index value is larger than or equal to an operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode;
acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set;
acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set;
and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the idle transportation value and the actual transportation value.
According to the logistics order dispatching method, the logistics order dispatching device, the computer equipment and the storage medium, when the real-time logistics order generation is detected, the operation index value of the target area where the target merchant is located is obtained; when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode; acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set; acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set; and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transport capacity value and the actual transport capacity value, namely determining an assignment mode of the real-time logistics orders according to the operation index value and determining a proper knight in a most proper mode, so that the overall distribution efficiency of the orders is ensured.
Drawings
FIG. 1 is a diagram of an application environment of a method for logistics order allocation in one embodiment;
FIG. 2 is a flow diagram illustrating a method for logistics order allocation in one embodiment;
FIG. 3 is a flow diagram illustrating the logistics order dispatch step in one embodiment;
FIG. 4 is a flow chart illustrating a method for dispatching a logistics order according to another embodiment;
FIG. 5 is a block diagram of an embodiment of a logistics order dispatching apparatus;
FIG. 6 is a block diagram showing the structure of a distribution order assigning apparatus according to an embodiment;
FIG. 7 is a diagram illustrating an internal structure of a computer device according to an embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The logistics order dispatching method provided by the application can be applied to the application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. When the terminal 102 detects that a real-time logistics order is generated, acquiring an operation index value of a target area where a target merchant is located from the server 104; when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode; acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set; acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set; and performing union dispatching and/or grouping dispatching on the real-time logistics orders in the real-time logistics order set by the target knight determined according to the idle transportation value and the actual transportation value. The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers.
In one embodiment, as shown in fig. 2, a logistics order dispatching method is provided, which is described by taking the method as an example applied to the terminal in fig. 1, and includes the following steps:
The operation index values comprise operation indexes such as a local order pressure value, a ratio of an idle capacity value to a total capacity, a per-person order quantity, the number of available summons for recalling, and the like. The target area refers to a pre-set dispatchable area of the logistics order of each target merchant.
Specifically, when the terminal detects that a real-time logistics order is generated, at least operation index values such as a local order pressure value, a ratio of an idle transportation value to a total transportation capacity, a per-person order quantity, and a recall available order dispatching rider are obtained, the received logistics order is pre-judged, and whether the logistics order can be dispatched or not is judged.
And 204, when the operation index value is greater than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode.
The operation index threshold value is a preset value and is used for ensuring that the logistics order can be sent to the knight, namely the logistics order can be viewed by the terminal where the knight is located. The first order dispatching mode is that when the operation index value of a target area where a target merchant is located reaches an operation index threshold value, a logistics order is dispatched to a knight with the maximum score value, namely an optimal knight according to the currently assignable knight and the score values of the knights; determining a corresponding target assignment mode according to the order policy data of the first order mode, wherein the target assignment mode comprises at least one of order merging assignment, grouping assignment and combined assignment mode of order merging assignment and grouping assignment; the dispatching strategy data is used for determining the optimal rider while the dispatching efficiency of the logistics order viewed by the dispatching object and the dispatching efficiency of the logistics order are within the preset efficiency range value within the preset time length.
Specifically, when the operation index values such as the local order pressure value, the ratio of the idle capacity value to the total capacity, the per-person order quantity and the recall available dispatching order rider reach the respective index threshold values, the logistics order can be dispatched, and the real-time logistics order is determined to be dispatched in the first dispatching mode.
And step 206, acquiring a real-time logistics order within a preset time length based on the first order mode to obtain a real-time logistics order set.
The preset time duration refers to a preset time duration for pressing the menu, and the preset time duration may be, but is not limited to, 20 seconds. For example, when the preset time length is 20S, the real-time logistics orders generated in 20S are pressed to obtain a real-time logistics order set, and the obtained real-time logistics order set is assigned. Optionally, real-time logistics orders within a preset time length are obtained, and the real-time logistics orders with the same order attributes are combined into a real-time logistics order set, wherein the order attributes comprise a logistics order destination, delivery time, predicted arrival time and the like; the obtained real-time logistics order sets are assigned to the same knight, so that the transport capacity can be saved, and the utilization rate of the transport capacity can be improved.
And step 208, acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set.
Wherein the idle capacity value includes a number of riders to which the logistics order is not assigned.
And step 210, performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transportation value and the actual transportation value.
The real-time logistics orders in the real-time logistics order set are dispatched in a target dispatching mode in a first dispatching mode according to the target knight determined according to the idle transport value and the actual transport value, and the target dispatching mode comprises at least one of merging dispatching, grouping dispatching and combined dispatching modes of merging dispatching and then grouping dispatching.
Specifically, when the idle transportation value is smaller than the actual transportation value, acquiring the order attribute of the real-time logistics order; performing order-combining dispatching on the real-time logistics order according to the order dispatching path information of the order attributes, dispatching the order to a target rider carrying an order identical to the real-time logistics order dispatching path information, and finishing dispatching the real-time logistics order through the target rider; and if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders, namely performing grouping assignment according to the destinations of the real-time logistics orders. Optionally, when the idle capacity value is greater than or equal to the actual capacity value, merging the real-time logistics orders carrying the same order attributes into a real-time logistics order set, and assigning the merged real-time logistics order set to the idle knight.
The following is an application scenario of logistics order allocation in an embodiment, when a terminal detects a real-time logistics order, it is pre-determined whether the order can be allocated; when the operation index value is larger than or equal to the operation index threshold value, determining that the order can be dispatched, dispatching in a first dispatching mode and performing order pressing to obtain a real-time logistics order generated within 20s, and when the idle transportation value is smaller than the actual transportation value, obtaining the order attribute of the real-time logistics order; performing order merging and dispatching on the real-time logistics orders according to the order dispatching path information of the order attributes, and dispatching the orders to target knights carrying orders which are the same as the real-time logistics order dispatching path information; and when the idle capacity value is larger than or equal to the actual capacity value, merging the real-time logistics orders carrying the same order attributes into a real-time logistics order set, and distributing the merged real-time logistics order set to idle knights. And if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders.
In the logistics order dispatching method, when the real-time logistics order generation is detected, the operation index value of the target area where the target merchant is located is obtained; when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode; acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set; acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set; and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transport capacity value and the actual transport capacity value, namely determining an assignment mode of the real-time logistics orders according to the operation index value and determining a proper knight in a most proper mode, so that the overall distribution efficiency of the orders is ensured.
In one embodiment, as shown in fig. 3, a logistics order dispatching step is provided, which is exemplified by the application of the step to the terminal in fig. 1, and includes the following steps:
And 308, acquiring a real-time logistics order within a preset time length based on the first order mode to obtain a real-time logistics order set.
And step 310, acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set.
And step 312, performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transportation value and the actual transportation value.
Specifically, when an unprocessed real-time logistics order still exists after any one of the combined dispatching mode of the order merging dispatching, the combined dispatching mode of the order merging dispatching and the grouping dispatching, or the grouping dispatching mode, the real-time logistics order is determined to be dispatched in the second order dispatching mode. Optionally, in the embodiment, but not limited to, in the first order mode, when an unprocessed real-time logistics order still exists after detecting that the grouping assignment is performed after the parallel assignment, the determining of the real-time logistics order is described by taking the second order mode as an example.
The second order sending mode is a recommended order sending mode, namely, the real-time logistics orders are sent to a certain number (the certain number is self-defined and can be but is not limited to 5) of target knights according to the order attributes of the real-time logistics orders; the target rider is a real-time logistics order and a single rider carrying the order, and the following degree reaches a following degree threshold value, the following degree is the distance between the current position of the real-time logistics order and the position of each idle rider, and when the distance is smaller than or equal to the preset distance, the corresponding idle rider is the following rider of the logistics order.
And step 318, determining a target knight of the real-time logistics order assignment according to the recommended strategy data based on the second assignment mode.
Specifically, based on the second order dispatching mode, determining a sequential road value between a rider carrying an order dispatching task and a real-time logistics order according to the recommended strategy data; determining a trail rider with a trail value greater than or equal to a trail threshold value as a candidate rider; when the number of candidate knights is larger than or equal to the total recommended number of knights threshold value in the recommendation strategy data, sorting the sequential road values in a descending order, and determining the candidate knights with the total recommended number of knights threshold value as the target knights from the candidate knights.
And step 320, when the fact that the real-time logistics order is not read by the terminal where the target knight is located within the preset time is detected, determining that the real-time logistics order is dispatched in a third dispatching mode.
The third order sending mode is a periodic diffusion order sending mode, that is, the real-time logistics orders are sequentially sent to the terminal where the corresponding target knight is located according to the preset proportion combination based on the score value of the knight within the preset distance range (for example, within 5 KM) until all the real-time logistics orders are read by the terminal where the target knight is located. The predetermined ratio combination may be, but is not limited to, 5%, 10%, 50%, 80%, and 100%.
Specifically, when it is detected that the real-time logistics order is not read by the terminal where the target knight is located in the second form sending mode within a preset time, that is, the real-time logistics order is sent to the terminal where the target knight is located, the terminal of the target knight fails to trigger generation of a reading instruction or trigger generation of an order rejection instruction on an interface, it is detected that the real-time logistics order is not processed within the preset time, it is determined that the real-time logistics order is dispatched in the periodic diffusion form sending mode, based on the periodic diffusion form sending mode, scores of knights within 5KM of the target merchant are obtained, the real-time logistics order is sent to the terminal where the corresponding target knight is located in sequence according to 5%, 10%, 50%, 80% and 100%, and the dispatching of the real-time logistics order is completed until all the real-time logistics order is read by the terminal where the target kn.
Optionally, when the operation index value is smaller than the operation index threshold value, determining that the real-time logistics order is dispatched in a second dispatch mode, based on the second dispatch mode, determining a target rider of the real-time logistics order dispatch according to the recommended strategy data, when it is detected that the real-time logistics order is not read by a terminal where the target rider is located within a preset time, determining that the real-time logistics order is dispatched in a third dispatch mode until all the real-time logistics orders are read by the terminal where the target rider is located, and completing the dispatch of the real-time logistics order.
In the step of dispatching logistics orders, when a real-time logistics order is detected, the real-time logistics order is pre-judged by acquiring an operation index value of a target area where a target merchant is located, when the operation index value is larger than or equal to an operation index threshold value, the real-time logistics order is confirmed to be dispatched in a first dispatching mode, when an idle operation value is smaller than an actual operation value, the real-time logistics order is pressed, a pressed real-time logistics order set is subjected to union dispatching to an optimal knight, and the un-pressed real-time logistics order is subjected to grouping dispatching; when unprocessed real-time logistics orders or operation index values smaller than an operation index threshold value exist after the fact that the order merging assignment and/or the grouping assignment are detected, determining that the real-time logistics orders are assigned in a recommended order assignment mode; when the fact that the real-time logistics order is not read by the terminal where the target knight is located within the preset time is detected, the fact that the real-time logistics order is dispatched in the periodic diffusion order dispatching mode is determined, namely when the fact that the real-time logistics order is generated is detected, the fact that the real-time logistics order is generated is pre-judged, the appropriate order dispatching mode is determined from the first order dispatching mode, the second order dispatching mode and the third order dispatching mode, the optimal knight is determined, the logistics order distribution efficiency is improved, and the utilization rate of dispatching resources is improved.
In another embodiment, as shown in fig. 4, a logistics order dispatching method is provided, which is described by taking the method as an example applied to the terminal in fig. 1, and includes the following steps:
And step 404, when the operation index value is greater than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode.
And 406, acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set.
And step 408, acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set.
And step 410, when the idle transportation value is smaller than the actual transportation value, acquiring the order attribute of the real-time logistics order.
And step 412, performing order combining and dispatching on the real-time logistics orders according to the order dispatching path information of the order attributes, and dispatching the orders to target knights carrying orders which are the same as the real-time logistics order dispatching path information.
In step 414, if there are any real-time logistics orders that are not yet listed, the remaining real-time logistics orders are assigned in groups.
And step 416, when the unprocessed real-time logistics orders exist after the order combining and/or grouping assignment is detected, determining that the real-time logistics orders are assigned in the second order assignment mode.
Specifically, when the unprocessed real-time logistics orders are detected to exist after the combined dispatching of the concurrent dispatching and the grouped dispatching in the first dispatching mode, the real-time logistics orders are determined to be dispatched in the second dispatching mode.
And 418, determining a target knight of the real-time logistics order assignment according to the recommended strategy data based on the second assignment mode.
When the number of the candidate knights is larger than or equal to a total recommended number of knights threshold value in the recommendation strategy data, sorting the consequent values in a descending order until the selected number of the target knights is equal to the total recommended number of knights threshold value, otherwise, determining the corresponding number of knights as the target knights from the idle knights; determining a target rider from the recommended list of idle riders when a difference between the total recommended rider number threshold and the number of candidate riders is greater than or equal to the number of recommended list of idle riders; otherwise, the idle knights are ranked from big to small according to the consequent degree value, and the knights corresponding to the total recommended number threshold of the knights are determined as the target knights from the ranked idle knights.
And step 420, when the fact that the real-time logistics order is not read by the terminal where the target knight is located within the preset time is detected, determining that the real-time logistics order is dispatched in the third dispatching mode.
Specifically, when it is detected that the real-time logistics order is not read by the terminal where the target knight is located within the preset time, the real-time logistics order is determined to be dispatched in a third dispatching mode, that is, the real-time logistics order is sent to the terminals held by the knights with the preset number in the target area, and the dispatching of the real-time logistics order is completed.
Optionally, in an embodiment, when it is detected that the real-time logistics order is generated, an operation index value of a target area where the target merchant is located is obtained; when the operation index value is smaller than the operation index threshold value, determining that the real-time logistics order is dispatched in a second dispatching mode; determining a sequential road value between the knight carrying the order dispatching task and the real-time logistics order according to the recommended strategy data based on the second order dispatching mode; determining a trail rider with a trail value greater than or equal to a trail threshold value as a candidate rider; when the number of the candidate knights is larger than or equal to the total recommended number of knights threshold value in the recommendation strategy data, sorting the sequential road values according to the sequence from big to small, and determining the candidate knights with the total recommended number of knights threshold value from the candidate knights as target knights; when the number of the candidate knights is smaller than the total recommended knight number threshold value in the recommendation strategy data, acquiring the number of idle knights of the recommendation list in the designated area; determining a target rider from the recommended list of idle riders when a difference between the total recommended rider number threshold and the number of candidate riders is greater than or equal to the number of recommended list of idle riders; when detecting that the real-time logistics order is not read by the terminal where the target knight is located in the second order sending mode within the preset time, determining that the real-time logistics order is dispatched in the third order sending mode; the real-time logistics orders are pre-judged, the real-time logistics orders are dispatched through the second order dispatching mode under the condition that the first order dispatching mode is not met, when the real-time logistics orders are detected not to be dispatched in time, the orders are dispatched through the third order dispatching mode, the orders are distributed to proper riders in the most proper mode according to the conditions of real-time transport capacity and the like, and therefore the overall distribution efficiency of the orders is guaranteed, and the logistics order dispatching rationality is guaranteed.
In the logistics order dispatching method, when a real-time logistics order is detected, the real-time logistics order is pre-judged by acquiring an operation index value of a target area where a target merchant is located, when the operation index value is larger than or equal to an operation index threshold value, the real-time logistics order is confirmed to be dispatched in a first dispatching mode, when an idle operation value is smaller than an actual operation value, the real-time logistics order is pressed, a pressed real-time logistics order set is merged and dispatched to an optimal rider, and the real-time logistics order which is not merged is grouped and dispatched; when unprocessed real-time logistics orders exist after the fact that the order merging dispatching and/or the grouping dispatching are detected, the fact that the real-time logistics orders are dispatched in a recommended order dispatching mode is determined; when the fact that the real-time logistics order is not read by the terminal where the target knight is located within the preset time is detected, the fact that the real-time logistics order is dispatched in the periodic diffusion order dispatching mode is determined, namely when the fact that the real-time logistics order is generated is detected, the fact that the real-time logistics order is generated is pre-judged, the appropriate order dispatching mode is determined from the first order dispatching mode, the second order dispatching mode and the third order dispatching mode, the optimal knight is determined, the logistics order distribution efficiency is improved, and the utilization rate of dispatching resources is improved.
It should be understood that although the various steps in the flow charts of fig. 2-4 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2-4 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed in turn or alternately with other steps or at least some of the other steps.
In one embodiment, as shown in fig. 5, there is provided a logistics order dispatching apparatus comprising: a first obtaining module 502, a dispatch mode determination module 504, a pressing module 506, a second obtaining module 508, and an order dispatch module 510, wherein:
the first obtaining module 502 is configured to obtain an operation index value of a target area where a target merchant is located when it is detected that a real-time logistics order is generated.
The dispatch mode determining module 504 is configured to determine that the real-time logistics order is dispatched in the first dispatch mode when the operation index value is greater than or equal to the operation index threshold value.
And the order pressing module 506 is configured to obtain a real-time logistics order within a preset time length based on the first order sending mode, so as to obtain a real-time logistics order set.
And a second obtaining module 508, configured to obtain an idle transportation value and an actual transportation value required by the real-time logistics order set.
And the order dispatching module 510 is used for performing union dispatching and/or grouping dispatching on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transportation value and the actual transportation value.
In the logistics order dispatching device, when the real-time logistics order generation is detected, the operation index value of a target area where a target merchant is located is obtained; when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode; acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set; acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set; and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transport capacity value and the actual transport capacity value, namely determining an assignment mode of the real-time logistics orders according to the operation index value and determining a proper knight in a most proper mode, so that the overall distribution efficiency of the orders is ensured.
In another embodiment, as shown in fig. 6, a logistics order dispatching apparatus is provided, which comprises, in addition to a first obtaining module 502, a dispatching mode determining module 504, a pressing module 506, a second obtaining module 508 and an order dispatching module 510: a determination module 512, a ranking module 514, a third obtaining module 516, and a detection module 518, wherein:
and the dispatch mode determining module 504 is configured to determine that the real-time logistics order is dispatched in the second dispatch mode when the operation index value is smaller than the operation index threshold value.
The order dispatch module 510 is further configured to determine a target rider for real-time logistics order dispatch according to the recommended policy data based on the second dispatch mode.
A determining module 512, configured to determine, based on the second order dispatching mode, a sequential road value between the rider carrying the order dispatching task and the real-time logistics order according to the recommended policy data; and determining the along-road knight with the along-road value larger than or equal to the along-road threshold value as the candidate knight.
A ranking module 514 for ranking the sequential road values in order of big to small when the number of candidate knights is greater than or equal to the total recommended number of knights threshold in the recommendation policy data, the candidate knights of the total recommended number of knights threshold being determined as the target knight from the candidate knights.
A third obtaining module 516, configured to obtain the number of free recommended single knights in the specified area when the number of candidate knights is less than the total recommended number of knights threshold in the recommendation policy data.
The determination module 512 is further configured to determine the target rider from the idle recommended single knight when a difference between the total recommended number of knight threshold and the number of candidate knights is greater than or equal to the number of idle recommended single knights.
The second obtaining module 508 is further configured to obtain an order attribute of the real-time logistics order when the idle transportation value is smaller than the actual transportation value.
The order dispatching module 510 is further configured to perform order-combining dispatching on the real-time logistics order according to the order dispatching path information of the order attribute, and dispatch the real-time logistics order to a target rider carrying an order with the same information as the real-time logistics order dispatching path; and if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders.
The detecting module 518 is configured to detect that there is an unprocessed real-time logistics order after the parallel dispatching and/or the grouping dispatching, and perform a step of determining that the real-time logistics order is dispatched in the second dispatching mode.
The dispatch mode determining module 504 is further configured to determine that the real-time logistics order is dispatched in a third dispatch mode when it is detected that the real-time logistics order is not read by the terminal where the target knight is located within the preset time; the third order sending mode is to send real-time logistics orders to terminals held by knight in a preset number in a target area.
In one embodiment, when a real-time logistics order is detected, the real-time logistics order is pre-judged by acquiring an operation index value of a target area where a target merchant is located, when the operation index value is greater than or equal to an operation index threshold value, the real-time logistics order is determined to be dispatched in a first dispatching mode, when an idle transportation value is smaller than an actual transportation value, the real-time logistics order is pressed, a pressed real-time logistics order set is merged and dispatched to an optimal knight, and the real-time logistics orders which are not merged are grouped and dispatched; when unprocessed real-time logistics orders or operation index values smaller than an operation index threshold value exist after the fact that the order merging assignment and/or the grouping assignment are detected, determining that the real-time logistics orders are assigned in a recommended order assignment mode; when the fact that the real-time logistics order is not read by a terminal where a target rider is located within the preset time is detected, the fact that the real-time logistics order is dispatched in a periodic diffusion dispatching mode is determined, namely when the fact that the real-time logistics order is generated is detected, the fact that the real-time logistics order is generated is pre-judged, a proper dispatching mode and an optimal rider are determined from a first dispatching mode, a second dispatching mode and a third dispatching mode, the overall dispatching efficiency of the order is guaranteed, and the logistics order dispatching rationality is guaranteed.
For specific limitations of the logistics order dispatching device, reference may be made to the above limitations of the logistics order dispatching method, which will not be described herein again. The modules in the logistics order dispatching device can be wholly or partially implemented by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 7. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless communication can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a logistics order dispatching method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program:
when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located;
when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode;
acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set;
acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set;
and performing union dispatching and/or grouping dispatching on the real-time logistics orders in the real-time logistics order set by the target knight determined according to the idle transportation value and the actual transportation value.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the operation index value is smaller than the operation index threshold value, determining that the real-time logistics order is dispatched in a second dispatching mode;
and determining a target knight of the real-time logistics order assignment according to the recommended strategy data based on the second assignment mode.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
determining a sequential road value between the knight carrying the order dispatching task and the real-time logistics order according to the recommended strategy data based on the second order dispatching mode;
determining a trail rider with a trail value greater than or equal to a trail threshold value as a candidate rider;
when the number of candidate knights is larger than or equal to the total recommended number of knights threshold value in the recommendation strategy data, sorting the sequential road values in a descending order, and determining the candidate knights with the total recommended number of knights threshold value as the target knights from the candidate knights.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the number of the candidate knights is smaller than the total recommended knight number threshold value in the recommendation strategy data, acquiring the number of idle recommended single knights in the specified area;
when the difference between the total recommended rider number threshold and the number of candidate riders is greater than or equal to the number of idle recommended single riders, the target rider is determined from the idle recommended single riders.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the idle force value is smaller than the actual force value, acquiring the order attribute of the real-time logistics order;
performing order merging and dispatching on the real-time logistics orders according to the order dispatching path information of the order attributes, and dispatching the orders to target knights carrying orders which are the same as the real-time logistics order dispatching path information;
and if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
and detecting that unprocessed real-time logistics orders still exist after the order combining dispatching and/or the grouping dispatching, and executing a step of determining that the real-time logistics orders are dispatched in the second dispatching mode.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when detecting that the real-time logistics order is not read by the terminal where the target knight is located within the preset time, determining that the real-time logistics order is dispatched in a third dispatching mode; the third order sending mode is to send real-time logistics orders to terminals held by knight in a preset number in a target area.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located;
when the operation index value is larger than or equal to the operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode;
acquiring a real-time logistics order within a preset time length based on a first order mode to obtain a real-time logistics order set;
acquiring an idle transportation value and an actual transportation value required by a real-time logistics order set;
and performing union dispatching and/or grouping dispatching on the real-time logistics orders in the real-time logistics order set by the target knight determined according to the idle transportation value and the actual transportation value.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when the operation index value is smaller than the operation index threshold value, determining that the real-time logistics order is dispatched in a second dispatching mode;
and determining a target knight of the real-time logistics order assignment according to the recommended strategy data based on the second assignment mode.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining a sequential road value between the knight carrying the order dispatching task and the real-time logistics order according to the recommended strategy data based on the second order dispatching mode;
determining a trail rider with a trail value greater than or equal to a trail threshold value as a candidate rider;
when the number of candidate knights is larger than or equal to the total recommended number of knights threshold value in the recommendation strategy data, sorting the sequential road values in a descending order, and determining the candidate knights with the total recommended number of knights threshold value as the target knights from the candidate knights.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when the number of the candidate knights is smaller than the total recommended knight number threshold value in the recommendation strategy data, acquiring the number of idle recommended single knights in the specified area;
when the difference between the total recommended rider number threshold and the number of candidate riders is greater than or equal to the number of idle recommended single riders, the target rider is determined from the idle recommended single riders.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when the idle force value is smaller than the actual force value, acquiring the order attribute of the real-time logistics order;
performing order merging and dispatching on the real-time logistics orders according to the order dispatching path information of the order attributes, and dispatching the orders to target knights carrying orders which are the same as the real-time logistics order dispatching path information;
and if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders.
In one embodiment, the computer program when executed by the processor further performs the steps of:
and detecting that unprocessed real-time logistics orders still exist after the order combining dispatching and/or the grouping dispatching, and executing a step of determining that the real-time logistics orders are dispatched in the second dispatching mode.
In one embodiment, the computer program when executed by the processor further performs the steps of:
when detecting that the real-time logistics order is not read by the terminal where the target knight is located within the preset time, determining that the real-time logistics order is dispatched in a third dispatching mode; the third order sending mode is to send real-time logistics orders to terminals held by knight in a preset number in a target area.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A logistics order dispatching method, characterized in that the method comprises:
when the generation of a real-time logistics order is detected, acquiring an operation index value of a target area where a target merchant is located;
when the operation index value is larger than or equal to an operation index threshold value, determining that the real-time logistics order is dispatched in a first dispatching mode;
acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set;
acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set;
and performing order combining and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the idle transportation value and the actual transportation value.
2. The method of claim 1, further comprising:
when the operation index value is smaller than the operation index threshold value, determining that the real-time logistics order is dispatched in a second dispatching mode;
based on the second dispatch mode, determining a target rider for the real-time logistics order dispatch according to recommended strategy data.
3. The method of claim 2, wherein said determining a target rider for said real-time logistics order dispatch according to recommended strategy data based on said second dispatch mode comprises:
determining a sequential road value between a rider carrying a dispatching task and the real-time logistics order according to recommended strategy data based on the second dispatching mode;
determining a trail rider with the trail value greater than or equal to a trail threshold value as a candidate rider;
when the number of the candidate knights is larger than or equal to the total recommended number of knights threshold value in the recommendation strategy data, sorting the road degree values in an order from big to small, and determining the candidate knights with the total recommended number of knights threshold value from the candidate knights as target knights.
4. The method of claim 3, further comprising:
when the number of the candidate knights is smaller than the total recommended number of knights threshold in the recommendation strategy data, acquiring the number of recommended single idle knights in a specified area;
determining a target rider from the recommended list of idle riders when a difference between the total recommended rider number threshold and the number of candidate riders is greater than or equal to the number of recommended list of idle riders.
5. The method of claim 1, wherein the determining of the idle capacity value and the actual capacity value by the target knight for the collective real-time logistics orders and/or the grouped assignment of real-time logistics orders from the real-time logistics order sets comprises:
when the idle transportation value is smaller than the actual transportation value, acquiring order attributes of the real-time logistics order;
performing order-combining dispatching on the real-time logistics order according to the order dispatching path information of the order attributes, and dispatching the order to a target rider carrying an order with the same real-time logistics order dispatching path information;
and if the real-time logistics orders which are not listed exist, performing grouping assignment on the remaining real-time logistics orders.
6. The method of claim 5, further comprising:
and detecting that unprocessed real-time logistics orders still exist after the order combining dispatching and/or the grouping dispatching, and executing the step of determining that the real-time logistics orders are dispatched in a second dispatching mode.
7. The method of any one of claims 1 to 6, further comprising:
when the fact that the real-time logistics order is not read by the terminal where the target knight is located within the preset time is detected, determining that the real-time logistics order is dispatched in a third dispatching mode; the third order sending mode is to send the real-time logistics orders to terminals held by knight in a preset number in the target area.
8. A logistics order distribution apparatus, said apparatus comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring an operation index value of a target area where a target merchant is located when the generation of a real-time logistics order is detected;
the dispatching mode determining module is used for determining that the real-time logistics order is dispatched in a first dispatching mode when the operation index value is larger than or equal to an operation index threshold value;
the order pressing module is used for acquiring a real-time logistics order within a preset time length based on the first order sending mode to obtain a real-time logistics order set;
the second acquisition module is used for acquiring an idle transportation value and an actual transportation value required by the real-time logistics order set;
and the order assignment module is used for performing order combination assignment and/or grouping assignment on the real-time logistics orders in the real-time logistics order set according to the target knight determined by the idle transport force value and the actual transport force value.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the method of any of claims 1 to 7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011572906.2A CN112288340B (en) | 2020-12-28 | 2020-12-28 | Logistics order dispatching method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011572906.2A CN112288340B (en) | 2020-12-28 | 2020-12-28 | Logistics order dispatching method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112288340A true CN112288340A (en) | 2021-01-29 |
| CN112288340B CN112288340B (en) | 2021-03-19 |
Family
ID=74426436
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011572906.2A Active CN112288340B (en) | 2020-12-28 | 2020-12-28 | Logistics order dispatching method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112288340B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200118071A1 (en) * | 2018-10-13 | 2020-04-16 | Walmart Apollo, Llc | Delivery prediction generation system |
| CN113554386A (en) * | 2021-06-25 | 2021-10-26 | 杭州拼便宜网络科技有限公司 | Logistics distribution method, device, equipment and storage medium suitable for e-commerce orders |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108647895A (en) * | 2018-05-15 | 2018-10-12 | 北京顺丰同城科技有限公司 | A kind of worksheet processing method and device of Logistic Scheduling in shop |
| WO2019015450A1 (en) * | 2017-07-18 | 2019-01-24 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for determining an order accepting mode for a user |
| CN110555580A (en) * | 2018-06-04 | 2019-12-10 | 北京三快在线科技有限公司 | order processing method, device, storage medium and server |
| CN111178752A (en) * | 2019-12-27 | 2020-05-19 | 北京顺达同行科技有限公司 | Order form dispatching method and device, computer equipment and storage medium |
| CN111553501A (en) * | 2019-02-12 | 2020-08-18 | 北京嘀嘀无限科技发展有限公司 | Order allocation method and device |
| CN111815229A (en) * | 2020-06-12 | 2020-10-23 | 北京顺达同行科技有限公司 | Order information processing method and device, electronic equipment and storage medium |
-
2020
- 2020-12-28 CN CN202011572906.2A patent/CN112288340B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019015450A1 (en) * | 2017-07-18 | 2019-01-24 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for determining an order accepting mode for a user |
| CN108647895A (en) * | 2018-05-15 | 2018-10-12 | 北京顺丰同城科技有限公司 | A kind of worksheet processing method and device of Logistic Scheduling in shop |
| CN110555580A (en) * | 2018-06-04 | 2019-12-10 | 北京三快在线科技有限公司 | order processing method, device, storage medium and server |
| CN111553501A (en) * | 2019-02-12 | 2020-08-18 | 北京嘀嘀无限科技发展有限公司 | Order allocation method and device |
| CN111178752A (en) * | 2019-12-27 | 2020-05-19 | 北京顺达同行科技有限公司 | Order form dispatching method and device, computer equipment and storage medium |
| CN111815229A (en) * | 2020-06-12 | 2020-10-23 | 北京顺达同行科技有限公司 | Order information processing method and device, electronic equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200118071A1 (en) * | 2018-10-13 | 2020-04-16 | Walmart Apollo, Llc | Delivery prediction generation system |
| CN113554386A (en) * | 2021-06-25 | 2021-10-26 | 杭州拼便宜网络科技有限公司 | Logistics distribution method, device, equipment and storage medium suitable for e-commerce orders |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112288340B (en) | 2021-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP4087343A1 (en) | Information reporting method, apparatus and device, and storage medium | |
| CN104867065B (en) | Method and equipment for processing order | |
| CN112288340B (en) | Logistics order dispatching method and device, computer equipment and storage medium | |
| CN109600408B (en) | Resource sharing method and device, storage medium and computer equipment | |
| CN108256706B (en) | Task allocation method and device | |
| CN105592123B (en) | Storage management system, management device and method | |
| CN106294134A (en) | The collapse localization method of code and device | |
| CN108492005A (en) | Project data processing method, device, computer equipment and storage medium | |
| CN111178752A (en) | Order form dispatching method and device, computer equipment and storage medium | |
| CN110704177A (en) | Computing task processing method and device, computer equipment and storage medium | |
| US9244718B2 (en) | Virtual machine resource allocation based on connection time coverage exceeding a minimum threshold | |
| CN109492856B (en) | Service request processing method, device, computer equipment and storage medium | |
| CN112052374A (en) | Page display method and device, computer equipment and storage medium | |
| CN112347394A (en) | Method and device for acquiring webpage information, computer equipment and storage medium | |
| CN105653463B (en) | Storage management system, management device and method | |
| CN112433792A (en) | Interface loading method and device, computer equipment and storage medium | |
| CN110838041A (en) | Virtual resource activity processing method and device, computer equipment and storage medium | |
| CN110766430B (en) | Resource allocation method based on machine learning algorithm | |
| CN114418494A (en) | Order processing method, order processing device, electronic equipment, storage medium and program product | |
| CN111580883B (en) | Application program starting method, device, computer system and medium | |
| CN113254106A (en) | Task execution method and device based on Flink, computer equipment and storage medium | |
| CN117408794A (en) | Request processing method, device, equipment and storage medium thereof | |
| CN114070847A (en) | Current limiting method, device, equipment and storage medium of server | |
| CN105653529B (en) | Storage management system, management device and method | |
| CN110826889A (en) | Vehicle management method, device, computer equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |