Shared vehicle recommendation method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention provides a shared vehicle recommendation method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining a first region to which a current location address of a target user belongs, and a second region to which a destination address of the target user belongs; and in response to the fact that the first area and the second area are different areas and the vehicle whose operation area is the second area is parked in the first area, selecting the vehicle which is parked in the first area and whose operation area is the second area to obtain a to-be-recommended vehicle, and recommending the to-be-recommended vehicle to the target user. According to the method, the shared vehicles parked in the non-specified operation area are recommended to the user, so that the user replaces a worker to complete recovery scheduling work, resource waste and human input are reduced, and the problem that the user has no available vehicles in temporary cross-area is solved.

Description

Technical Field

[0001] The present application relates to the field of computer application technologies, and in particular, to a method, apparatus, electronic device, and storage medium for recommending shared vehicles. Background Art

[0002] With the emergence of shared vehicles, such as shared bicycles and shared electric vehicles, etc., a green and environmentally friendly travel solution is provided for people's daily travel. Shared vehicles can usually only travel within the specified operating area. Beyond the operating area, there will be problems such as power failure, inability to return the vehicle, inability to unlock the vehicle, and collection of dispatching fees. However, currently, for shared vehicles outside the operating area, they are mainly recycled and dispatched by staff, and users cannot continue to use them, which causes a great waste of resources and human input. Summary of the Invention

[0003] The purpose of the embodiments of the present application is to provide a method, apparatus, electronic device, and storage medium for recommending shared vehicles to solve the problem of "resource waste caused by staff recycling and dispatching shared vehicles outside the operating area". The specific technical solutions are as follows:

[0004] In a first aspect, the embodiments of the present application provide a method for recommending shared vehicles, the method including:

[0005] Obtaining a first area to which the current location address of the target user belongs, and a second area to which the destination address of the target user belongs;

[0006] In response to the first area and the second area being different areas, and there being a vehicle parked in the first area whose operating area is the second area, selecting the vehicle parked in the first area and whose operating area is the second area to obtain the vehicle to be recommended;

[0007] Recommending the vehicle to be recommended to the target user.

[0008] In a possible embodiment, the method further includes:

[0009] In response to the first area and the second area being different areas, determining whether there is a vehicle parked in the first area whose operating area is the second area.

[0010] In a possible embodiment, the step of, in response to the first area and the second area being different areas, determining whether there is a vehicle parked in the first area whose operating area is the second area includes:

[0011] In response to the first area and the second area being different areas, and when the second area is the operating area, determining whether there is a vehicle parked in the first area whose operating area is the second area;

[0012] In response to the first area and the second area being different areas, and in the case that the second area is a non-operating area, it is determined that no vehicle whose operating area is the second area is parked in the first area.

[0013] In a possible embodiment, the method further includes:

[0014] In response to the fact that the first area and the second area are different areas and no vehicle whose operating area is the second area is parked in the first area, a first target area closest to the second area is selected from the operating area to which the vehicle parked in the first area belongs; and a vehicle parked in the first area and whose operating area is the first target area is selected to obtain a vehicle to be recommended.

[0015] In a possible embodiment, the method further includes:

[0016] In response to the first area and the second area being the same non-operating area, a second target area closest to the first area is selected from the operating area to which the vehicle parked in the first area belongs; and a vehicle parked in the first area whose operating area is the second target area is selected to obtain a vehicle to be recommended.

[0017] In a possible embodiment, the method further includes:

[0018] Obtaining the starting address of the target vehicle to be recommended used by the target user and the return address for returning the target vehicle to be recommended;

[0019] Determine the reward or punishment of the target user based on the starting address and the return address;

[0020] The target user is rewarded or punished according to the reward or punishment situation of the target user.

[0021] In a possible embodiment, determining the reward or punishment of the target user based on the starting address and the return address includes:

[0022] Calculating an initial incentive for the target vehicle to be recommended according to the starting address, and calculating an ending incentive for the target vehicle to be recommended according to the return address;

[0023] The reward and punishment of the target user are determined according to the initial incentive and the end incentive.

[0024] In a possible embodiment, the calculating the initial incentive of the target vehicle to be recommended according to the starting address includes:

[0025] Determine the nearest vehicle return point to the starting address based on the starting address, and obtain the first vehicle return point;

[0026] Determine the distance between the starting address and the first vehicle return point, and obtain the first distance;

[0027] Based on at least one of the first distance, the first comprehensive dispatching evaluation factor, the first traffic difficulty, the first recovery dispatching cost, the first resource waste factor, and the first user credit value, determine the initial incentive for the target vehicle to be recommended;

[0028] The first comprehensive dispatching evaluation factor represents the probability that users in the area where the starting address is located use shared vehicles. The first traffic difficulty represents the probability that users go to the area where the starting address is located. The first recovery dispatching cost represents the cost of arranging staff to dispatch and recover the target vehicle to be recommended from the starting address to the affiliated operation area. The first resource waste factor represents the profit loss caused by the target vehicle not being parked in the affiliated operation area. The first user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user;

[0029] Or,

[0030] Calculating the end incentive for the target vehicle to be recommended according to the return address includes:

[0031] Determine the nearest vehicle return point to the return address based on the return address, and obtain the second vehicle return point;

[0032] Determine the distance between the return address and the second vehicle return point, and obtain the second distance;

[0033] Based on at least one of the second distance, the second comprehensive dispatching evaluation factor, the second traffic difficulty, the second recovery dispatching cost, the second resource waste factor, and the second user credit value, determine the end incentive for the target vehicle to be recommended;

[0034] The second comprehensive dispatching evaluation factor represents the probability that users in the area where the return address is located use shared vehicles. The second traffic difficulty represents the probability that users go to the area where the return address is located. The second recovery dispatching cost represents the cost of arranging staff to dispatch and recover the target vehicle to be recommended from the return address to the affiliated operation area. The second resource waste factor represents the profit loss caused by the target vehicle not being parked in the affiliated operation area. The second user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user.

[0035] In a possible embodiment, the method further includes:

[0036] Within a preset duration after punishing the target user according to the rewards and punishments, if the target vehicle to be recommended is driven back to its affiliated operation area, compensate the target user.

[0037] In a possible embodiment, the method further includes:

[0038] Update the user credit value of the target user based on the rewards and punishments of the target user;

[0039] If the user credit value of the target user is not less than a preset credit threshold, allow the target user to use the cross-region function of the shared vehicle;

[0040] If the user credit value of the target user is less than the preset credit threshold, do not allow the target user to use the cross-region function of the shared vehicle.

[0041] In a second aspect, an embodiment of the present application provides a shared vehicle recommendation device, and the device includes:

[0042] An acquisition module, configured to acquire a first area to which the current location address of the target user belongs, and a second area to which the destination address of the target user belongs;

[0043] A selection module, configured to, in response to the first area and the second area being different areas, and there being a vehicle with an operation area of the second area parked in the first area, select the vehicle parked in the first area and with an operation area of the second area to obtain the vehicle to be recommended;

[0044] A recommendation module, configured to recommend the vehicle to be recommended to the target user.

