Shared vehicle scheduling method and device

Abstract

The invention provides a shared vehicle scheduling method and device, and relates to the technical field of shared vehicle operation, and the method comprises the steps: responding to the online operation of a scheduling terminal, and obtaining the carrier information of the scheduling terminal; searching at least one target pulling point and at least one target delivery point matched with the dispatching terminal based on the carrier information; generating a scheduling order based on the position information of each target car pulling point and the target car delivery point; and sending the scheduling order to a scheduling terminal for display. According to the shared vehicle scheduling method and device provided by the invention, the combined scheduling of a plurality of parking points can be realized, and a plurality of vehicle pulling points can be pushed at the same time for scheduling, so that the scheduling efficiency of the shared vehicles is improved, and the shared resources of the shared vehicles are fully utilized.

Description

Technical Field

[0001] The present invention relates to the technical field of shared vehicle operation, and in particular to a shared vehicle scheduling method and device. Background Art

[0002] Usually, in the process of shared vehicle dispatching and operation, dispatch specialists play a vital role. The precise dispatch of dispatch specialists can ensure that vehicles can be transferred from the pickup point to the delivery point in a timely manner, thus achieving the optimal allocation of shared vehicle resources.

[0003] At present, in the dispatching plan of the dispatching specialist, the dispatching specialist is often pushed to the dispatching specialist the parking spots that meet the number of vehicles required by the dispatching specialist. For example, if the vehicle can carry 10 vehicles, only the parking spots with a backlog of more than 10 vehicles will be pushed as parking spots. This method ensures that the dispatching specialist can fully utilize the vehicle capacity and avoid waste of resources to a certain extent.

[0004] However, this single dispatching standard may have some limitations. For example, when the number of backlogged vehicles at a parking spot that can be used as a pull-in point is less than the vehicle capacity, this parking spot will not be pushed out by the system, causing the backlogged shared vehicles at the parking spot to be stranded for a long time, reducing the flexibility of shared vehicle dispatching and the utilization rate of shared resources. Summary of the invention

[0005] In view of this, an object of the present invention is to provide a method and device for dispatching shared vehicles to alleviate the above technical problems.

[0006] In a first aspect, an embodiment of the present invention provides a method for dispatching shared vehicles, the method comprising: in response to an online operation of a dispatching terminal, obtaining vehicle information of the dispatching terminal; based on the vehicle information, searching for at least one target pulling point matching the dispatching terminal, and searching for at least one target vehicle dropping point matching the dispatching terminal; wherein the sum of the number of pulling vehicles of at least one of the target pulling points matches the vehicle capacity of the vehicle corresponding to the dispatching terminal; generating a dispatching order based on the location information of each of the target pulling points and the target vehicle dropping points; sending the dispatching order to the dispatching terminal so as to display the dispatching order through a graphical user interface of the dispatching terminal, wherein the displayed content includes: the location information of at least one of the target pulling points, the location information of at least one of the target vehicle dropping points, and a dispatching path connecting each of the target pulling points and each of the target vehicle dropping points.

[0007] In combination with the first aspect, an embodiment of the present invention provides a first possible implementation method of the first aspect, wherein the above-mentioned step of searching for at least one target towing point matching the dispatching terminal includes: extracting the vehicle capacity from the vehicle information; searching for a towing point matching the distance of the dispatching terminal from a towing point database as a candidate towing point; and selecting the target towing point from the candidate towing points in turn until the sum of the towing quantities of the selected target towing points is greater than or equal to the vehicle capacity.

[0008] In combination with the first aspect, an embodiment of the present invention provides a second possible implementation method of the first aspect, wherein the above-mentioned step of searching for at least one target towing point matching the dispatching terminal further includes: responding to receiving towing point reporting information, wherein the towing point reporting information carries the towing point; and searching for a towing point that matches the distance of the dispatching terminal from the towing points reported in the towing point reporting information as at least one target towing point of the dispatching terminal.

[0009] In combination with the first aspect, an embodiment of the present invention provides a third possible implementation method of the first aspect, wherein the above method also includes: in response to the dispatching terminal completing the vehicle pulling based on the dispatching order, if the vehicle delivery point reporting information is monitored, determining whether the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition; if so, updating the target vehicle delivery point of the dispatching order to the vehicle delivery point in the vehicle delivery point reporting information, and displaying the updated dispatching order through the graphical user interface of the dispatching terminal.

[0010] In combination with the third possible implementation of the first aspect, an embodiment of the present invention provides a fourth possible implementation of the first aspect, wherein the step of determining whether the vehicle delivery point in the vehicle delivery point reporting information satisfies the replacement condition includes: finding whether the vehicle delivery point in the vehicle delivery point reporting information coincides with the point position of the target vehicle delivery point of other scheduling orders; if so, determining that the vehicle delivery point in the vehicle delivery point reporting information does not meet the replacement condition; if not, updating the target vehicle delivery point of the scheduling order to the vehicle delivery point in the vehicle delivery point reporting information, and generating a predicted scheduling path based on the updated scheduling order; determining whether the path difference between the predicted scheduling path and the scheduling path meets a preset scheduling threshold, or whether the predicted scheduling path is less than or equal to the scheduling path; if the path difference meets the preset scheduling threshold, or the predicted scheduling path is less than or equal to the scheduling path, determining that the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition; if it does not meet the preset scheduling threshold, determining that the vehicle delivery point in the vehicle delivery point reporting information does not meet the replacement condition.

[0011] In combination with the second or third possible implementation of the first aspect, an embodiment of the present invention provides a fifth possible implementation of the first aspect, wherein the above method also includes: in response to an information reporting operation, displaying an information reporting interface on a graphical user interface of the user terminal, and at least one parking point within a preset distance from the current user terminal; wherein the information reporting interface includes an information reporting control and an information submission control; the information reporting control is used for users to input reporting information, and the information reporting control includes a car pulling point reporting control and a car dropping point reporting control; in response to a touch operation acting on the information submission control, generating reporting information, the reporting information includes car pulling point reporting information, or, car dropping point reporting information.

