CN114077979B - Method and device for determining distribution service range - Google Patents

Method and device for determining distribution service range Download PDF

Info

Publication number
CN114077979B
CN114077979B CN202010830185.4A CN202010830185A CN114077979B CN 114077979 B CN114077979 B CN 114077979B CN 202010830185 A CN202010830185 A CN 202010830185A CN 114077979 B CN114077979 B CN 114077979B
Authority
CN
China
Prior art keywords
aoi
merchant
candidate
target merchant
target
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.)
Active
Application number
CN202010830185.4A
Other languages
Chinese (zh)
Other versions
CN114077979A (en
Inventor
毛禛
张润丰
丁雪涛
杜方潇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Sankuai Online Technology Co Ltd
Original Assignee
Beijing Sankuai Online Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Sankuai Online Technology Co Ltd filed Critical Beijing Sankuai Online Technology Co Ltd
Priority to CN202010830185.4A priority Critical patent/CN114077979B/en
Publication of CN114077979A publication Critical patent/CN114077979A/en
Application granted granted Critical
Publication of CN114077979B publication Critical patent/CN114077979B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201Market modelling; Market analysis; Collecting market data
    • G06Q30/0204Market segmentation
    • G06Q30/0205Location or geographical consideration
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0621Item configuration or customization
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0639Item locations

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Data Mining & Analysis (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The specification discloses a method and a device for determining a distribution service range, wherein a merchant with the distribution service range to be determined is determined as a target merchant, a basic service range corresponding to the target merchant is determined according to a geographic position corresponding to the target merchant, and candidate AOI matched with the basic service range are determined. And for each candidate AOI, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI characteristics corresponding to the candidate AOI, the merchant characteristics corresponding to the target merchant and the association characteristics between the candidate AOI and the target merchant. According to the association degree between each candidate AOI and the target merchant, at least one candidate AOI forming the distribution service range corresponding to the target merchant is selected to serve as the target AOI, and the distribution service range corresponding to the target merchant is determined according to the geographic range covered by the at least one target AOI, so that the rationality of the determined distribution service range is ensured.

Description

Method and device for determining distribution service range
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a method and apparatus for determining a distribution service range.
Background
Currently, the business of ordering goods online is widely favored by people, and the living of people is facilitated.
In practice, a plurality of merchants reside in the service platform, and each merchant corresponds to the distribution service range of the merchant. When a user purchases goods through the service platform, the service platform can determine a merchant with a distribution service range covering the goods receiving address based on the goods receiving address selected by the user and display the merchant to the user, and the user can select a proper merchant to purchase the goods. For each merchant, the distribution service scope of the merchant determines the scope of users that the merchant can serve, and thus it is particularly important to determine the distribution service scope of the merchant.
In the prior art, if a distribution service range of a merchant needs to be determined, the service platform may divide a geographical range centered on the merchant by setting a radius, and further compress the geographical range to obtain the distribution service range of the merchant, as shown in fig. 1A to 1C.
Fig. 1A-1C are schematic illustrations of one prior art manner of determining the range of merchant distribution services provided herein.
The service platform may first determine a geographic range with a radius of 5km as shown in fig. 1A, and take a number of points on the boundary of the geographic range, where the point on the boundary of the geographic range may be used as the first boundary point. And then, for each first boundary point, determining a point with a conveying distance of 5km from the geographic position of the merchant on the connection line of the first boundary point and the geographic position of the merchant as a boundary point of the distribution service range of the merchant, which is called a second boundary point. That is, a point with a distribution distance of 5km obtained by path planning starting from the geographic position of the merchant is found out in the connection line between the geographic position of the merchant and the first boundary point, namely the second boundary point. Taking point a as an example, the service platform determines, between point a (i.e., a first boundary point) and the geographic location of the merchant, a point B (i.e., a second boundary point) that is 5km away from the geographic location of the merchant, as shown in fig. 1B. After determining each second boundary point, the service platform can connect each second boundary point sequentially according to the passable path to obtain the distribution service range in the graph, as shown in fig. 1C.
However, in the prior art, if the distribution service range of the same merchant is determined according to the same set radius, the difference between the distribution service ranges determined each time may be large, so if the distribution service range of the merchant needs to be updated according to the original radius due to actual requirements, the distribution service range of the merchant may be changed greatly, so that under the condition that the receiving address of the user is unchanged, the user who originally frequently purchases the commodity of the merchant may not purchase the commodity of the merchant any more because the user is no longer located in the distribution service range of the merchant, and further, certain loss is brought to the merchant while inconvenience is brought to the user.
Therefore, how to reasonably determine the distribution service range of the merchant is a problem to be solved.
Disclosure of Invention
The present disclosure provides a method and apparatus for determining a distribution service range, so as to partially solve the above-mentioned problems in the prior art.
The technical scheme adopted in the specification is as follows:
the present specification provides a method of determining a distribution service range, comprising:
determining a merchant with a distribution service range to be determined as a target merchant;
according to the geographic position corresponding to the target merchant, determining a basic service range corresponding to the target merchant, and determining each interest area AOI matched with the basic service range as each candidate AOI;
for each candidate AOI, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI characteristics corresponding to the candidate AOI, the merchant characteristics corresponding to the target merchant and the association characteristics between the candidate AOI and the target merchant;
Selecting at least one candidate AOI forming a distribution service range corresponding to the target merchant as a target AOI according to the association degree between each candidate AOI and the target merchant;
And determining a distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommending the service provided by the target merchant to a user according to the determined distribution service range corresponding to the target merchant.
Optionally, determining the regions of interest AOI matching the basic service scope includes:
for each AOI, determining a region in the AOI, which is positioned in the basic service range, as an intersection region;
and if the area ratio of the intersection area in the AOI exceeds the set ratio, determining that the AOI is matched with the basic service range.
Optionally, the AOI features corresponding to the candidate AOI include: at least one of an AOI area corresponding to the candidate AOI, an AOI passing state corresponding to the candidate AOI and the number of orders corresponding to the candidate AOI within a set time;
The merchant characteristics corresponding to the target merchant include: the merchant type corresponding to the target merchant;
The association features between the candidate AOI and the target merchant include: at least one of a shipping distance between the target merchant and the candidate AOI, a number of orders for the order of the target merchant generated within the candidate AOI during the set time.
Optionally, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI feature corresponding to the candidate AOI, the merchant feature corresponding to the target merchant, and the association feature between the candidate AOI and the target merchant includes:
determining other merchants that match the candidate AOI;
Determining the merchant quantity of merchants belonging to the merchant type from other merchants matched with the candidate AOI according to the merchant type corresponding to the target merchant;
And determining the association degree between the candidate AOI and the target merchant according to the merchant quantity, wherein the association degree between the candidate AOI and the target merchant is higher as the merchant quantity is smaller.
Optionally, determining other merchants that match the candidate AOI includes:
for each other merchant, determining whether the candidate AOI matches a distribution service range corresponding to the other merchant;
And if the candidate AOI is matched with the distribution service range corresponding to the other merchant, determining that the other merchant is matched with the candidate AOI.
Optionally, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI feature corresponding to the candidate AOI, the merchant feature corresponding to the target merchant, and the association feature between the candidate AOI and the target merchant includes:
Predicting the delivery duration from the target merchant to the candidate AOI according to the AOI passing state corresponding to the candidate AOI and the delivery distance between the candidate AOI and the target merchant;
And determining the association degree between the candidate AOI and the target merchant according to the distribution time length, wherein the association degree between the candidate AOI and the target merchant is higher as the distribution time length is shorter.
Optionally, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI feature corresponding to the candidate AOI, the merchant feature corresponding to the target merchant, and the association feature between the candidate AOI and the target merchant includes:
Determining the association degree between the candidate AOI and the target merchant according to at least one of the conveying distance between the target merchant and the candidate AOI, the AOI area corresponding to the candidate AOI, the number of orders corresponding to the candidate AOI in the set time and the number of orders for the target merchant generated in the candidate AOI in the set time, wherein the shorter the conveying distance is, the higher the association degree between the candidate AOI and the target merchant is, the higher the number of orders corresponding to the candidate AOI in the set time is, the higher the association degree between the candidate AOI and the target merchant is, the smaller the AOI area corresponding to the candidate AOI is, the higher the association degree between the candidate AOI and the target merchant is, and the higher the number of orders for the target merchant generated in the candidate AOI in the set time is.
Optionally, selecting at least one candidate AOI forming the corresponding distribution service range of the target merchant as the target AOI according to the association degree between each candidate AOI and the target merchant, including:
Sequencing the candidate AOIs according to the sequence from the high degree of relevance to the low degree of relevance to obtain a sequencing result;
judging whether the N candidate AOI in the sequencing result meets a preset condition or not, wherein N is an integer not less than 1;
if the Nth candidate AOI meets the preset condition, selecting the Nth candidate AOI, and judging whether the (n+1) th candidate AOI in the sequencing result meets the preset condition or not until the area of the geographic range covered by each selected candidate AOI is within a set area range;
And taking each selected candidate AOI as a target AOI.
Optionally, determining that the candidate AOI meets the preset condition includes:
And if determining that the order completion rate corresponding to the order generated in the candidate AOI within the set time is not less than the set completion rate and/or the order distribution duration corresponding to the order generated in the candidate AOI within the set time is not less than the set distribution duration, determining that the candidate AOI meets the preset condition.
Optionally, determining the distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI includes:
Determining a plurality of boundary points positioned on an AOI boundary of the at least one target AOI, and numbering the boundary points according to the sequence of sequential connection to obtain the serial numbers of the boundary points;
For each boundary point, determining a plurality of boundary points adjacent to the boundary point as adjacent boundary points corresponding to the boundary point;
Determining the maximum value and the minimum value of serial numbers in each adjacent boundary point corresponding to the boundary point;
If the difference value between the maximum value and the minimum value is not smaller than the set value, screening out the boundary points of the serial numbers between the maximum value and the minimum value except the boundary points;
And determining the distribution service range corresponding to the target merchant according to the remaining boundary points.
The present specification provides an apparatus for determining a distribution service range, comprising:
a merchant determination module configured to determine a merchant for which a distribution service range is to be determined as a target merchant;
The range determining module is configured to determine a basic service range corresponding to the target merchant according to the geographic position corresponding to the target merchant, and determine each region of interest AOI matched with the basic service range as each candidate AOI;
A relevance determining module configured to determine, for each candidate AOI, a relevance between the candidate AOI and the target merchant according to at least one of an AOI feature corresponding to the candidate AOI, a merchant feature corresponding to the target merchant, and a relevance feature between the candidate AOI and the target merchant;
The selecting module is configured to select at least one candidate AOI forming a corresponding distribution service range of the target merchant as a target AOI according to the association degree between each candidate AOI and the target merchant;
And the service module is configured to determine a distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommend the service provided by the target merchant to a user according to the determined distribution service range corresponding to the target merchant.
The present specification provides a computer readable storage medium storing a computer program which when executed by a processor implements the above method of determining a distribution service range.
The present specification provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the above method of determining a distribution service range when executing the program.
The above-mentioned at least one technical scheme that this specification adopted can reach following beneficial effect:
In the method for determining the distribution service range provided in the present specification, a merchant Of which the distribution service range is to be determined is determined as a target merchant, then, according to a geographic location corresponding to the target merchant, a basic service range corresponding to the target merchant is determined, and each Area Of Interest (AOI) matched with the basic service range is determined as each candidate AOI. And for each candidate AOI, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI characteristics corresponding to the candidate AOI, the merchant characteristics corresponding to the target merchant and the association characteristics between the candidate AOI and the target merchant. And selecting at least one candidate AOI forming a distribution service range corresponding to the target merchant as a target AOI according to the association degree between each candidate AOI and the target merchant, determining the distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommending the service provided by the target merchant to the user according to the determined distribution service range corresponding to the target merchant.
According to the method, after the service platform determines the target merchant needing to determine the distribution service range, the service platform can determine the AOI of each interest area in a certain range around the target merchant, and determine the AOI suitable for forming the distribution service range of the target merchant according to the association degree between each AOI and the target merchant, so as to determine the distribution service range corresponding to the target merchant. Therefore, the distribution service range is determined by combining the AOIs around the target merchant, and the distribution service range of the merchant is not changed greatly even if the distribution service range of the merchant is redetermined because the area covered by the AOIs on the electronic map is relatively fixed, so that the rationality of the determined distribution service range is ensured.
Drawings
The accompanying drawings, which are included to provide a further understanding of the specification, illustrate and explain the exemplary embodiments of the present specification and their description, are not intended to limit the specification unduly. In the drawings:
FIGS. 1A-1C are schematic illustrations of one prior art manner of determining merchant distribution service coverage provided herein;
FIG. 2 is a flow chart of a method for determining a distribution service range according to the present disclosure;
FIG. 3 is a schematic illustration of a basic service scope provided in the present specification;
FIG. 4 is a schematic diagram of a distribution service range corresponding to a target merchant provided in the present specification;
FIG. 5 is a schematic diagram of a manner of screening boundary points provided in the present specification;
FIG. 6 is a schematic diagram of an apparatus for determining a distribution service range provided herein;
fig. 7 is a schematic view of the electronic device corresponding to fig. 2 provided in the present specification.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the present specification more apparent, the technical solutions of the present specification will be clearly and completely described below with reference to specific embodiments of the present specification and corresponding drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present specification. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.
The following describes in detail the technical solutions provided by the embodiments of the present specification with reference to the accompanying drawings.
Fig. 2 is a flow chart of a method for determining a distribution service range in the present specification, specifically including the following steps:
S201: and determining the merchant with the distribution service range to be determined as a target merchant.
In practical application, a merchant can sell goods to a user through a service platform, and the service platform can determine the distribution service range of the goods sold by the merchant for the merchant. If the service platform determines that the receiving address selected by the user is located in the distribution service range of the merchant, the merchant can be displayed to the user, and correspondingly, the user can purchase the goods sold by the merchant.
Currently, when a merchant enters a service platform, a request for applying the corresponding distribution service range of the merchant can be sent to the service platform, and after the service platform receives the request for applying the distribution service range of the merchant, the merchant can be determined to be the merchant needing to determine the distribution service range, namely, the merchant is taken as a target merchant. Of course, for the merchant who has already entered the service platform, the merchant can also apply for adjusting the distribution service range to the service platform according to the actual demand of the merchant. Specifically, if the merchant needs to adjust the distribution service range, a request for adjusting the distribution service range may also be sent to the service platform, and correspondingly, the service platform may use the merchant needing to adjust the distribution service range as the target merchant.
In the present specification, the method for determining the distribution service range provided in the present specification may be specifically executed by a server or a terminal device such as a computer in a service platform, and for convenience of description, the method for determining the distribution service range provided in the present specification will be described below with only the service platform as an execution body.
S202: and determining a basic service range corresponding to the target merchant according to the geographic position corresponding to the target merchant, and determining each region of interest AOI matched with the basic service range as each candidate AOI.
After the service platform determines the target merchant, a basic service range corresponding to the target merchant can be determined according to the geographic position corresponding to the target merchant, wherein the basic service range is determined by taking the geographic position of the target merchant as the center, and the service platform can further determine a distribution service range corresponding to the merchant by utilizing the basic service range, as shown in fig. 3.
Fig. 3 is a schematic diagram of a basic service scope provided in the present specification.
Assuming that the service platform receives a request of a merchant for hosting the service platform, taking the merchant as a target merchant, and determining that the geographic position of the target merchant is point A in the graph. The service platform may divide the basic service range corresponding to the target merchant with a radius of 5 km with the point a as the center, that is, the circular area shown in the figure is the basic service range.
For a merchant who already resides in the service platform, if the merchant needs to adjust the distribution service range according to the actual requirement of the merchant, a request for adjusting the distribution service range can be sent to the service platform. Assuming that the service platform determines, according to the request, that the merchant needs to expand the radius of the distribution service range to 10 km based on the distribution service range divided by taking 5 km as the radius, the service platform can divide a circular area with the radius of 10 km by taking the geographic position of the merchant as the center. The circular area is the distribution service range of the merchant, which is re-divided by the service platform according to the requirements of the merchant.
It should be noted that, in addition to the above-mentioned basic service scope in a circular form, the service platform may also divide the basic service scope into a plurality of forms. For example, the service platform may also determine a square area with a side length of 10 km with the target merchant as the center, as the basic service range. Other forms of basic service scope are not described in one-to-one relation herein.
After the service platform determines the basic service range corresponding to the target merchant, each AOI matched with the basic service range can be determined and used as each candidate AOI. Here, the region of interest AOI mentioned here is a planar region in an electronic map, such as a school, a residential district, a business district, or the like. Each AOI that matches the basic service scope may refer to an AOI that has a majority of its area within the basic service scope. Each candidate AOI referred to herein is used to determine an AOI that ultimately constitutes a distribution service range to which the target merchant corresponds.
Specifically, for each AOI, the service platform may determine an area in the AOI within the basic service range as an intersection area, and determine that the AOI is matched with the basic service range if an area ratio of the intersection area in the AOI exceeds a set ratio. The setting duty ratio mentioned here may be set according to actual demands.
Also taking fig. 3 as an example, the service platform determines a basic service range centered on a, and it can be seen from fig. 3 that there are areas where 6 AOIs from a to f meet the basic service range. Wherein all 4 AOIs from a to d are within the basic service scope, AOI: e 80% of area in this basic service area, AOI: f is only 40% of the area in this basic service range. If the set duty ratio is 70%, the 5 AOIs from a to e meet the set duty ratio, and the service platform can take the 5 AOIs as candidate AOIs for the AOIs matched with the basic service scope. Correspondingly, AOI: f intersection area with the basic service area at the AOI: area ratio in f is less than 70%, AOI: f does not belong to the candidate AOI.
S203: and for each candidate AOI, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI characteristics corresponding to the candidate AOI, the merchant characteristics corresponding to the target merchant and the association characteristics between the candidate AOI and the target merchant.
After determining each candidate AOI, the service platform can determine, for each candidate AOI, a degree of association between the candidate AOI and the target merchant according to at least one of an AOI feature corresponding to the candidate AOI, a merchant feature corresponding to the target merchant, and an association feature between the candidate AOI and the target merchant. The higher the association between the candidate AOI and the target merchant, the more likely the candidate AOI is selected as the AOI that constitutes the target merchant distribution service range.
The AOI feature corresponding to the candidate AOI may be used to represent characteristics of the candidate AOI, such as an AOI area of the candidate AOI, an AOI traffic state of the candidate AOI, and the number of orders corresponding to the candidate AOI within a set time. The AOI traffic status referred to herein is used to indicate whether the candidate AOI allows entry of delivery capacity. The setting time can be set according to actual requirements.
Accordingly, the merchant characteristics corresponding to the target merchant may represent characteristics of the target merchant, such as the type of merchant corresponding to the target merchant. The correlation characteristics between the candidate AOI and the target merchant represent characteristics exhibited by the candidate AOI in the presence of a correlation with the target merchant, such as the shipping distance between the target merchant and the candidate AOI, and the number of orders generated within the candidate AOI for the target merchant over a set time period. Wherein, the delivery distance refers to the delivery distance from the target merchant to the candidate AOI, which is determined by the service platform through path planning, instead of the straight line distance from the target merchant to the candidate AOI.
There are many ways in which the business platform can determine the shipping distance. For example, the business platform may determine a shipping distance from the target merchant to the center of the candidate AOI as the shipping distance from the target merchant to the candidate AOI; for another example, the service platform may determine the shipping distances from the target merchant to the plurality of boundary points of the candidate AOI, respectively, and then determine an average of the shipping distances as the final determined shipping distance from the target merchant to the candidate AOI. Other ways are not exemplified here.
The degree of association between the candidate AOI and the target merchant mentioned above may be determined by any of the features described above (i.e., AOI features, merchant features, and associated features), or by any combination of the features described above.
If the association is determined by the merchant type corresponding to the target merchant, the service platform may determine other merchants matching the candidate AOI, and determine the number of merchants belonging to the merchant type from the other merchants matching the candidate AOI according to the merchant type corresponding to the target merchant. Further, a degree of association between the candidate AOI and the target merchant is determined based on the merchant quantity. Other merchants that match the candidate AOI as referred to herein are other merchants that assign a range of service that matches the candidate AOI, and users located within the candidate AOI may purchase goods from other merchants that match the candidate AOI.
If the number of the determined other merchants belonging to the merchant type is smaller, the user in or near the candidate AOI can select the merchant of the merchant type to be smaller, so that the candidate AOI can relate to more merchants of the merchant type, the proportion of each merchant matched with the candidate AOI on the merchant type is balanced, and if the number of the merchants is smaller, the association degree between the candidate AOI and the target merchant determined by the service platform is higher.
For example, if the service platform determines that the merchant type corresponding to the target merchant is a chafing dish type, and determines that there are only 2 chafing dish merchants among other merchants matching with the candidate AOI, it can be seen that for users near the candidate AOI, there are fewer chafing dish merchants to select, and the association between the target merchant and the candidate AOI is higher, so that the candidate AOI can be included in the distribution service range of the target merchant as much as possible, thereby increasing the number of chafing dish merchants matching with the candidate AOI.
The service platform can also predict the delivery duration from the target merchant to the candidate AOI according to the AOI passing state corresponding to the candidate AOI and the delivery distance between the candidate AOI and the target merchant, and determine the association degree between the candidate AOI and the target merchant according to the predicted delivery duration, wherein the association degree between the candidate AOI and the target merchant is higher as the delivery duration is shorter.
For example, if the traffic state of the AOI corresponding to the candidate AOI is such that the dispatcher is not allowed to enter, and the delivery distance between the candidate AOI and the target merchant is 3 km, the service platform predicts that the time required for the dispatcher to travel from the target merchant to the candidate AOI is 10 minutes according to the delivery distance. The service platform also predicts this time to be 5 minutes, since the candidate AOI does not allow the dispatcher to enter, and the dispatcher needs to wait for the user to leave the candidate AOI and get the commodity when arriving at the candidate AOI. Therefore, the service platform predicts that the delivery time from the target merchant to the candidate AOI is 15 minutes, and can determine the association degree between the candidate AOI and the target merchant according to the predicted delivery time.
Of course, for the remaining features, the service platform may also determine the above-mentioned association through these features. For example, the service platform may determine the association between the candidate AOI and the target merchant according to at least one of a shipping distance between the target merchant and the candidate AOI, an AOI area corresponding to the candidate AOI, a number of orders corresponding to the candidate AOI within a set time, and a number of orders for an order of the target merchant generated within the candidate AOI within the set time.
Wherein the shorter the shipping distance between the target merchant and the candidate AOI, the higher the association between the candidate AOI and the target merchant. The shorter the shipping distance, the more likely the shipping capacity will be to ship the target merchant's goods to the candidate AOI, and therefore, the higher the association between the candidate AOI and the target merchant. The smaller the AOI area corresponding to the candidate AOI, the higher the degree of association between the candidate AOI and the target merchant is, because the shorter the time it takes to leave the candidate AOI after delivery capacity is completed for orders generated within the candidate AOI. That is, the less the delivery capacity remains in the candidate AOI, the more the delivery capacity may be completed in a certain time, and accordingly, the higher the delivery efficiency of the delivery capacity may be.
Whether the number of orders corresponding to the candidate AOI in the set time is larger or the number of orders generated in the candidate AOI for the target merchant is larger in the set time, it is indicated that the user in the candidate AOI can generate more orders, and the user in the candidate AOI may generate more orders for the target merchant, so that the association degree between the candidate AOI and the target merchant is higher.
One way of determining the degree of association between the candidate AOI and the target merchant is described below by way of example.
Wherein, R is the association degree between the candidate AOI and the target merchant, order is the number of orders corresponding to the candidate AOI in the set time, a can be a numerical value set according to the actual situation, and dist is the conveying distance between the target merchant and the candidate AOI. From the formula, it can be seen that, if the number of orders corresponding to the candidate AOI is larger within the set time, the association degree between the candidate AOI and the target merchant is higher, and if the shipping distance between the target merchant and the candidate AOI is shorter, the association degree between the candidate AOI and the target merchant is higher.
Of course, the formula for determining the degree of association is not unique, and the formula for determining the degree of association may be set according to the characteristics required to be used. Further, there may be many ways for the service platform to determine the association degree, that is, the features may be arbitrarily combined according to the above-mentioned relationship between the features and the association degree, so as to determine the association degree between the candidate AOI and the target merchant, and other ways for determining the association degree are not illustrated herein.
S204: and selecting at least one candidate AOI forming a distribution service range corresponding to the target merchant as a target AOI according to the association degree between each candidate AOI and the target merchant.
After the service platform determines the association degree between each candidate AOI and the target merchant, at least one candidate AOI forming the distribution service range corresponding to the target merchant can be selected as the target AOI according to the determined association degree.
The target AOI may be selected according to the above-mentioned association degree. For example, the service platform may sort the candidate AOIs according to the order of the association degree from large to small, to obtain a sorting result, and determine whether the nth candidate AOI in the sorting result meets a preset condition, where N is an integer not less than 1. If the N candidate AOI meets the preset condition, selecting the N candidate AOI, judging whether the (n+1) candidate AOI in the sequencing result meets the preset condition or not, and taking each selected candidate AOI as a target AOI until the area of the geographic range covered by each selected candidate AOI is within the set area range.
The set area range mentioned here may be set according to actual requirements, where the set area range may be an area range set by the service platform for the distribution service range of the target merchant, and the area of the distribution service range finally determined by the service platform should be located in the set area range. The candidate AOIs ranked from large to small according to the association degree, the selected candidate AOIs high in association degree, and the area of the geographic area surrounded by the selected candidate AOIs located in the set area range, so that the area of the distribution service range finally determined is also located in the set area range.
In the present specification, the above-mentioned two cases may be included until the area of the geographical range covered by each of the selected candidate AOIs within the set area range, and one case is that the continuation of the selection of the candidate AOIs is stopped immediately as long as the sum of the areas of the geographical ranges covered by the selected candidate AOIs just within the set area range. For example, assuming that there are 5 candidate AOIs, after the service platform ranks the 5 candidate AOIs, it is determined that all of the first 3 candidate AOIs meet the preset condition, and the sum of the areas of the geographic ranges covered by the first 3 candidate AOIs smaller than the minimum area of the set area range. The service platform determines that the AOI arranged at the 4 th AOI also meets the preset condition, and determines that the sum of the areas of the geographic ranges covered by the first 4 AOIs just falls into the set area range, then the continuous selection of the candidate AOIs is stopped, namely, whether the 5 th candidate AOI meets the preset condition is not needed to be judged any more, so that the service platform can take the first 4 candidate AOIs as the selected target AOIs.
In another case, the service platform may continue to select the candidate AOI as long as the sum of the areas of the geographic areas covered by the candidate AOIs selected by the service platform does not exceed the maximum area of the set area range, and once the sum of the areas of the geographic areas covered by the selected candidate AOIs exceeds the maximum area of the set area range, the selection of the candidate AOI needs to be stopped.
For example, assuming that the area range is set to 20 square kilometers to 21 square kilometers, the service platform determines 8 candidate AOIs from a to h, and determines that the association degree between the 8 candidate AOIs from a to h and the target merchant is sequentially 100, 80, 95, 70, 88, 50 and 60, and the service platform ranks the 8 candidate AOIs according to the association degree order, so as to obtain a ranking result a, c, e, b, d, g, f, h. Then, the service platform starts from the first candidate AOI and selects a target AOI. First, the service platform determines candidate AOIs: a meets the preset condition, but candidate AOI: a has not reached the minimum area in the set area range, and secondly, AOI: c also satisfies the preset condition, but the area of the geographical range covered by both AOIs a and c and the minimum area in the set area range are not reached.
The service platform determines the candidate AOI arranged next: e meets the preset condition, but the area of the geographic range covered by the three candidate AOIs a, c and e and the minimum area in the set area range still do not reach, so that selection needs to be continued, and the candidate AOIs: b also meets the preset condition, but the area of the geographical range covered by the four AOIs a, c, e, b and the set area range is still not reached. Then, the service platform determines candidate AOI: d does not meet the preset condition, the service platform determines the next candidate AOI: g whether the preset condition is met, if so, determining the candidate AOI: g meets the preset condition, and determines a, c, e, b, g that the sum of the areas of the geographic areas covered by the five AOIs is 20.4 square kilometers, and is positioned in the set area range. The service platform may continue to determine the next candidate AOI: f whether the preset condition is met, if so, determining the candidate AOI: f meets a preset condition, but the sum of the areas of the geographical ranges covered by the a, c, e, b, g, f AOIs exceeds the maximum area in the set area range: 21 square kilometers, the service platform will stop continuing to select candidate AOIs and take a, c, e, b, g of these five AOIs as target AOIs.
The above-mentioned preset conditions may be set according to actual demands. For example, if the order completion rate corresponding to the order generated in the candidate AOI within the set time is not less than the set completion rate for one candidate AOI, it is determined that the candidate AOI satisfies the preset condition. The order completion rate referred to herein refers to the proportion of orders completed (i.e., orders that have not been cancelled) within the candidate AOI generated within a set time to the total order; for another example, if the service platform determines that the order delivery duration corresponding to the order generated in the candidate AOI within the set time is not less than the set delivery duration, it determines that the candidate AOI meets the preset condition, where the order delivery duration may be an average delivery duration of the order generated in the set time. The remaining preset conditions are not illustrated.
For each candidate AOI, if the service platform determines that the candidate AOI meets any one preset condition, the candidate AOI can be selected as a target AOI. Of course, the service platform may also select the candidate AOI as the target AOI when determining that the candidate AOI meets the preset condition of not less than the set number.
In addition, if the area of the distribution service range of the target merchant does not need to be set, when the service platform determines the target AOI, the candidate AOI before the arrangement is set in the sorting result may be used as the target AOI, or the candidate AOI before the arrangement is set and meeting the preset condition may be used as the target AOI.
S205: and determining a distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommending the service provided by the target merchant to a user according to the determined distribution service range corresponding to the target merchant.
After each target AOI is determined by the service platform, the distribution service range corresponding to the target merchant can be determined according to the geographic range covered by each target AOI, and then the service provided by the target merchant is recommended to the user according to the distribution service range. For example, assuming that the target merchant is a take-away providing merchant, the business platform, after determining the delivery service range, may recommend various take-away provided by the target merchant to users located within the delivery service range for selection by the users. That is, the service platform may combine the target AOIs to connect the boundaries of the target AOIs to obtain a complete distribution service range. However, in practical application, there may be a case where there is a protruding portion on the boundary, as shown in fig. 4.
Fig. 4 is a schematic diagram of a distribution service range corresponding to a target merchant provided in the present specification.
As can be seen from fig. 4, the service platform determines each target AOI around the target merchant, and each graph with a different shape in the graph represents each target AOI determined by the service platform, and the service platform may sequentially connect the boundaries of each target AOI in the electronic map as shown in fig. 4, so as to enclose the whole area covered by each target AOI, thereby determining the distribution service range corresponding to the target merchant in the graph. However, in practical application, it may happen that after the service platform connects the boundaries of the target AOIs, the protruding portion pointed by the arrow a in fig. 4 is obtained, and the service platform may remove the protruding portion, so as to obtain a more reasonable distribution service range.
Specifically, the service platform may determine a plurality of boundary points located on the AOI boundary in each target AOI, and number each boundary point according to the sequence of sequentially connecting the boundary points to obtain the sequence number of each boundary point. And then, determining a plurality of boundary points adjacent to each boundary point as adjacent boundary points corresponding to the boundary point, and determining the maximum value and the minimum value of serial numbers in each adjacent boundary point corresponding to the boundary point. And if the difference between the maximum value and the minimum value is not smaller than the set value, screening out the boundary points between the maximum value and the minimum value of the serial numbers except the boundary points, and determining the distribution service range corresponding to the target merchant according to the rest boundary points. The setting value may be set according to actual situations.
Continuing with the example above, the service platform in fig. 4 numbers the boundary points and then numbers the protruding portions, generally in the form indicated by the lateral arrows. It can be seen that from the boundary point 2 to the boundary point 9, which is a boundary point belonging to the protruding portion, the boundary point 2 is adjacent to the boundary point 9, but the difference in serial numbers therebetween is large, which means that there is a high possibility that the protruding portion exists between the boundary point 2 and the boundary point 9. Therefore, for the boundary point 2, the service platform can determine that the maximum value of the sequence numbers in the boundary point 1 and the boundary point 9 adjacent to the boundary point 2 is 9, and the minimum value is 1. Assuming that the set value is 7, since the difference between the maximum value and the minimum value is greater than the set value 7, the service platform may remove boundary points (excluding the boundary point corresponding to the maximum value, i.e., boundary point 9, and excluding the boundary point corresponding to the minimum value, i.e., boundary point 1) between the sequence numbers 1 and 9 except the boundary point 2, i.e., remove the boundary 3 to the boundary point 8.
In addition to the above-mentioned removal of the protruding portion, the service platform may further remove unnecessary boundary points, so that a storage space used for storing the distribution service range corresponding to the target merchant may be effectively saved, as shown in fig. 5.
Fig. 5 is a schematic diagram of a manner of screening boundary points provided in the present specification.
As shown in fig. 5, after the service platform connects the target AOIs on the left side in fig. 5, the boundary formed by connecting the points a, b, c, d and e is relatively flat, and for such a case, the service platform may directly remove the boundary point between the points a and e, that is, remove the points b, c and d, and directly connect the points a and e. That is, as shown on the right side of fig. 5, after the service platform removes the points b, c and d, the remaining boundary points are connected, so that the boundary of the obtained distribution service range is relatively flat.
In addition, in practical applications, there may be some areas around the target merchant where distribution cannot be performed, such as rivers (urban protection), scenic spots, etc., in order to avoid such areas, a fixed distribution range for the target merchant may be predetermined, and this fixed distribution range may be a service range determined in order to avoid these areas. After the service platform determines the distribution service range according to each target AOI, the distribution service range and the fixed distribution range can be intersected, and the distribution service range corresponding to the final target merchant is determined according to the obtained intersection.
According to the method, after the service platform determines the target merchant needing to determine the distribution service range, each AOI in a certain range around the target merchant can be determined to serve as a candidate AOI, and according to the association degree between each candidate AOI and the target merchant, the target AOI suitable for forming the distribution service range of the target merchant is determined from the candidate AOI, and then the distribution service range corresponding to the target merchant is determined. Therefore, the distribution service range is determined by combining the AOIs around the target merchant, and the distribution service range of the merchant is not changed greatly even if the distribution service range of the merchant is redetermined because the area covered by the AOIs on the electronic map is relatively fixed, so that the rationality of the determined distribution service range is ensured.
In the present disclosure, the service platform may draw a distribution service range corresponding to a target merchant in a preset electronic map according to the above manner, and display the distribution service range to the target merchant. The target merchant can determine whether the distribution service range needs to be adjusted according to the actual demand of the target merchant, and if the distribution service range needs to be adjusted, a request for adjusting the distribution service range can be sent to the service platform, so that the service platform can redetermine the distribution service range corresponding to the target merchant according to the request of the target merchant.
The above method for determining the distribution service range provided for one or more embodiments of the present disclosure further provides a corresponding device for determining the distribution service range based on the same concept, as shown in fig. 6.
Fig. 6 is a schematic diagram of an apparatus for determining a distribution service range provided in the present specification, which specifically includes:
A merchant determination module 601 configured to determine a merchant for which a distribution service range is to be determined as a target merchant;
a range determining module 602, configured to determine, according to a geographic location corresponding to the target merchant, a basic service range corresponding to the target merchant, and determine, as candidate AOIs, each region of interest AOI that matches the basic service range;
A relevance determining module 603 configured to determine, for each candidate AOI, a relevance between the candidate AOI and the target merchant according to at least one of an AOI feature corresponding to the candidate AOI, a merchant feature corresponding to the target merchant, and a relevance feature between the candidate AOI and the target merchant;
A selecting module 604, configured to select, as a target AOI, at least one candidate AOI that constitutes a corresponding distribution service range of the target merchant according to a degree of association between the candidate AOIs and the target merchant;
The service module 605 is configured to determine a distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommend, to a user, a service provided by the target merchant according to the determined distribution service range corresponding to the target merchant.
Optionally, the range determination module 602 is configured to determine, for each AOI, a region of the AOI that is within the basic service range as an intersection region; and if the area ratio of the intersection area in the AOI exceeds the set ratio, determining that the AOI is matched with the basic service range.
Optionally, the AOI features corresponding to the candidate AOI include: at least one of an AOI area corresponding to the candidate AOI, an AOI passing state corresponding to the candidate AOI and the number of orders corresponding to the candidate AOI within a set time; the merchant characteristics corresponding to the target merchant include: the merchant type corresponding to the target merchant; the association features between the candidate AOI and the target merchant include: at least one of a shipping distance between the target merchant and the candidate AOI, a number of orders for the order of the target merchant generated within the candidate AOI during the set time.
Optionally, the relevance determination module 603 is configured to determine other merchants that match the candidate AOI; determining the merchant quantity of merchants belonging to the merchant type from other merchants matched with the candidate AOI according to the merchant type corresponding to the target merchant; and determining the association degree between the candidate AOI and the target merchant according to the merchant quantity, wherein the association degree between the candidate AOI and the target merchant is higher as the merchant quantity is smaller.
Optionally, the association determining module 603 is configured to determine, for each other merchant, whether the candidate AOI matches the distribution service range corresponding to the other merchant; and if the candidate AOI is matched with the distribution service range corresponding to the other merchant, determining that the other merchant is matched with the candidate AOI.
Optionally, the association determining module 603 is configured to predict a delivery duration from the target merchant to the candidate AOI according to the AOI traffic state corresponding to the candidate AOI and the delivery distance between the candidate AOI and the target merchant; and determining the association degree between the candidate AOI and the target merchant according to the distribution time length, wherein the association degree between the candidate AOI and the target merchant is higher as the distribution time length is shorter.
Optionally, the association determining module 603 is configured to determine the association between the candidate AOI and the target merchant according to at least one of a shipping distance between the target merchant and the candidate AOI, an AOI area corresponding to the candidate AOI, a number of orders corresponding to the candidate AOI within the set time, and a number of orders for the target merchant generated within the candidate AOI, where the shorter the shipping distance, the higher the association between the candidate AOI and the target merchant, the more the number of orders corresponding to the candidate AOI within the set time, the higher the association between the candidate AOI and the target merchant, the smaller the AOI area corresponding to the candidate AOI, the higher the association between the candidate AOI and the target merchant, and the more the number of orders for the target merchant generated within the candidate AOI, the higher the association between the candidate AOI and the target merchant.
Optionally, the selecting module 604 is configured to sort the candidate AOIs according to the order of the association degree from the big to the small, so as to obtain a sorting result; judging whether the N candidate AOI in the sequencing result meets a preset condition or not, wherein N is an integer not less than 1; if the Nth candidate AOI meets the preset condition, selecting the Nth candidate AOI, and judging whether the (n+1) th candidate AOI in the sequencing result meets the preset condition or not until the area of the geographic range covered by each selected candidate AOI is within a set area range; and taking each selected candidate AOI as a target AOI.
Optionally, the selecting module 604 is configured to determine, for each candidate AOI, that the candidate AOI meets the preset condition if it is determined that an order completion rate corresponding to an order generated in the candidate AOI within a set time is not less than a set completion rate and/or an order delivery duration corresponding to an order generated in the candidate AOI within the set time is not less than a set delivery duration.
Optionally, the service module 605 is configured to determine a plurality of boundary points located on the AOI boundary in the at least one target AOI, and number each boundary point according to the order of connection in sequence, to obtain a sequence number of each boundary point; for each boundary point, determining a plurality of boundary points adjacent to the boundary point as adjacent boundary points corresponding to the boundary point; determining the maximum value and the minimum value of serial numbers in each adjacent boundary point corresponding to the boundary point; if the difference value between the maximum value and the minimum value is not smaller than the set value, screening out the boundary points of the serial numbers between the maximum value and the minimum value except the boundary points; and determining the distribution service range corresponding to the target merchant according to the remaining boundary points.
From the above-mentioned device, it can be seen that, after determining the target merchant needing to determine the distribution service range, the device for determining the distribution service range provided in the present specification may determine AOIs of each interest area within a certain range around the target merchant, and determine AOIs suitable for forming the distribution service range of the target merchant according to the association degree between each AOI and the target merchant, so as to determine the distribution service range corresponding to the target merchant. Therefore, the distribution service range is determined by combining the AOIs around the target merchant, and the area covered by the AOIs on the electronic map is relatively fixed, so that even if the distribution service range of the merchant is redetermined, the distribution service range of the merchant can not be changed greatly, and the rationality of the determined distribution service range is ensured.
The present specification also provides a computer readable storage medium storing a computer program operable to perform the method of determining a distribution service range shown in fig. 2 described above.
The present specification also provides a schematic structural diagram of the electronic device shown in fig. 7. At the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile storage, as described in fig. 7, although other hardware required by other services may be included. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs to implement the method of determining the distribution service scope described above with respect to fig. 2. Of course, other implementations, such as logic devices or combinations of hardware and software, are not excluded from the present description, that is, the execution subject of the following processing flows is not limited to each logic unit, but may be hardware or logic devices.
In the 90 s of the 20 th century, improvements to one technology could clearly be distinguished as improvements in hardware (e.g., improvements to circuit structures such as diodes, transistors, switches, etc.) or software (improvements to the process flow). However, with the development of technology, many improvements of the current method flows can be regarded as direct improvements of hardware circuit structures. Designers almost always obtain corresponding hardware circuit structures by programming improved method flows into hardware circuits. Therefore, an improvement of a method flow cannot be said to be realized by a hardware entity module. For example, a programmable logic device (Programmable Logic Device, PLD) (e.g., field programmable gate array (Field Programmable GATE ARRAY, FPGA)) is an integrated circuit whose logic functions are determined by user programming of the device. A designer programs to "integrate" a digital system onto a PLD without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Moreover, nowadays, instead of manually manufacturing integrated circuit chips, such programming is mostly implemented with "logic compiler (logic compiler)" software, which is similar to the software compiler used in program development and writing, and the original code before being compiled is also written in a specific programming language, which is called hardware description language (Hardware Description Language, HDL), but HDL is not just one, but a plurality of kinds, such as ABEL(Advanced Boolean Expression Language)、AHDL(Altera Hardware Description Language)、Confluence、CUPL(Cornell University Programming Language)、HDCal、JHDL(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL(Ruby Hardware Description Language), and VHDL (Very-High-SPEED INTEGRATED Circuit Hardware Description Language) and Verilog are currently most commonly used. It will also be apparent to those skilled in the art that a hardware circuit implementing the logic method flow can be readily obtained by merely slightly programming the method flow into an integrated circuit using several of the hardware description languages described above.
The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium storing computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, application SPECIFIC INTEGRATED Circuits (ASICs), programmable logic controllers, and embedded microcontrollers, examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, atmel AT91SAM, microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic of the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller in a pure computer readable program code, it is well possible to implement the same functionality by logically programming the method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers, etc. Such a controller may thus be regarded as a kind of hardware component, and means for performing various functions included therein may also be regarded as structures within the hardware component. Or even means for achieving the various functions may be regarded as either software modules implementing the methods or structures within hardware components.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being functionally divided into various units, respectively. Of course, the functions of each element may be implemented in one or more software and/or hardware elements when implemented in the present specification.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
It will be appreciated by those skilled in the art that embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, the present specification may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present description can take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.
The foregoing is merely exemplary of the present disclosure and is not intended to limit the disclosure. Various modifications and alterations to this specification will become apparent to those skilled in the art. Any modifications, equivalent substitutions, improvements, or the like, which are within the spirit and principles of the present description, are intended to be included within the scope of the claims of the present description.

Claims (13)

1. A method of determining a distribution service range, comprising:
determining a merchant with a distribution service range to be determined as a target merchant;
according to the geographic position corresponding to the target merchant, determining a basic service range corresponding to the target merchant, and determining each interest area AOI matched with the basic service range as each candidate AOI;
for each candidate AOI, determining the association degree between the candidate AOI and the target merchant according to at least one of the AOI characteristics corresponding to the candidate AOI, the merchant characteristics corresponding to the target merchant and the association characteristics between the candidate AOI and the target merchant;
Selecting at least one candidate AOI forming a distribution service range corresponding to the target merchant as a target AOI according to the association degree between each candidate AOI and the target merchant;
And determining a distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommending the service provided by the target merchant to a user according to the determined distribution service range corresponding to the target merchant.
2. The method of claim 1, wherein determining respective regions of interest AOI that match the base service scope comprises:
for each AOI, determining a region in the AOI, which is positioned in the basic service range, as an intersection region;
and if the area ratio of the intersection area in the AOI exceeds the set ratio, determining that the AOI is matched with the basic service range.
3. The method of claim 1, wherein the candidate AOI corresponding AOI feature comprises: at least one of an AOI area corresponding to the candidate AOI, an AOI passing state corresponding to the candidate AOI and the number of orders corresponding to the candidate AOI within a set time;
The merchant characteristics corresponding to the target merchant include: the merchant type corresponding to the target merchant;
The association features between the candidate AOI and the target merchant include: at least one of a shipping distance between the target merchant and the candidate AOI, a number of orders for the order of the target merchant generated within the candidate AOI during the set time.
4. The method of claim 3, wherein determining a degree of association between the candidate AOI and the target merchant based on at least one of the AOI feature corresponding to the candidate AOI, the merchant feature corresponding to the target merchant, and the association feature between the candidate AOI and the target merchant comprises:
determining other merchants that match the candidate AOI;
Determining the merchant quantity of merchants belonging to the merchant type from other merchants matched with the candidate AOI according to the merchant type corresponding to the target merchant;
And determining the association degree between the candidate AOI and the target merchant according to the merchant quantity, wherein the association degree between the candidate AOI and the target merchant is higher as the merchant quantity is smaller.
5. The method of claim 4, wherein determining other merchants that match the candidate AOI comprises:
for each other merchant, determining whether the candidate AOI matches a distribution service range corresponding to the other merchant;
And if the candidate AOI is matched with the distribution service range corresponding to the other merchant, determining that the other merchant is matched with the candidate AOI.
6. The method of claim 3, wherein determining a degree of association between the candidate AOI and the target merchant based on at least one of the AOI feature corresponding to the candidate AOI, the merchant feature corresponding to the target merchant, and the association feature between the candidate AOI and the target merchant comprises:
Predicting the delivery duration from the target merchant to the candidate AOI according to the AOI passing state corresponding to the candidate AOI and the delivery distance between the candidate AOI and the target merchant;
And determining the association degree between the candidate AOI and the target merchant according to the distribution time length, wherein the association degree between the candidate AOI and the target merchant is higher as the distribution time length is shorter.
7. The method of claim 3, wherein determining a degree of association between the candidate AOI and the target merchant based on at least one of the AOI feature corresponding to the candidate AOI, the merchant feature corresponding to the target merchant, and the association feature between the candidate AOI and the target merchant comprises:
Determining the association degree between the candidate AOI and the target merchant according to at least one of the conveying distance between the target merchant and the candidate AOI, the AOI area corresponding to the candidate AOI, the number of orders corresponding to the candidate AOI in the set time and the number of orders for the target merchant generated in the candidate AOI in the set time, wherein the shorter the conveying distance is, the higher the association degree between the candidate AOI and the target merchant is, the higher the number of orders corresponding to the candidate AOI in the set time is, the higher the association degree between the candidate AOI and the target merchant is, the smaller the AOI area corresponding to the candidate AOI is, the higher the association degree between the candidate AOI and the target merchant is, and the higher the number of orders for the target merchant generated in the candidate AOI in the set time is.
8. The method of claim 1, wherein selecting at least one candidate AOI that constitutes a corresponding distribution service range for the target merchant as a target AOI based on a degree of association between the candidate AOIs and the target merchant, comprising:
Sequencing the candidate AOIs according to the sequence from the high degree of relevance to the low degree of relevance to obtain a sequencing result;
judging whether the N candidate AOI in the sequencing result meets a preset condition or not, wherein N is an integer not less than 1;
if the Nth candidate AOI meets the preset condition, selecting the Nth candidate AOI, and judging whether the (n+1) th candidate AOI in the sequencing result meets the preset condition or not until the area of the geographic range covered by each selected candidate AOI is within a set area range;
And taking each selected candidate AOI as a target AOI.
9. The method of claim 8, wherein determining that the candidate AOI meets the preset condition comprises:
And if determining that the order completion rate corresponding to the order generated in the candidate AOI within the set time is not less than the set completion rate and/or the order distribution duration corresponding to the order generated in the candidate AOI within the set time is not less than the set distribution duration, determining that the candidate AOI meets the preset condition.
10. The method of claim 1, wherein determining the distribution service range corresponding to the target merchant based on the geographic range covered by the at least one target AOI comprises:
Determining a plurality of boundary points positioned on an AOI boundary of the at least one target AOI, and numbering the boundary points according to the sequence of sequential connection to obtain the serial numbers of the boundary points;
For each boundary point, determining a plurality of boundary points adjacent to the boundary point as adjacent boundary points corresponding to the boundary point;
Determining the maximum value and the minimum value of serial numbers in each adjacent boundary point corresponding to the boundary point;
If the difference value between the maximum value and the minimum value is not smaller than the set value, screening out the boundary points of the serial numbers between the maximum value and the minimum value except the boundary points;
And determining the distribution service range corresponding to the target merchant according to the remaining boundary points.
11. An apparatus for determining a distribution service range, comprising:
a merchant determination module configured to determine a merchant for which a distribution service range is to be determined as a target merchant;
The range determining module is configured to determine a basic service range corresponding to the target merchant according to the geographic position corresponding to the target merchant, and determine each region of interest AOI matched with the basic service range as each candidate AOI;
A relevance determining module configured to determine, for each candidate AOI, a relevance between the candidate AOI and the target merchant according to at least one of an AOI feature corresponding to the candidate AOI, a merchant feature corresponding to the target merchant, and a relevance feature between the candidate AOI and the target merchant;
The selecting module is configured to select at least one candidate AOI forming a corresponding distribution service range of the target merchant as a target AOI according to the association degree between each candidate AOI and the target merchant;
And the service module is configured to determine a distribution service range corresponding to the target merchant according to the geographic range covered by the at least one target AOI, and recommend the service provided by the target merchant to a user according to the determined distribution service range corresponding to the target merchant.
12. A computer-readable storage medium, characterized in that the storage medium stores a computer program which, when executed by a processor, implements the method of any of the preceding claims 1-10.
13. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of any of the preceding claims 1-10 when executing the program.
CN202010830185.4A 2020-08-18 2020-08-18 Method and device for determining distribution service range Active CN114077979B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010830185.4A CN114077979B (en) 2020-08-18 2020-08-18 Method and device for determining distribution service range

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010830185.4A CN114077979B (en) 2020-08-18 2020-08-18 Method and device for determining distribution service range

Publications (2)

Publication Number Publication Date
CN114077979A CN114077979A (en) 2022-02-22
CN114077979B true CN114077979B (en) 2024-05-28

Family

ID=80281252

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010830185.4A Active CN114077979B (en) 2020-08-18 2020-08-18 Method and device for determining distribution service range

Country Status (1)

Country Link
CN (1) CN114077979B (en)

Citations (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130007950A (en) * 2011-07-11 2013-01-21 광주과학기술원 Apparatus and method for detecting region of interest, and the recording media storing the program performing the said method
CN103268556A (en) * 2013-05-10 2013-08-28 宁加宇 Method for seller to distribute goods in certain areas through map on website
CN106681996A (en) * 2015-11-05 2017-05-17 腾讯科技(深圳)有限公司 Method and device for determining interest areas and interest points within geographical scope
CN107124476A (en) * 2017-07-04 2017-09-01 百度在线网络技术(北京)有限公司 Information-pushing method and device
CN107437122A (en) * 2016-05-26 2017-12-05 北京三快在线科技有限公司 Determine that businessman dispenses the method and device of scope
CN108090953A (en) * 2017-12-14 2018-05-29 上海联影医疗科技有限公司 Area-of-interest method for reconstructing, system and computer readable storage medium
CN108271120A (en) * 2017-12-22 2018-07-10 阿里巴巴集团控股有限公司 Target area and the determining method, apparatus and equipment of target user
CN108572999A (en) * 2017-03-14 2018-09-25 腾讯科技(深圳)有限公司 The searching method and device of interest face AOI profiles
CN109598430A (en) * 2018-11-28 2019-04-09 拉扎斯网络科技(上海)有限公司 Dispense range generation method, device, electronic equipment and storage medium
CN109636013A (en) * 2018-11-27 2019-04-16 拉扎斯网络科技(上海)有限公司 Dispense generation method, device, electronic equipment and the storage medium of range
CN109962939A (en) * 2017-12-14 2019-07-02 腾讯科技(深圳)有限公司 Position recommended method, device, server, terminal and storage medium
CN110210813A (en) * 2019-06-12 2019-09-06 拉扎斯网络科技(上海)有限公司 A kind of method, apparatus, electronic equipment and the storage medium of determining dispatching range
CN110503353A (en) * 2018-05-16 2019-11-26 北京三快在线科技有限公司 A kind of dispatching Zonal expression method and device
CN110544159A (en) * 2019-09-09 2019-12-06 拉扎斯网络科技(上海)有限公司 map information processing method and device, readable storage medium and electronic equipment
CN110766510A (en) * 2019-09-18 2020-02-07 北京三快在线科技有限公司 Recommendation method and device, electronic equipment and readable storage medium
CN111340412A (en) * 2020-02-07 2020-06-26 北京三快在线科技有限公司 Order processing method and device, readable storage medium and electronic equipment
CN111401767A (en) * 2020-03-25 2020-07-10 沈树新 Logistics distribution hotspot pushing method and device, logistics distribution system and server
CN111461779A (en) * 2020-03-31 2020-07-28 拉扎斯网络科技(上海)有限公司 Map information processing method and device, readable storage medium and electronic equipment
CN111476523A (en) * 2020-04-08 2020-07-31 上海明略人工智能(集团)有限公司 Method and device for matching distribution area with distribution point and storage medium

Patent Citations (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130007950A (en) * 2011-07-11 2013-01-21 광주과학기술원 Apparatus and method for detecting region of interest, and the recording media storing the program performing the said method
CN103268556A (en) * 2013-05-10 2013-08-28 宁加宇 Method for seller to distribute goods in certain areas through map on website
CN106681996A (en) * 2015-11-05 2017-05-17 腾讯科技(深圳)有限公司 Method and device for determining interest areas and interest points within geographical scope
CN107437122A (en) * 2016-05-26 2017-12-05 北京三快在线科技有限公司 Determine that businessman dispenses the method and device of scope
CN108572999A (en) * 2017-03-14 2018-09-25 腾讯科技(深圳)有限公司 The searching method and device of interest face AOI profiles
CN107124476A (en) * 2017-07-04 2017-09-01 百度在线网络技术(北京)有限公司 Information-pushing method and device
CN109962939A (en) * 2017-12-14 2019-07-02 腾讯科技(深圳)有限公司 Position recommended method, device, server, terminal and storage medium
CN108090953A (en) * 2017-12-14 2018-05-29 上海联影医疗科技有限公司 Area-of-interest method for reconstructing, system and computer readable storage medium
CN108271120A (en) * 2017-12-22 2018-07-10 阿里巴巴集团控股有限公司 Target area and the determining method, apparatus and equipment of target user
CN110503353A (en) * 2018-05-16 2019-11-26 北京三快在线科技有限公司 A kind of dispatching Zonal expression method and device
CN109636013A (en) * 2018-11-27 2019-04-16 拉扎斯网络科技(上海)有限公司 Dispense generation method, device, electronic equipment and the storage medium of range
CN109598430A (en) * 2018-11-28 2019-04-09 拉扎斯网络科技(上海)有限公司 Dispense range generation method, device, electronic equipment and storage medium
CN110210813A (en) * 2019-06-12 2019-09-06 拉扎斯网络科技(上海)有限公司 A kind of method, apparatus, electronic equipment and the storage medium of determining dispatching range
CN110544159A (en) * 2019-09-09 2019-12-06 拉扎斯网络科技(上海)有限公司 map information processing method and device, readable storage medium and electronic equipment
CN110766510A (en) * 2019-09-18 2020-02-07 北京三快在线科技有限公司 Recommendation method and device, electronic equipment and readable storage medium
CN111340412A (en) * 2020-02-07 2020-06-26 北京三快在线科技有限公司 Order processing method and device, readable storage medium and electronic equipment
CN111401767A (en) * 2020-03-25 2020-07-10 沈树新 Logistics distribution hotspot pushing method and device, logistics distribution system and server
CN111461779A (en) * 2020-03-31 2020-07-28 拉扎斯网络科技(上海)有限公司 Map information processing method and device, readable storage medium and electronic equipment
CN111476523A (en) * 2020-04-08 2020-07-31 上海明略人工智能(集团)有限公司 Method and device for matching distribution area with distribution point and storage medium

Also Published As

Publication number Publication date
CN114077979A (en) 2022-02-22

Similar Documents

Publication Publication Date Title
CN107093096B (en) Traffic prediction method and device
CN110414731B (en) Order distribution method and device, computer readable storage medium and electronic equipment
CN110852503B (en) Payment channel selection method and device and payment channel route
CN116225669B (en) Task execution method and device, storage medium and electronic equipment
CN111340412A (en) Order processing method and device, readable storage medium and electronic equipment
CN111144979B (en) Data processing method and device
CN114077979B (en) Method and device for determining distribution service range
CN116932175B (en) Heterogeneous chip task scheduling method and device based on sequence generation
CN111639269B (en) Site recommendation method and device
AU2017203619B2 (en) Searching available rental vehicles based on adjustable parameters
CN110276637B (en) Resource allocation method and device, and coupon allocation method and device
CN116151907A (en) Order processing method and device, electronic equipment and computer storage medium
CN114742623A (en) Order distribution method and device, computer readable storage medium and electronic equipment
CN114925982A (en) Model training method and device, storage medium and electronic equipment
CN112418975A (en) Service processing system, method and device for determining service processing mode
CN114077944A (en) Order allocation method and device, storage medium and electronic equipment
CN116362457A (en) Order recommending method and device, storage medium and electronic equipment
CN113205377A (en) Information recommendation method and device
CN112862228A (en) Order distribution method and device, computer readable storage medium and electronic equipment
CN116612640B (en) Vehicle scheduling method and device, storage medium and electronic equipment
CN116757566A (en) Method and device for executing distribution task
CN116205696A (en) Order distribution method and device, storage medium and electronic equipment
CN113642846A (en) Order processing method and device, storage medium and electronic equipment
CN116089434B (en) Data storage method and device, storage medium and electronic equipment
CN112181928B (en) Method, device and system for executing service

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