[0045] In a possible embodiment, the device further includes a module for performing the following operations:

[0046] In response to the first area and the second area being different areas, determine whether there is a vehicle with an operation area of the second area parked in the first area.

[0047] In a possible embodiment, the device further includes a module for performing the following operations:

[0048] In response to the first area and the second area being different areas, and in the case where the second area is an operation area, determine whether there is a vehicle with an operation area of the second area parked in the first area;

[0049] In response to the first area and the second area being different areas, and in the case where the second area is a non-operation area, determine that there is no vehicle with an operation area of the second area parked in the first area.

[0050] In a possible embodiment, the device further includes a module for performing the following operations:

[0051] In response to the first area and the second area being different areas, and there being no vehicle with the operation area being the second area parked in the first area, select the first target area closest to the second area in the operation area to which the vehicle parked in the first area belongs; select the vehicle parked in the first area and with the operation area being the first target area to obtain the vehicle to be recommended.

[0052] In a possible embodiment, the device further includes a module for performing the following operations:

[0053] In response to the first area and the second area being the same non-operation area, select the second target area closest to the first area in the operation area to which the vehicle parked in the first area belongs; select the vehicle parked in the first area and with the operation area being the second target area to obtain the vehicle to be recommended.

[0054] In a possible embodiment, the device further includes a module for performing the following operations:

[0055] Obtain the starting address of the target vehicle to be recommended used by the target user, and the return address for returning the target vehicle to be recommended;

[0056] Determine the reward and punishment situation of the target user according to the starting address and the return address;

[0057] Reward or punish the target user according to the reward and punishment situation of the target user.

[0058] In a possible embodiment, the device further includes a module for performing the following operations:

[0059] Calculate the initial incentive of the target vehicle to be recommended according to the starting address, and calculate the end incentive of the target vehicle to be recommended according to the return address;

[0060] Determine the reward and punishment situation of the target user according to the initial incentive and the end incentive.

[0061] In a possible embodiment, the device further includes a module for performing the following operations:

[0062] Based on the starting address, determine the return point closest to the starting address to obtain the first return point;

[0063] Determine the distance between the starting address and the first return point to obtain the first distance;

[0064] Determine an initial incentive for the target vehicle to be recommended based on at least one of the first distance, the first comprehensive scheduling evaluation factor, the first traffic difficulty, the first recycling scheduling cost, the first resource waste factor, and the first user credit value;

[0065] The first comprehensive scheduling evaluation factor represents the probability that users in the area where the starting address is located use shared vehicles. The first traffic difficulty represents the probability that users go to the area where the starting address is located. The first recycling scheduling cost represents the cost of arranging staff to schedule and recycle the target vehicle to be recommended from the starting address to the affiliated operation area. The first resource waste factor represents the profit loss caused by the target vehicle not being parked in the affiliated operation area. The first user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user;

[0066] Or,

[0067] The device further includes a module for performing the following operations:

[0068] Based on the return address, determine the return point closest to the return address to obtain a second return point;

[0069] Determine the distance between the return address and the second return point to obtain a second distance;

[0070] Based on at least one of the second distance, the second comprehensive scheduling evaluation factor, the second traffic difficulty, the second recycling scheduling cost, the second resource waste factor, and the second user credit value, determine an end incentive for the target vehicle to be recommended;

[0071] The second comprehensive scheduling evaluation factor represents the probability that users in the area where the return address is located use shared vehicles. The second traffic difficulty represents the probability that users go to the area where the return address is located. The second recycling scheduling cost represents the cost of arranging staff to schedule and recycle the target vehicle to be recommended from the return address to the affiliated operation area. The second resource waste factor represents the profit loss caused by the target vehicle not being parked in the affiliated operation area. The second user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user.

[0072] In a possible embodiment, the device further includes a module for performing the following operations:

[0073] Within a preset duration after punishing the target user according to the rewards and punishments, if the target vehicle to be recommended is driven back to the affiliated operation area, compensate the target user.

[0074] In a possible embodiment, the device further includes a module for performing the following operations:

[0075] Update the user credit value of the target user based on the rewards and punishments of the target user;

[0076] If the user credit value of the target user is not less than a preset credit threshold, allow the target user to use the cross-region function of the shared vehicle;

[0077] If the user credit value of the target user is less than the preset credit threshold, do not allow the target user to use the cross-region function of the shared vehicle.

[0078] In a third aspect, an embodiment of the present application provides an electronic device, including a processor and a memory;

[0079] The memory is used to store a computer program;

[0080] When the processor executes the program stored on the memory, it implements the shared vehicle recommendation method described in the present application.

[0081] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a processor, it implements the shared vehicle recommendation method described in the present application.

[0082] Advantageous effects of the embodiments of the present application:

[0083] The shared vehicle recommendation method, device, electronic device and storage medium provided by the embodiments of the present application obtain the first area to which the current location address of the target user belongs, and the second area to which the destination address of the target user belongs. In response to the first area and the second area being different areas, and there being vehicles with an operating area of the second area parked in the first area, select the vehicles parked in the first area and with an operating area of the second area to obtain the vehicles to be recommended, and recommend the vehicles to be recommended to the target user. By recommending shared vehicles parked in non-specified operating areas to users, allowing users to replace staff to complete the recycling and scheduling work, resource waste and labor input are reduced, and the problem that users have no available vehicles when temporarily crossing regions is solved.

[0084] Of course, when implementing any product or method of the present application, it is not necessarily required to achieve all the above-mentioned advantages at the same time. Description of the Drawings

[0085] To more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the accompanying drawings required for the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, other embodiments can also be obtained based on these drawings.

[0086] Figure 1 The first schematic diagram of the shared vehicle recommendation method provided by the embodiment of the present application;

[0087] Figure 2 The second schematic diagram of the shared vehicle recommendation method provided by the embodiment of the present application;

[0088] Figure 3 A schematic diagram of establishing a connection between a shared vehicle and an intelligent terminal provided by the embodiment of the present application;

[0089] Figure 4 A schematic diagram of determining the reward and punishment situation of a target user according to the starting address and the return address provided by the embodiment of the present application;

[0090] Figure 5 The third schematic diagram of the shared vehicle recommendation method provided by the embodiment of the present application;

[0091] Figure 6 A schematic diagram of the shared vehicle recommendation device provided by the embodiment of the present application;

[0092] Figure 7 A schematic diagram of an electronic device provided by the embodiment of the present application. Detailed implementation manners

[0093] The following will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only some embodiments of the present application, rather than all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art based on the present application belong to the scope of protection of the present application.

[0094] The terms used in the embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to limit the present application. The singular forms of "a", "the" and "said" used in the embodiments of the present application and the appended claims are also intended to include the plural forms, unless the context clearly indicates otherwise.

[0095] It should be understood that the term "and / or" used herein is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0096] In the description of the embodiments of the present application, the terms "first", "second", "third", "fourth", etc. (if any) in the specification, claims and the above drawings are used to distinguish similar objects, and do not necessarily describe a specific order or sequence. It should be understood that such data can be interchanged under appropriate circumstances 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 "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device that includes a series of steps or units does not necessarily have to be limited to those steps or units clearly listed, but may include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0097] Before providing a detailed explanation of the shared vehicle recommendation method provided by the embodiments of the present application, the application scenarios of the shared vehicle recommendation method provided by the embodiments of the present application will be introduced first.

