Nothing Special   »   [go: up one dir, main page]

CN114267202B - Parking reservation dynamic evaluation method - Google Patents

Parking reservation dynamic evaluation method Download PDF

Info

Publication number
CN114267202B
CN114267202B CN202111668849.2A CN202111668849A CN114267202B CN 114267202 B CN114267202 B CN 114267202B CN 202111668849 A CN202111668849 A CN 202111668849A CN 114267202 B CN114267202 B CN 114267202B
Authority
CN
China
Prior art keywords
parking
vehicle
parked
vehicles
negotiation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111668849.2A
Other languages
Chinese (zh)
Other versions
CN114267202A (en
Inventor
吕何新
马康鑫
虞飞华
戴国勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Shuren University
Original Assignee
Zhejiang Shuren University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang Shuren University filed Critical Zhejiang Shuren University
Priority to CN202111668849.2A priority Critical patent/CN114267202B/en
Publication of CN114267202A publication Critical patent/CN114267202A/en
Application granted granted Critical
Publication of CN114267202B publication Critical patent/CN114267202B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention relates to a dynamic evaluation method for parking reservation, which comprises the steps of carrying out cooperative evaluation matching on the conditions of a vehicle to be parked, a vehicle to be away from a parking space, and a parking space, introducing a negotiation mechanism based on the result of the cooperative evaluation, obtaining an optimal parking scheme on the premise of negotiation, effectively utilizing the fragmentation time in the parking process, further accelerating the rotation of the parking space, effectively compressing the idle time of the parking space, and meeting the actual parking demands of more vehicle owners of the vehicle to be parked, thereby obtaining the optimal solution.

Description

Parking reservation dynamic evaluation method
Technical Field
The invention relates to the technical field of data processing systems or methods specially adapted for administrative, commercial, financial, administrative, supervisory or predictive purposes, in particular to a dynamic assessment method for parking reservations.
Background
With the increase of the storage quantity of automobiles and the continuous expansion of cities, the gaps of parking spaces become larger and larger. Besides the reduction of parking pressure by constructing a new parking lot, how to fully utilize the existing parking space, reform old parking lots in old urban areas and prosperous areas, establish multifunctional and intelligent parking management, and be concerned by car owners.
The shared parking system is an intelligent system which is highly matched with a future community, a parking space internet of things technology and artificial intelligence are adopted to construct an intelligent parking shared system model of the future community, and various parking lots and relations thereof describing a parking cloud platform and the future community are development directions of the future community.
In the prior art, the intelligent parking management still focuses on reservation and allocation, in fact, no effective evaluation is carried out on the vehicle to be parked, and a parking scheme which can be negotiated by screening is not adopted, so that the situation that the parking space is idle for a long time and the best parking scheme cannot be obtained by a vehicle owner actually needing parking is caused intangibly, and unnecessary trouble is caused.
Disclosure of Invention
The invention solves the problems existing in the prior art and provides an optimized dynamic assessment method for parking reservation.
The technical scheme adopted by the invention is that the method for dynamically evaluating the parking reservation carries out cooperative evaluation matching on the conditions of the vehicle to be parked, the vehicle to be away from the parking space, and introduces a negotiation mechanism to obtain the optimal parking scheme.
Preferably, the method comprises the steps of:
step 1: the method comprises the steps that a server receives a parking request sent by a vehicle owner of one or more vehicles to be parked;
step 2: based on all the current parking requests, verifying, if the verification is successful, performing the next step, otherwise, directly rejecting;
step 3: performing collaborative evaluation; if the matched parking spaces exist after the cooperative evaluation, directly feeding back to the vehicle owner, otherwise, carrying out the next step;
step 4: acquiring owners of vehicles to be parked and vehicles to be away from a parking place with negotiation intention, and entering a negotiation link;
step 5: and carrying out reservation confirmation to the vehicle owner based on the negotiation result.
Preferably, in the step 1, the parking request includes a vehicle number plate, a vehicle type, owner information, a parking destination, a planned approach period, a planned departure period, whether to accept approach negotiation, and whether to accept departure negotiation.
Preferably, in the step 1, the server obtains the parking request by taking the preset time T1 and T2 as a unit, wherein T1 is greater than or equal to T2 > 0.
Preferably, in the step 2, if the vehicle license plate or the vehicle owner information is recorded in the blacklist of the server, the verification fails and is directly refused.
Preferably, in the step 3, the cooperative evaluation for any one of the vehicles to be parked includes the steps of:
step 3.1: extracting the type of the vehicle, the planned approach time period and the parking destination;
step 3.2: the server inquires the parking space, if the matched parking space exists, the parking space is directly fed back to the vehicle owner, otherwise, the next step is carried out;
step 3.3: extracting information corresponding to whether to accept the approach negotiation; if yes, carrying out the next step, otherwise, directly recommending other parking lots in the surrounding preset range, or waiting for the next server to inquire, and turning to the step 3.2;
step 3.4: based on the planned approach time period of the vehicle to be parked, a plurality of parked vehicles and reserved vehicles closest to the time period are acquired and recorded as a set A.
Preferably, the matchable parking space includes a match of a vehicle width, a height, a length, a parking destination, a parking space type, and whether to charge.
Preferably, the step 4 includes the steps of:
step 4.1: acquiring reservation information of vehicles in the set A, screening whether to accept information corresponding to the departure negotiation, if so, reserving, otherwise, deleting from the set A to obtain a set A';
step 4.2: the server sends out an inquiry to the vehicle owners corresponding to the vehicles in the set A', if the vehicles can leave the parking space in advance, if so, the vehicles to be parked are bound with the parking spaces corresponding to the currently parked vehicles or reserved vehicles, step 5 is carried out, otherwise, other parking spaces in a preset range around the vehicles to be parked are recommended, and the requirements are confirmed;
step 4.3: if the vehicle to be parked reserves the parking requirement, repeating the step 3.2 for a preset time before the planned approach time period of the vehicle to be parked until the starting time of the planned approach time period, stopping pushing, and feeding back reservation failure information.
Preferably, preferential billing is performed for parked vehicles or reserved vehicles that successfully accept negotiations.
Preferably, if the vehicle to be parked is not parked within the preset time T from the starting time of the planned approach time period, the scores corresponding to the current vehicle number plate and the owner information are deducted until the scores are lower than the threshold value, and then the blacklist is added.
The invention relates to an optimized dynamic evaluation method for parking reservation, which comprises the steps of carrying out cooperative evaluation on the conditions of a vehicle to be parked, a vehicle to be away from a parking space, and a parking space, introducing a negotiation mechanism based on the result of the cooperative evaluation, obtaining an optimal parking scheme on the premise of negotiation, effectively utilizing the fragmentation time in the parking process, further accelerating the rotation of the parking space, effectively compressing the idle time of the parking space, and meeting the actual parking demands of more vehicle owners of the vehicle to be parked, thereby obtaining the optimal solution.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
The present invention will be described in further detail with reference to examples, but the scope of the present invention is not limited thereto.
The invention relates to a dynamic evaluation method for parking reservation, which is used for carrying out collaborative evaluation matching on the conditions of a vehicle to be parked, a vehicle to be away from a parking space and a parking space, and introducing a negotiation mechanism to obtain an optimal parking scheme.
The method comprises the following steps:
step 1: the method comprises the steps that a server receives a parking request sent by a vehicle owner of one or more vehicles to be parked;
in the step 1, the parking request includes a vehicle number plate, a vehicle type, owner information, a parking destination, a planned approach period, a planned departure period, whether to accept approach negotiation, and whether to accept departure negotiation.
In the step 1, the server side obtains the parking request by taking the preset time T1 and the preset time T2 as units, wherein T1 is more than or equal to T2 and more than 0.
In the invention, in the parking request, the vehicle license plate is used for vehicle reservation and identification.
In the invention, the vehicle types comprise traditional vehicles and new energy vehicles, and can be used for distinguishing SUVs, sports cars, common cars or large off-road vehicles and the like, so that applicable parking spaces can be matched.
In the invention, the owner information is used for verification, information pushing and the like, and comprises a bound mobile phone number, a corresponding user ID or name, other effective information and the like.
In the invention, a planned approach period, a planned departure period, a parking destination, whether to accept approach negotiation and whether to accept departure negotiation are required to be limited when a parking request is sent, wherein the planned approach period and the planned departure period are generally in the form of a period of time, for example, 11-12 points are the planned approach and 14-15 points are the planned departure in an hour unit, and meanwhile, request identification is carried out according to whether to accept approach negotiation and whether to accept departure negotiation, and the request identification is used for matching and negotiating between a to-be-parked vehicle owner receiving approach negotiation and a parked vehicle owner (or reserved vehicle owner) receiving departure negotiation when a parking space is full.
In the invention, in order to improve the processing efficiency and the robustness of the method operation, the frequency of the acquisition and batch processing of the parking request is distinguished between the idle period and the busy period.
Step 2: based on all the current parking requests, verifying, if the verification is successful, performing the next step, otherwise, directly rejecting;
in the step 2, if the vehicle license plate or the vehicle owner information is recorded in the blacklist of the server, the verification fails and the vehicle license plate or the vehicle owner information is directly refused.
In the invention, the information of the car owner with actions such as the fact that the car owner is out of order in the management of the parking lot due to the fact that the car owner is out of the field after reservation and the fact that the negotiation condition is not fulfilled after negotiation is recorded in a blacklist, and the parking lot judges that the verification of the car owner fails based on the management rules/conventions of the parking lot and directly refuses.
In the invention, part of the car owners in the blacklist can be released after a certain time.
In the invention, the vehicle license plate can generally correspond to the owner information, but the verification is mainly based on the owner information.
Step 3: performing collaborative evaluation; if the matched parking spaces exist after the cooperative evaluation, directly feeding back to the vehicle owner, otherwise, carrying out the next step;
in the step 3, the cooperative evaluation for any vehicle to be parked includes the following steps:
step 3.1: extracting the type of the vehicle, the planned approach time period and the parking destination;
step 3.2: the server inquires the parking space, if the matched parking space exists, the parking space is directly fed back to the vehicle owner, otherwise, the next step is carried out;
step 3.3: extracting information corresponding to whether to accept the approach negotiation; if yes, carrying out the next step, otherwise, directly recommending other parking lots in the surrounding preset range, or waiting for the next server to inquire, and turning to the step 3.2;
step 3.4: based on the planned approach time period of the vehicle to be parked, a plurality of parked vehicles and reserved vehicles closest to the time period are acquired and recorded as a set A.
The matchable parking spaces include matches of vehicle width, height, length, parking destination, parking space type, and whether to charge.
In the invention, when the matched parking space exists, the matched parking space can be directly fed back to the vehicle owner, and the parking space is locked in a reserved time period.
In the invention, when no matched parking space exists, and the vehicle owner does not accept negotiation, other surrounding parking spaces can be recommended to the vehicle owner for multi-place cooperation.
In the invention, when no matched parking is available, the vehicle owner accepts negotiation, and then obtains a vehicle set which can be negotiated, wherein the vehicle set is not only limited to parked vehicles, but also comprises reserved vehicles; the term "closest to the time period" refers to a difference of 15-30 minutes from a planned approach time period of a vehicle owner to be parked, or is set by a person skilled in the art based on requirements.
Step 4: acquiring owners of vehicles to be parked and vehicles to be away from a parking place with negotiation intention, and entering a negotiation link;
the step 4 comprises the following steps:
step 4.1: acquiring reservation information of vehicles in the set A, screening whether to accept information corresponding to the departure negotiation, if so, reserving, otherwise, deleting from the set A to obtain a set A';
step 4.2: the server sends out an inquiry to the vehicle owners corresponding to the vehicles in the set A', if the vehicles can leave the parking space in advance, if so, the vehicles to be parked are bound with the parking spaces corresponding to the currently parked vehicles or reserved vehicles, step 5 is carried out, otherwise, other parking spaces in a preset range around the vehicles to be parked are recommended, and the requirements are confirmed;
step 4.3: if the vehicle to be parked reserves the parking requirement, repeating the step 3.2 for a preset time before the planned approach time period of the vehicle to be parked until the starting time of the planned approach time period, stopping pushing, and feeding back reservation failure information.
And performing preferential charging on the parked vehicle or the reserved vehicle which successfully accepts negotiation.
In the invention, firstly, the vehicle owners which can negotiate the departure time are screened out from the vehicle set, the system sorts the vehicle owners according to the 'closest to the time period', and the inquiry is carried out successively, and the mode of message or voice telephone pushing is generally adopted; if no vehicle owner is willing to accept the negotiation departure time temporarily and the parking requirement is reserved by the vehicle owner to be parked, the vehicle owner is queried again in a preset time, such as fifteen minutes, half hours and one hour, before the planned approach time period, and the vehicle owner negotiates whether the driver in the currently used vehicle can leave the parking place in advance or not by a parking space negotiation mechanism, and vacates the parking space so as to meet the parking space reservation request.
In the present invention, if there are parked vehicles not existing in the set a' that leave the field in advance of the planned approach period of the vehicle to be parked, the vehicle to be parked is preferentially allocated without a more preferable parked vehicle.
In the present invention, to encourage such behavior, preferential billing is performed for vehicles that successfully accept negotiations, with partial amount deduction directly on the original billing criteria or other preferential manner encouraging the next parking.
Step 5: and carrying out reservation confirmation to the vehicle owner based on the negotiation result.
And if the starting time of the planned approach time period is within the preset time T, deducting the scores corresponding to the current vehicle number plate and the owner information until the scores are lower than the threshold value, and adding a blacklist.
In the invention, a certain score is attached to the new vehicle owner, score deduction is carried out on bad behaviors until the score deduction is lower than a threshold value, and a blacklist is carried out, so that the quick and effective verification in the step 2 is realized.

Claims (7)

1. A parking reservation dynamic evaluation method is characterized in that: the method comprises the steps of carrying out collaborative evaluation matching on the conditions of a vehicle to be parked, a vehicle to be away from a parking space, and introducing a negotiation mechanism to obtain an optimal parking scheme; the method comprises the following steps:
step 1: the method comprises the steps that a server receives a parking request sent by a vehicle owner of one or more vehicles to be parked;
step 2: based on all the current parking requests, verifying, if the verification is successful, performing the next step, otherwise, directly rejecting;
step 3: performing collaborative evaluation; if the matched parking spaces exist after the cooperative evaluation, directly feeding back to the vehicle owner, otherwise, carrying out the next step;
step 4: acquiring owners of vehicles to be parked and vehicles to be away from a parking place with negotiation intention, and entering a negotiation link;
step 5: carrying out reservation confirmation on the vehicle owner based on the negotiation result;
the collaborative assessment includes the following steps:
step 3.1: extracting the type of the vehicle, the planned approach time period and the parking destination;
step 3.2: the server inquires the parking space, if the matched parking space exists, the parking space is directly fed back to the vehicle owner, otherwise, the next step is carried out;
step 3.3: extracting information corresponding to whether to accept the approach negotiation; if yes, carrying out the next step, otherwise, directly recommending other parking lots in the surrounding preset range, or waiting for the next server to inquire, and turning to the step 3.2;
step 3.4: based on a planned approach time period of a vehicle to be parked, acquiring a plurality of parked vehicles and reserved vehicles closest to the time period, and recording the parked vehicles and the reserved vehicles as a set A;
the negotiation includes the steps of:
step 4.1: acquiring reservation information of vehicles in the set A, screening whether to accept information corresponding to the departure negotiation, if so, reserving, otherwise, deleting from the set A to obtain a set A';
step 4.2: the server sends out an inquiry to the vehicle owners corresponding to the vehicles in the set A', if the vehicles can leave the parking space in advance, if so, the vehicles to be parked are bound with the parking spaces corresponding to the currently parked vehicles or reserved vehicles, step 5 is carried out, otherwise, other parking spaces in a preset range around the vehicles to be parked are recommended, and the requirements are confirmed;
step 4.3: if the vehicle to be parked reserves the parking requirement, repeating the step 3.2 for a preset time before the planned approach time period of the vehicle to be parked until the starting time of the planned approach time period, stopping pushing, and feeding back reservation failure information.
2. The method for dynamically evaluating parking reservations according to claim 1, wherein: in the step 1, the parking request includes a vehicle number plate, a vehicle type, owner information, a parking destination, a planned approach period, a planned departure period, whether to accept approach negotiation, and whether to accept departure negotiation.
3. The method for dynamically evaluating parking reservations according to claim 1, wherein: in the step 1, the server side obtains the parking request by taking the preset time T1 and the preset time T2 as units, wherein T1 is more than or equal to T2 and more than 0.
4. The method for dynamically evaluating parking reservations according to claim 1, wherein: in the step 2, if the vehicle license plate or the vehicle owner information is recorded in the blacklist of the server, the verification fails and the vehicle license plate or the vehicle owner information is directly refused.
5. The method for dynamically evaluating parking reservations according to claim 1, wherein: the matchable parking spaces include matches of vehicle width, height, length, parking destination, parking space type, and whether to charge.
6. The method for dynamically evaluating parking reservations according to claim 1, wherein: and performing preferential charging on the parked vehicle or the reserved vehicle which successfully accepts negotiation.
7. The method for dynamically evaluating parking reservations according to claim 1, wherein: and if the starting time of the planned approach time period is within the preset time T, deducting the scores corresponding to the current vehicle number plate and the owner information until the scores are lower than the threshold value, and adding a blacklist.
CN202111668849.2A 2021-12-31 2021-12-31 Parking reservation dynamic evaluation method Active CN114267202B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111668849.2A CN114267202B (en) 2021-12-31 2021-12-31 Parking reservation dynamic evaluation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111668849.2A CN114267202B (en) 2021-12-31 2021-12-31 Parking reservation dynamic evaluation method

Publications (2)

Publication Number Publication Date
CN114267202A CN114267202A (en) 2022-04-01
CN114267202B true CN114267202B (en) 2023-09-26

Family

ID=80832130

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111668849.2A Active CN114267202B (en) 2021-12-31 2021-12-31 Parking reservation dynamic evaluation method

Country Status (1)

Country Link
CN (1) CN114267202B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008132520A1 (en) * 2007-04-27 2008-11-06 Andreas Prodromidis Method and system for the central collection, management and communication of information about parking spaces
CN101783079A (en) * 2009-01-20 2010-07-21 上海迪哈大计算机科技有限公司 Control device and control method for indicating parking spaces in intelligent traffic system
JP2014211778A (en) * 2013-04-19 2014-11-13 日本宅配システム株式會社 Vehicle allocation system
CN106067194A (en) * 2016-05-24 2016-11-02 王永明 The interim rent method in parking stall
CN106409006A (en) * 2016-11-08 2017-02-15 南威软件股份有限公司 Could data-based parking lot networked management system
CN106469517A (en) * 2015-08-20 2017-03-01 腾石智能科技(上海)有限公司 The method with sharing parking stall for the system sharing parking stall
CN106971606A (en) * 2017-04-17 2017-07-21 商丘师范学院 A kind of parking stall management method applied based on smart mobile phone APP
CN107170278A (en) * 2017-06-16 2017-09-15 深圳市盛路物联通讯技术有限公司 A kind of shared method in parking stall and server
CN107798911A (en) * 2017-11-28 2018-03-13 青岛理工大学 Indoor parking space accurate guiding system and method based on WiFi
CN108961104A (en) * 2018-06-29 2018-12-07 深圳春沐源控股有限公司 Scenic spot parking stall management method and scenic spot parking management device
CN111653041A (en) * 2019-03-18 2020-09-11 上海铼锶信息技术有限公司 Parking space sharing system and method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016046831A1 (en) * 2014-09-26 2016-03-31 Natan Tomer Methods and systems of managing parking space occupancy

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008132520A1 (en) * 2007-04-27 2008-11-06 Andreas Prodromidis Method and system for the central collection, management and communication of information about parking spaces
CN101783079A (en) * 2009-01-20 2010-07-21 上海迪哈大计算机科技有限公司 Control device and control method for indicating parking spaces in intelligent traffic system
JP2014211778A (en) * 2013-04-19 2014-11-13 日本宅配システム株式會社 Vehicle allocation system
CN106469517A (en) * 2015-08-20 2017-03-01 腾石智能科技(上海)有限公司 The method with sharing parking stall for the system sharing parking stall
CN106067194A (en) * 2016-05-24 2016-11-02 王永明 The interim rent method in parking stall
CN106409006A (en) * 2016-11-08 2017-02-15 南威软件股份有限公司 Could data-based parking lot networked management system
CN106971606A (en) * 2017-04-17 2017-07-21 商丘师范学院 A kind of parking stall management method applied based on smart mobile phone APP
CN107170278A (en) * 2017-06-16 2017-09-15 深圳市盛路物联通讯技术有限公司 A kind of shared method in parking stall and server
CN107798911A (en) * 2017-11-28 2018-03-13 青岛理工大学 Indoor parking space accurate guiding system and method based on WiFi
CN108961104A (en) * 2018-06-29 2018-12-07 深圳春沐源控股有限公司 Scenic spot parking stall management method and scenic spot parking management device
CN111653041A (en) * 2019-03-18 2020-09-11 上海铼锶信息技术有限公司 Parking space sharing system and method

Also Published As

Publication number Publication date
CN114267202A (en) 2022-04-01

Similar Documents

Publication Publication Date Title
CN107038488B (en) Parking lot real-time parking space reservation method based on parking space prediction and parking selection
CN105788241B (en) Credit rating-based public resource optimal allocation method and system
WO2018232914A1 (en) Parking space reservation charging method and system
CN108765591A (en) A kind of parking stall sharing method and device based on block chain technology
CN110020842B (en) Intelligent automobile management method and system based on block chain
CN114730525A (en) Parking space distribution system and method
CN110807944B (en) Multi-level management method for occupying parking spaces of charging station
CN112699351A (en) Method, system and storage medium for identifying identity of bus driver
CN106409001A (en) Private parking space time-share renting method based on bluetooth ad-hoc network
CN111653041A (en) Parking space sharing system and method
CN111967952A (en) Intelligent truck logistics transaction system based on intelligent Internet of vehicles and block chain
CN114435173B (en) Charging pile management method, device and storage medium
CN114373330A (en) Parking space order sharing method and system
CN114267202B (en) Parking reservation dynamic evaluation method
CN117291757A (en) Charging pile scheduling system and charging pile scheduling method
CN111223298B (en) Method and system for controlling bus lane borrowing
CN115063927B (en) Shared charging system and operation equipment based on block chain
CN109920071B (en) Preferential parking management method, parking management terminal and readable storage medium
CN111815791A (en) Roadside parking automatic payment method and system based on Internet of vehicles
CN112070256B (en) Reservation parking management method and system based on blockchain and storage medium thereof
CN114285061B (en) Operation system of direct current V2V charge-discharge technology
CN117292448A (en) Vehicle charge management method and system capable of charging illegal vehicle
CN116051050A (en) Vehicle rental system
CN113256344A (en) Automobile trip sharing platform system and sharing method
CN107993472A (en) Parking stall reserving method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant