Order dispatching management method and device and storage medium

By identifying key areas in the city and generating independent dispatch pools and dynamically adjusting the dispatch strategy, the problem of insufficient operational efficiency and flexibility in the existing technology is solved, and the refined operation and efficient management of travel services are achieved.

CN119006114APending Publication Date: 2024-11-22智行盒子(河南)科技有限公司
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411164650.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-23
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

The existing order management strategy focuses on urban-level macro-control, ignoring the differentiated needs of different regions in the city, resulting in low operational efficiency and management flexibility of travel services, and the inability to achieve refined operation management.

Method used

By determining the key areas in the city, an independent regional dispatch pool is generated, and the dispatching operations are carried out according to the dispatching strategies of each region, the dispatching strategy is dynamically adjusted to adapt to changes in supply and demand, and converted to manual configuration mode to improve efficiency and flexibility .

Benefits of technology

It improves the overall operational efficiency and management flexibility of travel services, realizes targeted order dispatch management, adapts to the complex and changeable urban transportation ecology and diversified passenger needs, and alleviates the system burden and dispatch delays during peak periods.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119006114A_ABST
    Figure CN119006114A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides an order dispatching management method and device and a storage medium, and relates to the technical field of online car-hailing. The method comprises the following steps: determining at least one key area of a target city, and generating an area dispatching pool corresponding to each key area; and respectively acquiring an order dispatching strategy corresponding to each regional order dispatching pool, and respectively executing order dispatching operation on the corresponding regional order dispatching pool based on each order dispatching strategy. According to the embodiment of the invention, the key areas in the city are determined, the independent order dispatching pools are generated respectively, and the order dispatching operation is carried out according to the order dispatching strategy corresponding to each key area, so that targeted order dispatching management can be carried out on the key areas, and the overall operation efficiency and management flexibility of travel service are effectively improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of online car-hailing technology, and more specifically, to a dispatch management method, device and storage medium. Background Art

[0002] With the booming travel service industry, people have higher and higher requirements for the quality and efficiency of travel services. Achieving fast and accurate order matching between passengers and drivers is the key to improving the quality and efficiency of travel services. However, existing order management strategies generally focus on macro-control at the city level, ignoring the differentiated needs of different regions within the city, and are unable to achieve refined operational management of different regions, resulting in low overall operational efficiency and management flexibility of travel services. Summary of the invention

[0003] The purpose of the embodiments of the present application is to provide an order management method, device and storage medium to improve the overall operational efficiency and management flexibility of travel services.

[0004] In a first aspect, an embodiment of the present application provides an order management method, including:

[0005] Determine at least one key area of ​​the target city and generate a regional dispatch pool corresponding to each key area;

[0006] The dispatch strategies corresponding to each regional dispatch pool are obtained respectively, and dispatch operations are performed on the corresponding regional dispatch pools based on each dispatch strategy.

[0007] In an embodiment of the present application, by determining the key areas in the city and generating independent dispatch pools for each of them, dispatch operations are performed according to the corresponding dispatch strategies of each key area, so that targeted dispatch management can be performed on the key areas, effectively improving the overall operational efficiency and management flexibility of the travel service.

[0008] In some possible embodiments, determining at least one key area of ​​the target city includes:

[0009] Divide the target city into grid units and obtain historical order data corresponding to each grid unit;

[0010] Filtering out a number of candidate grid units that meet preset conditions based on the historical order data;

[0011] At least one key area of ​​the target city is determined based on the plurality of candidate grid cells.

[0012] In the embodiment of the present application, candidate grid units of the target city are screened out according to historical order data, and key areas of the target city are identified based on these candidate grid units, thereby further improving the flexibility of identifying key areas.

[0013] In some possible embodiments, the step of selecting a plurality of candidate grid units that meet preset conditions based on the historical order data includes:

[0014] Determine the number of orders for each grid unit in a preset historical period based on the historical order data, and screen the grid units whose order numbers exceed a preset first threshold to obtain a number of candidate grid units;