[0098] The shared vehicle recommendation method provided by the embodiments of the present application is applied to an application scenario of recommending shared vehicles to users.

[0099] In the prior art, for shared vehicles parked in non-specified operating areas, they are mainly recovered and scheduled by staff, and users cannot continue to use these shared vehicles, which causes a great waste of resources and human input. The shared vehicle recommendation method provided by the embodiments of the present application recommends shared vehicles parked in non-specified operating areas to users, allowing users to replace staff to complete the recovery and scheduling work, reducing resource waste and human input, and solving the problem that users have no available vehicles when temporarily crossing regions.

[0100] Next, the implementation environment of the shared vehicle recommendation method provided by the embodiments of the present application will be introduced.

[0101] The shared vehicle recommendation method provided by the embodiments of this application can be applied to an intelligent terminal installed with a shared vehicle application program or to a server. When this method is applied to an intelligent terminal, the intelligent terminal obtains the current location address of the user and the destination address of the user, analyzes the obtained current location address and destination address of the user, and recommends a shared vehicle for the user based on the analysis result. When this method is applied to a server, the intelligent terminal sends the obtained current location address and destination address of the user to the server when it obtains them. The server analyzes the obtained current location address and destination address of the user and recommends a shared vehicle for the user based on the analysis result. Among them, the intelligent terminal includes but is not limited to intelligent electronic devices such as mobile phones and tablet computers.

[0102] It should be noted that the information (including but not limited to user device information, user personal information, etc.), data (including but not limited to data for analysis, stored data, displayed data, etc.) and signals involved in this application are all authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data need to comply with the relevant laws, regulations and standards of relevant countries and regions.

[0103] After introducing the implementation environment provided by the embodiments of this application, the shared vehicle recommendation method provided by the embodiments of this application will be explained in detail below.

[0104] See Figure 1 , Figure 1 which is a schematic diagram of a shared vehicle recommendation method provided by an embodiment of this application. Taking the application of this method to an intelligent terminal as an example, this method may include the following steps:

[0105] S101, obtain a first area to which the current location address of the target user belongs and a second area to which the destination address of the target user belongs.

[0106] The target user is the user who currently needs to use a shared vehicle. When the target user needs to travel by driving a shared vehicle, it is necessary to first use the shared vehicle application program installed in the intelligent terminal to obtain the current location address of the target user and the destination address of the target user, and determine the area to which the current location address of the target user belongs and the area to which the destination address of the target user belongs, and then recommend a shared vehicle for the target user based on the determined area to which the current location address of the target user belongs and the area to which the destination address of the target user belongs.

[0107] In a possible embodiment, the positioning device installed in the intelligent terminal can be used to obtain the current location address of the target user, and determine the area to which the current location address of the target user belongs. For example, the longitude and latitude information of the intelligent terminal can be obtained through the GPS system or the Beidou system, or the map position of the intelligent terminal in the current electronic map can be obtained, etc.

[0108] In a possible embodiment, the destination address of the target user can be predicted based on the historical travel data of the target user, and the predicted destination address can be displayed on the display interface of the intelligent terminal for the target user to select, or the target user can input the destination address by himself / herself. Then, the positioning device installed in the intelligent terminal is used to determine the area to which the destination address of the target user belongs. For example, target user A needs to leave home at 8:00 am every working day and arrive at the company at 8:30 am. Therefore, when target user A opens the shared vehicle application at 8:00 am on Monday, its destination address can be predicted as the company address.

[0109] In a possible embodiment, the shared vehicles include vehicles for users to ride through time-sharing rental, including but not limited to shared bicycles, shared electric vehicles or shared cars.

[0110] S102, in response to the first area and the second area being different areas, and there is a vehicle with an operation area of the second area parked in the first area, select the vehicle parked in the first area and with an operation area of the second area to obtain the vehicle to be recommended.

[0111] The fact that the first area and the second area are different areas indicates that if the user wants to drive from the user's current location to the destination, cross-region driving is required.

[0112] In the embodiment of the present application, when the first area and the second area are different areas, and there is a vehicle with an operation area of the second area parked in the first area, the vehicle parked in the first area and with an operation area of the second area is determined as the vehicle to be recommended. In the embodiment of the present application, if the user is willing to drive the vehicle to be recommended to the user's destination, it can not only meet the actual needs of the user, but also recycle and dispatch the vehicle to be recommended to the specified operation area, without the need for staff to recycle and dispatch the vehicle to be recommended, reducing resource waste and manpower investment, and solving the problem that users have no vehicle available when temporarily crossing regions.

[0113] In a possible embodiment, before determining the vehicle to be recommended, it is also necessary to, in response to the first area to which the current location address of the target user belongs and the second area to which the destination address of the target user belongs being different areas, determine whether there is a vehicle with an operation area of the second area parked in the first area.

[0114] In a possible embodiment, in response to the two being different regions and the second region being an operating region, it is determined whether there is a vehicle parked in the first region whose operating region is the second region.

[0115] In response to the two being different regions and the second region being a non-operating region, it is determined that there is no vehicle parked in the first region whose operating region is the second region.

[0116] In a possible embodiment, in response to the first region and the second region being different regions and there being no vehicle parked in the first region whose operating region is the second region, the vehicles parked in the first region are selected to obtain the vehicles to be recommended.

[0117] In a possible embodiment, in response to the first region and the second region being different regions and there being no vehicle parked in the first region whose operating region is the second region, the vehicles parked in the first region are selected to obtain the vehicles to be recommended, including:

[0118] In response to the first region and the second region being different regions and there being no vehicle parked in the first region whose operating region is the second region, the first target region closest to the second region is selected from the operating regions to which the vehicles parked in the first region belong; the vehicles parked in the first region and whose operating region is the first target region are selected to obtain the vehicles to be recommended.

[0119] In the embodiments of the present application, it is considered that there may be a situation where the region to which the current location address of the target user belongs and the region to which the destination address of the target user belongs are different regions and there is no vehicle parked in the region to which the current location address of the target user belongs whose operating region is the region to which the destination address of the target user belongs. Then, the vehicle parked in the region to which the current location address of the target user belongs and whose operating region is the region closest to the region to which the destination address of the target user belongs will be selected. In this way, the vehicle can be recycled and scheduled to a position closer to the operating region for subsequent recycling and scheduling, reducing resource waste and manpower input.

[0120] In a possible embodiment, in response to the first region and the second region being different regions and there being no vehicle parked in the first region whose operating region is the second region, the vehicles parked in the first region are selected to obtain the vehicles to be recommended, including:

[0121] In response to the first region and the second region being different regions and there being no vehicle parked in the first region whose operating region is the second region, the vehicles parked in the first region and whose operating region is the first region are selected to obtain the vehicles to be recommended.

