CN114267202B - Parking reservation dynamic evaluation method - Google Patents

Abstract

The invention relates to a parking reservation dynamic evaluation method. Through collaborative evaluation and matching of vehicles to be parked, vehicles to leave, and parking spaces, a negotiation mechanism is introduced based on the results of the collaborative evaluation, and the optimal parking plan is obtained under the premise of negotiation, which is effective The fragmented time in the parking process is used to speed up the rotation of parking spaces. The vacant parking time is effectively compressed, and the actual parking needs of more owners of waiting vehicles are met, and the optimal solution is obtained.

Description

A dynamic evaluation method for parking reservations

Technical field

The present invention relates to the technical field of data processing systems or methods specifically suitable for administrative, commercial, financial, management, supervision or forecasting purposes, and in particular to a parking reservation dynamic evaluation method.

Background technique

As car ownership increases and cities continue to expand, the gap in parking spaces will become larger and larger. In addition to reducing parking pressure by building new parking lots, how to make full use of existing parking spaces, transform some old parking lots in old cities and bustling areas, and establish multi-functional and intelligent parking management has attracted much attention from car owners. .

The shared parking system is an intelligent system that is highly compatible with the future community. It uses parking space IoT technology and artificial intelligence to build a future community intelligent parking sharing system model. It describes the parking cloud platform and the various types of parking lots and their relationships in the future community. It is the future community. development direction.

In the existing technology, this kind of intelligent parking management still focuses on reservation and allocation. In fact, there is no effective evaluation of the vehicles to be parked and the screening of negotiable parking plans, which in turn causes the parking spaces to be vacant for a long time and truly Car owners who need to park are unable to obtain the best parking solution, causing unnecessary trouble.

Contents of the invention

The present invention solves the problems existing in the prior art and provides an optimized dynamic evaluation method for parking reservations.

The technical solution adopted by the present invention is a dynamic evaluation method for parking reservations. The method performs collaborative evaluation and matching on the conditions of vehicles to be parked, vehicles to be departed, and parking spaces, and a negotiation mechanism is introduced to obtain the optimal parking plan.

Preferably, the method includes the following steps:

Step 1: The server receives a parking request from the owner of one or more vehicles to be parked;

Step 2: Verify based on all current parking requests. If the verification is successful, proceed to the next step, otherwise it will be rejected directly;

Step 3: Carry out collaborative assessment; if after collaborative assessment, there is a matching parking space, feedback will be given directly to the car owner, otherwise, proceed to the next step;

Step 4: Obtain the owners of the vehicles to be parked and the vehicles to be left who have the intention to negotiate, and enter the negotiation process;

Step 5: Confirm the reservation with the car owner based on the negotiation results.

Preferably, in step 1, the parking request includes vehicle license plate, vehicle type, vehicle owner information, parking destination, planned entry time period, planned departure time period, whether to accept entry negotiation, and whether to accept departure negotiation.

Preferably, in step 1, during the idle period and the busy period, the server obtains the parking request in units of preset time T1 and T2 respectively, T1≥T2>0.

Preferably, in step 2, if the vehicle license plate or vehicle owner information is recorded in the blacklist of the server, the verification fails and is directly rejected.

Preferably, in step 3, the collaborative evaluation for any vehicle to be parked includes the following steps:

Step 3.1: Extract vehicle type, planned arrival time period, and parking destination;

Step 3.2: The server queries the parking space. If there is a matching parking space, it will directly feed back to the car owner. Otherwise, proceed to the next step;

Step 3.3: Extract the information corresponding to whether to accept the entry negotiation; if so, proceed to the next step; otherwise, directly recommend other parking lots within the surrounding preset range, or wait for the next server query, and go to step 3.2;

Step 3.4: Based on the planned arrival time period of the vehicle to be parked, obtain a number of parked vehicles and reserved vehicles that are closest to this time period, recorded as set A.

Preferably, the matchable parking spaces include matching of vehicle width, height, length, parking destination, parking space type and whether to charge.

