Shared vehicle dynamic allocation method, system and device and storage medium

Abstract

The invention discloses a dynamic allocation method for shared vehicles, and the method comprises the steps: obtaining a vehicle use request, and planning a travel route and a service vehicle according to the vehicle use request; if the travel route covers a plurality of blocks of a service area, determining service vehicles and vehicle docking road sections of different blocks according to the travel route; the service area comprises a plurality of blocks, each block comprises at least one service vehicle site, service vehicles in each block only run in the area and on boundary roads, and the number of the service vehicles in each block can be dynamically adjusted. The method can reduce the waiting time, reduce the empty driving rate and the operation cost, and can be widely applied to the technical field of intelligent traffic.

Description

Technical Field

[0001] The present invention relates to the field of intelligent transportation technology, and in particular to a method, system, device and storage medium for dynamic allocation of shared vehicles. Background Art

[0002] An important technology in shared travel is vehicle dispatching technology. In existing technical solutions, one vehicle is assigned to provide full-service for a travel service, that is, the service vehicle drives from the current location to the user's current location, picks up the user, and sends him or her to the destination.

[0003] Existing methods include the following typical technical solutions: 1. Dispatch based on historical data predictions: By collecting and analyzing vehicle demand data from different regions and time periods over a period of time, a prediction model is established to dispatch vehicles in advance to areas with high predicted demand. For example, based on the historical trend of high demand in commercial areas during the morning rush hour and high demand in residential areas during the evening rush hour on weekdays, vehicles can be dispatched in advance of these periods.

[0004] 2. Dispatch based on real-time demand: Leveraging vehicle and user positioning systems, the system obtains real-time vehicle location and user request information. Based on real-time demand distribution, it dispatches nearby idle vehicles to the desired location. For example, if the system receives multiple user requests for a vehicle in a certain area with few vehicles, it dispatches a vehicle from a nearby area with more vehicles.

[0005] 3. User-booked scheduling: Users reserve a ride time and location on the platform in advance. The platform then schedules a vehicle to arrive at the designated location at the designated time based on the reservation information. For example, if a user reserves a ride from the community entrance to the airport the next morning, the platform will dispatch a suitable vehicle to the designated location at the scheduled time.

[0006] The above-mentioned existing technical solutions cause the following problems due to inaccurate estimation of vehicle demand, insufficient response to dynamic changes in vehicle demand, and reserved vehicle capacity occupation: 1. Users have to wait too long during the vehicle use process, resulting in poor user experience; 2. The vehicle takes a long time from completing one service to the start of the next service, resulting in a high idle rate and high operating costs. Summary of the Invention

[0007] In view of this, the purpose of the embodiments of the present invention is to provide a method, system, device and storage medium for dynamic allocation of shared vehicles, which can reduce waiting time, lower empty driving rate and operating costs.

[0008] In one aspect, an embodiment of the present invention provides a method for dynamically allocating shared vehicles, which is applied to a cloud dispatching center and includes: Obtain a vehicle request, and plan a travel route and a service vehicle according to the vehicle request; If the travel route covers multiple blocks of the service area, the service vehicles and vehicle docking sections of different blocks are determined according to the travel route; the service area includes several blocks, each block includes at least one service vehicle site, and the service vehicles in each block only operate within the area and on boundary roads. The number of service vehicles in each block can be dynamically adjusted.

[0009] Optionally, the service area is divided into blocks by the following method: Selecting historical travel data based on the historical travel data of the service area, and determining the number of blocks based on the area of ​​the service area; determining a center position of each block according to the historical travel data and the number of blocks; Determining a target point set for each block based on the historical travel data and the center position of each block; The service area is divided into blocks according to the target point set of each block and the physical boundary of the service area.

[0010] Optionally, the historical travel data includes a starting point and an end point, and determining the target point set of each block according to the historical travel data and the center position of each block includes: Matching the starting point and the end point with the center position to determine an initial point set for each block; The center position is updated according to the initial point set of each block, and the start point and the end point are matched with the center position until the preset requirements are met, thereby determining the target point set of each block.

[0011] Optionally, the method further includes: Calculating a first travel coverage rate of the historical travel data within a single block; If the first travel coverage is less than a preset coverage threshold, the number of blocks is adjusted and the service area is re-divided into blocks until the first travel coverage is greater than or equal to the preset coverage threshold.