[0122] In a possible embodiment, in response to the first area and the second area being the same non-operating area, select the second target area closest to the first area from the operating areas to which the vehicles parked in the first area belong; select the vehicles parked in the first area and whose operating area is the second target area to obtain the vehicles to be recommended. Alternatively, select the second target area closest to the second area from the operating areas to which the vehicles parked in the second area belong; select the vehicles parked in the second area and whose operating area is the second target area to obtain the vehicles to be recommended. In this way, the vehicles can be recycled and scheduled to a position closer to the operating area for subsequent recycling and scheduling, reducing resource waste and labor input.

[0123] In a possible embodiment, in response to the first area and the second area being the same operating area, select the vehicles parked in the first area and whose operating area is the first area to obtain the vehicles to be recommended. Alternatively, select the vehicles parked in the second area and whose operating area is the second area to obtain the vehicles to be recommended.

[0124] S103. Recommend the vehicles to be recommended to the target user.

[0125] In a possible embodiment, when displaying the vehicles to be recommended, identify the vehicles to be recommended and correspondingly display the operating areas to which the vehicles to be recommended belong. In this way, the user can clearly know through the application installed in the intelligent terminal which shared vehicles are cross-area vehicles and the operating areas to which the shared vehicles belong, so as to choose whether to use the vehicles to be recommended in combination with their travel destinations.

[0126] See Figure 2 , Figure 2 which is a schematic diagram of a shared vehicle recommendation method provided by an embodiment of the present application. The above method further includes the following steps:

[0127] S104. Obtain the starting address of the target vehicle to be recommended used by the target user and the return address for returning the target vehicle to be recommended.

[0128] In a possible embodiment, see Figure 3 , Figure 3A schematic diagram of establishing a connection between a shared vehicle and an intelligent terminal provided by an embodiment of the present application. In this diagram, modules for implementing control and positioning functions are installed in the shared vehicle. For example, the shared vehicle and the intelligent terminal establish a connection via Bluetooth. An SIM (Subscriber Identity Module) card with an independent number is integrated in the intelligent door lock of the shared vehicle, and it can maintain communication with the cloud via a wireless network, and report the location of the shared vehicle and the current state of the vehicle to the cloud in a timely manner. The cloud feeds back the location of the shared vehicle and the current state of the vehicle to the shared vehicle application installed in the intelligent terminal. As an example, the cloud feeds back the location of the vehicle when the target user unlocks the target vehicle to be recommended as the starting address of the target vehicle to be recommended used by the target user and the location of the vehicle when the target user locks the target vehicle to be recommended as the return address for returning the target vehicle to be recommended to the shared vehicle application.

[0129] S105. Determine the reward and punishment situation of the target user according to the starting address and the return address.

[0130] During the use of shared vehicles, it often occurs that shared vehicles are driven to non - designated operating areas. This situation is very likely to lead to vehicle loss and the problem that users have no vehicles to use in the designated operating area. The embodiment of the present application determines the reward and punishment situation of the target user according to the starting address of the target vehicle to be recommended used by the target user and the return address of the target vehicle to be recommended returned by the target user, so as to reward and punish the target user according to the reward and punishment situation of the target user subsequently. By establishing a reward and punishment rule, the behavior of users can be effectively restricted, and the situation of shared vehicles being driven to non - designated operating areas can be alleviated. Moreover, it can also encourage users to drive the shared vehicles that have been driven to non - designated operating areas to designated operating areas, without setting up special staff to recycle and dispatch the shared vehicles, reducing resource waste and labor input, and also solving the problem that users have no vehicles to use temporarily across regions.

[0131] As an example, if a user returns a shared vehicle in a non - designated operating area to a designated operating area or a location close to the designated operating area, the user will be rewarded; if a user drives a shared vehicle in a designated operating area to a non - designated operating area, or drives the shared vehicle to a location farther from the designated operating area, the user will be punished.

[0132] As an example, users can be rewarded in the form of red envelopes. For instance, when a user returns a shared vehicle from a non - specified operating area to a specified operating area or a location near the specified operating area, the user is rewarded with a certain amount of red envelopes. Subsequently, the user can use these red envelopes to pay for the cost of using the shared vehicle. Users can be punished in the form of a dispatching fee. For example, when a user drives a shared vehicle from a specified operating area to a non - specified operating area, or drives the shared vehicle to a location farther away from the specified operating area, while charging the user the normal cost of using the shared vehicle, an additional dispatching fee will be charged. The embodiments of the present application do not limit the forms of rewards and punishments.

[0133] In a possible embodiment, determining the rewards and punishments of the target user according to the starting address and the return address includes:

[0134] Calculating the initial incentive of the target vehicle to be recommended according to the starting address, and calculating the ending incentive of the target vehicle to be recommended according to the return address; determining the rewards and punishments of the target user according to the initial incentive and the ending incentive.

[0135] In a possible embodiment, calculating the initial incentive of the target vehicle to be recommended according to the starting address includes:

[0136] Based on the starting address, determining the nearest vehicle return point to the starting address to obtain the first vehicle return point; determining the distance between the starting address and the first vehicle return point to obtain the first distance; based on at least one of the first distance, the first comprehensive dispatching evaluation factor, the first traffic difficulty, the first recovery dispatching cost, the first resource waste factor, and the first user credit value, determining the initial incentive of the target vehicle to be recommended. The first comprehensive dispatching evaluation factor represents the probability of users in the area where the starting address is located using shared vehicles, the first traffic difficulty represents the probability of users going to the area where the starting address is located, the first recovery dispatching cost represents the cost of arranging staff to dispatch and recover the target vehicle to be recommended from the starting address to the affiliated operating area, the first resource waste factor represents the profit loss caused by the target vehicle not being parked in the affiliated operating area, and the first user credit value represents the value obtained by evaluating the vehicle - using behavior of the target user.

[0137] As an example, based on the first distance, the first comprehensive dispatching evaluation factor, the first traffic difficulty, the first recovery dispatching cost, the first resource waste factor, and the first user credit value, determining the initial incentive of the target vehicle to be recommended includes:

[0138] Based on the first distance, the first comprehensive dispatching evaluation factor, the first traffic difficulty, the first recovery dispatching cost, the first resource waste factor, and the first user credit value, using the following formula to determine the initial incentive of the target vehicle to be recommended:

[0139] F(Dst0, SEF0, Cond0, Cost0, TOE0, R0)

[0140] Among them, Dst0 is the first distance, SEF0 is the first comprehensive scheduling evaluation factor, Cond0 is the first traffic difficulty, Cost0 is the first recycling and scheduling cost, TOE0 is the first resource waste factor, and R0 is the first user credit value.

[0141] In a possible embodiment, calculating the end incentive of the target vehicle to be recommended according to the return address includes:

[0142] Determine the return point closest to the return address based on the return address to obtain the second return point; determine the distance between the return address and the second return point to obtain the second distance; based on at least one of the second distance, the second comprehensive scheduling evaluation factor, the second traffic difficulty, the second recycling and scheduling cost, the second resource waste factor, and the second user credit value, determine the end incentive of the target vehicle to be recommended. The second comprehensive scheduling evaluation factor represents the probability that users in the area where the return address is located use shared vehicles, the second traffic difficulty represents the probability that users go to the area where the return address is located, the second recycling and scheduling cost represents the cost of arranging staff to schedule and recycle the target vehicle to be recommended from the return address to the affiliated operation area, the second resource waste factor represents the profit loss caused by the target vehicle to be recommended not being parked in the affiliated operation area, and the second user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user.