Preferably, step 4 includes the following steps:

Step 4.1: Obtain the reservation information of the vehicles in set A, and filter the information corresponding to whether departure negotiation is accepted. If so, keep it, otherwise delete it from set A, and get set A';

Step 4.2: The server sends an inquiry to the owner of the vehicle in set A' whether it is possible to leave early. If so, bind the vehicle to be parked with the parking space corresponding to the currently parked vehicle or reserved vehicle, and proceed to step 5. Otherwise, , recommend other parking lots within the preset range around the vehicle to be parked and confirm the demand;

Step 4.3: If the vehicle to be parked retains parking requirements, repeat step 3.2 at the preset time before the planned entry time period of the vehicle to be parked, until the start time of the planned entry time period, stop pushing, and feedback the reservation failure information.

Preferably, preferential charging is performed on parked vehicles or reserved vehicles that successfully accept negotiation.

Preferably, if the vehicle to be parked does not enter within the preset time T from the start time of the planned entry time period, then the score corresponding to the current vehicle license plate and owner information will be deducted until the score is lower than the threshold, and then added blacklist.

The present invention relates to an optimized dynamic evaluation method for parking reservations. Through collaborative evaluation of vehicles to be parked, vehicles to be left, and parking spaces, a negotiation mechanism is introduced based on the results of the collaborative evaluation, and the optimal parking plan is obtained under the premise of negotiation. It effectively utilizes the fragmented time during the parking process, thereby speeding up the rotation of parking spaces, effectively compressing the vacant parking time, and meeting the actual parking needs of more owners of waiting vehicles to obtain the optimal solution.

Description of the drawings

Figure 1 is a flow chart of the method of the present invention.

Detailed ways

The present invention will be described in further detail below with reference to the examples, but the protection scope of the present invention is not limited thereto.

The invention relates to a parking reservation dynamic evaluation method. The method performs collaborative evaluation and matching on the conditions of vehicles to be parked, vehicles to be departed, and parking spaces, and a negotiation mechanism is introduced to obtain an optimal parking plan.

The method includes the following steps:

Step 1: The server receives a parking request from the owner of one or more vehicles to be parked;

In step 1, the parking request includes vehicle license plate, vehicle type, vehicle owner information, parking destination, planned entry time period, planned departure time period, whether to accept entry negotiation, and whether to accept departure negotiation.

In step 1, during the idle period and the busy period, the server obtains the parking request in units of preset time T1 and T2 respectively, T1≥T2>0.

In the present invention, in the parking request, the vehicle license plate is used for vehicle reservation and identification.

In the present invention, vehicle types include traditional vehicles and new energy vehicles, and can be used to distinguish SUVs, sports cars, ordinary cars, or large off-road vehicles, etc., thereby matching applicable parking spaces.

In the present invention, the car owner information is used for verification, information push, etc. The car owner information includes the bound mobile phone number, the corresponding user ID or name, and other valid information.

In the present invention, when sending a parking request, it is necessary to define the planned entry time period, the planned departure time period, the parking destination, whether to accept the entry negotiation, and whether to accept the departure negotiation. Among them, the planned entry time period, the planned departure time The segment is generally in the form of a time period, such as one hour as a unit, 11-12 o'clock is the planned entry, and 14-15 o'clock is the planned departure. At the same time, the request is marked by whether to accept the entry negotiation and whether to accept the departure negotiation. It is used to match the parking car owners who accept the entry negotiation and the parked car owners (or the reserved car owners) who accept the departure negotiation when the parking spaces are full, and negotiate between the two parties.

In the present invention, in order to improve the processing efficiency and the robustness of the method operation, the frequency of acquisition of parking requests and batch processing is distinguished between idle periods and busy periods.

Step 2: Verify based on all current parking requests. If the verification is successful, proceed to the next step, otherwise it will be rejected directly;

In step 2, if the vehicle license plate or owner information is recorded in the blacklist of the server, the verification fails and is directly rejected.