[0012] In combination with the first aspect, an embodiment of the present invention provides a sixth possible implementation of the first aspect, wherein the above method also includes: responding to the pulling operation reported by the dispatching terminal based on the dispatching order, and updating the display status of the target pulling point corresponding to the pulling operation in the graphical user interface.

[0013] In combination with the first aspect, an embodiment of the present invention provides a seventh possible implementation of the first aspect, wherein the above method also includes: responding to the dispatching terminal reaching the target vehicle delivery points in turn, monitoring the number of vehicles delivered to each of the target vehicle delivery points until the dispatching order is completed.

[0014] In combination with the seventh possible implementation of the first aspect, an embodiment of the present invention provides an eighth possible implementation of the first aspect, wherein the above method also includes: responding to the vehicle delivery request sent by the dispatching terminal, searching for a vehicle delivery point that matches the distance of the dispatching terminal, and sending the found vehicle delivery point information to the dispatching terminal; wherein the vehicle delivery request includes at least one of the following information: the number of vehicles delivered to each of the target vehicle delivery points has been completed, and it is determined that the carrier has remaining shared vehicles; the current target vehicle delivery point does not meet the vehicle delivery demand.

[0015] In a second aspect, an embodiment of the present invention further provides a dispatching device for shared vehicles, the device comprising: a response module, used to respond to the online operation of the dispatching terminal and obtain the vehicle information of the dispatching terminal; a search module, used to search for at least one target pulling point matching the dispatching terminal based on the vehicle information, and to search for at least one target vehicle delivery point matching the dispatching terminal; wherein the sum of the number of pulling vehicles at at least one of the target pulling points matches the vehicle capacity of the vehicle corresponding to the dispatching terminal; a generation module, used to generate a dispatching order based on the location information of each of the target pulling points and the target vehicle delivery point; a dispatching module, used to send the dispatching order to the dispatching terminal so as to display the dispatching order through the graphical user interface of the dispatching terminal, wherein the displayed content includes: the location information of at least one of the target pulling points, the location information of at least one of the target vehicle delivery points, and a dispatching path connecting each of the target pulling points and each of the target vehicle delivery points.

[0016] In a third aspect, an embodiment of the present invention further 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 implements the method described in the first aspect when executing the computer program.

[0017] In a fourth aspect, an embodiment of the present invention further 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 the first aspect is implemented.

[0018] The embodiments of the present invention bring the following beneficial effects:

[0019] The scheduling method and device for shared vehicles provided by the embodiments of the present invention can respond to the online operation of the scheduling terminal and obtain the vehicle information of the scheduling terminal; then, based on the vehicle information, find at least one target pulling point that matches the scheduling terminal, and find at least one target vehicle delivery point that matches the scheduling terminal, so that the sum of the number of pulled vehicles at the target pulling point matches the vehicle capacity of the vehicle corresponding to the scheduling terminal, and then generate a scheduling order based on the location information of each target pulling point and the target vehicle delivery point; send the scheduling order to the scheduling terminal to display the scheduling order through the graphical user interface of the scheduling terminal, wherein the displayed content includes: the location information of at least one target pulling point, the location information of at least one target vehicle delivery point, and the scheduling path connecting each target pulling point and each target vehicle delivery point, thereby realizing the combined scheduling of multiple parking points, and realizing the simultaneous pushing of multiple pulling points for scheduling, thereby improving the scheduling efficiency of shared vehicles and making full use of the shared resources of shared vehicles.

[0020] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention are realized and obtained by the structures particularly pointed out in the description, claims and drawings.

[0021] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without paying any creative work.

[0023] Figure 1 A flow chart of a method for scheduling a shared vehicle provided by an embodiment of the present invention;

[0024] Figure 2 A flowchart of another method for scheduling a shared vehicle provided by an embodiment of the present invention;

[0025] Figure 3 A schematic diagram showing a scheduling order provided by an embodiment of the present invention;

[0026] Figure 4 A schematic diagram of the structure of a scheduling device for a shared vehicle provided in an embodiment of the present invention;

[0027] Figure 5 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0028] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0029] At present, the dispatch of shared vehicles is mostly based on the principle of satisfying the number of vehicles required by the dispatch specialist to determine the pick-up point. This method ensures that the dispatch specialist can fully utilize the vehicle capacity to a certain extent and avoid waste of resources. However, this method will also cause some parking points where the number of backlogged vehicles is less than the vehicle capacity to be ignored, resulting in the backlog of vehicles being stranded for a long time, reducing the flexibility of shared vehicle dispatch and the utilization rate of shared resources.

[0030] Based on this, a shared vehicle dispatching method and device provided in an embodiment of the present invention can realize the packaging and combination of multiple parking spots, ensuring that during the dispatching process, the total number of vehicles that can be pulled at each parking spot in the combination is greater than the vehicle capacity of the dispatch specialist, thereby improving the dispatching efficiency.

[0031] To facilitate understanding of this embodiment, a method for dispatching a shared vehicle disclosed in an embodiment of the present invention is first introduced in detail.

[0032] In one possible implementation, an embodiment of the present invention provides a scheduling method for a shared vehicle. Specifically, the method can be applied to a background server of a shared vehicle, and the background server communicates with the shared vehicle. At the same time, the background server can also communicate with a user terminal to facilitate interaction with the user through the user terminal during the user's use of the vehicle.