[0143] For example, based on the second distance, the second comprehensive scheduling evaluation factor, the second traffic difficulty, the second recycling and scheduling cost, the second resource waste factor, and the second user credit value, determining the end incentive of the target vehicle to be recommended includes:

[0144] Based on the second distance, the second comprehensive scheduling evaluation factor, the second traffic difficulty, the second recycling and scheduling cost, the second resource waste factor, and the second user credit value, use the following formula to determine the end incentive of the target vehicle to be recommended:

[0145] F(Dst1, SEF1, Cond1, Cost1, TOE1, R1)

[0146] Among them, Dst1 is the second distance, SEF1 is the second comprehensive scheduling evaluation factor, Cond1 is the second traffic difficulty, Cost1 is the second recycling and scheduling cost, TOE1 is the second resource waste factor, and R1 is the second user credit value.

[0147] It should be noted that the "first" and "second" in the first distance Dst0, the first comprehensive scheduling evaluation factor SEF0, the first traffic difficulty Cond0, the first recycling scheduling cost Cost0, the first resource waste factor TOE0, the first user credit value R0 and the second distance Dst1, the second comprehensive scheduling evaluation factor SEF1, the second traffic difficulty Cond1, the second recycling scheduling cost Cost1, the second resource waste factor TOE1, the second user credit value R1 are only used to distinguish similar objects, and do not have to be used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged under appropriate circumstances, so that the embodiments of the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein.

[0148] In a possible embodiment, the comprehensive scheduling evaluation factor SEF represents the probability that users in the area where the target vehicle to be recommended is currently located use shared vehicles. The comprehensive scheduling evaluation factor SEF is related to factors such as the penetration rate of the target vehicle to be recommended in the area where it is currently located and the travel preferences of users in this area. For example, in some first-tier cities, due to relatively congested traffic, people often choose shared vehicles as a means of transportation when traveling. In areas with better traffic conditions, people do not need to worry about parking and traffic jams, and often choose to use their own vehicles as a means of transportation. As an example, the comprehensive scheduling evaluation factor SEF can be determined based on the number of shared vehicles available in the area where the target vehicle to be recommended is currently located, the number of users traveling by shared vehicles in this area, and the total number of users in this area.

[0149] As an example, the specific expression for calculating the comprehensive scheduling evaluation factor SEF can be:

[0150]

[0151] Where A represents the number of users traveling by shared vehicles in the area where the target vehicle to be recommended is currently located, B represents the total number of users in the area where the target vehicle to be recommended is currently located, and C represents the number of shared vehicles available in the area where the target vehicle to be recommended is currently located.

[0152] For example, assume that there are 100 users in the area where the target vehicle to be recommended is currently located. Among them, 30 target users prefer to travel by shared vehicles, and there are 40 shared vehicles available in this area. Then the comprehensive scheduling evaluation factor SEF = (30 / 100)*(30 / 40). The present application does not limit the method of calculating the comprehensive scheduling evaluation factor.

[0153] In a possible embodiment, the lower the SEF value, the lower the need for staff to intervene in the scheduling of shared vehicles.

[0154] In a possible embodiment, the traffic difficulty Cond represents the probability that the target user goes to the area where the target vehicle to be recommended is currently located. The traffic difficulty Cond is related to factors such as road network density and population flow density. For example, if the area is a remote area with low population flow density, manual scheduling is required in this case, otherwise the target vehicle to be recommended may be in a state of being unusable or unused for a long time. As an example, the traffic difficulty Cond can be obtained by weighted summation of the road network density and the population flow density, or can be calculated by other methods. The present application does not limit this.

[0155] As an example, the specific expression for calculating the traffic difficulty Cond is:

[0156] Cond = a * C + b * D

[0157] Wherein, a represents the weight coefficient of the road network density of the area where the target vehicle to be recommended is currently located, C represents the road network density of the area where the target vehicle to be recommended is currently located, b represents the weight coefficient of the population flow density of the area where the target vehicle to be recommended is currently located, and D represents the population flow density of the area where the target vehicle to be recommended is currently located.

[0158] In a possible embodiment, the calculation methods of the road network density and the population flow density within the area are prior arts, and the present application does not elaborate herein.

[0159] In a possible embodiment, the weight coefficients a and b can be set manually according to experience or set according to the actual situation. By setting different weights, each index can be flexibly adjusted according to actual needs, making the calculated result more accurate.

[0160] In a possible embodiment, the larger the Cond value, the more convenient the traffic; on the contrary, the more difficult the traffic.

[0161] In a possible embodiment, the recovery scheduling cost Cost represents the cost incurred in arranging staff to schedule and recover the target vehicle to be recommended to its affiliated operation area. For example, the recovery scheduling cost Cost is the sum of the cost of the staff riding the target vehicle to be recommended from its current location to its affiliated operation area and the salary of the staff during this riding period.

[0162] As an example, if the vehicle charging for the staff to ride the target vehicle to be recommended from its current location to its affiliated operation area is 5 yuan, and the salary of the staff during this riding period is 20 yuan, then the cost incurred by the staff to recover and schedule the vehicle is 25 yuan.

[0163] In one possible embodiment, the resource waste factor TOE represents the profit loss caused by the target recommended vehicle not being parked in its operating area. For example, under normal circumstances, the target recommended vehicle is in use for an average of 8 hours per day. However, because the target user drove the target recommended vehicle to a location where scheduling could not be completed in time, it was not scheduled for normal use until the third day. During this period, the vehicle was idle on the first and second days, resulting in the loss of 16 hours of profit value that could have been generated by the vehicle. The method for calculating profit value is existing technology and will not be described in detail in this application.

[0164] In one possible embodiment, the user reputation value R represents a numerical value derived from evaluating the user's vehicle usage behavior. This user reputation value is related to the user's rewards and penalties. For example, a user's initial reputation value is 100 points. If the user violates vehicle usage regulations, the user is penalized, and the user reputation value decreases based on the penalties. If the user does not violate vehicle usage regulations, the user is rewarded, and the user reputation value increases based on the rewards.

[0165] It should be noted that parameters such as the comprehensive dispatch evaluation factor (SEF), traffic difficulty (Cond), recovery dispatch fee (Cost), resource waste factor (TOE), and user reputation (R) will change with the shared vehicle's location. For example, when the location change is small, parameters such as the comprehensive dispatch evaluation factor (SEF), traffic difficulty (Cond), recovery dispatch fee (Cost), resource waste factor (TOE), and user reputation (R) can be set to fixed values.

[0166] In a possible embodiment, a correspondence between the above parameters and the area to which the shared vehicle is located may be set, and the parameter values of the above parameters may be determined based on the correspondence.

