Method and device for generating fixed route

Abstract

The embodiment of the present invention discloses a method and device for generating a fixed route. In the embodiment of the present invention, an order data set within a set area is obtained, wherein the order data set includes multiple order data, and each order data includes a starting point and an end point; multiple high-heat grid pairs are determined based on the order data set, wherein each high-heat grid pair consists of two grids, one of the two grids is the grid where the starting point is located, and the other grid is the grid where the end point is located, and each of the grids is an area within a set range; at least one high-heat route is determined based on the multiple high-heat grid pairs; the at least one high-heat route is corrected according to the set conditions to generate at least one fixed route. Through the above method, running a fixed vehicle according to the fixed route can improve the operational efficiency of the carpooling service and enhance the user experience.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for generating a fixed route. Background Art

[0002] With the development of mobile Internet, various travel services have provided convenience for people's daily lives. Considering the cost of travel, many users choose to travel by carpooling.

[0003] In the existing technology, carpooling services generally adopt the hitchhiking method. After obtaining the user's needs, vehicles are immediately matched for each user, and then a more suitable vehicle is selected for the user based on the vehicle's availability along the way. However, the temporarily matched vehicle may be an unreasonable carpooling strategy, resulting in long travel time, low operating efficiency, and high operating costs for the driver, thus bringing a negative experience to users and drivers.

[0004] To sum up, how to improve the operational efficiency of carpooling services and enhance user experience is a problem that needs to be solved at present. Summary of the Invention

[0005] In view of this, embodiments of the present invention provide a method and apparatus for generating a fixed route, which can improve the operational efficiency of a carpooling service and enhance the user experience.

[0006] In a first aspect, an embodiment of the present invention provides a method for generating a fixed route, the method comprising:

[0007] Acquire an order data set within a set area, wherein the order data set includes a plurality of order data, and each order data includes a start point and an end point;

[0008] Determining a plurality of high-fever grid pairs according to the order data set, wherein each high-fever grid pair consists of two grids, one of the two grids being the grid where the starting point is located, and the other being the grid where the end point is located, and each of the grids being an area within a set range;

[0009] determining at least one high-heat route according to the plurality of high-heat grid pairs;

[0010] The at least one high-heat route is modified according to set conditions to generate at least one fixed route.

[0011] Optionally, determining a plurality of high-heat grid pairs according to the order data set specifically includes:

[0012] Aggregate multiple order data in the order data set according to the starting point and the end point to generate multiple high-heat grid pairs.

[0013] Optionally, determining at least one high-heat route according to the plurality of high-heat grid pairs specifically includes:

[0014] Sorting the plurality of high-heat grid pairs in descending order of order quantity to generate a grid pool, wherein the grid pool includes all sorted high-heat grid pairs;

[0015] Creating a route pool according to the grid pool, wherein the route pool includes a plurality of routes;

[0016] The at least one high-heat route is generated according to the route pool.

[0017] Optionally, the creating a route pool according to the grid pool specifically includes:

[0018] Obtaining the first-ranked high-heat grid pair in the grid pool to create an initial route;

[0019] Saving the initial route to the route pool;

[0020] sequentially traversing a plurality of the high-heat grid pairs to be allocated in the grid pool;

[0021] For each of the high-heat grid pairs to be allocated, in response to the high-heat grid pair satisfying a set condition, the high-heat grid pair is added to the initial route, and the initial route is updated;

[0022] Alternatively, in response to the high-heat grid pair not satisfying a set condition, a new route is created according to the high-heat grid pair, and the new route is saved in the route pool.

[0023] Optionally, the method further includes:

[0024] In response to the high-heat grid pair satisfying a set condition, the new route is updated according to the high-heat grid pair, and the updated new route is saved in the route pool.

[0025] Optionally, generating the at least one high-heat route according to the route pool specifically includes:

[0026] Acquire multiple routes in the route pool that include at least one of the high-heat grid pairs;

[0027] Determine the total order quantity for each route;

[0028] sorting the plurality of routes in descending order of order quantity;

[0029] The routes ranked in the top K positions are determined as high-heat routes, where K is a positive integer greater than or equal to 1.