[0012] Optionally, the method further includes: Within a first preset time period, the second travel coverage ratio within a single block is re-evaluated. If the second travel coverage ratio is less than the preset coverage ratio threshold, the service area is re-divided into blocks based on the travel data within the first preset time period until the second travel coverage ratio is greater than or equal to the preset coverage ratio threshold.

[0013] Optionally, the number of service vehicles in each block is dynamically adjusted by the following method: During a second preset time period, adjusting the number of service vehicles in each block according to the average load intensity of the service area, the average load intensity of each block, and a preset load intensity range; and / or, during a third preset time period, adjusting the number of service vehicles in each block according to the average empty rate in each block and a preset empty rate range; And / or, during the fourth preset time period, the number of service vehicles in each block is adjusted according to the order saturation rate in each block.

[0014] On the other hand, an embodiment of the present invention provides a shared vehicle dynamic allocation system, which is applied to a cloud dispatch center, including: The first module is used to obtain a vehicle request and plan a travel route and service vehicle according to the vehicle request; The second module is used to determine the service vehicles and vehicle docking sections in different blocks according to the travel route if the travel route covers multiple blocks in the service area; the service area includes several blocks, each block includes at least one service vehicle site, and the service vehicles in each block only operate within the area and on the boundary roads. The number of service vehicles in each block can be dynamically adjusted.

[0015] On the other hand, an embodiment of the present invention provides a shared vehicle dynamic allocation device, comprising: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the above method.

[0016] On the other hand, an embodiment of the present invention provides a computer-readable storage medium storing a program executable by a processor. When the program is executed by the processor, it is used to perform the above method.

[0017] On the other hand, an embodiment of the present invention provides a shared vehicle dynamic allocation system, including a cloud dispatch center, a service vehicle, and a user terminal, wherein: The user terminal is used to obtain the vehicle request, send the vehicle request to the cloud dispatch center, and receive service vehicles and vehicle docking sections in different blocks sent by the cloud dispatch center; The cloud dispatching center is used in the above method; The service vehicle is used to operate according to the instructions of the cloud dispatching center.

[0018] Implementation of the embodiments of the present invention provides the following beneficial effects: a service area includes several blocks, each of which includes at least one service vehicle site. Service vehicles are parked at the service vehicle site when idle. Service vehicles within each block operate only within the area and on boundary roads. The number of service vehicles within each block can be dynamically adjusted. When a vehicle request is received, a travel route and service vehicles are planned based on the vehicle request. If the travel route covers multiple blocks in the service area, the service vehicles and vehicle docking sections for different blocks are determined based on the travel route. The distribution of service vehicles within the service vehicle sites of each block in the service area is more reasonable. When a vehicle request is received, a service vehicle in a nearby area can be quickly matched, thereby shortening user waiting time, reducing the distance between the service vehicle site and the starting point of the trip, and the distance between the end point of the trip and the service vehicle site, and reducing idle travel before and after service. The total number of service vehicles between the blocks in the service area is allocated. While ensuring a certain proportion of transport capacity redundancy in each block and maintaining the total number of service vehicles in the city, the service vehicles within each block can be dynamically adjusted, thereby optimizing transport capacity resources within the city, improving service vehicle utilization, reducing the total number of service vehicles in the city, and lowering operating costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1 This is a structural block diagram of a shared vehicle dynamic allocation system provided by an embodiment of the present invention; Figure 2 This is a flowchart of the steps of a shared vehicle dynamic allocation method provided by an embodiment of the present invention; Figure 3 This is a flow chart of steps for dividing a service area into blocks provided by an embodiment of the present invention; Figure 4 1 is a schematic flow chart of steps for determining a target point set for each block provided by an embodiment of the present invention; Figure 5 This is a schematic flow chart of steps for re-dividing a service area into blocks according to an embodiment of the present invention; Figure 6 This is a schematic diagram of a result of dividing a service area into blocks provided by an embodiment of the present invention; Figure 7 This is a schematic diagram of a result of re-dividing a service area into blocks according to an embodiment of the present invention; Figure 8 This is a structural block diagram of another shared vehicle dynamic allocation system provided by an embodiment of the present invention; Figure 9 This is a structural block diagram of a shared vehicle dynamic allocation device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0020] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. The step numbers in the following embodiments are provided for ease of description only and do not limit the order of the steps. The order of execution of the steps in the embodiments can be adaptively adjusted based on the understanding of those skilled in the art.