[0167] See also Figure 4 , Figure 4 A schematic diagram of determining the reward and punishment of a target user based on the starting address and the return address provided in an embodiment of the present application. In this diagram, the initial position A is the starting address of the target vehicle to be recommended used by the target user, the nearest return point A' is the return point closest to the starting address, the initial incentive F0 is the initial incentive of the target vehicle to be recommended calculated based on the starting address, the destination B is the return address where the target user returns the target vehicle to be recommended, the nearest return point B' is the return point closest to the return address, the end incentive F1 is the end incentive of the target vehicle to be recommended calculated based on the return position, and S is the reward and punishment of the target user, wherein S = F0-F1.

[0168] S106: reward or punish the target user according to the reward or punishment situation of the target user.

[0169] In a possible embodiment, if the difference between the initial incentive and the end incentive is less than 0, the target user is punished; if the difference between the initial incentive and the end incentive is greater than 0, the target user is rewarded. In the embodiments of the present application, if the difference between the initial incentive and the end incentive is less than 0, it indicates that the distance between the return position of the shared vehicle and the specified operation area is farther than the distance between the starting position of the shared vehicle and the specified operation area. Then, the user needs to be punished. For example, a dispatching fee is charged. If the difference between the initial incentive and the end incentive is greater than 0, it indicates that the distance between the return position of the shared vehicle and the specified operation area is closer than the distance between the starting position of the shared vehicle and the specified operation area. Then, the user can be rewarded. For example, a red envelope with a certain amount of money is sent to the user, and the red envelope can be used to pay the fee for using the shared vehicle.

[0170] In a possible embodiment, within a preset duration after punishing the target user according to the reward and punishment situation, if the target vehicle to be recommended is driven back to the affiliated operation area, the target user is compensated. For example, a part of the dispatching fee is refunded to the user.

[0171] In a possible embodiment, in the embodiments of the present application, the user credit value of the target user can be updated according to the reward and punishment situation of the target user. When the user credit value of the target user is not less than the preset credit threshold, the target user is allowed to use the cross-region function of the shared vehicle. When the user credit value of the target user is less than the preset credit threshold, the target user is not allowed to use the cross-region function of the shared vehicle. The cross-region function allows the shared vehicle to travel in any area. And the shared vehicle that cannot use the cross-region function can only travel in the specified operation area.

[0172] In a possible embodiment, updating the credit value of the target user according to the reward and punishment situation of the target user includes:

[0173] When the reward and punishment situation of the target user is less than 0, the user credit value of the target user is reduced; when the reward and punishment situation of the target user is greater than 0, the user credit value of the target user is increased. For example, when the reward and punishment situation S of the target user is -25, the credit value of the target user is subtracted by 25. When the reward and punishment situation S of the target user is 25, the credit value of the target user is added by 25.

[0174] Through the technical solution provided by the embodiments of the present application, obtain the first area to which the current location address of the target user belongs, and the second area to which the destination address of the target user belongs. In response to the first area and the second area being different areas, and there being a vehicle parked in the first area with an operation area of the second area, select the vehicle parked in the first area and with an operation area of the second area to obtain the vehicle to be recommended, and recommend the vehicle to be recommended to the target user. By recommending shared vehicles parked in non-prescribed operation areas to users, allowing users to replace staff to complete the recycling and scheduling work, it reduces resource waste and manpower investment, and solves the problem that users have no available vehicles when temporarily crossing areas.

[0175] The embodiments of the present application also provide a shared vehicle recommendation system, which includes a user historical travel data analysis module, a cross-region vehicle identification and navigation module, a cross-region vehicle usage incentive module, and a user credit module. The user historical travel data analysis module is used to analyze the travel habits of users at different times and locations, and predict the user's destination. The cross-region vehicle identification and navigation module is used to identify shared vehicles parked in non-prescribed operation areas. Users can clearly know which vehicles belong to cross-region vehicles through the shared vehicle application installed on the smart terminal. Clicking on the corresponding vehicle identification can display on the map which area the vehicle belongs to, so as to combine their travel destination to choose whether to unlock the cross-region vehicle. Users can also turn off the display of cross-region vehicles on the application. The cross-region vehicle usage incentive module is used to incentivize users if they return vehicles in non-prescribed operation areas to within or near the prescribed operation areas, and punish users if they drive vehicles parked in the prescribed operation areas to locations far from the prescribed operation areas. And if the vehicle is driven back to the prescribed operation area within a certain time, compensate the user. The step of driving the vehicle back to the prescribed operation area can be completed by the user himself or by other users. The user credit module is used to make a credit evaluation of the user's vehicle return behavior. The cross-region function of shared vehicles will not be opened to users with low credit values, and good shared vehicle usage behaviors can increase the user's credit value.

[0176] See Figure 5 , Figure 5 is a schematic diagram of the shared vehicle recommendation method provided by the embodiments of the present application, and the method includes the following steps:

[0177] Step 1: Start;

[0178] Step 2: Determine whether the user credit value is greater than the preset credit threshold;

[0179] Step 3: If so, allow the user to use the cross-region function of the shared vehicle;

[0180] Step 4: Obtain the area B to which the user's destination address belongs through either user input or analysis of historical travel data, and obtain the area A to which the user's location address belongs;

[0181] Step 5: Determine whether the area A to which the user's location address belongs and the area B to which the user's destination address belongs are the same area (whether it is a cross-area situation);

[0182] Step 6: If the area A to which the user's location address belongs and the area B to which the user's destination address belongs are different areas (the result of determining whether it is a cross-area situation is yes), the area A to which the user's location address belongs is an operating area, and there are no vehicles in the area A to which the user's location address belongs with the operating area being the area B to which the user's destination address belongs, then select the vehicles parked in the area A to which the user's location address belongs as the vehicles to be recommended, and charge a dispatching fee and a usage fee;

[0183] Step 7: Determine whether, within a certain period of time, the vehicles in Step 6 are driven back to a location where the operating area is the area A to which the user's location address belongs. If so, refund part of the dispatching fee; if not, do not refund the dispatching fee;

[0184] Step 12: If the area A to which the user's location address belongs and the area B to which the user's destination address belongs are different areas (the result of determining whether it is a cross-area situation is yes) and there are vehicles in the area A to which the user's location address belongs with the operating area being the area B to which the user's destination address belongs, select the vehicles parked in the area A to which the user's location address belongs and with the operating area being the area B to which the user's destination address belongs as the vehicles to be recommended;

[0185] Step 15: Calculate the initial incentive according to the incentive function, and determine whether to return the vehicles to be recommended in Step 12 to a location where the operating area is the area B to which the user's destination address belongs;

[0186] Step 18: If so, obtain the full initial incentive;

[0187] Step 21: If not, calculate the ending incentive according to the incentive function, and calculate the user's rewards and punishments based on the initial incentive and the ending incentive;

[0188] Step 24: If the area A to which the user's location address belongs and the area B to which the user's destination address belongs are the same area (the result of determining whether it is a cross-area situation is no), determine whether the current area is an operating area;