[0015] Alternatively, the supply-demand ratio of each grid unit in a preset historical period is determined based on the historical order data, and grid units whose supply-demand ratio exceeds a preset second threshold are screened to obtain a plurality of candidate grid units.

[0016] In the embodiment of the present application, candidate grid units are screened by the order quantity or supply-demand ratio of each grid unit, thereby further improving the flexibility of identifying key areas.

[0017] In some possible embodiments, determining at least one key area of ​​the target city based on the plurality of candidate grid units includes:

[0018] Determine at least one candidate grid unit cluster from the plurality of candidate grid units, and determine a corresponding key area based on each of the candidate grid unit sets; wherein the candidate grid unit cluster is a grid unit cluster whose number of connected candidate grid units exceeds a preset first number threshold;

[0019] Alternatively, a traversal search is performed on the target city after the grid unit division based on a preset sliding pane range, the number of candidate grid units contained in the sliding pane range each time is counted, and the corresponding key area is determined based on the sliding pane range in which the number of candidate grid units exceeds a second preset number threshold.

[0020] In the embodiment of the present application, the corresponding key area is determined based on the connected candidate grid unit clusters or the number of candidate grid units in the sliding pane range, thereby further improving the flexibility of identifying the key area.

[0021] In some possible embodiments, respectively obtaining the dispatching strategies corresponding to the regional dispatching pools, and performing dispatching operations on the corresponding regional dispatching pools based on the dispatching strategies, includes:

[0022] Determine the applicable time periods corresponding to the key areas respectively, and enable the regional dispatch pools of the corresponding key areas based on the applicable time periods;

[0023] For enabled regional dispatch pools, obtain the dispatch strategies corresponding to each regional dispatch pool respectively, and execute dispatch operations on the corresponding regional dispatch pools based on each dispatch strategy.

[0024] In an embodiment of the present application, the regional dispatch pool of each key area is enabled in a timely manner according to applicable time period conditions, thereby further improving the flexibility of key area dispatch management.

[0025] In some possible embodiments, after respectively acquiring the dispatch strategies corresponding to the regional dispatch pools and respectively executing dispatch operations on the corresponding regional dispatch pools based on the dispatch strategies, the method further includes:

[0026] Obtain the supply and demand information of each regional dispatch pool in real time, and dynamically adjust the dispatch strategy corresponding to each regional dispatch pool based on the supply and demand information;

[0027] Based on the dynamically adjusted dispatch strategy, dispatch operations are performed on the corresponding regional dispatch pools.

[0028] In an embodiment of the present application, the dispatching strategy corresponding to each regional dispatching pool is dynamically adjusted according to the supply and demand information obtained in real time, thereby further improving the efficiency and flexibility of dispatching in key areas.

[0029] In some possible embodiments, after respectively acquiring the dispatch strategies corresponding to the regional dispatch pools and respectively executing dispatch operations on the corresponding regional dispatch pools based on the dispatch strategies, the method further includes:

[0030] When it is determined that the target area dispatch pool in the various area dispatch pools meets the preset manual configuration condition, the target area dispatch pool is switched to a manual configuration mode;

[0031] The target dispatching strategy corresponding to the target area dispatching pool is determined based on the configuration parameters set in the manual configuration mode, and dispatching operations are performed on the target area dispatching pool based on the target dispatching strategy.

[0032] In an embodiment of the present application, the efficiency and flexibility of dispatch management in key areas are further improved by converting the dispatch pool that meets the conditions into a manual configuration mode.

[0033] In a second aspect, an embodiment of the present application provides an order management device, including:

[0034] The dispatch pool generation module is used to determine at least one key area of ​​the target city and generate a regional dispatch pool corresponding to each key area;

[0035] The dispatch management module is used to obtain the dispatch strategies corresponding to each regional dispatch pool respectively, and execute dispatch operations on the corresponding regional dispatch pool based on each dispatch strategy.

[0036] In a third aspect, an embodiment of the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor can implement the method described in any embodiment of the first aspect when executing the program.

[0037] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the method described in any embodiment of the first aspect can be implemented.

[0038] In a fifth aspect, an embodiment of the present application provides a computer program product, wherein the computer program product includes a computer program, wherein when the computer program is executed by a processor, the method described in any embodiment of the first aspect can be implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0040] Figure 1 A flowchart of a dispatch management method provided in an embodiment of the present application;

[0041] Figure 2 A schematic diagram of the structure of a dispatch management device provided in an embodiment of the present application;

[0042] Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0043] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0044] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0045] The order pool configuration of the existing solution is: multiple order pools are divided according to the city dimension. Assuming that the maximum number of orders to be dispatched at any time during the peak period in the city is 5,000, and each order pool is expected to store a maximum of 1,000 orders, the number of order pools divided for the city is 5,000 / 1,000=5.

[0046] The order allocation mechanism is configured as follows: a simplified strategy based on order ID modulus is adopted to allocate new orders to different dispatch pools. Although this method achieves basic load balancing, it ignores the actual geographical location of the order, time factors and driver capacity, resulting in a lack of pertinence and optimization space in the allocation process, which is not conducive to the subsequent refined dispatch management.

[0047] The dispatch execution logic is configured as follows: a single dispatch task is started at the city level, and the number of orders processed for each task is set to X; the dispatch process follows a fixed sequence, and if there are no sufficient orders in the current dispatch pool, orders are extracted from the next pool in turn until X orders are collected. This logic ignores the potential of parallel processing, especially during peak traffic periods in cities, which may increase the burden on the system and limit dispatch efficiency and response speed.

[0048] In summary, the existing dispatch system has at least the following defects: 1. The order allocation strategy of simple modular distribution ignores key factors such as geography and time, and cannot achieve on-demand and efficient order-driver matching, affecting user experience and system performance; 2. It fails to fully utilize the advantages of modern distributed computing and does not support parallel dispatch within urban areas, resulting in limited system processing capabilities in high-traffic scenarios, which easily forms a dispatch bottleneck; 3. The strategy of taking orders in the order of dispatch pool numbers may, in some cases, cause the waiting time of orders in the subsequent pool to be too long, especially when the dispatch demand is concentrated in a few areas, further exacerbating service delays.

[0049] It should be noted that the key to improving the quality and efficiency of travel services lies in achieving fast and accurate matching between passengers and drivers. However, existing dispatch management solutions face many challenges:

[0050] On the one hand, traditional dispatch mechanisms are mostly based on a unified perspective across the city, which shows its limitations when dealing with super-large cities or super-large-scale orders. Peak orders during peak hours or in specific areas can easily lead to delays in dispatching orders and imbalanced resource allocation, which not only weakens user satisfaction, but also seriously restricts the operating efficiency of the service platform. Especially in hot spots where orders are highly concentrated, a single dispatch resource pool design is difficult to support high-intensity concurrent requests, frequently causing system overloads, and greatly reducing the dispatch response speed and success rate.

[0051] On the other hand, the existing policy configuration generally focuses on macro-control at the city level, ignoring the differentiated needs within the region. For megacities with large scale and significant regional characteristics, this "one-size-fits-all" policy configuration method is particularly insufficient and cannot effectively support refined operations and management by regional segmentation. Due to the lack of targeted regional policy customization, the flexibility and efficiency of services are limited, making it difficult to adapt to the complex and changing urban transportation ecology and the diverse needs of passengers.

[0052] In response to the problems existing in the above-mentioned prior art, an embodiment of the present application provides a dispatch management method, which can effectively improve the efficiency and flexibility of the overall dispatch management by constructing an independent dispatch pool for key areas of the city and implementing targeted dispatch management.

[0053] like Figure 1 As shown, the embodiment of the present application provides a dispatch management method, which may include the steps of:

[0054] S1. Determine at least one key area of ​​the target city, and generate a regional dispatch pool corresponding to each key area.

[0055] Specifically, first determine one or more key areas of the target city. It should be noted that key areas can be identified and configured for different cities in advance, and the key area information table corresponding to each city can be saved; illustratively, some CBD areas in the city, areas with higher order density selected according to the order heat map, etc. can be marked as key areas; corresponding areas can also be designated as key areas (the corresponding applicable time period can be configured) according to actual emergencies and events (such as concerts, expositions, etc.). Each key area can usually be a circular area range, that is, an area with a certain position as the center and within a certain radius; the key area can also be other polygons such as rectangles and hexagons, which can be set according to needs, and the size and shape of each key area can be the same or different.

[0056] Then, for the determined one or more key areas, a corresponding regional dispatch pool is generated, and a one-to-one correspondence is established between the regional dispatch pool and the key area. Position matching is performed based on the starting point of the order placed by the passenger to determine whether the order falls within the key area and which key area it falls within.

[0057] Exemplarily, the dispatch pool of the target city can be divided into one or more regional dispatch pools and one public default dispatch pool. Each key area corresponds to a regional dispatch pool, and areas other than the key areas correspond to the public default dispatch pool, which adopts the traditional ordinary dispatch strategy. Assume that the target city contains n key areas: R1, R2...Rn; and assume that the R1 area contains m hexagonal grid units: H1, H2...Hm; then if the grid unit corresponding to the starting point of the passenger's order is H2, the order will be assigned to the R1 regional dispatch pool; if the grid unit corresponding to the starting point of the passenger's order does not match the corresponding hexagonal grid id in {R1, R2...Rn}, the order will be assigned to the public default dispatch pool.

[0058] S2. Obtain the dispatch strategies corresponding to each regional dispatch pool respectively, and execute dispatch operations on the corresponding regional dispatch pool based on each dispatch strategy.

[0059] It should be noted that after generating the regional dispatch pools corresponding to each key area, the pre-configured default strategy for the key area can be obtained as the dispatch strategy corresponding to each regional dispatch pool. It is understandable that the designated key areas have the characteristics of large traffic changes, large capacity changes, and large order volumes, so these key areas need to be focused on. Compared with the public default dispatch pools for non-key areas, more targeted, flexible and scalable dispatch strategies can be configured for key areas.

[0060] It is understandable that the dispatch strategy includes dispatch parameters such as dispatch interval and driver listening radius. The default strategy corresponding to each key area may be different, and can be pre-configured according to the characteristics of each key area. It should be noted that the same key area may also correspond to multiple pre-configured dispatch strategies. When performing dispatch operations, the corresponding dispatch strategy is matched and obtained in real time according to the current time or order flow status, so as to achieve adaptive adjustment of the dispatch strategy. For example, for the regional dispatch pool corresponding to the key area of ​​CBD, based on the preset multiple dispatch strategies, the first dispatch strategy is executed during rush hour (e.g. 7:00-9:00, 18:00-20:00), and the second dispatch strategy is executed in other time periods; or, the third dispatch strategy is executed on weekdays, and the fourth dispatch strategy is executed on holidays.

[0061] In addition, the regional dispatch pools in each key area adopt a concurrent dispatch execution architecture, which enables each dispatch pool to independently and collaboratively execute dispatch operations. By introducing a concurrent dispatch execution mechanism, the dispatch load of a single node is distributed to multiple nodes, thus significantly enhancing the system's throughput and response speed, especially in high-load scenarios, effectively alleviating dispatch delays and ensuring service continuity and reliability.

[0062] It should be noted that in the process of dispatching orders, the real-time verification logic of the vehicle status can also be integrated. When binding an order to a vehicle, a distributed task lock is used for management so that when an order is dispatched to a vehicle, the vehicle has no other orders, so as to avoid the situation where a vehicle on the border of an adjacent area is dispatched by two areas at the same time when multiple dispatch pools execute dispatch tasks in parallel. Based on this, the problem of repeated assignment of vehicles across the boundaries of dispatch pools is effectively prevented, ensuring the accuracy and rapid response of dispatch decisions, especially in the case of a sharp increase in orders caused by traffic peaks or emergencies, which can demonstrate excellent system resilience and processing efficiency.

[0063] In some possible embodiments, in step S1, determining at least one key area of ​​the target city may include:

[0064] S101, dividing the target city into grid units, and obtaining historical order data corresponding to each grid unit;

[0065] S102, screening out a number of candidate grid units that meet preset conditions based on historical order data;

[0066] S103: Determine at least one key area of ​​the target city based on a number of candidate grid units.

[0067] It should be noted that when determining at least one key area of ​​the target city, in addition to manual designation, automatic intelligent site selection can also be performed based on order heat maps and geographic information systems.

[0068] Exemplarily, the target city can be divided into grid units (usually hexagonal grids), and the historical order data corresponding to each grid unit can be obtained; qualified candidate grid units can be screened out according to preset conditions, and the preset condition can be whether the number of historical orders in a preset time period exceeds a set value. If so, the grid unit is screened as a candidate grid unit; after all qualified candidate grid units are screened out, the corresponding key areas are determined based on these candidate grid units, for example, multiple relatively concentrated candidate grid units are determined as a key area.

[0069] In some possible embodiments, step S102, screening out a number of candidate grid units that meet preset conditions based on historical order data, may include the following two methods:

[0070] S1022. Determine the order quantity of each grid unit in a preset historical period based on the historical order data, and screen the grid units whose order quantity exceeds a preset first threshold to obtain a number of candidate grid units.

[0071] Specifically, a first threshold of the order quantity can be pre-set, and the order quantity of each grid unit in the same preset historical period can be counted one by one (for example, the order volume of the grid unit on all holidays in the past month). If the order quantity exceeds the first threshold, it is identified as a candidate grid unit.

[0072] S1023. Determine the supply-demand ratio of each grid unit in a preset historical period based on the historical order data, and screen the grid units whose supply-demand ratio exceeds a preset second threshold to obtain a number of candidate grid units.

[0073] Specifically, a second threshold of the supply-demand ratio can be set in advance, and the supply-demand ratio of each grid unit in the same preset historical period can be counted one by one (for example, the supply-demand ratio of the grid unit for all holidays in the past month). If the supply-demand ratio exceeds (greater than or less than) the second threshold, it is identified as a candidate grid unit.

[0074] It should be noted that for a grid unit in the same historical period, its order density is: grid order number / grid unit area; its vehicle density is: grid vehicle number / grid unit area; then the grid unit supply-demand ratio is: vehicle density / order density. Generally speaking, if the supply-demand ratio>1, it means that supply exceeds demand; if the supply-demand ratio=1, supply and demand are balanced; if the supply-demand ratio<1, it means that supply is less than demand.

[0075] In some possible embodiments, step S103, determining at least one key area of ​​the target city based on a number of candidate grid units, may include the following two methods:

[0076] S1031. Determine at least one candidate grid unit cluster from a number of candidate grid units, and determine a corresponding key area based on each candidate grid unit set; wherein the candidate grid unit cluster is a grid unit cluster whose number of connected candidate grid units exceeds a preset first number threshold.

[0077] Specifically, if there are connected grid unit clusters exceeding the first number threshold, it means that the area near this grid unit cluster is relatively special (the order density is large or the supply and demand are relatively unstable), and this area is determined as a key area to execute a targeted dispatching strategy. Exemplarily, the geometric center corresponding to the candidate grid unit cluster can be determined, and the range within a radius of x kilometers near the geometric center can be used as a key area. In addition, a minimum circumscribed polygon (such as a regular hexagon) of these candidate grid unit clusters can also be used as a key area.