[0030] Optionally, determining the total order quantity for each route specifically includes:

[0031] determining all of the high-heat grid pairs on each route;

[0032] Obtaining the order quantity of each of the high-heat grid pairs;

[0033] The sum of the order quantities of all the high-heat grid pairs is determined as the total order quantity of each route.

[0034] Optionally, the modifying the at least one high-heat route according to the set conditions to generate at least one fixed route specifically includes:

[0035] The sections of each of the high-heat routes that have reached a set value and the sections that have reached a set difficulty of travel are eliminated to generate the fixed route.

[0036] In a second aspect, an embodiment of the present invention provides a device for generating a fixed route, the device comprising:

[0037] An acquiring unit, configured to acquire an order data set within a set area, wherein the order data set includes a plurality of order data, and each order data includes a start point and an end point;

[0038] a determining unit, configured to determine a plurality of high-fever grid pairs according to the order data set, wherein each high-fever grid pair consists of two grids, one of the two grids being the grid where the starting point is located, and the other being the grid where the end point is located, and each of the grids being an area within a set range;

[0039] The determining unit is further configured to determine at least one high-heat route according to the plurality of high-heat grid pairs;

[0040] The generating unit is configured to modify the at least one high-heat route according to the condition requirements to generate at least one fixed route.

[0041] Optionally, the determining unit is specifically configured to:

[0042] Aggregate multiple order data in the order data set according to the starting point and the end point to generate multiple high-heat grid pairs.

[0043] Optionally, the determining unit is further configured to:

[0044] Sorting the plurality of high-heat grid pairs in descending order of order quantity to generate a grid pool, wherein the grid pool includes all sorted high-heat grid pairs;

[0045] Creating a route pool according to the grid pool, wherein the route pool includes a plurality of routes;

[0046] The at least one high-heat route is generated according to the route pool.

[0047] Optionally, the determining unit is specifically configured to:

[0048] Obtaining the first-ranked high-heat grid pair in the grid pool to create an initial route;

[0049] Saving the initial route to the route pool;

[0050] sequentially traversing a plurality of the high-heat grid pairs to be allocated in the grid pool;

[0051] For each of the high-heat grid pairs to be allocated, in response to the high-heat grid pair satisfying a set condition, the high-heat grid pair is added to the initial route, and the initial route is updated;

[0052] Alternatively, in response to the high-heat grid pair not satisfying a set condition, a new route is created according to the high-heat grid pair, and the new route is saved in the route pool.

[0053] Optionally, the determining unit is further configured to:

[0054] In response to the high-heat grid pair satisfying a set condition, the new route is updated according to the high-heat grid pair, and the updated new route is saved in the route pool.

[0055] Optionally, the determining unit is specifically configured to:

[0056] Acquire multiple routes in the route pool that include at least one of the high-heat grid pairs;

[0057] Determine the total order quantity for each route;

[0058] sorting the plurality of routes in descending order of order quantity;

[0059] The routes ranked in the top K positions are determined as high-heat routes, where K is a positive integer greater than or equal to 1.

[0060] Optionally, the determining unit is specifically configured to:

[0061] determining all of the high-heat grid pairs on each route;

[0062] Obtaining the order quantity of each of the high-heat grid pairs;

[0063] The sum of the order quantities of all the high-heat grid pairs is determined as the total order quantity of each route.

[0064] Optionally, the generating unit is specifically configured to:

[0065] The sections of each of the high-heat routes that have reached a set value and the sections that have reached a set difficulty of travel are eliminated to generate the fixed route.

[0066] In a third aspect, an embodiment of the present invention provides a computer-readable storage medium storing computer program instructions, which, when executed by a processor, implement a method as described in the first aspect or any possible embodiment of the first aspect.

[0067] In a fourth aspect, an embodiment of the present invention provides an electronic device comprising a memory and a processor, wherein the memory is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement a method as described in any one of the first aspect and any possible one of the first aspect.

[0068] In a fifth aspect, an embodiment of the present invention provides a computer program product, comprising a computer program / instruction, which, when executed by a processor, implements a method as described in the first aspect or any possible method of the first aspect.