[0189] Step 27: If the area A to which the user's location address belongs and the area B to which the user's destination address belongs are the same area and the current area is an operating area (the result of determining whether the current area is an operating area is yes), then select the vehicles parked in the area A to which the user's location address belongs and with the operating area being the area A to which the user's location address belongs for use as the vehicles to be recommended;

[0190] Step 14: If the area A to which the user's location address belongs and the area B to which the user's destination address belongs are the same area and the current area is a non-operational area (the result of determining whether the current area is an operational area is no), then select the vehicle parked in the area A to which the user's location address belongs and whose operational area is the operational area C closest to the area A to which the user's location address belongs as the vehicle to be recommended;

[0191] Step 15: Calculate the initial incentive according to the incentive function, and determine whether the vehicle to be recommended in Step 14 is returned to the location of the operational area C closest to the area A to which the user's location address belongs;

[0192] Step 16: If so, perform the operation in Step 10;

[0193] Step 17: If not, perform the operation in Step 11;

[0194] Step 18: Evaluate the user's creditworthiness.

[0195] See Figure 6 , Figure 6 which is a schematic diagram of a shared vehicle recommendation device provided by an embodiment of the present application. The device includes:

[0196] An acquisition module 601, configured to acquire the first area to which the current location address of the target user belongs, and the second area to which the destination address of the target user belongs;

[0197] A selection module 602, configured to, in response to the first area and the second area being different areas, and there being a vehicle parked in the first area whose operational area is the second area, select the vehicle parked in the first area and whose operational area is the second area to obtain the vehicle to be recommended;

[0198] A recommendation module 603, configured to recommend the vehicle to be recommended to the target user.

[0199] In a possible embodiment, the device further includes a module for performing the following operations:

[0200] In response to the first area and the second area being different areas, determine whether there is a vehicle parked in the first area whose operational area is the second area.

[0201] In a possible embodiment, the device further includes a module for performing the following operations:

[0202] In response to the first area and the second area being different areas, and in the case where the second area is an operational area, determine whether there is a vehicle parked in the first area whose operational area is the second area;

[0203] In response to the first area and the second area being different areas, and when the second area is a non-operational area, it is determined that there is no vehicle parked in the first area whose operational area is the second area.

[0204] In a possible embodiment, the device further includes a module for performing the following operations:

[0205] In response to the first area and the second area being different areas and there being no vehicle parked in the first area whose operational area is the second area, select the first target area closest to the second area from the operational areas to which the vehicles parked in the first area belong; select the vehicles parked in the first area and whose operational area is the first target area to obtain the vehicles to be recommended.

[0206] In a possible embodiment, the device further includes a module for performing the following operations:

[0207] In response to the first area and the second area being the same non-operational area, select the second target area closest to the first area from the operational areas to which the vehicles parked in the first area belong; select the vehicles parked in the first area and whose operational area is the second target area to obtain the vehicles to be recommended.

[0208] In a possible embodiment, the device further includes a module for performing the following operations:

[0209] Obtain the starting address of the target vehicle to be recommended used by the target user, and the return address for returning the target vehicle to be recommended;

[0210] Determine the reward and punishment situation of the target user according to the starting address and the return address;

[0211] Reward or punish the target user according to the reward and punishment situation of the target user.

[0212] In a possible embodiment, the device further includes a module for performing the following operations:

[0213] Calculate the initial incentive of the target vehicle to be recommended according to the starting address, and calculate the ending incentive of the target vehicle to be recommended according to the return address;

[0214] Determine the reward and punishment situation of the target user according to the initial incentive and the ending incentive.

[0215] In a possible embodiment, the device further includes a module for performing the following operations:

[0216] Based on the starting address, determine the return point closest to the starting address to obtain the first return point;

[0217] Determine the distance between the starting address and the first return point to obtain the first distance;

[0218] Determine an initial incentive for a target vehicle to be recommended based on at least one of a first distance, a first comprehensive scheduling evaluation factor, a first traffic difficulty, a first recycling scheduling cost, a first resource waste factor, and a first user credit value;

[0219] The first comprehensive scheduling evaluation factor represents the probability that users in the area where the starting address is located use shared vehicles. The first traffic difficulty represents the probability that users go to the area where the starting address is located. The first recycling scheduling cost represents the cost of arranging staff to schedule and recycle the target vehicle to be recommended from the starting address to the affiliated operation area. The first resource waste factor represents the profit loss caused by the target vehicle to be recommended not being parked in the affiliated operation area. The first user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user;

[0220] Or,

[0221] The device further includes a module for performing the following operations:

[0222] Based on the return address, determine the return point closest to the return address to obtain a second return point;

[0223] Determine the distance between the return address and the second return point to obtain a second distance;

[0224] Based on the second distance, a second comprehensive scheduling evaluation factor, a second traffic difficulty, a second recycling scheduling cost, a second resource waste factor, and a second user credit value, determine an end incentive for the target vehicle to be recommended;

[0225] The second comprehensive scheduling evaluation factor represents the probability that users in the area where the return address is located use shared vehicles. The second traffic difficulty represents the probability that users go to the area where the return address is located. The second recycling scheduling cost represents the cost of arranging staff to schedule and recycle the target vehicle to be recommended from the return address to the affiliated operation area. The second resource waste factor represents the profit loss caused by the target vehicle to be recommended not being parked in the affiliated operation area. The second user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user.

[0226] In a possible embodiment, the device further includes a module for performing the following operations:

[0227] Within a preset time period after punishing the target user according to the reward and punishment situation, if the target vehicle to be recommended is driven back to the affiliated operation area, compensate the target user.

[0228] In a possible embodiment, the device further includes a module for performing the following operations:

[0229] Update the user credit value of the target user based on the reward and punishment situation of the target user;

[0230] If the user credit value of the target user is not less than the preset credit threshold, the target user is allowed to use the cross-region function of the shared vehicle;

[0231] If the user credit value of the target user is less than the preset credit threshold, the target user is not allowed to use the cross-region function of the shared vehicle.

[0232] The embodiment of the present application also provides an electronic device, as Figure 7 shown, including a processor 701, a communication interface 702, a memory 703, and a communication bus 704. Among them, the processor 701, the communication interface 702, and the memory 703 complete mutual communication through the communication bus 704.

[0233] The memory 703 is used to store a computer program;

[0234] When the processor 701 is used to execute the program stored in the memory 703, the following steps are implemented:

[0235] Obtain the first region to which the current location address of the target user belongs, and the second region to which the destination address of the target user belongs;

[0236] In response to the first region and the second region being different regions, and there being a vehicle with an operating area of the second region parked in the first region, select the vehicle parked in the first region and with an operating area of the second region to obtain the vehicle to be recommended;

[0237] Recommend the vehicle to be recommended to the target user.

[0238] The communication bus mentioned in the above electronic device may be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This communication bus can be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience of representation, only a thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

[0239] The communication interface is used for communication between the above electronic device and other devices.

[0240] The memory may include a Random Access Memory (RAM), or may also include a Non-Volatile Memory (NVM), such as at least one disk memory. Optionally, the memory may also be at least one storage device located far from the aforementioned processor.