[0078] S1032. Perform a traversal search on the target city after the grid unit division based on a preset sliding pane range, count the number of candidate grid units contained in the sliding pane range each time, and determine the corresponding key area based on the sliding pane range in which the number of candidate grid units exceeds a second preset number threshold.

[0079] Specifically, a sliding window range of a fixed size can be preset, and a sliding search is performed on the entire area of ​​the target city based on the sliding window range. After each sliding, the number of candidate grid units contained in the current sliding window range is counted. If it exceeds the second preset number threshold, it means that the area within the current window range is relatively special (the order density is large or the supply and demand are relatively unstable), so the vicinity of the area is determined as a key area. Exemplarily, the grid units contained in the current window range can be directly used as a key area, or the center point and geometric radius can be determined according to the current window range to determine the corresponding key area.

[0080] In some possible embodiments, step S2, respectively obtaining the dispatching strategies corresponding to the regional dispatching pools, and performing dispatching operations on the corresponding regional dispatching pools based on the dispatching strategies, may include:

[0081] S201, respectively determining the applicable time periods corresponding to the key areas, and activating the regional dispatch pools of the corresponding key areas based on the applicable time periods;

[0082] S202. For enabled regional dispatch pools, obtain the dispatch strategies corresponding to the regional dispatch pools respectively, and execute dispatch operations on the corresponding regional dispatch pools based on the dispatch strategies respectively.

[0083] It should be noted that for the generated regional dispatch pool, you can directly enable it and execute dispatch operations according to the pre-configured dispatch strategy, or you can configure the applicable time period for each key area and enable the regional dispatch pool only during the corresponding applicable time period.

[0084] Specifically, the applicable time period can be configured according to the regulation and control needs of each key area. For example, for a certain key area, its applicable time period can be configured as holidays, that is, the regional dispatch pool of the key area is only enabled on holidays; or the applicable time period of a key area can be configured as a specific holiday (such as the Spring Festival every year), or the applicable time period can be configured as a specific time period (such as every Monday), etc.

[0085] Whenever each applicable time period is in progress, the regional dispatch pool of the corresponding key area is activated. For example, if the applicable time period of a key area is every Monday, the regional dispatch pool of the key area will be activated every Monday, and then the dispatch strategy of the regional dispatch pool will be obtained and followed to execute the dispatch operation, thereby providing highly customized, efficient and flexible dispatch solutions for special areas (or in special time periods).

[0086] In some possible embodiments, after step S2, the following steps may also be included:

[0087] S301. Obtain supply and demand information of each regional dispatch pool in real time, and dynamically adjust the dispatch strategy corresponding to each regional dispatch pool based on the supply and demand information;

[0088] S302: Execute dispatch operations on corresponding regional dispatch pools based on the dynamically adjusted dispatch strategy.

[0089] It should be noted that during the dispatch operation of the regional dispatch pool of the key area, the dispatch strategy can be dynamically adjusted according to the real-time supply and demand information of the current key area. Specifically, the supply and demand information may include but is not limited to the number of orders, the number of vehicles, the supply-demand ratio and other information; according to the preset correspondence between the supply and demand information and the dispatch parameters, the dispatch strategy corresponding to the current supply and demand information can be determined, and as the supply and demand information changes, the corresponding dispatch strategy can be adjusted dynamically in real time.

[0090] Based on this, through adaptive dispatch management of key areas, the dispatch strategy can be quickly adjusted and optimized according to scene changes, so as to ensure that the dispatch efficiency always remains at the optimal level, further improving the efficiency and flexibility of dispatch in key areas.

[0091] In some possible embodiments, after step S2, the following steps may also be included:

[0092] S401: When it is determined that the target area dispatch pool in each area dispatch pool meets the preset manual configuration condition, the target area dispatch pool is switched to the manual configuration mode;