[0069] In an embodiment of the present invention, an order data set within a set area is obtained, wherein the order data set includes multiple order data, and each order data includes a starting point and an end point; multiple high-heat grid pairs are determined based on the order data set, wherein each high-heat grid pair consists of two grids, one of the two grids is the grid where the starting point is located, and the other grid is the grid where the end point is located, and each of the grids is an area within a set range; at least one high-heat route is determined based on the multiple high-heat grid pairs; the at least one high-heat route is modified according to the set conditions to generate at least one fixed route. Through the above method, running a fixed vehicle according to the fixed route can improve the operational efficiency of the carpooling service and enhance the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0070] The above and other objects, features and advantages of the present invention will become more apparent through the following description of the embodiments of the present invention with reference to the accompanying drawings, in which:

[0071] Figure 1 This is a flow chart of a method for generating a fixed route according to an embodiment of the present invention;

[0072] Figure 2 This is a schematic diagram of a regional map according to an embodiment of the present invention;

[0073] Figure 3 is another schematic diagram of a regional map according to an embodiment of the present invention;

[0074] Figure 4is a flow chart of another method for generating a fixed route according to an embodiment of the present invention;

[0075] Figure 5 This is a flow chart of another method for generating a fixed route according to an embodiment of the present invention;

[0076] Figure 6 This is a schematic diagram of a device for generating a fixed route according to an embodiment of the present invention;

[0077] Figure 7 is a schematic diagram of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0078] The present disclosure is described below based on examples, but the present disclosure is not limited to these examples. Certain specific details are described in detail in the following detailed description of the present disclosure. A person skilled in the art can fully understand the present disclosure without these details. To avoid obscuring the essence of the present disclosure, well-known methods, processes, procedures, components, and circuits are not described in detail.

[0079] Furthermore, persons of ordinary skill in the art will appreciate that the figures provided herein are for illustration purposes only and are not necessarily drawn to scale.

[0080] Unless the context clearly requires otherwise, words like “include”, “comprising” and the like throughout this application should be interpreted as including rather than exclusive or exhaustive; that is, as meaning “including but not limited to”.

[0081] In the description of the present disclosure, it should be understood that the terms "first," "second," etc. are used for descriptive purposes only and are not to be understood as indicating or implying relative importance. In addition, in the description of the present disclosure, unless otherwise specified, "plurality" means two or more.

[0082] In the prior art, ride-sharing services can reduce user expenses while also lowering drivers' operating costs. For example, if a driver receives ride-sharing order B while completing order A, they can then complete order B simultaneously, increasing revenue while maintaining the same operating costs. This reduces operating costs compared to completing order A first and then accepting order B. However, ride-sharing services, upon obtaining user needs, instantly match vehicles for each user and then select the most suitable vehicle based on the vehicle's availability. However, these temporarily matched vehicles may be irrational ride-sharing strategies. Limited by the number of current ride-sharing orders and the number of available vehicles and routes, a more reasonable route may not be planned, resulting in extended travel times, low operational efficiency, and excessively high operating costs for drivers, thus creating a negative experience for both users and drivers. In particular, when minibuses are used, user fees are relatively lower due to their greater availability. However, operational efficiency requires a set number of passengers in the minibus to be improved, and existing ride-sharing methods cannot meet these requirements. Therefore, improving the operational efficiency of ride-sharing services and enhancing the user experience are currently unresolved issues.

[0083] In an embodiment of the present invention, in order to solve the above problems, a method for generating a fixed route is proposed. The flow chart of the method for generating a fixed route is as follows: Figure 1 As shown, specifically including:

[0084] Step S101: Acquire a set of order data within a set area.

[0085] The order data set includes multiple order data, and each order data includes a starting point and an end point.

[0086] In one possible implementation, the set area is an administrative area, such as a city area, a town area, a district area, etc.; the set area can also be an area of ​​a certain size, such as a circular area with a diameter of 10 kilometers (km), or a square area with a length of 20 km, etc. The multiple independent geographical units formed after each area (geographical range) is gridded can be called grids, each grid includes an area of ​​the set range, and the shape of the grid can be square, diamond, circular or hexagonal, etc. The specific size and shape can be determined according to actual conditions.

[0087] In a possible implementation, taking a map of a region as an example, specifically Figure 2 As shown, the region includes multiple grids, for example, grid 1, grid 2, grid 3, grid 4, grid 5, grid 6, grid 7, grid 8, grid 9, ... grid N.

[0088] In a possible implementation, the order data may be completed order data, or may be user query order data. The order data may also be referred to as bubble order data.

[0089] Step S102: determining a plurality of high-heat grid pairs according to the order data set.

[0090] Among them, the high-heat grid pair refers to the two grids where the travel demand is relatively dense. For example, if the travel demand from grid A to grid B is significant, then grid A and grid B constitute a pair of high-heat grid pairs, or, if the travel demand from grid B to grid A is significant, then grid B and grid A constitute a pair of high-heat grid pairs; that is, each of the high-heat grid pairs is composed of two grids, one of the two grids is the grid where the starting point is located, and the other grid is the grid where the end point is located, and each of the grids is an area within a set range.

[0091] Specifically, multiple order data in the order data set are aggregated according to the starting point and the end point to generate multiple high-heat grid pairs.

[0092] In a possible implementation, spatial demand aggregation and temporal demand aggregation are performed on multiple order data in the order data set according to the starting point and the end point, wherein the spatial demand aggregation is to determine the hot sites in each grid based on the statistical heat information of the starting point or end point in the order data, and any pair of hot sites can be regarded as the spatial aggregation result of the demand carried in the grid; the temporal demand aggregation refers to aggregating the demand of the same starting point and end point pair in different time periods within a certain time range, and regards it as the result of demand aggregation by time; grid pairs with significant demand are determined, that is, grid pairs with more order data are determined, for example, Figure 3 As shown, the grid 1 and the grid 2 are a grid pair, the grid 1 and the grid 3 are a grid pair, the grid 1 and the grid 4 are a grid pair, and the grid 1 and the grid 5 are a grid pair, which will not be described in detail here.

[0093] In a possible implementation, after a plurality of grid pairs are determined, they are sorted from large to small according to the number of orders in each grid pair, and the top N grid pairs are determined as high-heat grid pairs.

[0094] Step S103: determining at least one high-heat route according to the plurality of high-heat grid pairs.

[0095] In a possible implementation, the determining of at least one high-heat route according to the plurality of high-heat grid pairs is as follows: Figure 4 As shown, including the following:

[0096] Step S401: sort the plurality of high-heat grid pairs in descending order of order quantity to generate a grid pool.

[0097] Specifically, the lattice pool includes all sorted high-temperature lattice pairs.

[0098] Step S402: Create a route pool based on the grid pool.

[0099] Specifically, the route pool includes multiple routes.

[0100] In a possible implementation, creating a route pool based on the grid pool specifically includes: obtaining the high-heat grid pair ranked first in the grid pool to create an initial route; saving the initial route to the route pool; traversing the multiple high-heat grid pairs to be assigned in the grid pool in turn; for each high-heat grid pair to be assigned, in response to the high-heat grid pair meeting the set conditions, adding the high-heat grid pair to the initial route and updating the initial route; or, in response to the high-heat grid pair not meeting the set conditions, creating a new route based on the high-heat grid pair, and saving the new route to the route pool.

[0101] In a possible implementation, in response to the high-heat grid pair satisfying a set condition, the new route is updated according to the high-heat grid pair, and the updated new route is saved in the route pool.

[0102] In an embodiment of the present invention, the setting conditions include ease of travel, maximum detour ratio, vehicle carrying capacity, etc., wherein the ease of travel is an indicator used to describe the smoothness of passing through location C in the process of traveling from location A to location B. The specific calculation method is: the distance directly from A to B is recorded as k, and the total distance from A through C to B is recorded as x, and the ease of travel is equal to the ratio of x divided by k; the ease of travel indicator can effectively reflect the smoothness of route selection. The closer the ease of travel is to 1, the closer the route passing through C is to the route directly from A to B, and the better the ease of travel. Therefore, when the ease of travel is less than the set threshold, the traversed high-heat grid pairs can be added to the existing route. This is only an example.

[0103] In one possible implementation, the maximum detour ratio can be the maximum detour ratio from each starting point to the site, or the maximum detour ratio of any sub-segment on the route; the vehicle carrying capacity is the maximum carrying capacity of a single transport on each route; the setting condition can also be the minimum carrying capacity for each sub-trip segment, etc., which is determined according to actual conditions.

[0104] Step S403: Generate the at least one high-heat route according to the route pool.

[0105] Specifically, a plurality of routes containing at least one of the high-heat grid pairs are obtained from the route pool; the total number of orders for each route is determined; the plurality of routes are sorted in descending order of the order quantity; and the routes ranked in the top K positions are determined as high-heat routes, where K is a positive integer greater than or equal to 1.

[0106] In one possible implementation, after determining the routes ranked in the top K positions, the total number of orders in the routes ranked in the top K positions is determined, and the total number of orders in the routes ranked in the top K positions this time is compared with the total number of orders in the routes ranked in the top K positions in the previous allocation plan. If the total number of orders in the routes ranked in the top K positions this time is greater than the total number of orders in the routes ranked in the top K positions in the previous allocation plan, the routes ranked in the top K positions this time are determined as high-heat routes; if the total number of orders in the routes ranked in the top K positions this time is less than or equal to the total number of orders in the routes ranked in the top K positions in the previous allocation plan, the high-heat grid pairs in the routes ranked after K are put back into the grid pool for traversal to determine the routes suitable for joining, and so on, and the high-heat routes are updated once every set time.

[0107] In one possible implementation, determining the total number of orders for each route specifically includes: determining all the high-heat grid pairs on each route; obtaining the order quantity of each high-heat grid pair; and determining the sum of the order quantities of all the high-heat grid pairs as the total number of orders for each route.

[0108] For example, assuming that route 1 includes three pairs of high-heat grid pairs consisting of grid 1 and grid 2, grid 3 and grid 8, grid 5 and grid 4, determine the order quantity of each high-heat grid pair. Assuming that the order quantity of grid 1 and grid 2 is 400, the order quantity of grid 3 and grid 8 is 700, and the order quantity of grid 5 and grid 4 is 600, then the total order quantity of route 1 is equal to the sum of 400, 700 and 600, that is, the total order quantity of route 1 is 1700.

[0109] In a possible implementation, since each grid may include multiple sites, after determining the high-heat grid pairs in the high-heat route, the high-heat sites in the grid to be used may be further determined.

[0110] Step S104: modify the at least one high-heat route according to the set conditions to generate at least one fixed route.

[0111] Specifically, sections of each of the high-heat routes that have reached a set value and sections that have reached a set difficulty of travel are removed to generate the fixed route.

[0112] In the embodiment of the present invention, the above method can generate a fixed route that not only meets the requirement of accessibility but also ensures traffic efficiency.

[0113] The following describes in detail the process of generating a high-heat route from a plurality of high-heat grids through a specific embodiment. Figure 5 As shown:

[0114] Step S501: sort the plurality of high-heat grid pairs in descending order according to order quantity to generate a grid pool to be allocated.

[0115] The grid pool is divided into two parts, one part is an allocated grid pool consisting of allocated high-heat grid pairs, and the other part is a to-be-allocated grid pool consisting of unallocated high-heat grid pairs.

[0116] Step S502 , query whether there is a high-temperature grid pair to be allocated in the grid pool to be allocated, if so, execute step S503 , if not, execute step S507 .

[0117] Step S503: Obtain the candidate high-heat grid pair with the largest number of orders in the grid pool to be allocated, and determine whether the candidate high-heat grid pair can be added to the existing route. If so, execute step S504; if not, execute step S506.

[0118] Step S504: adding the candidate high-heat grid pair to the most efficient existing route, and updating the existing route.