[0021] It should be noted that, although the functional modules are divided in the device schematic diagram and the logical order is shown in the flow chart, in some cases, the steps shown or described can be performed in a different order than the module division in the device or the order in the flow chart. The terms "first", "second", etc. in the specification and claims and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or precedence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0022] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application pertains. The terms used herein are for the purpose of describing the embodiments of this application only and are not intended to limit this application.

[0023] See Figure 1 , an embodiment of the present invention provides a shared vehicle dynamic allocation system, including a cloud-based dispatching center, service vehicles, and user terminals. The service area for dynamic allocation of shared vehicles is divided into several blocks, each block including at least one service vehicle site, and idle service vehicles are parked at the service vehicle site. Among them, the cloud-based dispatching center is responsible for uniformly receiving and processing the vehicle use demands sent by the user terminal, planning the user's travel route, dispatching the service vehicle combination in sequence to meet the user's needs, dynamically adjusting the area covered by the block division, dynamically planning the total number of service vehicles required within each block, and planning the cross-block dispatch routes of the service vehicles accordingly. The service vehicle site is a place where service vehicles wait for tasks, and service vehicles can also complete maintenance, repairs, refueling and other operations here. The service vehicle is dispatched by the cloud-based dispatching center and is mainly responsible for transporting users from the designated starting point to the designated end point. The application on the user terminal is the entry point for users to obtain vehicle use demands, and can display information such as the progress of demand satisfaction and the location of the service vehicle in real time.

[0024] See Figure 2, an embodiment of the present invention provides a shared vehicle dynamic allocation method, which is applied to a cloud dispatching center, comprising: S100: Obtain a vehicle request, and plan a travel route and service vehicle based on the vehicle request; S200. If the travel route covers multiple blocks in the service area, determine the service vehicles and vehicle docking sections in different blocks based on the travel route; the service area includes several blocks, each block includes at least one service vehicle site, and the service vehicles in each block only operate within the area and on boundary roads. The number of service vehicles in each block can be dynamically adjusted.

[0025] It should be noted that the service area is rationally divided into blocks based on road boundaries. Block boundaries are not fixed and are subject to dynamic adjustment based on actual vehicle user demand, historical statistics of potential demand within the block, block size, and road length within the block. After the blocks are divided, the number of service vehicles allocated to each block is calculated based on historical statistics of potential demand within the block, actual vehicle user demand, major events (performances, sporting events, etc.), and weather changes. The number of service vehicles is adjusted dynamically. Service vehicles within each block operate only within that block and on its boundary roads. When not operating, they are parked at a centralized service vehicle yard within the block for maintenance and on standby. Each block has at least one service vehicle yard.

[0026] This invention allows short-distance travel needs within each block to be met as much as possible within that block, while cross-block needs are efficiently handled through relaying. In one specific embodiment, when a vehicle user needs to travel across blocks, the system calculates the fastest route. Service vehicle 1 in block 1 picks up the vehicle user and then travels along the fastest route to a relay point near the boundary between blocks 1 and 2. Service vehicle 2 in block 2, based on system-calculated time, must arrive at the relay point before service vehicle 1 reaches the overlapping road. Similarly, mobile vehicle 2 operates only within the block and near the boundary roads. When the system-planned fastest route requires passing through multiple blocks, the above process is repeated, gradually relaying the vehicle user from service vehicle 2 to service vehicle n. Ultimately, service vehicle n delivers the vehicle user to their destination in block n. After all service vehicles have completed their vehicle user transport missions, they return to the service vehicle yard within their respective blocks, awaiting the system's next mission assignment or taking on other transport service missions within the block.