[0093] S402: Determine a target dispatching strategy corresponding to the target area dispatching pool based on the configuration parameters set in the manual configuration mode, and execute dispatching operations on the target area dispatching pool based on the target dispatching strategy.

[0094] It should be noted that during the dispatch operation of the regional dispatch pool in the key area, it is also possible to switch to manual configuration mode in a timely manner according to the operating conditions of the target area dispatch pool, so as to further improve the efficiency and flexibility of dispatch management in the key area.

[0095] Specifically, the supply and demand information of each regional order dispatch pool can be monitored in real time, including order flow and transportation capacity, etc. When the preset manual configuration conditions are met according to the current supply and demand information, the regional order dispatch pool will be switched to manual configuration mode; the preset manual configuration conditions can also be pre-configured time conditions, that is, when the current time reaches the preset time period, it is deemed that the manual configuration conditions are met, and then the target regional order dispatch pool is switched to manual configuration mode.

[0096] Based on this, by incorporating a mechanism of manual intervention in special circumstances or special time periods to fine-tune strategies such as dispatch decisions and dispatch results, it is possible to ensure the optimization of global dispatch results, thereby improving the efficiency and flexibility of overall dispatch management.

[0097] Please refer to Figure 2 , Figure 2 FIG. 1 shows a block diagram of a dispatch management device provided in some embodiments of the present application. It should be understood that the dispatch management device is similar to the above-mentioned Figure 1 Corresponding to the method embodiment, it is able to execute each step involved in the above method embodiment. The specific functions of the dispatch management device can be found in the description above. To avoid repetition, the detailed description is appropriately omitted here.

[0098] Figure 2 The dispatch management device includes at least one software function module that can be stored in a memory in the form of software or firmware or fixed in the dispatch management device, and the dispatch management device includes:

[0099] The dispatch pool generation module 210 is used to determine at least one key area of ​​the target city and generate a regional dispatch pool corresponding to each key area;

[0100] The dispatch management module 220 is used to obtain the dispatch strategies corresponding to each regional dispatch pool, and execute dispatch operations on the corresponding regional dispatch pool based on each dispatch strategy.

[0101] It can be understood that the above-mentioned device item embodiments correspond to the method item embodiments of the present invention. An order management device provided by the embodiment of the present invention can implement the order management method provided by any method item embodiment of the present invention.

[0102] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the device described above can refer to the corresponding process in the aforementioned method, and will not be described in detail here.

[0103] like Figure 3 As shown, some embodiments of the present application provide an electronic device 300, which includes: a memory 310, a processor 320, and a computer program stored in the memory 310 and executable on the processor 320, wherein the processor 320 reads the program from the memory 310 through the bus 330 and executes the program to implement a method of any embodiment included in the above-mentioned dispatch management method.

[0104] Processor 320 can process digital signals and can include various computing structures, such as complex instruction set computer structure, reduced instruction set computer structure, or a structure that implements a combination of multiple instruction sets. In some examples, processor 320 can be a microprocessor.

[0105] The memory 310 may be used to store instructions executed by the processor 320 or data related to the execution of instructions. These instructions and / or data may include codes for implementing some or all functions of one or more modules described in the embodiments of the present application. The processor 320 of the disclosed embodiment may be used to execute instructions in the memory 310 to implement the method shown above. The memory 310 includes a dynamic random access memory, a static random access memory, a flash memory, an optical memory, or other memory known to those skilled in the art.

[0106] Some embodiments of the present application further provide a computer-readable storage medium having a computer program stored thereon. The computer program is executed by a processor to execute the method described in the method embodiment.

[0107] Some embodiments of the present application further provide a computer program product, which, when executed on a computer, enables the computer to execute the method described in the method embodiment.

[0108] It should be noted that each embodiment in this specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments, and the same or similar parts between the embodiments can be referred to each other. For the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0109] In several embodiments provided by the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0110] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0111] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0112] The above description is only an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0113] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0114] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Claims