In the present invention, the information of car owners who have behaviors such as not showing up after making a reservation, failing to fulfill the negotiation conditions after negotiation, resulting in disordered parking lot management, etc. is recorded in the blacklist, and the parking lot determines that the verification has failed based on the parking lot management code/convention, etc. Reject directly.

In the present invention, some car owners in the blacklist can be released after a certain period of time.

In the present invention, the vehicle license plate can generally correspond to the vehicle owner information, but this verification is mainly based on the vehicle owner information.

Step 3: Carry out collaborative assessment; if after collaborative assessment, there is a matching parking space, feedback will be given directly to the car owner, otherwise, proceed to the next step;

In step 3, the collaborative evaluation of any vehicle to be parked includes the following steps:

Step 3.1: Extract vehicle type, planned arrival time period, and parking destination;

Step 3.2: The server queries the parking space. If there is a matching parking space, it will directly feed back to the car owner. Otherwise, proceed to the next step;

Step 3.3: Extract the information corresponding to whether to accept the entry negotiation; if so, proceed to the next step; otherwise, directly recommend other parking lots within the surrounding preset range, or wait for the next server query, and go to step 3.2;

Step 3.4: Based on the planned arrival time period of the vehicle to be parked, obtain a number of parked vehicles and reserved vehicles that are closest to this time period, recorded as set A.

The matching parking spaces include matching of vehicle width, height, length, parking destination, parking space type and whether to charge or not.

In the present invention, when there is a matching parking space, feedback can be directly provided to the car owner and the parking space can be locked within the reservation time period.

In the present invention, when there is no matching parking space and the car owner does not accept the negotiation, other surrounding parking lots can be recommended to the car owner for multi-place coordination.

In the present invention, when there is no matching parking behavior and the car owner accepts the negotiation, the vehicle collection that can be negotiated is obtained. The vehicle collection is not limited to parked vehicles, but also includes reserved vehicles; among them, "the closest to this time period" It means that the difference from the planned entry time period of the car owner waiting to be parked is 15 to 30 minutes, or it can be set by technicians in the field based on needs.

Step 4: Obtain the owners of the vehicles to be parked and the vehicles to be left who have the intention to negotiate, and enter the negotiation process;

The step 4 includes the following steps:

Step 4.1: Obtain the reservation information of the vehicles in set A, and filter the information corresponding to whether departure negotiation is accepted. If so, keep it, otherwise delete it from set A, and get set A';

Step 4.2: The server sends an inquiry to the owner of the vehicle in set A' whether it is possible to leave early. If so, bind the vehicle to be parked with the parking space corresponding to the currently parked vehicle or reserved vehicle, and proceed to step 5. Otherwise, , recommend other parking lots within the preset range around the vehicle to be parked and confirm the demand;

Step 4.3: If the vehicle to be parked retains parking requirements, repeat step 3.2 at the preset time before the planned entry time period of the vehicle to be parked, until the start time of the planned entry time period, stop pushing, and feedback the reservation failure information.

Preferential billing will be performed for parked vehicles or reserved vehicles that successfully accept negotiation.

In the present invention, firstly, the vehicle owners who can negotiate the departure time are screened out from the vehicle collection, and the system sorts them according to "the closest to this time period", and inquires one by one, usually in the form of message or voice call push; if If no car owner is willing to accept the negotiated departure time for the time being, and the car owner who is waiting to park retains the parking demand, the time will be preset before the planned entry time, such as fifteen minutes, half an hour, or one hour. Inquiries will be made again through the parking space negotiation mechanism. , negotiate whether the driver currently using the parking space can leave early and vacate the parking space to meet the parking space reservation request.

In the present invention, if there is a parked vehicle that does not exist in set A' and leaves the site early before the planned entry time period of the vehicle to be parked, then in the absence of a more preferential vehicle to be parked, priority is given to the vehicle to be parked. .

In the present invention, in order to encourage such behavior, preferential charging is implemented for vehicles that successfully accept the negotiation, part of the amount is directly deducted from the original charging standard, or the next parking is encouraged in other preferential ways.