[0027] It should be noted that during the docking process, passengers in different areas can transfer from the previous service vehicle to the next service vehicle by themselves, or the passengers can complete the docking between the service vehicles without getting off the vehicle. The docking process between service vehicles is as follows: on the docking section, when service vehicle 1 and service vehicle 2 are traveling at the same speed and in the same direction, the dynamic alignment mechanism makes the positions of the front and rear vehicles reach the initial docking accuracy requirements; the posture fine-tuning mechanism makes the cabin movement mechanism meet the movement requirements; then the dynamic driving locking mechanism dynamically locks service vehicle 1 and service vehicle 2; the cabin locking mechanism of service vehicle 1 is clocked in; the cabin movement mechanism moves the cabin from the chassis of service vehicle 1 to the chassis of service vehicle 2; the cabin locking mechanism of service vehicle 2 is locked; the dynamic driving locking mechanism is unlocked; service vehicle 1 and service vehicle 2 continue their respective subsequent scheduling arrangements according to the route planned by the cloud dispatch center.

[0028] Optionally, see Figure 3 , the service area is divided into blocks by the following method: S010. Select historical travel data based on the historical travel data of the service area, and determine the number of blocks based on the area of ​​the service area; S020. Determine the center position of each block based on historical travel data and the number of blocks; S030. Determine a target point set for each block based on historical travel data and the center position of each block; S040. Divide the service area into blocks according to the target point set of each block and the physical boundary of the service area.

[0029] Historical trip data represents data selected from historical travel data that meets certain requirements, such as the total number of distances traveled. The number of blocks is determined based on the size of the service area. A larger service area requires more blocks, evenly dividing the service area into a certain number of blocks. Based on the number of blocks, multiple pairs of start and end points are randomly selected from the historical trip data. The center of each block is determined based on each pair of start and end points. The target point set for each block is determined based on the distance from the historical trip data to the center of each block. The service area is divided into blocks based on the target point set and the distribution of the physical boundaries of the service area.

[0030] Optionally, see Figure 4 ,The historical travel data includes the starting point and the end point.,The target point set of each block is determined based on the historical travel data and the center position of each block,,including: S031. Match the starting point and the end point with the center position to determine the initial point set of each block; S032. Update the center position according to the initial point set of each block, return to execute matching the start point and end point with the center position until the preset requirements are met, and determine the target point set of each block.

[0031] The starting and ending points of the historical travel data are matched multiple times in a loop to determine the initial point set of each block. The target point set of each block is determined based on the center position of the initial point set until the center position no longer changes or the number of cycles reaches the requirement.

[0032] In a specific embodiment, the process of dividing the service area into blocks is as follows: S1. Select the trip data with a mileage less than a certain value (such as 3km) in the historical data, and take the geographical location of the starting point and the end point as a data pair ( p 1,s , p 1,d )……( p k,s , p k,d ), there are k data pairs in total.

[0033] S2. Based on the main area covered by travel services S city and the average area of ​​the blocks initially determined S block , calculate the initial number of blocks n , .

[0034] S3, randomly select k data pairs according to the principle of geographical space dispersion n Data pairs are calculated, and the midpoint position of the navigation path between the starting point and the end point of the data pair is used as the initial position for iteration of the center of each block c 1…… c n .

[0035] S4. Calculate the distances between the starting point and the end point of k data points respectively. n The navigation path distance of the center point, and according to the minimum distance principle, match to n Block point set S 1…… S n .

[0036] S5. Calculate the geometric center point of all points in each block point set and match it to the nearest road as the new center point of each block; S6. Repeat steps S4 and S5 until the block center position no longer changes or reaches the iterative calculation threshold T1, and obtain the final value of this round of calculation. n Block point setS 1…… S n .

[0037] S7, calculated according to step S6 n The point set of each block is divided according to the physical boundaries such as main roads, rivers, railways, closed park boundaries, mountains, etc., in order to reduce the cost of crossing physical boundaries as much as possible. Z 1…… Z n .

[0038] Optionally, see Figure 5 , the method further comprises: S033. Calculate the first trip coverage rate of historical travel data within a single block; S034. If the first travel coverage is less than the preset coverage threshold, adjust the number of blocks and re-divide the service area into blocks until the first travel coverage is greater than or equal to the preset coverage threshold.

[0039] The travel coverage rate refers to the percentage of data pairs whose starting and ending points are both in the same block. Specifically, the percentage of data pairs whose starting and ending points are both in the same block is calculated. If the ratio of the starting and ending points of a short trip in the same block point set is greater than or equal to the single block short trip coverage rate threshold T2, then the iteration is completed; if the ratio of the starting and ending points of a short trip in the same block point set is less than the single block short trip coverage rate threshold T2, then the number of blocks is adjusted. n , repeat the above steps S3-S6 until the short-distance travel coverage requirement of a single block is met.