[0119] Among them, the most efficient existing route is the route with the smallest new distance. That is to say, when there are multiple existing routes at the same time, the candidate high-heat grid pair will be added to the route with the smallest new distance when added.

[0120] Step S505: Add the updated existing route to the route pool.

[0121] Step S506: Create a new route based on the candidate high-heat grid pair, and then execute step S505.

[0122] Step S507: Filter the route pool to retain routes containing at least one high-heat grid pair.

[0123] Step S508: Retain the top K routes according to the order quantity, and determine whether the total popularity of the top K routes currently ranked is greater than the total popularity of the top K routes in the previous allocation plan. If not, execute step S509; if so, execute step S510.

[0124] The total popularity refers to the total number of orders.

[0125] Step S509: Determine the routes ranked in the top K positions in this ranking as high-heat routes.

[0126] Step S510: Put the high-heat grid pairs in the route sorted after K back into the grid pool, and return to step S502.

[0127] In an embodiment of the present invention, operating a fixed vehicle according to the fixed route during a specific time period can improve the operational efficiency of the carpooling service, so that there are more shared ride segments during the operation of the vehicle, and each shared ride segment has at least two passengers. The more passengers in the shared ride segment, the lower the travel cost for each passenger, the higher the seat utilization rate of the vehicle, and it is also more environmentally friendly.

[0128] Figure 6 FIG. 1 is a schematic diagram of a device for generating a fixed route according to an embodiment of the present invention. Figure 6 As shown, the apparatus of this embodiment includes an acquiring unit 601 , a determining unit 602 , and a generating unit 603 .

[0129] Among them, the acquisition unit 601 is used to obtain an order data set within a set area, wherein the order data set includes multiple order data, and each order data includes a starting point and an end point; the determination unit 602 is used to determine multiple high-heat grid pairs based on the order data set, wherein each high-heat grid pair consists of two grids, one of the two grids is the grid where the starting point is located, and the other grid is the grid where the end point is located, and each of the grids is an area within a set range; the determination unit 602 is also used to determine at least one high-heat route based on the multiple high-heat grid pairs; the generation unit 603 is used to modify the at least one high-heat route according to the condition requirements to generate at least one fixed route.

[0130] Furthermore, the determining unit is specifically configured to:

[0131] Aggregate multiple order data in the order data set according to the starting point and the end point to generate multiple high-heat grid pairs.

[0132] Furthermore, the determining unit is further configured to:

[0133] Sorting the plurality of high-heat grid pairs in descending order of order quantity to generate a grid pool, wherein the grid pool includes all sorted high-heat grid pairs;

[0134] Creating a route pool according to the grid pool, wherein the route pool includes a plurality of routes;

[0135] The at least one high-heat route is generated according to the route pool.

[0136] Furthermore, the determining unit is specifically configured to:

[0137] Obtaining the first-ranked high-heat grid pair in the grid pool to create an initial route;

[0138] Saving the initial route to the route pool;

[0139] sequentially traversing a plurality of the high-heat grid pairs to be allocated in the grid pool;

[0140] For each of the high-heat grid pairs to be allocated, in response to the high-heat grid pair satisfying a set condition, the high-heat grid pair is added to the initial route, and the initial route is updated;

[0141] Alternatively, in response to the high-heat grid pair not satisfying a set condition, a new route is created according to the high-heat grid pair, and the new route is saved in the route pool.

[0142] Furthermore, the determining unit is further configured to:

[0143] In response to the high-heat grid pair satisfying a set condition, the new route is updated according to the high-heat grid pair, and the updated new route is saved in the route pool.

[0144] Furthermore, the determining unit is specifically configured to:

[0145] Acquire multiple routes in the route pool that include at least one of the high-heat grid pairs;

[0146] Determine the total order quantity for each route;

[0147] sorting the plurality of routes in descending order of order quantity;

[0148] The routes ranked in the top K positions are determined as high-heat routes, where K is a positive integer greater than or equal to 1.

[0149] Furthermore, the determining unit is specifically configured to:

[0150] determining all of the high-heat grid pairs on each route;

[0151] Obtaining the order quantity of each of the high-heat grid pairs;