[0241] The above-mentioned processor may be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), etc.; it may 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 gate or transistor logic devices, discrete hardware components.

[0242] In another embodiment provided by the present application, there is also provided a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a processor, the steps of any of the above-mentioned shared vehicle recommendation methods are implemented.

[0243] In another embodiment provided by the present application, there is also provided a computer program product containing instructions, which when run on a computer, causes the computer to execute any of the shared vehicle recommendation methods in the above embodiments.

[0244] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer may be a general-purpose computer, a dedicated computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center in a wired manner (such as coaxial cable, optical fiber, Digital Subscriber Line (DSL)) or a wireless manner (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or data center that includes one or more integrated available media. The available medium may be a magnetic medium (such as a floppy disk, a hard disk, a magnetic tape), an optical medium (such as a DVD), or a semiconductor medium (such as a Solid State Disk (SSD)).

[0245] It should be noted that in this document, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprising", "including" or any other variant thereof are intended to cover non-exclusive inclusion, such that a process, method, article or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or device. Without further limitation, an element defined by the statement "comprising an..." does not exclude the presence of additional identical elements in the process, method, article or device comprising the element.

[0246] Each embodiment in this specification is described in a related manner. For the same or similar parts among the embodiments, reference can be made to each other. Each embodiment focuses on the differences from other embodiments. In particular, for the embodiments of the device, electronic device and storage medium, since they are basically similar to the method embodiments, the description is relatively simple, and reference can be made to the relevant parts of the method embodiments for the relevant content.

[0247] The above are only the preferred embodiments of the present application and are not intended to limit the protection scope of the present application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present application are included in the protection scope of the present application.

Claims

1. A shared vehicle recommendation method, characterized in that, The method includes: Obtaining a first area to which the current location address of the target user belongs, and a second area to which the destination address of the target user belongs; In response to the first area and the second area being different areas, and there being a vehicle parked in the first area with an operating area being the second area, selecting the vehicle parked in the first area and having an operating area being the second area to obtain a vehicle to be recommended; Recommending the vehicle to be recommended to the target user.

2. The method according to claim 1, characterized in that The method further includes: In response to the first area and the second area being different areas, determining whether there is a vehicle parked in the first area with an operating area being the second area.

3. The method according to claim 2, wherein The determining, in response to the first area and the second area being different areas, whether there is a vehicle parked in the first area with an operating area being the second area, includes: In response to the first area and the second area being different areas, and in the case where the second area is an operating area, determining whether there is a vehicle parked in the first area with an operating area being the second area; In response to the first area and the second area being different areas, and in the case where the second area is a non-operating area, determining that there is no vehicle parked in the first area with an operating area being the second area.

4. The method according to claim 1, wherein The method further includes: In response to the first area and the second area being different areas and there being no vehicle parked in the first area with an operating area being the second area, selecting a first target area closest to the second area from the operating areas to which the vehicles parked in the first area belong; selecting the vehicle parked in the first area and having an operating area being the first target area to obtain a vehicle to be recommended.

5. The method according to claim 1, wherein The method further includes: In response to the first area and the second area being the same non-operating area, selecting a second target area closest to the first area from the operating areas to which the vehicles parked in the first area belong; selecting the vehicle parked in the first area and having an operating area being the second target area to obtain a vehicle to be recommended.

6. The method according to any one of claims 1-5, characterized in that, The method further includes: Obtaining the starting address of the target vehicle to be recommended used by the target user, and the return address for returning the target vehicle to be recommended; Determining the reward and punishment situation of the target user according to the starting address and the return address; Rewarding or punishing the target user according to the reward and punishment situation of the target user.

7. The method according to claim 6, wherein The determining the reward and punishment situation of the target user according to the starting address and the return address includes: Calculating the initial incentive of the target vehicle to be recommended according to the starting address, and calculating the end incentive of the target vehicle to be recommended according to the return address; Determining the reward and punishment situation of the target user according to the initial incentive and the end incentive.

8. The method according to claim 7, characterized in that The calculating the initial incentive of the target vehicle to be recommended according to the starting address includes: Based on the starting address, determining the return point closest to the starting address to obtain a first return point; Determining the distance between the starting address and the first return point to obtain a first distance; Determine an initial incentive for the target vehicle to be recommended based on at least one of the first distance, the first comprehensive scheduling evaluation factor, the first traffic difficulty, the first recovery scheduling cost, the first resource waste factor, and the first user credit value; The first comprehensive scheduling evaluation factor represents the probability that users in the area where the starting address is located use shared vehicles. The first traffic difficulty represents the probability that users go to the area where the starting address is located. The first recovery scheduling cost represents the cost of arranging staff to schedule and recover the target vehicle to be recommended from the starting address to the affiliated operation area. The first resource waste factor represents the profit loss caused by the target vehicle to be recommended not being parked in the affiliated operation area. The first user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user; Or, Calculating an end incentive for the target vehicle to be recommended according to the return address includes: Determine the second return point, which is the return point closest to the return address, based on the return address; Determine the distance between the return address and the second return point to obtain a second distance; Determine an end incentive for the target vehicle to be recommended based on at least one of the second distance, the second comprehensive scheduling evaluation factor, the second traffic difficulty, the second recovery scheduling cost, the second resource waste factor, and the second user credit value; The second comprehensive scheduling evaluation factor represents the probability that users in the area where the return address is located use shared vehicles. The second traffic difficulty represents the probability that users go to the area where the return address is located. The second recovery scheduling cost represents the cost of arranging staff to schedule and recover the target vehicle to be recommended from the return address to the affiliated operation area. The second resource waste factor represents the profit loss caused by the target vehicle to be recommended not being parked in the affiliated operation area. The second user credit value represents the value obtained by evaluating the vehicle usage behavior of the target user.

9. The method according to claim 6, characterized in that, The method further includes: Within a preset time period after punishing the target user according to the reward and punishment situation, if the target vehicle to be recommended is driven back to the affiliated operation area, compensate the target user.

10. The method according to claim 6, characterized in that The method further includes: Update the user credit value of the target user based on the reward and punishment situation of the target user; If the user credit value of the target user is not less than a preset credit threshold, allow the target user to use the cross-region function of the shared vehicle; If the user credit value of the target user is less than the preset credit threshold, do not allow the target user to use the cross-region function of the shared vehicle.

11. A shared vehicle recommendation device, characterized in that, The device includes: An acquisition module, configured to acquire a first area to which the current location address of the target user belongs, and a second area to which the destination address of the target user belongs; A selection module, configured to select a vehicle parked in the first area and with an operation area of the second area as the vehicle to be recommended in response to the first area and the second area being different areas and there being a vehicle with an operation area of the second area parked in the first area; A recommendation module for recommending the vehicle to be recommended to the target user.

12. An electronic device, characterized in that, It includes a processor, a communication interface, a memory, and a communication bus. Among them, the processor, the communication interface, and the memory complete mutual communication through the communication bus; The memory is used to store computer programs; The processor is used to implement the method according to any one of claims 1-10 when executing the programs stored on the memory.

13. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, and when the computer program is executed by the processor, the method according to any one of claims 1-10 is implemented.

Images