[0040] Optionally, the method further comprises: S300. Re-evaluate the second travel coverage ratio within a single block within a first preset time period. If the second travel coverage ratio is less than the preset coverage ratio threshold, re-divide the service area into blocks based on the travel data within the first preset time period until the second travel coverage ratio is greater than or equal to the preset coverage ratio threshold.

[0041] It should be noted that the first preset time period is determined based on actual application and is not specifically limited in this embodiment. For example, the short-distance travel coverage of a single block can be reassessed at a fixed time (e.g., monthly or quarterly) to determine whether it meets the threshold requirement. If it does not meet the requirement, the block can be re-divided.

[0042] In a specific embodiment, see Figure 6 and Figure 7 , Figure 6 A schematic diagram showing the result of dividing a service area into blocks using the above method during a certain time period. Figure 7A schematic diagram showing the result of re-dividing the service area into blocks based on the travel data within the first preset time period.

[0043] Optionally, the number of service vehicles in each block is dynamically adjusted by the following method: S410. Adjust the number of service vehicles in each block within a second preset time period according to the average load intensity of the service area, the average load intensity of each block, and a preset load intensity range; S420, and / or, within a third preset time period, adjusting the number of service vehicles in each block according to the average empty rate in each block and a preset empty rate range; S430, and / or, within the fourth preset time period, adjusting the number of service vehicles in each block according to the order saturation rate in each block.

[0044] Specifically, the second preset time period, the third preset time period, and the fourth preset time period are determined according to actual applications and are not specifically limited in this embodiment. In a specific embodiment, the dynamic adjustment method is divided into three methods: long-term adjustment, mid-term adjustment, and short-term adjustment.

[0045] Long-term adjustments can be made on a monthly or quarterly basis. Define the average transport intensity for a block, Ez, as the total number of orders for that block divided by the total number of vehicles in that block. Set the average transport intensity for a city, Ec, as the total number of orders for that city divided by the total number of vehicles in that city. Set the upper limit of transport intensity to Eu,limit and the lower limit to El,limit. If Ec exceeds Eu,limit for a sustained period, increase the total number of vehicles serving the city. If Ec falls below El,limit for a sustained period, reduce the total number of vehicles serving the city to maintain a reasonable level of overall urban operational intensity. Simultaneously, adjust the number of vehicles in each block to keep the average transport intensity, Ez, within the range of El,limit and Eu,limit.

[0046] Mid-term adjustments are made on a daily basis. For holiday tourism peaks, phased construction areas, etc., the average idle rate of service vehicles in the affected blocks is estimated based on historical data. The average idle rate r = total idle time / total driving time. The upper limit of the average idle rate is set to ru,limit, and the lower limit is set to rl,limit. The number of affected blocks is n a , the number of blocks with smaller impact is n b , n a +n b =n. Calculate n separately b Calculate the average empty rate of the less affected blocks and sort them from small to large, r1<r2<……<r b Estimate n a If the average empty driving rate of the most affected blocks is r a<rl,limit, then vehicles are deployed from block b with a larger idle rate to support block a. After the vehicles are deployed from block b, the average idle rate must be n b The average of the average empty driving rate of the less affected blocks If the average empty rate of block a still cannot be within the upper and lower limits after the vehicle is transferred out of block b, the above process is repeated to continue to transfer vehicles from block b-1 to support block a. The average empty rate of block b-1 after the vehicle is transferred out needs to be n after the average empty rate of block b is updated. b The average of the average empty driving rate of the less affected blocks If r a >ru,limit, then according to the above principle, transfer vehicles from block a to block 1 and subsequent blocks until the requirements are met. Average empty driving rate after vehicle number adjustment The calculation formula is:

[0047] Short-term adjustments can be made to cope with the constant changes in demand hotspots throughout the day. Several fixed dynamic adjustment time periods can be set each day. Calculate the order saturation rate within each block. , the numerator is the current number of orders, and the denominator is the number of vehicles that can be dispatched to complete orders within a short time (for example, 3 minutes) within the block. .