[0152] The sum of the order quantities of all the high-heat grid pairs is determined as the total order quantity of each route.

[0153] Furthermore, the generating unit is specifically configured to:

[0154] The sections of each of the high-heat routes that have reached a set value and the sections that have reached a set difficulty of travel are eliminated to generate the fixed route.

[0155] Figure 7 Schematic diagram of an electronic device according to an embodiment of the present invention. Figure 7 As shown, Figure 7 The electronic device shown is a device for generating fixed routes. It includes a general computer hardware structure, including at least a processor 701 and a memory 702. The processor 701 and the memory 702 are connected via a bus 703. The memory 702 is suitable for storing instructions or programs executable by the processor 701. The processor 701 can be a standalone microprocessor or a collection of one or more microprocessors. Thus, by executing the instructions stored in the memory 702, the processor 701 performs the method flow described above in the embodiments of the present invention, processing data and controlling other devices. The bus 703 connects the aforementioned components together and also connects them to a display controller 704 and a display device, as well as an input / output (I / O) device 705. The I / O device 705 can be a mouse, keyboard, modem, network interface, touch input device, motion input device, printer, or other devices known in the art. Typically, the I / O device 705 is connected to the system via an I / O controller 706.

[0156] Among them, the instructions stored in the memory 702 are executed by at least one processor 701 to achieve: obtaining an order data set within a set area, wherein the order data set includes multiple order data, and each order data includes a starting point and an end point; determining multiple high-heat grid pairs based on the order data set, wherein each high-heat grid pair consists of two grids, one of the two grids is the grid where the starting point is located, and the other grid is the grid where the end point is located, and each of the grids is an area within a set range; determining at least one high-heat route based on the multiple high-heat grid pairs; and correcting the at least one high-heat route according to the set conditions to generate at least one fixed route.

[0157] Specifically, the electronic device includes: one or more processors 701 and a memory 702, Figure 7 Take a processor 701 as an example. The processor 701 and the memory 702 may be connected via a bus or other means. Figure 7 In the example, a bus connection is used. Memory 702, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer executable programs, and modules. Processor 701 executes the non-volatile software programs, instructions, and modules stored in memory 702 to perform various functional applications and data processing of the device, thereby implementing the above-mentioned method for generating a fixed route.

[0158] The memory 702 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store a list of options, etc. In addition, the memory 702 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the memory 702 may optionally include a memory remotely located relative to the processor 701, and these remote memories may be connected to an external device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0159] One or more modules are stored in the memory 702 , and when executed by one or more processors 701 , perform the method for generating a fixed route in any of the above method embodiments.

[0160] The above-mentioned product can execute the method provided in the embodiment of this application, and has the functional modules and beneficial effects corresponding to the execution method. For technical details not fully described in this embodiment, please refer to the method provided in the embodiment of this application.

[0161] An embodiment of the present invention relates to a non-volatile storage medium for storing a computer-readable program, wherein the computer-readable program is used for enabling a computer to execute part or all of the above method embodiments.