[0033] Among them, the user terminals in the embodiments of the present invention include operation and maintenance terminals used by operation and maintenance personnel, dispatch terminals used by dispatch specialists, and smart terminals used by people using shared vehicles, etc., and the user terminals can be smart terminals such as smart phones, tablet computers, and handheld computers used by users, and the user terminals are usually installed with application programs APP that match the shared vehicles. Users can start the application program APP and then establish communication with the background server.

[0034] Furthermore, the shared vehicles in the embodiments of the present invention may be shared bicycles, shared electric cars, shared electric motorcycles, etc., and the embodiments of the present invention are not limited to this.

[0035] For ease of understanding, Figure 1 A flow chart of a method for dispatching a shared vehicle is shown, the method comprising the following steps:

[0036] Step S102, responding to the dispatch terminal online operation, obtaining the vehicle information of the dispatch terminal;

[0037] Usually, when a dispatch specialist starts dispatching a shared vehicle, he or she can log in to the dispatch terminal. Taking the dispatch terminal as a smartphone used by the dispatch specialist, the dispatch specialist can log in to the application APP installed on the smartphone, and then go to the dispatch interface. At this time, the background server can detect that the dispatch specialist is online. Alternatively, the dispatch specialist touches the online control on the dispatch interface to send the online information to the background server. At this time, the background server can also detect that the dispatch specialist is online and respond.

[0038] At the same time, after the dispatch specialist comes online, he can select the dispatch vehicle used for this dispatch task in the dispatch interface and submit the vehicle information to the background server. After the background server receives the vehicle information submitted by the dispatch specialist, it can learn the specific type of vehicle currently used by the dispatch specialist, such as tricycles, new energy vehicles, trucks, etc., and learn the corresponding vehicle capacity, that is, the number of shared vehicles that the vehicle can accommodate at one time.

[0039] Step S104, based on the vehicle information, searching for at least one target vehicle pulling point that matches the dispatching terminal, and searching for at least one target vehicle dropping point that matches the dispatching terminal;

[0040] Wherein, the sum of the number of vehicles pulled at at least one target pulling point matches the vehicle capacity of the vehicle corresponding to the dispatching terminal;

[0041] Step S106, generating a dispatch order based on the location information of each target vehicle pulling point and target vehicle delivery point;

[0042] Among them, the pull-up point in the embodiment of the present invention refers to a parking spot with low demand for shared vehicles, and the parking spot refers to a pre-planned area for parking shared vehicles, which usually has obvious parking marks to facilitate users to find the area and park or use the vehicle.

[0043] For example, during a certain period of time, there are many users parking at a certain parking spot, causing the number of parking spaces at the parking spot to exceed the parking capacity, resulting in a backlog of shared vehicles. At this time, the parking spot can be regarded as a pulling point.

[0044] Furthermore, the above-mentioned vehicle drop point refers to a parking point with a high demand for shared vehicles. For example, in a certain period of time, there are many users of shared vehicles at a certain parking point. In order to avoid the phenomenon of shared vehicles being in short supply, the parking point can be used as a vehicle drop point to facilitate the dispatch specialist to transfer the shared vehicles at the pulling point to the vehicle drop point in time.

[0045] It should be understood that the above-mentioned car-pulling points and car-dropping points are relative. For example, in a certain period of time, parking point A can be a car-pulling point, and in another period of time, the parking point A can be a car-dropping point. For example, the parking point at the entrance and exit of a residential area can be used as a car-dropping point during the morning rush hour when the demand for shared vehicles is relatively high. During this time, the parking point at the entrance and exit will have a backlog of shared vehicles during the evening rush hour. At this time, the parking point can be used as a car-pulling point.

[0046] In actual use, the background server can combine historical order data and real-time shared vehicle usage data to predict demand trends in different areas and parking spots, and combine the real-time shared vehicle inventory at the current parking spot to predict whether each parking spot needs to be dispatched, that is, to predict in advance the pulling points and the dropping points, as well as the number of pulling cars at each pulling point and the number of dropping cars at each dropping point. In addition, the data predicted by the background server is usually stored in a database. For example, information such as the pulling points and the number of pulling cars is stored in the pulling car database, while information such as the dropping points and the number of dropping cars is stored in the dropping car database, so that when executing the above step S104, the corresponding database can be directly called to find matching target pulling points and target dropping points.

[0047] Furthermore, in an embodiment of the present invention, in the above step S104, when searching for a target pulling point, the pulling points near the dispatch specialist can be considered, that is, multiple available pulling points can be provided. Specifically, when the pulling quantity of a pulling point meets the vehicle capacity of the dispatch specialist, one target pulling point can be matched. When the pulling quantity of a single pulling point does not meet the vehicle capacity of the dispatch specialist, such as being less than the vehicle capacity, multiple target pulling points can be matched. That is, the sum of the pulling quantities of at least one target pulling point matches the vehicle capacity of the vehicle corresponding to the dispatch terminal. Similarly, at least one target vehicle delivery point found, the sum of its vehicle delivery quantities also matches the vehicle capacity of the vehicle, so that the dispatch resources of the vehicle are fully utilized.

[0048] Specifically, a pulling point and a dropping point can be provided first, and a scheduling route can be planned. If the number of pulling vehicles at the pulling point does not meet the vehicle capacity, a second pulling point can be provided, and usually the second pulling point is located near the planned scheduling route. If the sum of the number of pulling vehicles at the second pulling point and the number of pulling vehicles at the first pulling point is still less than the vehicle capacity, a third pulling point can be provided until the sum of the number of pulling vehicles is greater than or equal to the vehicle capacity. Similarly, if a dropping point provided first does not meet the vehicle capacity, for example, the number of dropped vehicles is less than the vehicle capacity, a second dropping point can be provided near the first dropping point until the sum of the number of dropped vehicles is greater than or equal to the vehicle capacity.

