CN110543994A - Information processing method and device, readable storage medium and electronic equipment - Google Patents
Information processing method and device, readable storage medium and electronic equipment Download PDFInfo
- Publication number
- CN110543994A CN110543994A CN201910860070.7A CN201910860070A CN110543994A CN 110543994 A CN110543994 A CN 110543994A CN 201910860070 A CN201910860070 A CN 201910860070A CN 110543994 A CN110543994 A CN 110543994A
- Authority
- CN
- China
- Prior art keywords
- area
- added
- unit
- quasi
- units
- 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
- 230000010365 information processing Effects 0.000 title claims abstract description 19
- 238000003672 processing method Methods 0.000 title claims abstract description 11
- 238000012216 screening Methods 0.000 claims abstract description 54
- 238000000034 method Methods 0.000 claims abstract description 43
- 230000001174 ascending effect Effects 0.000 claims description 33
- 230000004044 response Effects 0.000 claims description 32
- 238000012163 sequencing technique Methods 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 2
- 241001137251 Corvidae Species 0.000 description 1
- 240000007651 Rubus glaucus Species 0.000 description 1
- 235000011034 Rubus glaucus Nutrition 0.000 description 1
- 235000009122 Rubus idaeus Nutrition 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 235000015108 pies Nutrition 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/12—Hotels or restaurants
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
the embodiment of the invention discloses an information processing method, an information processing device, a readable storage medium and electronic equipment. The method comprises the steps of determining a plurality of to-be-added area units of a target object, and screening at least one quasi-to-be-added area unit from the plurality of to-be-added area units; and determining a target distribution range of the target object according to the at least one quasi-joining area unit and the initial distribution range, and performing task distribution according to the target distribution range. According to the method, the area units to be added are screened to screen the area units to be added, the expanded target distribution range is determined according to the area units to be added and the initial distribution range, and due to the fact that the target distribution range is expanded, the expanded area units are screened, the number of orders can be effectively increased, and the distribution resource utilization rate is effectively improved.
Description
Technical Field
the invention relates to the field of data processing, in particular to an information processing method, an information processing device, a readable storage medium and electronic equipment.
Background
with the development of internet technology, emerging takeaway industries are also continuously developed, and more convenience is brought to life. Because the delivery timeliness requirement of the take-out goods is high, the take-out platform or the take-out system can preset the initial delivery range of the merchant and set delivery resources for the merchant, the merchant can only receive orders of users in the initial delivery range, but in the off-peak period of the take-out service, the number of the orders is reduced, the delivery resources are left, and the utilization rate of the delivery resources is low.
In the prior art, the initial distribution range of a merchant is expanded during an off-peak period, and the expanded distribution range may cut some uncontrollable areas, for example, the uncontrollable areas may be rivers, non-traversable roads, etc., which not only affects the order number, but also responds to the distribution speed of the distribution resources, and reduces the utilization rate of the distribution resources.
disclosure of Invention
In view of this, embodiments of the present invention provide an information processing method, an information processing apparatus, a readable storage medium, and an electronic device, which can effectively increase the number of orders and effectively improve the utilization rate of distribution resources.
in a first aspect, an embodiment of the present invention provides an information processing method, where the method includes: receiving data from a program calling interface; analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object; acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data; the at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range; and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
Preferably, the feature data includes a distance between the area unit where the target object is located and the area unit to be added, and/or a historical task amount of each area unit to be added.
Preferably, the screening, based on the feature data, at least one quasi-joining area unit from the plurality of area units to be joined specifically includes: determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value; and performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
preferably, the screening, based on the feature data, at least one quasi-joining area unit from the plurality of area units to be joined specifically further includes: determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount; and performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
preferably, the screening, based on the feature data, at least one quasi-joining area unit from the plurality of area units to be joined specifically further includes: screening at least one candidate region unit from the plurality of region units to be added based on the distance; and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
preferably, the screening, based on the distance, at least one candidate region unit from the plurality of region units to be added specifically includes: determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit; the screening of at least one candidate region unit from the at least one region unit to be added based on the historical task amount specifically includes: and performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
Preferably, the at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range, and specifically includes: in response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range; and in response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
preferably, the method further comprises: in response to the sum of the areas being less than the set area threshold, the at least one processor continues to join the quasi joining zone unit into the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking.
preferably, the method further comprises: determining a non-increasable area unit in the area units to be added; and in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, the at least one processor determines the quasi-join area unit as the non-increasable quasi-join area unit.
Preferably, the set area takes a center point of an area unit where the target object is located as a center of a circle, and the set length is a radius or a radius of an circumscribed circle.
In a second aspect, an embodiment of the present invention provides an information processing apparatus, including: the receiving unit is used for receiving data from the program calling interface; the first determining unit is used for analyzing the data through at least one processor and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object; the screening unit is used for acquiring the characteristic data of the plurality of to-be-added area units through the at least one processor and screening at least one quasi-to-be-added area unit from the plurality of to-be-added area units on the basis of the characteristic data; a second determining unit, configured to determine, by the at least one processor, a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range; and the processing unit is used for responding to the condition that the distribution data meet the preset conditions and starting the target distribution range of the target object.
In a third aspect, an embodiment of the present invention provides a computer-readable storage medium on which computer program instructions are stored, which when executed by a processor implement the method according to the first aspect or any one of the possibilities of the first aspect.
In a fourth aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor, where the memory is used to store one or more computer program instructions, where the one or more computer program instructions are executed by the processor to implement the following steps: receiving data from a program calling interface; analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object; acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data; the at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range; and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
Preferably, the feature data includes a distance between the area unit where the target object is located and the area unit to be added, and/or a historical task amount of each area unit to be added.
preferably, the processor specifically executes the following steps: determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value; and performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
Preferably, the processor further performs the steps of: determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount; and performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
preferably, the processor specifically executes the following steps: screening at least one candidate region unit from the plurality of region units to be added based on the distance; and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
preferably, the processor specifically executes the following steps: determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit; and performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
preferably, the processor specifically executes the following steps: in response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range; in response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
Preferably, the processor further performs the steps of: in response to the sum of the areas being less than the set area threshold, the at least one processor continues to join the quasi joining zone unit into the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking.
Preferably, the processor further performs the steps of: determining a non-increasable area unit in the area units to be added; and in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, the at least one processor determines the quasi-join area unit as the non-increasable quasi-join area unit.
Preferably, the set area takes a center point of an area unit where the target object is located as a center of a circle, and the set length is a radius or a radius of an circumscribed circle.
the embodiment of the invention receives data from a program calling interface; analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object; acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data; the at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range; and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object. According to the method, the area units to be added are screened to screen the area units to be added, the expanded target distribution range is determined according to the area units to be added and the initial distribution range, and due to the fact that the target distribution range is expanded, the expanded area units are screened, the number of orders can be effectively increased, and the distribution resource utilization rate is effectively improved.
Drawings
The above and other objects, features and advantages of the present invention will become more apparent from the following description of the embodiments of the present invention with reference to the accompanying drawings, in which:
FIG. 1 is a schematic illustration of an initial delivery range in the prior art;
FIG. 2 is a schematic diagram of an expanded delivery range in the prior art;
FIG. 3 is a flow chart of a method of processing information according to a first embodiment of the present invention;
FIG. 4 is a schematic diagram of a target delivery range of the first embodiment of the present invention;
FIG. 5 is a schematic view of another target delivery range of the first embodiment of the present invention;
FIG. 6 is a schematic view of a target delivery range of the first embodiment of the present invention;
FIG. 7 is a diagram of an application scenario of the second embodiment of the present invention;
FIG. 8 is a diagram showing an information processing apparatus according to a third embodiment of the present invention;
Fig. 9 is a schematic view of an electronic apparatus according to a fourth embodiment of the present invention.
Detailed Description
The present disclosure is described below based on examples, but the present disclosure is not limited to only these examples. In the following detailed description of the present disclosure, certain specific details are set forth. It will be apparent to those skilled in the art that the present disclosure may be practiced without these specific details. Well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present disclosure.
further, those of ordinary skill in the art will appreciate that the drawings provided herein are for illustrative purposes and are not necessarily drawn to scale.
unless the context clearly requires otherwise, throughout the description, the words "comprise", "comprising", and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is, what is meant is "including, but not limited to".
In the description of the present disclosure, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In addition, in the description of the present disclosure, "a plurality" means two or more unless otherwise specified.
generally, in the prior art, a takeout platform or a takeout system sets a distribution range for a merchant in advance, for example, as shown in fig. 1, point a is a location of the merchant, an initial distribution range is a distribution range which is divided by the takeout platform for the merchant in advance, the merchant can only receive an order of a user within the initial distribution range, and some capacity resources are configured for the merchant in advance to distribute the order. In off-peak hours, the demand of the user is reduced, which results in the reduction of the number of orders received by the merchant, and the distribution resources distributed for the merchant are left, which results in the low utilization rate of the distribution resources. Therefore, in the off-peak period, the user needs to expand the initial distribution range of the merchant, as shown in fig. 2, a circle is drawn by taking a point a of the merchant as a center and setting a length R as a radius, then 8 points are selected from the circle, namely, a point B, a point C, a point D, a point E, a point F, a point G, a point H, and a point I, wherein an equant point or an unequally divided point can be selected when selecting a point on the circle, then a curve between the points is determined according to a riding path on the map, and a range enclosed by the curve is the expanded distribution range. The expanded distribution range determined by the method may cut some uncontrollable areas, for example, the uncontrollable areas may be rivers, non-traversable roads, etc., the uncontrollable areas do not have users, the distribution range is increased immediately, the order number is not increased, and the non-traversable roads may affect the distribution speed of the distribution resources, and reduce the utilization rate of the distribution resources. Therefore, how to enlarge the initial distribution range to effectively increase the order number and effectively improve the distribution resource utilization rate is a problem to be solved at present.
In the embodiment of the present invention, the merchant may also be referred to as a target object.
fig. 3 is a flowchart of an information processing method according to a first embodiment of the present invention. As shown in fig. 3, the method specifically includes the following steps:
and step S300, receiving data from the program calling interface.
Step S301, analyzing the data through at least one processor, and determining a plurality of to-be-added area units of the target object, where the to-be-added area units are area units within a set area of the target object and outside an initial distribution range of the target object.
specifically, map information in a set area is divided through grids, each grid represents one area unit, the initial distribution range is a set range on the map information, the set area takes a center point of the area unit where the target object is located as a circle center, and a set length is a radius or an circumscribed circle radius.
For example, as shown in fig. 4, a position of a target object is a, a center point Z of a grid where a is located is used as a center point, a length is set as a radius to determine an circumscribed circle, the set length is a maximum riding distance for distributing resources, a solid-line square frame is a set area, and all the area units except the initial distribution range in the set area are to-be-added area units of the target object, and it is assumed that, in actual application, an area on actual map information represented by each dotted-line area unit is an area of 130 meters multiplied by 130 meters.
step S302, obtaining the characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data.
the characteristic data includes a distance between the area unit where the target object is located and the area unit to be added, and/or a historical task amount of each area unit to be added, where the distance between the area unit where the target object is located and the area unit to be added may be a distance between a first central point of the area unit where the target object is located and a second central point of the area unit to be added.
in the embodiment of the present invention, when at least one quasi-join area unit is screened from the plurality of area units to be joined based on the feature data, the following three situations are specifically identified, respectively:
Determining a first region unit to be added, of the plurality of region units to be added, of which the distance is smaller than a first set threshold value, on the basis of the distance; and performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
Determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount; and performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
thirdly, screening at least one candidate region unit from the plurality of region units to be added based on the distance; and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
Specifically, based on the distances, determining a third to-be-added area unit of which the distance is smaller than a third set threshold value among the plurality of to-be-added area units, performing third sorting on the third to-be-added area unit according to an ascending order of the distances, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit; and performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
in the following, an example is given according to the third case, specifically, as shown in fig. 4, it is assumed that the center point of the area unit to be added is the second center point, and only 7 of the area units to be added are exemplarily numbered in fig. 4, so as to exemplify, where the area unit to be added 1, the area unit to be added 2, the area unit to be added 3, the area unit to be added 4, the area unit to be added 5, the area unit to be added 6, and the area unit to be added 7, where the second candidate center point of the area unit to be added 1 is M, the second candidate center point of the area unit to be added 2 is N, the second candidate center point of the area unit to be added 3 is X, the second candidate center point of the area unit to be added 4 is Y, the second candidate center point of the area unit to be added 5 is O, the second candidate center point of the area unit to be added 6 is P, and the second candidate center point of the to-be-added area unit 7 is Q, wherein the 7 to-be-added area units are sorted according to the distance between the second candidate center point and the first center point Z in ascending order of distance, as shown in table 1, in the embodiment of the present invention, when the 7 to-be-added area units are numbered, the sorting is performed according to distance, specifically as follows:
| Sorting | second candidate center point | Distance between two adjacent plates |
| 1 | M | 130 m |
| 2 | N | 182 m |
| 3 | X | 290 m |
| 4 | Y | 292 m |
| 5 | O | 422 m |
| 6 | P | 480 m |
| 7 | Q | 735 m |
the distance values in table 1 are only exemplary, and are determined according to actual conditions. When the area units to be added are determined, the radius of the circumscribed circle determined according to the maximum riding distance, therefore, all the area units to be added in the solid-line square frame in fig. 4 are within the maximum boundary line range, and assuming that the third set threshold is the maximum riding distance, the 7 meshes to be added can be called as third areas to be added, the 7 area units to be added are sorted, and the first 6 meshes are selected as the candidate area units.
In the embodiment of the present invention, after 6 candidate regions are determined, fourth sorting is performed according to the historical task amount in each candidate region unit, assuming that the historical task amount of the candidate region unit corresponding to the second candidate center point M is 202, the historical task amount of the candidate region unit corresponding to the second candidate center point N is 198, the historical task amount of the candidate region unit corresponding to the second candidate center point X is 0, the historical task amount of the candidate region unit corresponding to the second candidate center point Y is 167, the historical task amount of the candidate region unit corresponding to the second candidate center point Q is 132, the historical task amount of the candidate region unit corresponding to the second candidate center point P is 98, and the fourth sorting is shown in table 2:
| Fourth order | Third order | second candidate center point | historical task volume |
| 1 | 1 | M | 202 |
| 2 | 2 | N | 198 |
| 3 | 4 | Y | 167 |
| 4 | 5 | O | 132 |
| 5 | 6 | P | 98 |
| 6 | 3 | X | 0 |
The first 5 names in the fourth ranking are selected as quasi-join area units, the embodiment of the invention is only an exemplary description, and the specific historical task amount and the selected quasi-join area units are determined according to the actual situation, wherein the historical task amount of the 6 th name in the fourth ranking is 0, and the candidate area unit corresponding to the second candidate center point X can be regarded as the quasi-join area unit which cannot be increased.
step S303, the at least one processor determines a target distribution range of the target object according to the at least one quasi-joining area unit and the initial distribution range.
Specifically, in response to that the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaches a fifth set threshold, the at least one processor determines the sum of the area of the quasi-joining area units currently joining the initial distribution range and the area of the initial distribution range; taking the case three as an example, assuming that the fifth set threshold is 2, that is, after two quasi-joining region units are joined each time, the relationship between the sum of the areas of the quasi-joining region unit currently joined in the initial distribution range and the set area threshold is determined, and the method specifically includes two ways:
And in a first mode, in response to the fact that the sum of the areas is smaller than the set area threshold, continuing to join the quasi-joining area unit into the initial distribution range according to the sequence of the fourth set ranking.
specifically, two quasi-join area units are added each time, for example, the quasi-join area unit corresponding to the second candidate center point M and the quasi-join area unit corresponding to the second candidate center point N are added according to a fourth set order, the quasi-join area unit corresponding to the second candidate center point M and the sum of the area of the quasi-join area unit corresponding to the second candidate center point N and the initial distribution range are judged to be smaller than a set area threshold, and the quasi-join area units are continuously added into the initial distribution range according to the fourth set order, that is, the quasi-join area unit corresponding to the second candidate center point Y and the quasi-join area unit corresponding to the second candidate center point 0 are continuously added.
in a second mode, in response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range of the target object.
Specifically, two quasi join area units are continuously added, for example, the candidate area unit corresponding to the second candidate center point Y and the quasi join area unit corresponding to the second candidate center point O are added according to a fourth setting order, it is determined that the quasi join area unit corresponding to the second candidate center point Y and the sum of the area of the quasi join area unit corresponding to the second candidate center point O and the initial distribution range are greater than a set area threshold, the continuous addition is stopped, and the quasi join area unit corresponding to the second candidate center point M, the area of the quasi join area unit corresponding to the second candidate center point N, the area of the quasi join area unit corresponding to the second candidate center point Y and the area of the quasi join area unit corresponding to the second candidate center point O are determined as the target distribution range of the target object, as shown in fig. 5 specifically.
Optionally, the distribution area with the smaller area size of the interval between the increased candidate area unit and the initial distribution range may also be divided into the target distribution range.
In a specific embodiment of the present invention, a non-increasable area unit is determined in the area units to be added; and in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, determining the quasi-join area unit as the non-increasable quasi-join area unit by the at least one processor, wherein the center point of the quasi-join area unit is the third center point.
for example, when the sum of the areas determined by the second method is smaller than the set area threshold, the quasi join area unit corresponding to the second candidate center point P is continuously added, because the quasi join area unit corresponding to the second candidate center point X is a non-increasable quasi join area unit, a connection line between the center point P of the quasi join area unit and the first center point Z intersects with the non-increasable area unit, as shown in fig. 6 specifically.
step S304, in response to the delivery data meeting a preset condition, starting the target delivery range of the target object.
Specifically, the delivery data may be time or delivery pressure, and when it is determined that the delivery time is idle, the target delivery range of the target object is started; or, when the dispensing pressure is less than a set value, starting the target dispensing range of the target object.
In the embodiment of the invention, task allocation, task receiving or target merchant display can be performed in the target distribution range according to the configured distribution resources, or based on whether the user position is within the target distribution range.
Fig. 7 is an application scenario diagram of a second embodiment of the present invention, where a server of a take-out system or a take-out platform sets an initial distribution range for a merchant in advance, sends the set initial distribution range to a merchant terminal, and when the time is off-peak, the server expands the distribution range of the merchant, and sends the expanded target distribution range to the merchant terminal. In the embodiment of the invention, data from a program calling interface is received; analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object; acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data; the at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range; and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object. According to the method, the area units to be added are screened to screen the area units to be added, the expanded target distribution range is determined according to the area units to be added and the initial distribution range, and due to the fact that the target distribution range is expanded, the expanded area units are screened, the number of orders can be effectively increased, and the distribution resource utilization rate is effectively improved.
fig. 8 is a schematic diagram of an information processing apparatus according to a third embodiment of the present invention. As shown in fig. 8, the apparatus of the present embodiment includes a receiving unit 81, a first determining unit 82, a screening unit 83, a second determining unit 84, and a processing unit 85.
the receiving unit 81 is configured to receive data from a program call interface; a first determining unit 82, configured to analyze the data through at least one processor, and determine a plurality of to-be-added area units of a target object, where the to-be-added area units are area units within a set area of the target object and outside an initial distribution range of the target object; the screening unit 83 is configured to obtain, by the at least one processor, feature data of the plurality of to-be-added area units, and screen at least one quasi-addition area unit from the plurality of to-be-added area units based on the feature data; a second determining unit 84, configured to determine, by the at least one processor, a target delivery range of the target object according to the at least one joining-ready area unit and the initial delivery range; the processing unit 85 is configured to start the target delivery range of the target object in response to that the delivery data meets a preset condition.
Further, the feature data includes a distance between the area unit where the target object is located and the area unit to be added, and/or a historical task amount of each area unit to be added.
Further, the screening unit 83 is specifically configured to: determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value; and performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
Further, the screening unit 83 is specifically further configured to: determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount;
And performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
Further, the screening unit 83 is specifically further configured to: screening at least one candidate region unit from the plurality of region units to be added based on the distance; and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
further, the screening unit 83 is specifically further configured to: determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit; and performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
Further, the second determining unit 84 is specifically further configured to: in response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range; in response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
further, the second determining unit 84 is specifically further configured to: in response to the sum of the areas being less than the set area threshold, the at least one processor continues to join the quasi joining zone unit into the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking.
Further, the second determining unit 84 is specifically further configured to: determining a non-increasable area unit in the area units to be added; and in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, the at least one processor determines the quasi-join area unit as the non-increasable quasi-join area unit.
Furthermore, the set area takes the central point of the area unit where the target object is located as the center of a circle, and the set length is the radius or the radius of an external tangent circle.
Fig. 9 is a schematic view of an electronic apparatus according to a fourth embodiment of the present invention. In this embodiment, the electronic device is a server. It should be understood that other electronic devices, such as raspberry pies, are also possible. As shown in fig. 9, the electronic device: at least one processor 901; and, memory 902 communicatively connected to at least one processor 901; and a communication component 903 communicatively coupled to the scanning device, the communication component 903 receiving and transmitting data under the control of the processor 901; wherein the memory 902 stores instructions executable by the at least one processor 901, the instructions being executable by the at least one processor 901 to implement: receiving data from a program calling interface; analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object; acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data; the at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range; and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
Further, the feature data includes a distance between a first central point and a second central point, and a historical task amount of the user, where the first central point is a central point of an area unit where the target object is located, and the second central point is a central point of the area unit to be added.
further, the feature data includes a distance between the area unit where the target object is located and the area unit to be added, and/or a historical task amount of each area unit to be added.
Further, the processor specifically executes the following steps: determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value; and performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
Further, the processor executes the following steps: determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount; and performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
Further, the processor specifically executes the following steps: screening at least one candidate region unit from the plurality of region units to be added based on the distance; and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
Further, the processor specifically executes the following steps: determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit; and performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
further, the processor is specifically configured to perform the steps of: in response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range; in response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
Further, the processor executes the following steps: in response to the sum of the areas being less than the set area threshold, the at least one processor continues to join the quasi joining zone unit into the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking.
further, the processor executes the following steps: determining a non-increasable area unit in the area units to be added; and in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, the at least one processor determines the quasi-join area unit as the non-increasable quasi-join area unit.
furthermore, the set area takes the central point of the area unit where the target object is located as the center of a circle, and the set length is the radius or the radius of an external tangent circle.
specifically, the electronic device includes: one or more processors 901 and a memory 902, where one processor 901 is taken as an example in fig. 9. The processor 901 and the memory 902 may be connected by a bus or by other means, and fig. 9 illustrates the connection by the bus as an example. Memory 902, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The processor 901 executes various functional applications of the device and data processing by executing nonvolatile software programs, instructions, and modules stored in the memory 902, that is, implements the above-described information processing method.
The memory 902 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function; the storage data area may store a list of options, etc. Further, the memory 902 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, the memory 902 may optionally include memory located remotely from the processor 901, which may be connected to an external device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
One or more modules are stored in the memory 902, and when executed by the one or more processors 901, perform the information processing method in any of the above-described method embodiments.
The product can execute the method provided by the embodiment of the application, has corresponding functional modules and beneficial effects of the execution method, and can refer to the method provided by the embodiment of the application without detailed technical details in the embodiment.
A fifth embodiment of the invention is directed to a non-volatile storage medium storing a computer-readable program for causing a computer to perform some or all of the above-described method embodiments.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific embodiments for practicing the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.
The embodiment of the application discloses A1 and an information processing method, which comprises the following steps:
receiving data from a program calling interface;
analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object;
Acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data;
The at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range;
and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
A2, the method according to A1, wherein the characteristic data includes the distance between the area unit where the target object is located and the area unit to be added, and/or the historical task amount of each area unit to be added.
a3, the method as in A2, wherein the screening out at least one quasi joining area unit from the plurality of area units to be joined based on the characteristic data specifically comprises:
Determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value;
And performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
A4, the method of a2, the method further comprising: the screening of at least one area unit to be added from the plurality of area units to be added based on the characteristic data specifically further comprises:
Determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount;
And performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
A5, the method as in a2, wherein the screening at least one quasi joining area unit from the plurality of area units to be joined based on the characteristic data specifically further comprises:
Screening at least one candidate region unit from the plurality of region units to be added based on the distance;
and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
The method of a6, as described in a5, wherein the screening at least one candidate region unit from the plurality of region units to be added based on the distance specifically includes:
Determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit;
The screening of at least one candidate region unit from the at least one region unit to be added based on the historical task amount specifically includes:
and performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
A7, the method of any one of A3, a4, or a6, the at least one processor determining a target delivery range for the target object based on the at least one quasi-joining zone unit and the initial delivery range, comprising:
in response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range;
In response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
A8, the method of a7, the method further comprising:
in response to the sum of the areas being less than the set area threshold, the at least one processor continues to join the quasi joining zone unit into the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking.
A9, the method of A8, the method further comprising:
determining a non-increasable area unit in the area units to be added;
And in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, the at least one processor determines the quasi-join area unit as the non-increasable quasi-join area unit.
A10, the method according to a1, wherein the setting area has a length as a radius or a radius of an external circle with a center point of an area unit where the target object is located as a center.
The embodiment of the present application also discloses B1, an information processing apparatus, the apparatus comprising:
the receiving unit is used for receiving data from the program calling interface;
The first determining unit is used for analyzing the data through at least one processor and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object;
The screening unit is used for acquiring the characteristic data of the plurality of to-be-added area units through the at least one processor and screening at least one quasi-to-be-added area unit from the plurality of to-be-added area units on the basis of the characteristic data;
A second determining unit, configured to determine, by the at least one processor, a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range;
and the processing unit is used for responding to the condition that the distribution data meet the preset conditions and starting the target distribution range of the target object.
the embodiment of the application also discloses C1, a computer readable storage medium, on which computer program instructions are stored, the computer program instructions, when executed by a processor, implement the method according to any one of A1-A10.
The embodiment of the application also discloses a D1 electronic device, comprising a memory and a processor, wherein the memory is used for storing one or more computer program instructions, and the one or more computer program instructions are executed by the processor to realize the following steps:
Receiving data from a program calling interface;
Analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object;
Acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data;
The at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range;
And responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
D2, the electronic device according to D1, the feature data includes distances between the area units where the target objects are located and the area units to be joined, and/or historical task volumes of each area unit to be joined.
d3, the electronic device as claimed in D2, the processor specifically executes the steps of:
Determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value;
And performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
D4, the electronic device as recited in D2, the processor further executing the steps of:
determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount;
And performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
D5, the electronic device as claimed in D2, the processor specifically executes the steps of:
Screening at least one candidate region unit from the plurality of region units to be added based on the distance;
and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
D6, the electronic device as claimed in D5, the processor specifically executes the steps of:
Determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit;
And performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
D7, the electronic device of any one of D3, D4 or D6, the processor particularly performs the steps of:
In response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range;
In response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
D8, the electronic device as recited in D7, the processor further executing the steps of:
in response to the sum of the areas being less than the set area threshold, the at least one processor continues to join the quasi joining zone unit into the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking.
D9, the electronic device of claim D8, the processor further performing the steps of:
determining a non-increasable area unit in the area units to be added;
and in response to that a connecting line between the center point of the quasi-join area unit and the center point of the area unit where the target object is located intersects with the non-increasable area unit, the at least one processor determines the quasi-join area unit as the non-increasable quasi-join area unit.
D10, the electronic device as in D1, wherein the set area has a radius or a radius of a circumscribed circle with a center point of the area unit where the target object is located as a center.
Claims (10)
1. an information processing method, characterized in that the method comprises:
receiving data from a program calling interface;
Analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object;
acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data;
The at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range;
and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
2. The method according to claim 1, wherein the feature data comprises the distance between the area unit where the target object is located and the area unit to be joined, and/or the historical task amount of each area unit to be joined.
3. The method according to claim 2, wherein the screening out at least one quasi joining area unit among the plurality of to-be-joined area units based on the feature data specifically comprises:
Determining a first region unit to be added of the plurality of region units to be added, wherein the distance is smaller than a first set threshold value;
and performing first sorting on the first to-be-added area units according to the ascending order of the distance, and determining the first to-be-added area units before the first set ranking in the first sorting as the quasi-to-be-added area units.
4. The method of claim 2, further comprising: the screening of at least one area unit to be added from the plurality of area units to be added based on the characteristic data specifically further comprises:
Determining a second to-be-added area unit of which the historical task amount is smaller than a second set threshold value in the plurality of to-be-added area units based on the historical task amount;
and performing second sequencing on the second to-be-added area units according to the ascending order of the historical task amount, and determining the second to-be-added area units before a second set ranking in the second sequencing as the quasi-addition area units.
5. The method according to claim 2, wherein the screening out at least one quasi joining area unit from the plurality of to-be-joined area units based on the feature data further comprises:
Screening at least one candidate region unit from the plurality of region units to be added based on the distance;
and screening out at least one quasi-joining region unit from the at least one candidate region unit based on the historical task amount.
6. The method according to claim 5, wherein the screening out at least one candidate region unit from the plurality of region units to be added based on the distance comprises:
Determining a third to-be-added area unit of the plurality of to-be-added area units, wherein the distance is smaller than a third set threshold value, based on the distance, performing third sorting on the third to-be-added area unit according to the ascending order of the distance, and determining the third to-be-added area unit before a third set ranking in the third sorting as the candidate area unit;
the screening of at least one candidate region unit from the at least one region unit to be added based on the historical task amount specifically includes:
And performing fourth sorting on the at least one candidate region unit according to the historical task amount in an ascending order, and determining the candidate region unit before the fourth set ranking in the fourth sorting as the quasi-join region unit.
7. The method according to any one of claims 3, 4 or 6, wherein the determining, by the at least one processor, the target delivery range of the target object based on the at least one quasi-joining area unit and the initial delivery range comprises:
in response to the number of quasi-joining area units joining the initial distribution range in the order of the first set ranking, the order of the second set ranking, or the order of the fourth set ranking reaching a fifth set threshold, the at least one processor determining a sum of areas of the quasi-joining area units currently joining the initial distribution range and the initial distribution range;
In response to the sum of the areas being greater than a set area threshold for the first time, the at least one processor determines the current sum of the areas as a target delivery range for the target object.
8. an information processing apparatus characterized by comprising:
the receiving unit is used for receiving data from the program calling interface;
The first determining unit is used for analyzing the data through at least one processor and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object;
The screening unit is used for acquiring the characteristic data of the plurality of to-be-added area units through the at least one processor and screening at least one quasi-to-be-added area unit from the plurality of to-be-added area units on the basis of the characteristic data;
A second determining unit, configured to determine, by the at least one processor, a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range;
And the processing unit is used for responding to the condition that the distribution data meet the preset conditions and starting the target distribution range of the target object.
9. A computer-readable storage medium on which computer program instructions are stored, which, when executed by a processor, implement the method of any one of claims 1-7.
10. An electronic device comprising a memory and a processor, wherein the memory is configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to perform the steps of:
Receiving data from a program calling interface;
Analyzing the data through at least one processor, and determining a plurality of to-be-added area units of a target object, wherein the to-be-added area units are area units which are within a set area of the target object and outside an initial distribution range of the target object;
acquiring characteristic data of the plurality of to-be-added area units through the at least one processor, and screening out at least one quasi-to-be-added area unit from the plurality of to-be-added area units based on the characteristic data;
The at least one processor determines a target delivery range of the target object according to the at least one quasi-joining area unit and the initial delivery range;
and responding to the fact that the delivery data meet preset conditions, and starting the target delivery range of the target object.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910860070.7A CN110543994A (en) | 2019-09-11 | 2019-09-11 | Information processing method and device, readable storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910860070.7A CN110543994A (en) | 2019-09-11 | 2019-09-11 | Information processing method and device, readable storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110543994A true CN110543994A (en) | 2019-12-06 |
Family
ID=68713336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910860070.7A Pending CN110543994A (en) | 2019-09-11 | 2019-09-11 | Information processing method and device, readable storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110543994A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111461779A (en) * | 2020-03-31 | 2020-07-28 | 拉扎斯网络科技（上海）有限公司 | Map information processing method and device, readable storage medium and electronic equipment |
| CN111626554A (en) * | 2020-04-17 | 2020-09-04 | 拉扎斯网络科技（上海）有限公司 | Order assignment method and device, computer equipment and computer readable storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130006816A1 (en) * | 2011-06-30 | 2013-01-03 | Ebay Inc. | Leveraging a social network to search for local inventory |
| CN107194630A (en) * | 2017-03-31 | 2017-09-22 | 无锡漫途科技有限公司 | With city Logistic Scheduling method, apparatus and system |
| CN109598430A (en) * | 2018-11-28 | 2019-04-09 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution range generation device, electronic equipment and storage medium |
| CN109615122A (en) * | 2018-11-27 | 2019-04-12 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method and device, electronic equipment and storage medium |
| CN109636121A (en) * | 2018-11-16 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Distribution transport capacity scheduling method, order distribution method and device and electronic equipment |
| CN109658034A (en) * | 2018-12-28 | 2019-04-19 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution pressure adjustment method, distribution range generation device, distribution pressure adjustment device and server |
| CN109711783A (en) * | 2018-12-28 | 2019-05-03 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution range generation device, server and storage medium |
-
2019
- 2019-09-11 CN CN201910860070.7A patent/CN110543994A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130006816A1 (en) * | 2011-06-30 | 2013-01-03 | Ebay Inc. | Leveraging a social network to search for local inventory |
| CN107194630A (en) * | 2017-03-31 | 2017-09-22 | 无锡漫途科技有限公司 | With city Logistic Scheduling method, apparatus and system |
| CN109636121A (en) * | 2018-11-16 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Distribution transport capacity scheduling method, order distribution method and device and electronic equipment |
| CN109615122A (en) * | 2018-11-27 | 2019-04-12 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method and device, electronic equipment and storage medium |
| CN109598430A (en) * | 2018-11-28 | 2019-04-09 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution range generation device, electronic equipment and storage medium |
| CN109658034A (en) * | 2018-12-28 | 2019-04-19 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution pressure adjustment method, distribution range generation device, distribution pressure adjustment device and server |
| CN109711783A (en) * | 2018-12-28 | 2019-05-03 | 拉扎斯网络科技（上海）有限公司 | Distribution range generation method, distribution range generation device, server and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111461779A (en) * | 2020-03-31 | 2020-07-28 | 拉扎斯网络科技（上海）有限公司 | Map information processing method and device, readable storage medium and electronic equipment |
| CN111461779B (en) * | 2020-03-31 | 2023-10-24 | 拉扎斯网络科技（上海）有限公司 | Map information processing method and device, readable storage medium and electronic equipment |
| CN111626554A (en) * | 2020-04-17 | 2020-09-04 | 拉扎斯网络科技（上海）有限公司 | Order assignment method and device, computer equipment and computer readable storage medium |
| CN111626554B (en) * | 2020-04-17 | 2023-09-19 | 拉扎斯网络科技（上海）有限公司 | Order assignment method, order assignment device, computer equipment and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105138371B (en) | Method for upgrading software and device | |
| CN110351375B (en) | Data processing method and device, computer device and readable storage medium | |
| CN108540568B (en) | Computing capacity sharing method and intelligent equipment | |
| CN111309440B (en) | Method and equipment for managing and scheduling multiple types of GPUs | |
| CN110543994A (en) | Information processing method and device, readable storage medium and electronic equipment | |
| CN110389822A (en) | The node scheduling method, apparatus and server of execution task | |
| CN115756812A (en) | Resource adjusting method and device and storage medium | |
| CN110544159B (en) | Map information processing method and device, readable storage medium and electronic equipment | |
| CN110826782B (en) | Data processing method and device, readable storage medium and electronic equipment | |
| CN112363834A (en) | Task processing method, device, terminal and storage medium | |
| CN104331330A (en) | Resource pool generation method and device | |
| CN104468764A (en) | Method, device and system for strategy scheduling | |
| CN110442455A (en) | A kind of data processing method and device | |
| CN109697117B (en) | Terminal control method, terminal control device and computer-readable storage medium | |
| CN111176985B (en) | Software interface performance testing method and device, computer equipment and storage medium | |
| CN107464571B (en) | Data quality assessment method, equipment and system | |
| CN110795251A (en) | Method and equipment for determining terminal operation parameters | |
| CN104243587A (en) | Load balancing method and system for message servers | |
| CN112188499B (en) | Network self-adaptive configuration method, device, server and computer storage medium | |
| CN110825528B (en) | Resource management method, device and equipment | |
| CN108173689B (en) | Output system of load balancing data | |
| CN111489194B (en) | Map information processing method, apparatus, readable storage medium and electronic device | |
| CN111539592B (en) | Task allocation method and device, readable storage medium and electronic equipment | |
| CN114500553B (en) | Processing method, system, electronic equipment and storage medium of blockchain network | |
| CN110544064A (en) | data processing method and device, readable storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191206 |
|
| RJ01 | Rejection of invention patent application after publication |