1. A dispatch management method, It is characterized in that include: Determine at least one key area of ​​the target city and generate a regional dispatch pool corresponding to each key area; The dispatch strategies corresponding to each regional dispatch pool are obtained respectively, and dispatch operations are performed on the corresponding regional dispatch pools based on each dispatch strategy.

2. The dispatch management method according to claim 1, It is characterized in that The step of determining at least one key area of ​​the target city includes: Divide the target city into grid units and obtain historical order data corresponding to each grid unit; Filtering out a number of candidate grid units that meet preset conditions based on the historical order data; At least one key area of ​​the target city is determined based on the plurality of candidate grid cells.

3. The dispatch management method according to claim 2, It is characterized in that The step of screening out a number of candidate grid units that meet preset conditions based on the historical order data includes: Determine the number of orders for each grid unit in a preset historical period based on the historical order data, and screen the grid units whose order numbers exceed a preset first threshold to obtain a number of candidate grid units; Alternatively, the supply-demand ratio of each grid unit in a preset historical period is determined based on the historical order data, and grid units whose supply-demand ratio exceeds a preset second threshold are screened to obtain a plurality of candidate grid units.

4. The dispatch management method according to claim 2, It is characterized in that The determining at least one key area of ​​the target city based on the plurality of candidate grid units includes: Determine at least one candidate grid unit cluster from the plurality of candidate grid units, and determine a corresponding key area based on each of the candidate grid unit sets; wherein the candidate grid unit cluster is a grid unit cluster whose number of connected candidate grid units exceeds a preset first number threshold; Alternatively, a traversal search is performed on the target city after the grid unit division based on a preset sliding pane range, the number of candidate grid units contained in the sliding pane range each time is counted, and the corresponding key area is determined based on the sliding pane range in which the number of candidate grid units exceeds a second preset number threshold.

5. The dispatch management method according to claim 1, It is characterized in that The obtaining of the dispatching strategies corresponding to the regional dispatching pools respectively, and executing dispatching operations on the corresponding regional dispatching pools respectively based on the dispatching strategies, includes: Determine the applicable time periods corresponding to the key areas respectively, and enable the regional dispatch pools of the corresponding key areas based on the applicable time periods; For enabled regional dispatch pools, obtain the dispatch strategies corresponding to each regional dispatch pool respectively, and execute dispatch operations on the corresponding regional dispatch pools based on each dispatch strategy.

6. The dispatch management method according to claim 1, It is characterized in that After respectively acquiring the dispatching strategies corresponding to the regional dispatching pools and respectively executing dispatching operations on the corresponding regional dispatching pools based on the dispatching strategies, the method further includes: Obtain the supply and demand information of each regional dispatch pool in real time, and dynamically adjust the dispatch strategy corresponding to each regional dispatch pool based on the supply and demand information; Based on the dynamically adjusted dispatch strategy, dispatch operations are performed on the corresponding regional dispatch pools.

7. The dispatch management method according to claim 1, It is characterized in that After respectively acquiring the dispatching strategies corresponding to the regional dispatching pools and respectively executing dispatching operations on the corresponding regional dispatching pools based on the dispatching strategies, the method further includes: When it is determined that the target area dispatch pool in the various area dispatch pools meets the preset manual configuration condition, the target area dispatch pool is switched to a manual configuration mode; The target dispatching strategy corresponding to the target area dispatching pool is determined based on the configuration parameters set in the manual configuration mode, and dispatching operations are performed on the target area dispatching pool based on the target dispatching strategy.

8. An electronic device, It is characterized in that It includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor can implement the dispatch management method described in any one of claims 1 to 7 when executing the program.

9. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the dispatch management method according to any one of claims 1 to 7 is executed.

10. A computer program product, It is characterized in that The computer program product includes a computer program, and when the computer program is executed by a processor, the dispatch management method according to any one of claims 1 to 7 is implemented.

Citation Information

Cited By

  • Self-learning intelligent order sending method based on cloud big data

    CN121503960A