[0049] Then, perform the process of step S106 again to generate a scheduling order based on the position information of each target vehicle pulling point and target vehicle dropping point, that is, plan a scheduling path.

[0050] Step S108: Send the scheduling order to the scheduling terminal to display the scheduling order through the graphical user interface of the scheduling terminal.

[0051] Among them, the displayed content includes: the position information of at least one target vehicle pulling point, the position information of at least one target vehicle dropping point, and the scheduling path connecting each target vehicle pulling point and each target vehicle dropping point.

[0052] Specifically, after receiving the scheduling order, the scheduling terminal can, according to the scheduling order, display an electronic map on the graphical user interface, display the positions of each target vehicle pulling point and each target vehicle dropping point on the electronic map, and display the scheduling path. It can also provide the details of each target vehicle pulling point and each target vehicle dropping point in the form of a list for the scheduling specialist to view.

[0053] For the sake of easy understanding, Figure 2 a schematic diagram of the display of a scheduling order is shown, where Figure 2 two target vehicle pulling points and two target vehicle dropping points are taken as examples for display, where Figure 2 "Pull" in it represents the vehicle pulling point, Figure 2 "Drop" in it represents the vehicle dropping point, Figure 2 the connection line in it represents the scheduling path, and Figure 2 the list detail information of each target vehicle pulling point and target vehicle dropping point is shown below in it; further, Figure 2 the remaining vehicle pulling time and the number of vehicles to be pulled are also shown in it, that is Figure 2 "30 minutes" and "18 vehicles" in it. The remaining vehicle pulling time is used to prompt the scheduling specialist to complete the vehicle pulling task within the specified time, and the number of vehicles to be pulled is used to record the number of vehicles to be pulled corresponding to this vehicle pulling task. Usually, the maximum value represents the vehicle capacity, and as the vehicle pulling task progresses, the displayed number of vehicles to be pulled can gradually decrease to prompt the scheduling specialist that there are still shared vehicles with the remaining number of vehicles to be pulled away.

[0054] Based on Figure 2 the displayed scheduling order, the scheduling specialist can, according to the list detail information or by touching the navigation control, reach the corresponding target vehicle pulling point to pull the vehicle to execute the scheduling task.

[0055] The scheduling method for shared vehicles provided in an embodiment of the present invention can respond to the online operation of the scheduling terminal and obtain the vehicle information of the scheduling terminal; then, based on the vehicle information, find at least one target pulling point that matches the scheduling terminal, and find at least one target vehicle delivery point that matches the scheduling terminal, so that the sum of the number of pulled vehicles at the target pulling point matches the vehicle capacity of the vehicle corresponding to the scheduling terminal, and then generate a scheduling order based on the location information of each target pulling point and the target vehicle delivery point; send the scheduling order to the scheduling terminal to display the scheduling order through the graphical user interface of the scheduling terminal, wherein the displayed content includes: the location information of at least one target pulling point, the location information of at least one target vehicle delivery point, and the scheduling path connecting each target pulling point and each target vehicle delivery point, thereby realizing the combined scheduling of multiple parking points, and realizing the simultaneous pushing of multiple pulling points for scheduling, thereby improving the scheduling efficiency of shared vehicles and making full use of the shared resources of shared vehicles.

[0056] In actual use, the above-mentioned target pulling point is usually a pulling point that is closer to the dispatch specialist to improve the dispatch efficiency of the dispatch specialist. Therefore, in the above-mentioned step S104, when searching for a matching target pulling point, the vehicle capacity can be extracted from the vehicle information; the pulling point that matches the distance of the dispatch terminal is searched from the pulling point database as a candidate pulling point, for example, the pulling point that is within a preset distance range from the dispatch terminal is searched; and then the target pulling point is selected from the candidate pulling points in turn until the sum of the pulling quantities of the selected target pulling points is greater than or equal to the vehicle capacity.

[0057] In addition, in addition to the above-mentioned method of matching the target pulling point from the pulling database, in an embodiment of the present invention, real-time reporting information can also be considered when matching the target pulling point. Usually, operation and maintenance personnel or dispatching personnel, etc., can report the parking points in real time, such as reporting that there is a backlog of shared vehicles at a certain parking point, or that the inventory of a certain parking point is insufficient, etc. In addition to combining historical order data, the backend server can also combine these real-time reported information. Specifically, when searching for the target pulling point, the backend server can respond to receiving the pulling point reporting information, wherein the pulling point reporting information carries the pulling point, and then the backend server can search for the pulling point reported by the pulling point reporting information and the pulling point that matches the distance of the dispatch terminal as at least one target pulling point of the dispatch terminal.

[0058] Since the information reported by the pulling point is reported in real time, it is more timely than the data in the pulling database. Therefore, it can also improve the scheduling efficiency of the pulling point to a certain extent.

[0059] Usually, for the pull point report information, the backend server needs to verify it first, for example, to determine whether the pull point reported by the pull point report information overlaps with the currently running dispatch order to avoid duplicate dispatch problems. In addition, for the pull point report information, if the reported pull point is not processed within a certain time limit, the pull point reported by the pull point report information will also flow into the pulling database to wait for dispatch.

[0060] In addition, for the vehicle pulling database, the backend server can update it according to the real-time order data. For example, when the inventory vehicles of the vehicle pulling point are used for a period of time, and the number of its inventory vehicles drops to the normal operating number, the vehicle pulling point can also be deleted from the vehicle pulling database. Similarly, the data of the vehicle delivery database can also be updated in real time, which can be set according to the actual usage, and the embodiment of the present invention does not limit this.

[0061] Furthermore, in addition to the above-mentioned vehicle pulling report information, in an embodiment of the present invention, the background server can also receive vehicle delivery report information in real time, and promptly process the vehicle delivery point that needs to deliver the vehicle.