[0048] During the dynamic adjustment period, if an order needs to be relayed across blocks, such as transporting passengers from block p to block q, the relay is carried out near the boundary between blocks p and q. At this time, the order inclusion rates in blocks p and q are compared. hour, For short-term dynamic cross-block adjustment thresholds, the service vehicle in block p will no longer return to block p after completing the passenger delivery task, but will be directly incorporated into the vehicle dispatch subnet in block q to support the service task of block q.

[0049] Implementation of the embodiments of the present invention provides the following beneficial effects: a service area includes several blocks, each of which includes at least one service vehicle site. Service vehicles are parked at the service vehicle site when idle. Service vehicles within each block operate only within the area and on boundary roads. The number of service vehicles within each block can be dynamically adjusted. When a vehicle request is received, a travel route and service vehicles are planned based on the vehicle request. If the travel route covers multiple blocks in the service area, the service vehicles and vehicle docking sections for different blocks are determined based on the travel route. The distribution of service vehicles within the service vehicle sites of each block in the service area is more reasonable. When a vehicle request is received, a service vehicle in a nearby area can be quickly matched, thereby shortening user waiting time, reducing the distance between the service vehicle site and the starting point of the trip, and the distance between the end point of the trip and the service vehicle site, and reducing idle travel before and after service. The total number of service vehicles between the blocks in the service area is allocated. While ensuring a certain proportion of transport capacity redundancy in each block and maintaining the total number of service vehicles in the city, the service vehicles within each block can be dynamically adjusted, thereby optimizing transport capacity resources within the city, improving service vehicle utilization, reducing the total number of service vehicles in the city, and lowering operating costs.

[0050] See Figure 8 The embodiment of the present invention provides a shared vehicle dynamic allocation system, which is applied to a cloud dispatching center and includes: The first module is used to obtain car requests and plan travel routes and service vehicles based on the requests; The second module is used to determine the service vehicles and vehicle docking sections in different blocks according to the travel route if the travel route covers multiple blocks in the service area; the service area includes several blocks, each block includes at least one service vehicle site, and the service vehicles in each block only operate within the area and on the boundary roads. The number of service vehicles in each block can be dynamically adjusted.

[0051] It can be seen that the contents of the above method embodiments are all applicable to the present system embodiments. The functions specifically implemented by the present system embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0052] See Figure 9 , an embodiment of the present invention provides a shared vehicle dynamic allocation device, comprising: at least one processor; at least one memory for storing at least one program; When at least one program is executed by at least one processor, the at least one processor implements the above method.

[0053] Among them, the memory is a non-transient computer-readable storage medium that can be used to store non-transient software programs and non-transient computer executable programs. The memory may include a high-speed random access memory and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory optionally includes a remote memory remotely arranged relative to the processor, and these remote memories can be connected to the processor 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 a combination thereof.

[0054] It can be seen that the contents of the above method embodiments are all applicable to the present device embodiments. The functions specifically implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

[0055] In addition, embodiments of the present application further disclose a computer program product or computer program, which is stored in a computer-readable storage medium. A processor of a computer device can read the computer program from the computer-readable storage medium and execute the computer program, causing the computer device to perform the above-described method.

[0056] An embodiment of the present invention further provides a computer-readable storage medium storing a program executable by a processor. When executed by the processor, the program is used to implement the above-described method. Similarly, the contents of the above-described method embodiment are applicable to the present storage medium embodiment. The functions implemented by the present storage medium embodiment are the same as those of the above-described method embodiment, and the beneficial effects achieved are also the same as those achieved by the above-described method embodiment.

[0057] It will be appreciated that all or some of the steps and systems disclosed above may be implemented as software, firmware, hardware, or any suitable combination thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on computer-readable media, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is well known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information, such as computer-readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disks (DVDs) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0058] See Figure 1 The embodiment of the present invention provides a shared vehicle dynamic allocation system, including a cloud dispatch center, a service vehicle and a user terminal, wherein: The user end is used to obtain vehicle use requests, send the vehicle use requests to the cloud dispatch center, and receive service vehicles and vehicle docking sections in different blocks sent by the cloud dispatch center; A cloud dispatch center, used for the above method; Service vehicles are used to operate according to instructions from the cloud dispatch center.