[0162] That is, those skilled in the art will understand that all or part of the steps in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a program. The program is stored in a storage medium and includes a number of instructions for causing a device (which may be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps in the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a USB flash drive, a mobile hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, etc., various media that can store program code.

[0163] Those skilled in the art will appreciate that the above embodiments are specific embodiments for implementing the present invention, and that in actual applications, various changes may be made thereto in form and detail without departing from the spirit and scope of the present invention.

[0164] Any solutions described in this specification and in the examples that involve the processing of personal information will be processed only with a legitimate basis (such as with the consent of the personal information subject or as necessary for the performance of a contract) and only within the prescribed or agreed scope. A user's refusal to process personal information other than that required for basic functions will not affect their use of these functions.

Claims

1. A method for generating a fixed route, characterized in that: The method includes: Acquire an order data set within a set area, wherein the order data set includes a plurality of order data, and each order data includes a start point and an end point; Determining a plurality of high-fever grid pairs according to the order data set, wherein each high-fever grid pair consists of two grids, one of the two grids being the grid where the starting point is located, and the other being the grid where the end point is located, and each of the grids being an area within a set range; determining at least one high-heat route according to the plurality of high-heat grid pairs; Modifying the at least one high-heat route according to set conditions to generate at least one fixed route; The step of determining at least one high-heat route according to the plurality of high-heat grid pairs specifically includes: The multiple high-heat grid pairs are sorted in descending order of order quantity to generate a grid pool, wherein the grid pool includes all sorted high-heat grid pairs; an initial route is created according to the high-heat grid pair ranked first in the grid pool, and after traversing the multiple high-heat grid pairs to be allocated in the grid pool, a route pool including multiple routes is created according to the set conditions of the degree of convenience, the maximum detour ratio and / or the vehicle carrying capacity; and the at least one high-heat route is generated according to the route pool.

2. The method according to claim 1, wherein Determining a plurality of high-heat grid pairs according to the order data set specifically includes: Aggregate multiple order data in the order data set according to the starting point and the end point to generate multiple high-heat grid pairs.

3. The method according to claim 1, wherein The creating of a route pool according to the grid pool specifically includes: Obtaining the first-ranked high-heat grid pair in the grid pool to create an initial route; Saving the initial route to the route pool; sequentially traversing a plurality of the high-heat grid pairs to be allocated in the grid pool; For each of the high-heat grid pairs to be allocated, in response to the high-heat grid pair satisfying a set condition, the high-heat grid pair is added to the initial route, and the initial route is updated; Alternatively, in response to the high-heat grid pair not satisfying a set condition, a new route is created according to the high-heat grid pair, and the new route is saved in the route pool.

4. The method according to claim 3, wherein The method further comprises: In response to the high-heat grid pair satisfying a set condition, the new route is updated according to the high-heat grid pair, and the updated new route is saved in the route pool.

5. The method according to claim 1, wherein Generating the at least one high-heat route according to the route pool specifically includes: Acquire multiple routes in the route pool that include at least one of the high-heat grid pairs; Determine the total order quantity for each route; sorting the plurality of routes in descending order of order quantity; The routes ranked in the top K positions are determined as high-heat routes, where K is a positive integer greater than or equal to 1.

6. The method according to claim 5, wherein Determining the total order quantity for each route specifically includes: determining all of the high-heat grid pairs on each route; Obtaining the order quantity of each of the high-heat grid pairs; The sum of the order quantities of all the high-heat grid pairs is determined as the total order quantity of each route.

7. The method according to claim 1, wherein The modifying of the at least one high-heat route according to the set conditions to generate at least one fixed route specifically includes: The sections of each of the high-heat routes that have reached a set value and the sections that have reached a set difficulty of travel are eliminated to generate the fixed route.

8. A device for generating a fixed route, characterized in that: The device includes: An acquiring unit, configured to acquire an order data set within a set area, wherein the order data set includes a plurality of order data, and each order data includes a start point and an end point; a determining unit, configured to determine a plurality of high-fever grid pairs according to the order data set, wherein each high-fever grid pair consists of two grids, one of the two grids being the grid where the starting point is located, and the other being the grid where the end point is located, and each of the grids being an area within a set range; The determining unit is further configured to determine at least one high-heat route according to the plurality of high-heat grid pairs; a generating unit, configured to modify the at least one high-heat route according to the condition requirements to generate at least one fixed route; Among them, the determination unit is specifically used to: sort the multiple high-heat grid pairs in order from large to small according to the order quantity to generate a grid pool, wherein the grid pool includes all sorted high-heat grid pairs; create an initial route according to the high-heat grid pair ranked first in the grid pool, and after traversing the multiple high-heat grid pairs to be allocated in the grid pool, create a route pool including multiple routes according to the convenience, maximum detour ratio and / or vehicle carrying capacity as set conditions; generate the at least one high-heat route according to the route pool.

9. A computer-readable storage medium storing computer program instructions, characterized in that: The computer program instructions implement the method according to any one of claims 1 to 7 when executed by a processor.

10. An electronic device comprising a memory and a processor, characterized in that: The memory is configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method according to any one of claims 1 to 7.

11. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images