[0062] Therefore, in the embodiment of the present invention, an information reporting operation can be responded to. Specifically, the information reporting operation can be performed by a dispatch specialist through a dispatch terminal, or by an operation and maintenance personnel through an operation and maintenance terminal. Furthermore, it can also be performed by a user of a shared vehicle through a smart terminal. The specific operation is subject to actual usage and is not limited by the embodiment of the present invention.

[0063] Furthermore, the background server may respond to the above-mentioned information reporting operation, that is, in response to the information reporting operation, display an information reporting interface on the graphical user interface of the user terminal, as well as at least one parking point within a preset distance from the current user terminal; wherein the user terminal at this time may be the operation and maintenance terminal used by the above-mentioned operation and maintenance personnel, the dispatching terminal used by the dispatching specialist, and the smart terminal used by people using shared vehicles, etc.

[0064] Moreover, the above-mentioned information reporting interface includes an information reporting control and an information submission control; wherein, the information reporting control is used for users to input reporting information, and the information reporting control includes a car pulling point reporting control and a car delivery point reporting control; the user can enter the information of a specific parking point in the information reporting control, such as a parking point that needs to deliver a car, or a parking point that needs to pull a car, etc., and then touch the information submission control. At this time, the background server can respond to the touch operation on the information submission control and generate reporting information, and the reporting information includes car pulling point reporting information, or car delivery point reporting information.

[0065] Furthermore, if the information reported by the car pulling point or the car delivery point is not processed within a certain time limit, it can be stored in the database and wait for subsequent processing, such as entering the car pulling point reported by the car pulling point into the car pulling database, or entering the car delivery point reported by the car delivery point into the car delivery database, and so on.

[0066] Furthermore, in an embodiment of the present invention, the dispatch specialist can process the above-mentioned vehicle delivery point reporting information in real time during the dispatch process. For example, after the vehicle is pulled, the background server can match the monitored vehicle delivery point reporting information, so that the dispatch specialist can give priority to delivering the vehicle to the vehicle delivery point in the vehicle delivery point reporting information.

[0067] Furthermore, for ease of understanding, Figure 1 On the basis of Figure 3 A flow chart of another method for scheduling shared vehicles is shown to further illustrate the scheduling process of shared vehicles.

[0068] like Figure 3 As shown, the following steps are included:

[0069] Step S302, responding to the dispatch terminal online operation, obtaining the vehicle information of the dispatch terminal;

[0070] Step S304, based on the vehicle information, searching for at least one target vehicle pulling point that matches the dispatching terminal, and searching for at least one target vehicle dropping point that matches the dispatching terminal;

[0071] Among them, the sum of the number of vehicles pulled at at least one target pulling point matches the vehicle capacity of the vehicle corresponding to the dispatching terminal.

[0072] Step S306, generating a dispatch order based on the location information of each target vehicle pulling point and target vehicle delivery point;

[0073] Step S308, sending the dispatch order to the dispatch terminal so as to display the dispatch order through the graphical user interface of the dispatch terminal;

[0074] The displayed content includes: location information of at least one target vehicle pulling point, location information of at least one target vehicle delivery point, and a scheduling path connecting each target vehicle pulling point and each target vehicle delivery point.

[0075] The processes of the above steps S302 to S308 may refer to the processes of the above steps S102 to S108.

[0076] Step S310, the dispatch specialist arrives at the target pulling point to perform the pulling task;

[0077] Specifically, after the dispatch specialist starts the dispatch task based on the displayed dispatch order, when arriving at the pulling point to pull the vehicle, the dispatch terminal can be used to scan the identification code of the shared vehicle to report the dispatched shared vehicle to the backend server for recording. Furthermore, when the dispatch specialist pulls the vehicle, the backend server can respond to the pulling operation based on the reporting information of the dispatch terminal scanning the identification code of the shared vehicle, that is, in response to the pulling operation reported by the dispatch terminal based on the dispatch order, the display status of the target pulling point corresponding to the pulling operation is updated in the graphical user interface. For example, Figure 2 The color of the first target pulling point to be reached turns gray so that the dispatch order of the dispatch specialist can be tracked and displayed on the dispatch terminal.

[0078] Furthermore, if there is only one target pull-in point, after the dispatch specialist pulls the shared vehicle of the target pull-in point, he can click the [Go to Car] control in the graphical user interface and drive the vehicle to the target car drop-in point to drop the vehicle. When there are multiple target pull-in points, after the dispatch specialist pulls the shared vehicle of the current target pull-in point, if the vehicle capacity is not met, he will go to the next target pull-in point to pull the vehicle; if the vehicle capacity is met (for example, during the pull-in process, there are other shared vehicles flowing in), he will click the [Go to Car] control and drive the vehicle to the target car drop-in point to drop the vehicle.

[0079] Step S312, the dispatch terminal completes the pulling of the vehicle based on the dispatch order;

[0080] Step S313, in response to the dispatching terminal completing the pulling of the vehicle based on the dispatching order, if the vehicle delivery point reporting information is monitored, then determining whether the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition;

[0081] If yes, execute step S314, if no, execute step S315 to directly record the reported information of the vehicle delivery point.

[0082] Furthermore, if no reporting information of the vehicle delivery point is monitored, step S316 is directly executed.

[0083] Step S314, updating the target vehicle delivery point of the dispatch order to the vehicle delivery point in the vehicle delivery point reporting information, and displaying the updated dispatch order through the graphical user interface of the dispatch terminal;

[0084] Specifically, if in the above step S312, it is determined that the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition, the target vehicle delivery point of the scheduling order is updated to the vehicle delivery point in the vehicle delivery point reporting information to update the scheduling order.