[0059] The user sends a vehicle request to the cloud dispatch center through the user terminal; the cloud dispatch center plans the travel route and service vehicles based on the vehicle request. If the travel route covers multiple blocks in the service area, the cloud dispatch center determines the service vehicles and vehicle docking sections in different blocks based on the travel route, and sends the service vehicles and vehicle docking sections in different blocks to the user terminal; the user terminal receives the service vehicles and vehicle docking sections in different blocks and displays them.

[0060] It should be understood that in this application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0061] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0062] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0063] The above is a specific description of the preferred implementation of the present invention, but the invention is not limited to the embodiments. Those skilled in the art can make various equivalent modifications or substitutions without violating the spirit of the present invention. These equivalent modifications or substitutions are all included in the scope defined by the claims of this application.

Claims

1. A method for dynamic allocation of shared vehicles, characterized in that: Applied to cloud dispatch center, including: Obtain a vehicle request, and plan a travel route and a service vehicle according to the vehicle request; If the travel route covers multiple blocks of the service area, the service vehicles and vehicle docking sections of different blocks are determined according to the travel route; the service area includes several blocks, each block includes at least one service vehicle site, and the service vehicles in each block only operate within the area and on boundary roads. The number of service vehicles in each block can be dynamically adjusted.

2. The method according to claim 1, characterized in that The service area is divided into blocks by the following method: Selecting historical travel data based on the historical travel data of the service area, and determining the number of blocks based on the area of ​​the service area; determining a center position of each block according to the historical travel data and the number of blocks; Determining a target point set for each block based on the historical travel data and the center position of each block; The service area is divided into blocks according to the target point set of each block and the physical boundary of the service area.

3. The method according to claim 2, characterized in that The historical travel data includes a starting point and an end point, and determining a target point set of each block according to the historical travel data and the center position of each block includes: Matching the starting point and the end point with the center position to determine an initial point set for each block; The center position is updated according to the initial point set of each block, and the start point and the end point are matched with the center position until the preset requirements are met, thereby determining the target point set of each block.

4. The method according to claim 2, characterized in that The method further comprises: Calculating a first travel coverage rate of the historical travel data within a single block; If the first travel coverage is less than a preset coverage threshold, the number of blocks is adjusted and the service area is re-divided into blocks until the first travel coverage is greater than or equal to the preset coverage threshold.

5. The method according to claim 4, characterized in that The method further comprises: Within a first preset time period, the second travel coverage ratio within a single block is re-evaluated. If the second travel coverage ratio is less than the preset coverage ratio threshold, the service area is re-divided into blocks based on the travel data within the first preset time period until the second travel coverage ratio is greater than or equal to the preset coverage ratio threshold.

6. The method according to claim 1, wherein The number of service vehicles in each block is dynamically adjusted by the following methods: During a second preset time period, adjusting the number of service vehicles in each block according to the average load intensity of the service area, the average load intensity of each block, and a preset load intensity range; and / or, during a third preset time period, adjusting the number of service vehicles in each block according to the average empty rate in each block and a preset empty rate range; And / or, during the fourth preset time period, the number of service vehicles in each block is adjusted according to the order saturation rate in each block.

7. A shared vehicle dynamic allocation system, characterized in that: Applied to cloud dispatch center, including: The first module is used to obtain a vehicle request and plan a travel route and service vehicle according to the vehicle request; The second module is used to determine the service vehicles and vehicle docking sections in different blocks according to the travel route if the travel route covers multiple blocks in the service area; the service area includes several blocks, each block includes at least one service vehicle site, and the service vehicles in each block only operate within the area and on the boundary roads. The number of service vehicles in each block can be dynamically adjusted.

8. A shared vehicle dynamic allocation device, characterized in that: include: at least one processor; at least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method according to any one of claims 1 to 6.

9. A computer-readable storage medium storing a program executable by a processor, characterized in that: The processor-executable program is configured to perform the method according to any one of claims 1 to 6 when executed by the processor.

10. A shared vehicle dynamic allocation system, characterized in that: Including cloud dispatch center, service vehicles and user terminals, among which, The user terminal is used to obtain the vehicle request, send the vehicle request to the cloud dispatch center, and receive service vehicles and vehicle docking sections in different blocks sent by the cloud dispatch center; The cloud dispatching center is used in the method described in any one of claims 1 to 6; The service vehicle is used to operate according to the instructions of the cloud dispatching center.

Images