Step 5: Confirm the reservation with the car owner based on the negotiation results.

If the vehicle to be parked does not enter the venue within the preset time T from the start time of the planned entry time period, the points corresponding to the current vehicle license plate and owner information will be deducted until the points are lower than the threshold and then added to the blacklist.

In the present invention, new car owners are assigned certain points, and points are deducted for bad behavior until they are below the threshold and then blacklisted, thereby achieving fast and effective verification in step 2.

Claims (7)

1. A parking reservation dynamic evaluation method, characterized in that: the method performs collaborative evaluation and matching on vehicles to be parked, vehicles to leave, and parking spaces, and a negotiation mechanism is introduced to obtain the optimal parking plan; the method includes the following steps: Step 1: The server receives a parking request from the owner of one or more vehicles to be parked; Step 2: Verify based on all current parking requests. If the verification is successful, proceed to the next step, otherwise it will be rejected directly; Step 3: Carry out collaborative assessment; if after collaborative assessment, there is a matching parking space, feedback will be given directly to the car owner, otherwise, proceed to the next step; Step 4: Obtain the owners of the vehicles to be parked and the vehicles to be left who have the intention to negotiate, and enter the negotiation process; Step 5: Confirm the reservation with the car owner based on the negotiation results; Collaborative assessment includes the following steps: Step 3.1: Extract vehicle type, planned arrival time period, and parking destination; Step 3.2: The server queries the parking space. If there is a matching parking space, it will directly feed back to the car owner. Otherwise, proceed to the next step; Step 3.3: Extract the information corresponding to whether to accept the entry negotiation; if so, proceed to the next step; otherwise, directly recommend other parking lots within the surrounding preset range, or wait for the next server query, and go to step 3.2; Step 3.4: Based on the planned arrival time period of the vehicle to be parked, obtain a number of parked vehicles and reserved vehicles that are closest to this time period, recorded as set A; Negotiation includes the following steps: Step 4.1: Obtain the reservation information of the vehicles in set A, and filter the information corresponding to whether departure negotiation is accepted. If so, keep it, otherwise delete it from set A, and get set A'; Step 4.2: The server sends an inquiry to the owner of the vehicle in set A' whether it is possible to leave early. If so, bind the vehicle to be parked with the parking space corresponding to the currently parked vehicle or reserved vehicle, and proceed to step 5. Otherwise, , recommend other parking lots within the preset range around the vehicle to be parked and confirm the demand; Step 4.3: If the vehicle to be parked retains parking requirements, repeat step 3.2 at the preset time before the planned entry time period of the vehicle to be parked, until the start time of the planned entry time period, stop pushing, and feedback the reservation failure information. 2. A parking reservation dynamic evaluation method according to claim 1, characterized in that: in step 1, the parking request includes vehicle license plate, vehicle type, vehicle owner information, parking destination, planned entry time period, Plan the departure time period, whether to accept entry negotiation, and whether to accept exit negotiation. 3. A parking reservation dynamic evaluation method according to claim 1, characterized in that: in the step 1, during the idle period and the busy period, the server obtains the parking request in units of preset time T1 and T2 respectively, T1 ≥T2>0. 4. A parking reservation dynamic evaluation method according to claim 1, characterized in that: in step 2, if the vehicle license plate or vehicle owner information is recorded in the blacklist of the server, the verification fails and is directly rejected. 5. A parking reservation dynamic evaluation method according to claim 1, characterized in that: the matching parking spaces include matching of vehicle width, height, length, parking destination, parking space type and whether to charge or not. 6. A parking reservation dynamic evaluation method according to claim 1, characterized in that preferential charging is performed for parked vehicles or reserved vehicles that successfully accept negotiation. 7. A parking reservation dynamic evaluation method according to claim 1, characterized in that: if the vehicle to be parked does not enter within the preset time T from the starting time of the planned entry time period, the current vehicle number will be deducted. The score corresponding to the license plate and car owner information will be added to the blacklist until the score is lower than the threshold.