[0085] Specifically, in an embodiment of the present invention, when judging whether the vehicle delivery point in the vehicle delivery point reporting information satisfies the replacement condition, it is usually necessary to first find out whether the vehicle delivery point in the current vehicle delivery point reporting information coincides with the target vehicle delivery point of other scheduling orders; if so, it means that the vehicle delivery point is within the scheduling plan at this time, avoiding repeated scheduling, that is, at this time, it can be determined that the vehicle delivery point in the vehicle delivery point reporting information does not meet the replacement condition; if not, the target vehicle delivery point of the scheduling order is updated to the vehicle delivery point in the vehicle delivery point reporting information, and a predicted scheduling path is generated based on the updated scheduling order; then it is further judged whether the path difference between the predicted scheduling path and the original scheduling path meets the preset scheduling threshold, or whether the predicted scheduling path is less than or equal to the scheduling path; if the path difference meets the preset scheduling threshold, or the predicted scheduling path is less than or equal to the scheduling path, it is determined that the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition; otherwise, it is determined that the vehicle delivery point in the vehicle delivery point reporting information does not meet the replacement condition.

[0086] Specifically, when the path difference is less than or equal to the preset threshold, it means that the scheduling threshold is met, that is, the updated vehicle delivery point cannot be too far from the original vehicle delivery point, or the predicted scheduling path in the updated scheduling order is shortened and is less than the original scheduling path, which can also mean that the replacement condition is met, that is, the scheduling path is shortened and the scheduling efficiency can be improved.

[0087] For example, for dispatch order A, one of the target vehicle delivery points is vehicle delivery point A, and the dispatch specialist at this time is specialist A. When other dispatch specialist B passes by parking point B during work and believes that parking point B needs to deliver a shared vehicle, dispatch specialist B can report the location through the operation and maintenance terminal, that is, submit the vehicle delivery point reporting information. For example, enter the location of parking point B in the information reporting control of the above information reporting interface. At this time, the background server can predict the number of vehicles corresponding to parking point B and the deadline for vehicle shortage corresponding to parking point B from the recorded parking point information (such as the inventory of parking point B) based on the location of parking point B.

[0088] In addition, the backend server can determine whether the parking point in the current parking point reporting information meets the replacement conditions based on the received parking point reporting information, for example, determine whether the parking point B reported by dispatch specialist B can be used as the target parking point for dispatch order A.

[0089] First, the backend server can first determine whether the target vehicle delivery point coincides with the point of parking point B in all the dispatch orders currently being processed. If there is an overlap, it will not be processed to avoid repeated dispatch; if not, it will further determine whether the distance of the dispatch path will be shortened after replacing the target vehicle delivery point with the above parking point B, or whether the path difference is less than the dispatch threshold. If yes, it can be directly replaced to improve dispatch efficiency; if not, parking point B will be recorded to provide data support for subsequent analysis.

[0090] Furthermore, for situations where the replacement conditions are met, such as dispatch order A, the background server can modify the target vehicle delivery point of dispatch order A to parking point B, and provide prompts on the graphical interface of the dispatch terminal of dispatch specialist A, such as displaying the updated dispatch order, and providing voice broadcast prompts, etc.

[0091] In actual use, the above-mentioned method of reporting information to the parking point realizes a scout mode. For example, during actual patrols, the dispatch specialist can discover the shortage of vehicles at the parking point in a more real-time and accurate manner. In addition, through real-time information reporting by operation and maintenance personnel or dispatch specialists, or even users of shared vehicles, the background server can obtain real-time data for efficient interaction and analysis, providing more accurate and real-time information and more flexible decision-making support for the multi-point dispatch of shared vehicles, further optimizing the dispatch efficiency and service quality of shared vehicles.

[0092] Step S316, responding to the dispatching terminal to reach the target vehicle delivery point in turn, monitoring the number of vehicles delivered to each target vehicle delivery point until the dispatching order is completed.

[0093] Specifically, when the dispatch specialist arrives at the target vehicle delivery point, he can touch the vehicle delivery control on the dispatch terminal to deliver the vehicle. At this time, the background server can respond to monitor the number of vehicles delivered to each target vehicle delivery point.

[0094] For example, when the dispatch specialist arrives at the target vehicle deployment point, he or she can click the "one-click vehicle deployment" control to deploy and lock the vehicle, or he or she can unlock or unlock a single shared vehicle (for example, by scanning a code) and deploy it.

[0095] Furthermore, in the embodiment of the present invention, the background server may also respond to the vehicle delivery request sent by the dispatch terminal, search for a vehicle delivery point that matches the distance of the dispatch terminal, and send the found vehicle delivery point information to the dispatch terminal.

[0096] Specifically, the vehicle delivery request is usually sent by a dispatch specialist to the backend server when the current target vehicle delivery point is unable to deliver a vehicle.

[0097] For example, when the target delivery point meets the capacity, if there are no remaining shared vehicles on the vehicle, the dispatch specialist can complete the dispatch order and obtain a new dispatch order; if there are still remaining shared vehicles, the dispatch specialist can deliver vehicles to the next target delivery point in the dispatch order. If there is no next target delivery point and there are still remaining shared vehicles on the vehicle, the dispatch specialist can send a delivery request to the background server. At this time, the background server can provide a relatively close delivery point based on the location information of the dispatch specialist. The dispatch specialist can continue to deliver vehicles at the delivery point until there are no remaining shared vehicles on the vehicle. Therefore, the above delivery request includes at least one of the following information: the number of delivery vehicles at each target delivery point is completed, and it is determined that there are remaining shared vehicles on the vehicle.

[0098] In addition, the above-mentioned vehicle delivery information may also include that the current target vehicle delivery point does not meet the vehicle delivery demand. For example, the location of the vehicle delivery point provided by the background server is unreasonable, or scheduling is not allowed at this time. The dispatch specialist can report the information that the current target vehicle delivery point does not meet the vehicle delivery demand through the dispatch terminal, and further add information to explain that the target vehicle delivery point cannot operate, cannot deliver a vehicle to cancel the order, etc., so that the background server can re-assign a new dispatch order. The specific settings can be made according to actual usage, and the embodiments of the present invention are not limited to this.

