CN-117373282-B - Regional shared berth rolling time domain distribution method considering potential requirements

CN117373282BCN 117373282 BCN117373282 BCN 117373282BCN-117373282-B

Abstract

The invention provides a region sharing berth rolling time domain distribution method considering potential requirements, which comprises the following steps that a parking user provides a parking destination and parking time to a platform side, the platform generates a parking request matrix in a region according to a parking request reserved in advance and a time period, the platform divides the user into a sharing parking lot in the region according to the parking request matrix of the parking user and generates a parking supply matrix of the sharing parking lot in the region, the platform carries out primary distribution of sharing berths according to the reserved parking request of the parking user and a result of dividing the parking region, the number and parking time length of the parking users which are refused according to the requirement, and the platform carries out dynamic distribution according to the parking request matrix and the supply matrix of the temporary reserved user in the region which is changed and updated by road network traffic flow and updates the parking request matrix and the supply matrix. According to the invention, the parking requirements and the parking supplies are effectively combined through sharing parking, so that the benefits of a parking platform are improved.

Inventors

SUN CHAO
Yin Haowei
ZHANG PENG
CAI YUHANG

Assignees

江苏大学

Dates

Publication Date: 20260512
Application Date: 20231012

Claims (6)

1. The regional shared berth rolling time domain distribution method considering potential requirements is characterized by comprising the following steps of: S1, the sharing platform selects the number of the parking users refused on the same day according to the rule of the historical parking data And (d) Parking duration of parking user , ; S2, providing berth data by a shared berth provider; S3, the parking user provides a parking destination for the platform party The platform generates a parking request matrix in the area according to the pre-reserved parking request and the time period, and the parking user provides basic information including the initial parking time, the final parking time and the parking destination to the platform Variable(s) Indicating a pre-reserved parking request And time period If a parking request is made During a time period Internal rule Otherwise, 0, the parking request matrix of the ith decision point is , Representing a parking request at an ith decision point And time period In which M is the total number of parking requests reserved in advance; S4, the platform divides the users into the shared parking lots in the areas according to the parking request matrix of the parking users And generating a parking supply matrix for the shared parking lot in the area The method specifically comprises the following steps: S41 variable Representing shared parking lots And destination The distance between a single shared parking lot and a single destination is a fixed value, and the platform generates a shared parking lot distribution matrix Wherein , The total number of destinations in the area set for the platform; S42, updating the road network delay condition and the variable of the vicinity of each shared parking lot in the primary area at each decision point by the platform Indicating sharing of parking lots at an ith decision point The road delay data received by the platform all day is that ; S43, platform according to received parking user input parking destination Sharing parking lot distribution matrix Determining a parking area within an acceptable walking distance range; s44, screening out the parking areas according to the determined parking areas by the platform Shared berth in parking area Shared berth supply matrix for all days Updating, and updating the supply matrix Represented as a parking space provisioning matrix within a defined parking area; S5, the platform performs primary allocation of shared berths according to the reserved parking requests of the parking users and the division of parking areas, and the number of the parking users refused according to the requirement And a parking time period Rejecting the parking user allocated for the first time, specifically comprising the following steps: S51, establishing decision variables of parking users aiming at advance reservation Representing a parking request of a parking user reserved in advance at an ith decision point And share berths If a parking request is made Allocated to shared berths Then Otherwise, 0, parking request of parking user reserved in advance And share berths The relation matrix of (2) is ; S52, the platform carries out dynamic decision distribution according to the updated supply matrix and the updated parking user request matrix by taking the comprehensive benefits of the platform and the parking user as targets, wherein the dynamic decision distribution comprises the following specific steps: the comprehensive income formula of the income of the computing platform and the parking cost of the user is as follows: , Wherein: a unit interval reservation fee representing the shared parking space; Representing parking costs per unit time interval; Representing a unit running cost; representing a unit walking cost; represents an average walking speed; Representing the relationship between a parking request and a destination, when matched Otherwise ; Representing the benefits of sharing a parking lot, Indicating the cost of a delay in the road near the parking lot of the parking user, Indicating the walking cost of the parking user, Representing overall revenue; determining overall benefit maximum Corresponding parking request of pre-reserved parking user And share berths Is a relation matrix of (a) And shared berth supply matrix of whole day And update And ; S53, establishing a refusal variable after the initial allocation of advance reservation of the parking user at the ith decision point If advance reservation of parking request Allocating shared berths Failure then Otherwise, 0; S54, the platform is used for shortest time according to the parking time of the refused parking user Maximum time to stop And number of rejected parking users Updating the dynamic decision distribution matrix, and respectively updating the supply matrix and the request matrix after distribution is completed; And S6, dynamically distributing the parking request matrix and the supply matrix of the temporary reservation user in the updated area according to the change of the road network traffic flow by the platform, and updating the parking request matrix and the supply matrix.
2. The regional shared berth rolling horizon allocation method considering potential requirements according to claim 1, wherein S1 comprises the steps of: s11, taking the parking behavior of a parking user in the same period of a working day or a holiday as a rule, and the platform according to the rule, calling all-day parking data with the same history rule, and determining a time point when the parking demand in the day is greater than parking supply , I represents the total decision number, I represents the I-th decision point; S12, extracting the parking time proposed by all parking users in the historical parking data of the same day, and combining the parking users which can be allocated to the same parking space, wherein the number of the combinable users is as follows ; S13, pairing The front parking users can perform 'make before go' type parking allocation, and the number of combined parking can be completed is And sequencing the parking users incapable of performing combined parking in the step S12 according to the parking time, wherein the sequencing cut-off number is , The shortest time of the parking time of the rejected parking users is defined as the parking time of the first parking user in the order The longest time to demarcate a rejected parking user is rank-number The parking time of the parking user is 。
3. The regional shared berth rolling horizon allocation method considering potential requirements according to claim 1, wherein S2 comprises the steps of: The platform receives basic data of shared berths, wherein the basic data comprises a berth sharable period, the belonging relation between the shared berths and a shared parking lot, variables Representing shared berths If sharing berths At the position of An open state in a period of time Otherwise 0, variable Representing shared berths If sharing berths Belonging to parking lots Then Otherwise, 0; Representing sharing of berths at an ith decision point At the position of Open state in time period, shared berth supply matrix of all days is According to the fixed relationship between parking space and parking lot, the relationship matrix between all shared parking space and parking lot is that Wherein ; ; ; P represents the total number of shared poise, T is the total number of time slots, and Z is the total number of shared parks.
4. The regional shared berth rolling horizon allocation method considering potential requirements according to claim 1, wherein S6 comprises the steps of: S61 when When the platform receives the parking request of the temporary reservation parking user If the parking request is reserved temporarily Is to reserve a parking request in advance with a parking time of a car If the parking time of the platform is overlapped, rejecting the parking request; Variable(s) Indicating the state of a parking request of a user temporarily reserving parking at an ith decision point, if a parking request is made at the ith decision point During a time period In the interior, then Otherwise, 0, the parking request state matrix of the temporary reservation parking user in the whole day range is Wherein ; Establishing a parking user decision variable for temporary reservation according to S51 Representing a parking request of a parking user temporarily reserved at an ith decision point And share berths If a parking request is made Allocated to shared berths Then Otherwise, 0, parking request of all-day temporary reserved parking user And share berths The relation matrix of (2) is ; S62 when In this case, the parking request of the parking user who has been allocated and has not started parking is The request variable of the parking user who has been allocated and has not started parking is Representing a parking request at an ith decision point With time period Establishing a matrix of multiple allocated parking user requests Wherein A represents the total number of parking requests which need to be distributed for a plurality of times; S63 of establishing a request matrix for the parking users who have been allocated and have not yet started parking according to S62, Indicating at the ith decision point that a parking request is being made Decision variables assigned at the i-1 decision point, A decision variable representing the allocation at the ith decision point for the parking request at the ith decision point Decision variable matrix assigned at the i-1 decision point Establishing a request for parking Decision variable matrix assigned at the ith decision point ; S64, the platform updates the shared berth supply matrix according to S54 Parking user request matrix Comprehensive advance reservation users and temporary reservation users, and dynamic decision allocation is carried out according to the comprehensive income maximization of platform income and user parking cost as a target; S65, updating shared berth supply matrix of shared parking lot in area 。
5. The regional shared berth rolling horizon allocation method considering potential requirements of claim 4, wherein S64 comprises the steps of: The method comprises the steps that a successful parking user is allocated at an ith decision point, and when the parking time of a parking user is smaller than or equal to a unit time interval at an ith decision point and is equal to or smaller than a unit time interval, a platform informs the parking user of paying parking reservation fees and sharing parking fees, and the platform informs the parking user of a specific parking lot and parking space to finish parking; if the requested parking time of the parking user is greater than the unit time interval, the platform informs the parking user to pay the parking reservation fee and waits for the distribution of the subsequent decision point, specifically: Establishing a parking request matrix for a parking user In the process of meeting Is used for generating decision variable matrix under the condition of (1) At decision point after the end of the allocation And if the requested parking time of the parking user is less than or equal to the unit time interval, the platform informs the parking user that the specific parking lot and parking space are parked, and if the requested parking time of the parking user is not equal to the unit time interval, the platform continues to wait.
6. The regional shared berth rolling horizon allocation method considering potential requirements according to claim 4, wherein S65 comprises the steps of: When (when) When the shared berth supply matrix is updated, the process is as follows: , When (when) When the shared berth supply matrix is updated, the process is as follows: 。