[0099] In summary, the shared vehicle scheduling method provided by the embodiment of the present invention has the following beneficial effects:

[0100] (1) More efficient resource utilization: By combining multiple parking spots, even if the number of shared vehicles that can be dispatched at each individual parking spot is limited, enough shared vehicles can be assembled to fully utilize the vehicle space. For example, there are two parking spots A and B. There are 6 vehicles that need to be taken away at spot A and 5 vehicles that need to be taken away at spot B. After the combination, there are 11 vehicles, which meets the vehicle capacity requirements, thereby increasing the vehicle transportation volume for each dispatch and making more efficient use of resources.

[0101] (2) More flexible to changes in demand: When faced with such sudden changes in demand, shared vehicles can be quickly dispatched from multiple directions by combining multiple parking spots. That is, shared vehicles can be dispatched from several surrounding parking spots at the same time. By optimizing routes, shared vehicles can be deployed to hot spots more quickly, thereby improving the response speed to changes in market demand.

[0102] (3) Optimizing dispatch routes for higher efficiency: By rationally combining parking spots, more efficient dispatch routes can be planned. For example, by combining parking spots on the same route or in adjacent areas, dispatch specialists can visit these parking spots in sequence to collect vehicles in one trip, reducing unnecessary round trips, improving dispatch efficiency, and reducing transportation costs.

[0103] (4) Improve user experience: Through the combined dispatch of multiple parking spots, shared vehicles can be deployed to various areas more quickly, improving the coverage and availability of shared vehicles. Users can easily find available shared vehicles in more places, reducing users' waiting time and the cost of finding shared vehicles, thereby improving user experience and increasing user satisfaction and loyalty to shared vehicle services.

[0104] (5) Through real-time information reporting by operation and maintenance personnel or dispatch specialists, or even by users of shared vehicles, the backend server can obtain real-time data for efficient interaction and analysis, providing more accurate and real-time information and more flexible decision support for multi-point dispatch of shared vehicles, further optimizing the dispatch efficiency and service quality of shared vehicles.

[0105] Further, based on the above embodiment, the embodiment of the present invention also provides a scheduling device for a shared vehicle, such as Figure 4 A schematic structural diagram of a scheduling device for a shared vehicle is shown, the device comprising:

[0106] A response module 40, used to respond to the online operation of the dispatch terminal and obtain the vehicle information of the dispatch terminal;

[0107] A search module 42 is used to search for at least one target vehicle pulling point that matches the dispatch terminal based on the vehicle information, and to search for at least one target vehicle delivery point that matches the dispatch terminal; wherein the sum of the number of vehicles pulled by at least one of the target vehicle pulling points matches the vehicle capacity of the vehicle corresponding to the dispatch terminal;

[0108] A generating module 44, configured to generate a dispatch order based on the location information of each of the target vehicle pulling point and the target vehicle delivery point;

[0109] The scheduling module 46 is used to send the scheduling order to the scheduling terminal so that the scheduling order can be displayed through the graphical user interface of the scheduling terminal, wherein the displayed content includes: the location information of at least one of the target pulling points, the location information of at least one of the target vehicle delivery points, and the scheduling path connecting each of the target pulling points and each of the target vehicle delivery points.

[0110] The shared vehicle scheduling device provided in the embodiment of the present invention has the same technical features as the shared vehicle scheduling method provided in the above embodiment, so it can also solve the same technical problems and achieve the same technical effects.

[0111] Furthermore, an embodiment of the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above method when executing the computer program.

[0112] An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above method are executed.

[0113] Furthermore, an embodiment of the present invention also provides a structural diagram of an electronic device, such as Figure 5 As shown, it is a schematic diagram of the structure of the electronic device, wherein the electronic device includes a processor 51 and a memory 50, the memory 50 stores computer executable instructions that can be executed by the processor 51, and the processor 51 executes the computer executable instructions to implement the above method.

[0114] exist Figure 5 In the illustrated embodiment, the electronic device further includes a bus 52 and a communication interface 53 , wherein the processor 51 , the communication interface 53 and the memory 50 are connected via the bus 52 .

[0115] Among them, the memory 50 may include a high-speed random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 53 (which can be wired or wireless), and the Internet, wide area network, local area network, metropolitan area network, etc. can be used. The bus 52 can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus 52 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 5 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0116] The processor 51 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit in the processor 51 or the instruction in the form of software. The above processor 51 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in the embodiment of the present invention can be directly embodied as a hardware decoding processor to execute, or it can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor 51 reads the information in the memory and completes the above method in combination with its hardware.

[0117] The computer program product of the shared vehicle scheduling method and device provided in the embodiments of the present invention includes a computer-readable storage medium storing program code. The instructions included in the program code can be used to execute the methods described in the previous method embodiments. The specific implementation can be found in the method embodiments, which will not be repeated here.

[0118] 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 embodiment, and will not be repeated here.

[0119] In addition, in the description of the embodiments of the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, and it can be the internal communication of two components. For those skilled in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0120] If the functions are implemented in the form of software functional units 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 invention, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for 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 invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc., which can store program codes.

[0121] In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only, and cannot be understood as indicating or implying relative importance.

[0122] Finally, it should be noted that the above embodiments are only specific implementations of the present invention, which are used to illustrate the technical solutions of the present invention, rather than to limit them. The protection scope of the present invention is not limited thereto. Although the present invention is described in detail with reference to the above embodiments, those skilled in the art should understand that any person skilled in the art can still modify the technical solutions recorded in the above embodiments within the technical scope disclosed by the present invention, or can easily think of changes, or make equivalent replacements for some of the technical features therein; and these modifications, changes or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. A method for dispatching a shared vehicle, characterized in that: The method comprises: In response to the dispatch terminal online operation, obtain the vehicle information of the dispatch terminal; Based on the vehicle information, searching for at least one target vehicle pulling point that matches the dispatching terminal, and searching for at least one target vehicle delivery point that matches the dispatching terminal; wherein the sum of the number of vehicles pulled by at least one of the target vehicle pulling points matches the vehicle capacity of the vehicle corresponding to the dispatching terminal; Generate a dispatch order based on the location information of each of the target vehicle pulling point and the target vehicle delivery point; The dispatch order is sent to the dispatch terminal so as to be displayed through the graphical user interface of the dispatch terminal, wherein the displayed content includes: location information of at least one of the target vehicle pulling points, location information of at least one of the target vehicle delivery points, and a dispatch path connecting each of the target vehicle pulling points and each of the target vehicle delivery points.

2. The method according to claim 1, characterized in that The step of searching for at least one target vehicle pulling point matching the dispatching terminal comprises: Extracting the vehicle capacity from the vehicle information; Searching for a pulling point with a distance matching that of the dispatch terminal from a pulling point database as a candidate pulling point; The target pulling points are selected from the candidate pulling points in sequence until the sum of the pulling quantities of the selected target pulling points is greater than or equal to the vehicle capacity.

3. The method according to claim 1, characterized in that The step of searching for at least one target vehicle pulling point matching the dispatching terminal further includes: Responding to receiving the reported information of the pulling point, wherein the reported information of the pulling point carries the pulling point; A pulling point having a matching distance with the dispatching terminal is searched from the pulling points reported in the pulling point reporting information as at least one target pulling point of the dispatching terminal.

4. The method according to claim 1, characterized in that: The method further comprises: In response to the dispatching terminal completing the pulling of the vehicle based on the dispatching order, if the vehicle delivery point reporting information is monitored, determining whether the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition; If yes, the target vehicle delivery point of the dispatch order is updated to the vehicle delivery point in the vehicle delivery point reporting information, and the updated dispatch order is displayed through the graphical user interface of the dispatch terminal.

5. The method according to claim 4, characterized in that The step of determining whether the vehicle delivery point in the vehicle delivery point reporting information meets the replacement condition comprises: Find out whether the vehicle delivery point in the vehicle delivery point reporting information coincides with the target vehicle delivery point of other dispatching orders; If yes, it is determined that the vehicle delivery point in the vehicle delivery point reporting information does not meet the replacement condition; If not, the target vehicle delivery point of the dispatch order is updated to the vehicle delivery point in the vehicle delivery point reporting information, and a predicted dispatch path is generated based on the updated dispatch order; Determine whether a path difference between the predicted scheduling path and the scheduling path satisfies a preset scheduling threshold, or whether the predicted scheduling path is less than or equal to the scheduling path; If the path difference satisfies a preset scheduling threshold, or the predicted scheduling path is less than or equal to the scheduling path, it is determined that the vehicle delivery point in the vehicle delivery point reporting information satisfies a replacement condition; If the preset scheduling threshold is not met, it is determined that the vehicle delivery point in the vehicle delivery point reporting information does not meet the replacement condition.

6. The method according to claim 3 or 4, characterized in that: The method further comprises: In response to the information reporting operation, the graphical user interface of the user terminal displays an information reporting interface and at least one parking point within a preset distance from the current user terminal; wherein the information reporting interface includes an information reporting control and an information submission control; the information reporting control is used for the user to input reporting information, and the information reporting control includes a car pulling point reporting control and a car delivery point reporting control; In response to the touch operation on the information submission control, reporting information is generated, and the reporting information includes vehicle pulling point reporting information or vehicle delivery point reporting information.

7. The method according to claim 1, characterized in that The method further comprises: In response to the vehicle pulling operation reported by the dispatch terminal based on the dispatch order, a display status of the target vehicle pulling point corresponding to the vehicle pulling operation is updated in the graphical user interface.

8. The method according to claim 1, characterized in that The method further comprises: In response to the dispatching terminal reaching the target vehicle delivery point in turn, the number of vehicles delivered to each target vehicle delivery point is monitored until the dispatching order is completed.

9. The method according to claim 8, characterized in that The method further comprises: In response to the vehicle delivery request sent by the dispatch terminal, searching for a vehicle delivery point that matches the distance of the dispatch terminal, and sending the found vehicle delivery point information to the dispatch terminal; The vehicle delivery request includes at least one of the following information: The number of vehicles delivered to each target delivery point is completed, and it is determined that there are remaining shared vehicles on the carrier; The current target vehicle delivery point does not meet the vehicle delivery requirements.

10. A dispatching device for a shared vehicle, characterized in that: The device comprises: A response module, used to respond to the online operation of the dispatch terminal and obtain the vehicle information of the dispatch terminal; A search module, used to search for at least one target vehicle pulling point matching the dispatching terminal based on the vehicle information, and to search for at least one target vehicle delivery point matching the dispatching terminal; wherein the sum of the number of vehicles pulled by at least one of the target vehicle pulling points matches the vehicle capacity of the vehicle corresponding to the dispatching terminal; A generation module, used for generating a dispatch order based on the location information of each of the target vehicle pulling point and the target vehicle delivery point; A scheduling module is used to send the scheduling order to the scheduling terminal so that the scheduling order can be displayed through the graphical user interface of the scheduling terminal, wherein the displayed content includes: the location information of at least one of the target pulling points, the location information of at least one of the target vehicle delivery points, and the scheduling path connecting each of the target pulling points and each of the target vehicle delivery points.

Images