Description

Regional shared berth rolling time domain distribution method considering potential requirements Technical Field The invention relates to the field of shared parking, in particular to a regional shared berth rolling time domain distribution method considering potential requirements. Background With the increase of urban population and the increase of the maintenance quantity of vehicles per person, urban central urban parking has become one of the main problems faced by urban traffic. The adjacent parking areas in the urban area are not communicated with each other in information, and parking is still carried out according to FBFS 'first come first serve' principle, so that the problem of 'parking difficulty' of serious unbalanced supply and demand cannot be solved, a large amount of parking resource waste and environmental pollution are caused, and the parking experience of a parking user is seriously reduced. In order to improve the utilization rate of parking resources in urban central urban areas, a large number of shared parking technologies are started to be used for the staggered parking requirements of the urban central urban areas. Currently, two types of parking methods based on FBFS 'first come first serve' exist in shared parking. A parking user does not need to reserve in advance and automatically searches for an idle parking space, and the method is characterized in that the autonomy of the parking user is strong, but road traffic delay in key areas and confusion on management of the parking user are easily caused. The other is a shared parking mode of online advance reservation by utilizing internet app, because shared parking lot information is not communicated, shared parking positions of each parking lot are limited, a large number of parking demands are difficult to meet, and then the method of filling information first and drawing lots is adopted to distribute the parking positions. Disclosure of Invention Aiming at the defects existing in the prior art, the invention provides a region shared berth rolling time domain distribution method considering potential requirements, a shared parking region capable of carrying out data sharing is constructed by utilizing historical parking data, the dynamic distribution of cross parking lots in the region is realized by early reservation users and temporary reservation users which receive parking according to the mode that comprehensive benefits of road delay and walking distance are highest, and the utilization rate of the shared berth space-time is lower by rejecting a small number of early reservation parking users to obtain potential high-benefit users, so that the utilization rate of overall parking resources in the region is improved, the problem of unbalanced parking supply and demand is relieved, and the integral income of a sharing platform is increased. The regional shared berth rolling time domain distribution method considering potential requirements can effectively combine the parking requirements with the parking supplies through shared parking, reduce the berth construction management input cost and improve the parking platform benefits. The present invention achieves the above technical object by the following means. A region sharing berth rolling time domain distribution method considering potential requirements comprises the following steps: s1, the sharing platform selects the number n and the th of the parking users refused on the same day according to the rule of the historical parking data Parking duration of parking user S2, providing berth data by a shared berth provider; s3, the parking user provides a parking destination d, a starting parking time and a finishing parking time for a platform side, and the platform generates a parking request matrix in the area according to the parking request reserved in advance and the time period; s4, the platform divides the users into the shared parking lots Z m in the area according to the parking request matrix of the parking users and generates the parking supply matrix of the shared parking lots in the area S5, the platform performs primary allocation of shared berths according to the reserved parking requests of the parking users and the division of parking areas, and the number n of the parking users and the parking time length are refused according to the requirementRejecting the parking users allocated for the first time; And S6, dynamically distributing the parking request matrix and the supply matrix of the temporary reservation user in the updated area according to the change of the road network traffic flow by the platform, and updating the parking request matrix and the supply matrix. Further, the step S1 includes the steps of: S11, taking the parking behavior of a parking user in the same period of a working day or a holiday as a rule, and calling all-day parking data with the same history rule by a platform according to the rule, and determining a time point t i when the