CN106023641A - Parking space reservation and allocation method and system based on dynamic optimization - Google Patents

Abstract

The invention discloses a method and system for reservation and allocation of parking spaces based on dynamic optimization. The method includes: S1. Divide the geographical range covered by network reservation and allocation parking services into multiple parking areas, establish a data structure table, load basic data and initialize Time window; S2, open the time window, collect the supply and demand information of parking spaces in each parking area, and judge the supply and demand of parking spaces in each parking area; S3, based on the principle of maximizing the total utilization rate of parking spaces and minimizing the available time fragmentation of parking spaces The principled dynamic optimization method reserves and allocates the parking spaces in each parking area, and obtains the allocation results; S4. Sends the allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively. The invention can improve the utilization rate of parking spaces from multiple angles, reduce the waste of parking space resources, and alleviate the problem of "difficult parking" in cities.

Description

Parking space reservation allocation method and system based on dynamic optimization

technical field

The invention relates to the field of intelligent transportation. More specifically, it relates to a method and system for allocating parking space reservations based on dynamic optimization.

Background technique

At present, the common parking problem in big cities in our country has become a hot issue of social concern. Taking Beijing as an example, by the end of 2014, the number of motor vehicles was 5.5 million, and the number of motor vehicle parking spaces was only 2.8 million. The serious imbalance between supply and demand of parking caused "difficulty in parking" and "disorderly parking". "And other issues, while restricting the normal operation of the urban transportation system, also have a serious impact on the normal life and travel of residents. However, while it is difficult to find parking spaces in certain areas, there are parking spaces in some areas. The peak-staggered distribution of parking demand in time and space will not only cause a waste of parking space resources, but also aggravate urban traffic energy consumption and pollutant emissions.

The key to solving the above problems is how to make rational use of existing parking facilities and improve the utilization rate of parking space resources. With the rapid development of smart terminals and the Internet, more and more Internet companies have launched smart parking services, that is, car owners can query vacant parking spaces through parking software and navigate to parking according to electronic maps, which solves the problem of parking demand information and parking to a certain extent. The problem of asymmetrical parking space supply information has a certain role in alleviating the problem of "difficult parking" in cities. However, the above methods are limited in optimizing the utilization of parking space resources. On the one hand, the above methods only provide parking space information of public parking lots, and cannot improve the utilization rate of private or dedicated parking spaces. On the other hand, the above method is based on the "first come, first served" model, which cannot maximize the utilization rate of parking spaces in this area.

Therefore, it is necessary to provide a parking space reservation allocation method and system based on dynamic optimization, conduct an in-depth analysis of the parking demand of drivers and the supply of parking spaces, and propose a corresponding parking space reservation allocation service model and algorithm, in order to increase urban parking While improving the total supply of parking spaces, it improves the utilization rate of urban parking spaces, optimizes the parking experience of drivers, and alleviates problems such as "difficult parking" and "chaotic parking" in cities.

Contents of the invention

The purpose of the present invention is to provide a method and system for reservation and allocation of parking spaces based on dynamic optimization, collect urban private or special parking spaces and public parking space information and parking demand information, and design different methods for different types of parking needs. To allocate parking spaces, improve the utilization rate of parking spaces, so as to solve the problem of "difficult parking" to a certain extent.

To achieve the above object, the present invention adopts the following technical solutions:

A parking space reservation allocation method based on dynamic optimization, comprising the following steps:

S1. Divide the geographical range covered by the network reservation and allocation parking service into multiple parking areas, establish a data structure table, load basic data and initialize the time window;

S2. Open the time window, collect the supply and demand information of parking spaces in each parking area, and judge the supply and demand of parking spaces in each parking area;

S3. Based on the dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and the principle of minimizing the fragmentation of available time of parking spaces, the parking spaces in each parking area are reserved and allocated, and the allocation results are obtained;

S4. Sending allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively.

Preferably, in step S1, the method of dividing the geographical range covered by the network reservation and allocation parking service into multiple parking areas is: based on the spatial distribution of demand distribution, the parking demand concentration point is the center and the radius is 200-800 meters. The circle divides the area.

Preferably, the data structure table includes parking demand information, parking space supply information, driver credit record information and road network information, wherein the parking demand information is the parking space demander number, parking demand type, vehicle Type, date of parking demand, start and end time of parking demand, location of parking demand and distribution of parking demand; parking space supply information includes parking space number, parking space type, whether the parking space is occupied, location, parking space availability under each time window Utilize the start and end time and the hourly price of the parking space; the driver's credit record information includes the number of times the driver violates the parking contract under each time window.

Preferably, step S2 further includes the following sub-steps:

S2.1, open the time window;

S2.2. Collect the parking space supply information sent by the parking space provider terminal, the real-time parking space occupancy information sent by the parking space intelligent management system, and the parking demand information sent by the parking space demander terminal;

S2.3. Counting the parking demand and supply of each parking area, and judging the supply and demand of each parking area. The supply and demand include oversupply and undersupply.

Preferably, step S3 further includes the following sub-steps:

S3.1. Divide the parking demand into long-term parking demand, short-term parking demand and temporary parking demand;

S3.2. Reservation and allocation of parking spaces in each parking area according to long-term parking demand: first, selectively accept long-term parking demand according to the principle of maximizing the total utilization rate of parking spaces, and then allocate specific long-term parking demand according to the principle of minimum parking space fragmentation time parking space;

S3.3. According to the short-term parking demand, the parking spaces in each parking area are reserved and allocated: first, the short-term parking demand is selectively accepted according to the principle of maximizing the total utilization rate of the parking space, and then according to the parking space fragments before the expected parking time starts in the short-term parking demand Allocate specific parking spaces for short-term parking needs based on the principle of minimizing time;

S3.4. Reservation and allocation of parking spaces in each parking area according to the temporary parking demand: if the supply of the parking area where the temporary parking demand is located exceeds the demand, the temporary parking demand will be accepted, and the terminal of the temporary parking demander will select a vacant and unreserved parking space .

Preferably, the specific process of step S3.2 is:

The terminal of the long-term parking space demander submits the long-term parking demand for a certain parking area in the j-th time window before the j-1th time window;

If the supply and demand of the parking area in the jth time window is greater than the demand, all long-term parking demands will be accepted; if the supply and demand of the parking area in the jth time window is less than the demand, the first j-1 At the boundary point between the first time window and the jth time window, the long-term parking demand is selectively accepted according to the principle of maximizing the total utilization rate of the parking space, and then specific parking spaces are allocated to the long-term parking demand before the start of the jth time window.

Preferably, the specific process of step S3.3 is:

The short-term parking space demander terminal submits a short-term parking request for a certain parking area before the expected parking start time in the short-term parking demand;

Selectively accept short-term parking demands based on the principle of maximizing the total utilization rate of parking spaces, and assign specific parking spaces to accepted short-term parking demands short of the expected parking start time based on the principle of minimizing the fragmentation time of parking spaces;

For the accepted short-term parking demand that is long away from the expected parking start time, specific parking spaces are assigned to the demand according to the principle of minimum fragmentation time of parking spaces before the expected parking time begins.

Preferably, step S3.3 further includes: for the rejected short-term parking demand, it has the priority of allocating parking space resources after the termination of other parking demands in the next parking reservation.

A parking space reservation allocation system based on dynamic optimization, including: a parking space demander terminal, a parking space provider terminal, a parking space allocation dispatch center, and a parking space intelligent management system;

The terminal of the parking space demander sends the parking demand information to the parking space allocation and dispatching center, and receives the allocation result sent by the parking space allocation and dispatching center;

The parking space provider terminal sends parking space supply information to the parking space allocation dispatch center, and receives the allocation result sent by the parking space allocation dispatch center;

The parking space allocation and dispatching center divides the geographical scope covered by the network reservation allocation parking service into multiple parking areas, establishes a data structure table, loads basic data and initializes the time window; opens the time window to collect the supply and demand information of parking spaces in each parking area, And judge the supply and demand of parking spaces in each parking area; based on the dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and the principle of minimizing the fragmentation of available time for parking spaces, the parking spaces in each parking area are reserved and allocated, and the allocation results are obtained, and Send the allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively;

The intelligent parking space management system monitors the parking space status in real time and sends the parking space status to the parking space allocation dispatch center.

Preferably, the parking space provider terminal includes a private parking space lessor terminal and a public parking space administrator terminal.

The beneficial effects of the present invention are as follows:

The technical solution of the present invention aims at different types of parking needs, comprehensively considers the optimal utilization of parking space resources and the system service level and fairness, and designs different algorithms based on the principle of maximizing the total utilization rate of parking spaces and minimizing the fragmentation of available time of parking spaces Carry out optimal allocation of parking space resources. Prioritize the allocation of long-term fixed-contract parking needs such as commuting, and take into account short-term planned parking needs such as business trips. At the same time, it also provides a parking mode for temporary parking with a clear hierarchy. In addition, based on the consideration of fairness, car owners who are rejected in the reserved parking request can have priority in the allocation of parking spaces after other users exit; requirements in order to protect their own parking interests. The invention can improve the utilization rate of parking spaces from multiple angles, reduce the waste of parking space resources, and alleviate the problem of "difficult parking" in cities.

Description of drawings

Below in conjunction with accompanying drawing, specific embodiment of the present invention is described in further detail;

Fig. 1 shows a flow chart of a parking space reservation allocation method based on dynamic optimization.

FIG. 2 shows a flow chart of allocating reserved parking spaces in each parking area based on a dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and minimizing the fragmentation of available time of parking spaces.

Fig. 3 shows a flow chart of allocating reserved parking spaces in each parking area for short-term parking demands.

Fig. 4 shows a flow chart of fairness-based re-reservation in the reserved allocation of parking spaces in each parking area for short-term parking demands.

detailed description

In order to illustrate the present invention more clearly, the present invention will be further described below in conjunction with preferred embodiments and accompanying drawings. Similar parts in the figures are denoted by the same reference numerals. Those skilled in the art should understand that the content specifically described below is illustrative rather than restrictive, and should not limit the protection scope of the present invention.

As shown in Figure 1, the parking space reservation allocation method based on dynamic optimization provided by the present embodiment is characterized in that the method comprises the following steps:

S1. Divide the geographical range covered by the network reservation and distribution parking service into multiple parking areas, establish a data structure table, load basic data and initialize the time window (set the time window number j=0);

S2. Open the time window, collect the supply and demand information of parking spaces in each parking area, and judge the supply and demand of parking spaces in each parking area;

S3. Based on the dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and the principle of minimizing the fragmentation of available time of parking spaces, the parking spaces in each parking area are reserved and allocated, and the allocation results are obtained;

S4. Sending allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively.

in,

Step S1 is an initialization step,

In step S1, the geographical range covered by the network reservation and allocation parking service is divided into multiple parking areas: based on the spatial distribution of demand distribution, the area is divided into a circle with the parking demand concentration point as the center and a radius of 200-800 meters. divided. The most concentrated points of parking demand are places where self-parking is difficult, such as hospitals, large office buildings, and large shopping malls. The radius of 200-800 meters is obtained after considering the limitation of human walking distance. For the circular overlapping area, the overlapping area is attributed to the circle where the nearest parking space demand concentration point is located. For the uncovered area, it is divided according to the division principle of the traffic area combined with the actual situation.

The data structure table contains parking demand information, parking space supply information, driver credit record information and road network information, wherein the parking demand information is the parking space demander number, parking demand type (including long-term, short-term and temporary) under each time window. ), vehicle type (including large, medium and small), parking demand date, parking demand start and end time, parking demand location and parking demand distribution; parking space supply information includes parking space number, parking space type, parking Whether the space is occupied, the area, the start and end time of the parking space availability, and the hourly price of the parking space; the driver's credit record information includes the number of parking violations by the driver under each time window. Road network information aims to provide navigation services for parking space demanders looking for parking spaces.

Step S2 further comprises the following sub-steps:

S2.1, open the time window;

S2.2. Collect the parking space supply information sent by the parking space provider terminal, the real-time parking space occupancy information sent by the parking space intelligent management system, and the parking reservation request information sent by the parking space demander terminal;

S2.3. Counting the parking demand and supply of each parking area, and judging the supply and demand of each parking area. The supply and demand include oversupply and undersupply.

As shown in Figure 2, step S3 further includes the following sub-steps:

S3.1. For different parking needs such as commuting, business trips, temporary travel, etc., the parking needs are divided into long-term parking needs, short-term parking needs and temporary parking needs. For long-term parking needs, the contract parking reservation allocation method is adopted, which is suitable for long-term fixed parking Demand, its allocation priority is the highest, the feedback cycle is long, and parking demand information needs to be provided a long time in advance. When allocating, the parking demand is first selectively accepted according to the principle of maximizing the total utilization rate of parking spaces, and then according to the principle of minimizing the fragmentation time of parking spaces Assign specific parking spaces. For short-term parking demand, the reservation allocation method is adopted. The allocation priority is second, the feedback cycle is short, and the allocation is dynamic. According to the principle of maximum utilization of parking spaces, the parking demand is selectively accepted. Allocate specific parking spaces with minimum space fragmentation time, and the parking demand that is rejected in the reserved parking request has the priority in the allocation of parking space resources after the user exits when the next parking reservation is made. For temporary parking needs, the temporary parking reservation allocation method is adopted, and its allocation priority is the lowest. However, temporary parking demanders can check the supply of parking spaces in real time, choose parking spaces by themselves, and stop immediately. In addition, based on the consideration of response speed, a certain amount of parking space needs to be reserved for short-term parking demand and temporary parking demand, and the duration of reserved parking space should be determined according to the historical parking distribution in the area;

S3.2. Reservation and allocation of parking spaces in each parking area according to long-term parking demand: first, selectively accept long-term parking demand according to the principle of maximizing the total utilization rate of parking spaces, and then allocate specific long-term parking demand according to the principle of minimum parking space fragmentation time parking space;

S3.3. Reservation and allocation of parking spaces in each parking area according to short-term parking demand: first, selectively accept short-term parking demand based on the principle of maximizing the total utilization rate of parking spaces, and then according to parking space fragments before the start of required parking time in short-term parking demand Allocate specific parking spaces for short-term parking needs based on the principle of minimizing time;

S3.4. Reservation and allocation of parking spaces in each parking area according to the temporary parking demand: if the supply of the parking area where the temporary parking demand is located exceeds the demand, the temporary parking demand will be accepted, and the terminal of the temporary parking demander will select a vacant and unreserved parking space , select and stop.

The specific process of step S3.2 is:

The long-term parking space demander terminal submits the long-term parking demand for a certain parking area in the j-th time window before the j-1th time window, and the length of the time window is usually set to 24 hours;

If the supply and demand of the parking area in the jth time window is greater than the demand, all long-term parking demands will be accepted; if the supply and demand of the parking area in the jth time window is less than the demand, the first j-1 At the boundary point between the first time window and the jth time window, the long-term parking demand is selectively accepted according to the principle of the maximum total utilization rate of the parking space, and then the long-term parking demand is allocated to specific parking spaces before the start of the jth time window, so that in this time window Adjust the parking space allocation plan before the time, reduce the fragmentation of the remaining available time, and reserve more complete parking time for short-term needs.

The calculation rules for the total utilization rate of parking spaces are as follows:

Assuming that the total utilization rate of available parking space resources is z, the utilization rate of the i-th parking space is z _i , the available time is T _i , and the utilization time is UT _i , then the calculation of the total utilization rate of the parking space z The formula is:

$\mathrm{<span\; class="notranslate">\; z</span>}<span\; class="notranslate">\; =</span>\frac{\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; m</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; UT</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}{\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; m</span>}}{<span\; class="notranslate">\; \&Sigma;</span>}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}$

Among them, m is the number of parking spaces.

The calculation rules for the available time fragmentation index of the parking area in the principle of minimum fragmentation time of parking spaces are as follows:

The fragmentation of the available time of parking spaces needs to be quantified according to the characteristics of parking demand in a certain period of time in a certain area, specifically: investigate the parking demand in a certain area at different times, and draw the frequency density distribution curve of the parking demand in a certain period of time, from small to large Take the frequency density of the parking demand duration and the part that is the set value δ as the fragmentation time period, the specific value of the set value δ is set by the actual demand, and calculate the fragmentation in the unused time segment of the i-th parking space that is discontinuous If the number of time periods is F _i , then the calculation formula of the time fragmentation index f available for the parking area is:

According to the principle of maximizing the total utilization rate of parking spaces, the long-term parking demand is selectively accepted, and then the long-term parking demand is allocated to specific parking spaces before the start of the jth time window. The maximum total utilization rate z is the objective function to selectively accept long-term parking demand, calculate the available time fragmentation index f of the parking area, and use the minimum available time fragmentation index f as the objective function to optimize the specific allocation of parking spaces.

As shown in Figure 3, the specific process of step S3.3 is:

The short-term parking space demander terminal submits a short-term parking request for a certain parking area before the expected parking start time in the short-term parking demand. Usually, the short-term parking space demander terminal is required to advance at least 1- Submit a short-term parking request for a certain parking area within 5 hours, and the parking space dispatching center will Refresh the parking demand at intervals of minutes, The value of is usually 1-5 minutes;

Selectively accept short-term parking demand based on the principle of maximizing the total utilization rate of parking spaces (that is, calculate the total utilization rate z of parking spaces, and selectively accept short-term parking demands with the maximum total utilization rate z of parking spaces as the objective function), and based on the fragmentation time of parking spaces The principle of minimal allocation of specific parking spaces for accepted short-term parking needs short of the desired parking start time;

For the accepted short-term parking demand that is long away from the expected parking start time, specific parking spaces are assigned to the demand according to the principle of minimum fragmentation time of parking spaces before the expected parking time begins.

As shown in FIG. 4 , step S3.3 also includes: the rejected short-term parking demand has the priority of allocating parking space resources after the termination of other parking demands in the next parking reservation.

The parking space reservation allocation system based on dynamic optimization provided in this embodiment includes: a parking space demander terminal, a parking space provider terminal, a parking space allocation dispatch center, and a parking space intelligent management system;

The terminal of the parking space demander sends parking demand information to the parking space allocation and dispatching center, and receives the allocation result sent by the parking space allocation and dispatching center, and can also perform parking space query and navigation;

The parking space provider terminal sends parking space supply information to the parking space allocation and dispatching center, and receives the allocation results sent by the parking space allocation and dispatching center, and can also perform parking space rental information maintenance, real-time parking space query, income withdrawal, etc.;

The parking space allocation and dispatching center divides the geographical scope covered by the network reservation allocation parking service into multiple parking areas, establishes a data structure table, loads basic data and initializes the time window; opens the time window to collect the supply and demand information of parking spaces in each parking area, And judge the supply and demand of parking spaces in each parking area; based on the dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and the principle of minimizing the fragmentation of available time for parking spaces, the parking spaces in each parking area are reserved and allocated, and the allocation results are obtained, and Send the allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively;

The intelligent parking space management system monitors the parking space status in real time and sends the parking space status to the parking space allocation dispatch center.

The parking space provider terminals include private parking space lessor terminals and public parking space administrator terminals.

The parking space demander terminal and the parking space provider terminal can be smart phones, tablet computers and other devices respectively.

Apparently, the above-mentioned embodiments of the present invention are only examples for clearly illustrating the present invention, and are not intended to limit the implementation of the present invention. Those of ordinary skill in the art can also make It is impossible to exhaustively list all the implementation modes here, and any obvious changes or changes derived from the technical solutions of the present invention are still within the scope of protection of the present invention.

Claims (10)

1. a parking space reservation allocation method based on dynamic optimization, is characterized in that, the method comprises the following steps: S1. Divide the geographical range covered by the network reservation and allocation parking service into multiple parking areas, establish a data structure table, load basic data and initialize the time window; S2. Open the time window, collect the supply and demand information of parking spaces in each parking area, and judge the supply and demand of parking spaces in each parking area; S3. Based on the dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and the principle of minimizing the fragmentation of available time of parking spaces, the parking spaces in each parking area are reserved and allocated, and the allocation results are obtained; S4. Sending allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively. 2. The method according to claim 1, characterized in that, in step S1, the method of dividing the geographical range covered by the network reservation and distribution parking service into a plurality of parking areas is: based on the spatial distribution of demand distribution, the parking demand is concentrated The point is the center and the circle with the radius of 200-800 meters is used for regional division. 3. The method according to claim 1, wherein the data structure table includes parking demand information, parking space supply information, driver credit record information and road network information, wherein the parking demand information is for each time window Parking space demander number, parking demand type, vehicle type, parking demand date, parking demand start and end time, parking demand location and parking demand distribution; parking space supply information includes parking space number, parking space type, Whether the parking space is occupied, the area, the start and end time of the parking space availability, and the hourly price of the parking space; the driver's credit record information includes the number of parking violations by the driver under each time window. 4. The method according to claim 1, wherein step S2 further comprises the following sub-steps: S2.1, open the time window; S2.2. Collect the parking space supply information sent by the parking space provider terminal, the real-time parking space occupancy information sent by the parking space intelligent management system, and the parking demand information sent by the parking space demander terminal; S2.3. Counting the parking demand and supply of each parking area, and judging the supply and demand of each parking area. The supply and demand include oversupply and undersupply. 5. The method according to claim 2, wherein step S3 further comprises the following sub-steps: S3.1. Divide the parking demand into long-term parking demand, short-term parking demand and temporary parking demand; S3.2. Reservation and allocation of parking spaces in each parking area according to long-term parking demand: first, selectively accept long-term parking demand according to the principle of maximizing the total utilization rate of parking spaces, and then allocate specific long-term parking demand according to the principle of minimum parking space fragmentation time parking space; S3.3. According to the short-term parking demand, the parking spaces in each parking area are reserved and allocated: first, the short-term parking demand is selectively accepted according to the principle of maximizing the total utilization rate of the parking space, and then according to the parking space fragments before the expected parking time starts in the short-term parking demand Allocate specific parking spaces for short-term parking needs based on the principle of minimizing time; S3.4. Reservation and allocation of parking spaces in each parking area according to the temporary parking demand: if the supply of the parking area where the temporary parking demand is located exceeds the demand, the temporary parking demand will be accepted, and the terminal of the temporary parking demander will select a vacant and unreserved parking space . 6. The method according to claim 5, characterized in that the specific process of step S3.2 is: The terminal of the long-term parking space demander submits the long-term parking demand for a certain parking area in the j-th time window before the j-1th time window; If the supply and demand of the parking area in the jth time window is greater than the demand, all long-term parking demands will be accepted; if the supply and demand of the parking area in the jth time window is less than the demand, the first j-1 At the boundary point between the first time window and the jth time window, the long-term parking demand is selectively accepted according to the principle of maximizing the total utilization rate of the parking space, and then specific parking spaces are allocated to the long-term parking demand before the start of the jth time window. 7. The method according to claim 5, characterized in that the specific process of step S3.3 is: The short-term parking space demander terminal submits a short-term parking request for a certain parking area before the expected parking start time in the short-term parking demand; Selectively accept short-term parking demands based on the principle of maximizing the total utilization rate of parking spaces, and assign specific parking spaces to accepted short-term parking demands short of the expected parking start time based on the principle of minimizing the fragmentation time of parking spaces; For the accepted short-term parking demand that is long away from the expected parking start time, specific parking spaces are assigned to the demand according to the principle of minimum fragmentation time of parking spaces before the expected parking time begins. 8. The method according to claim 7, characterized in that step S3.3 further comprises: for the rejected short-term parking demand, it has the priority of allocating the parking space resources after the termination of other parking demands in the next parking reservation. 9. A parking space reservation allocation system based on dynamic optimization, characterized in that the system comprises: a parking space demander terminal, a parking space provider terminal, a parking space allocation dispatch center, and a parking space intelligent management system; The terminal of the parking space demander sends the parking demand information to the parking space allocation and dispatching center, and receives the allocation result sent by the parking space allocation and dispatching center; The parking space provider terminal sends parking space supply information to the parking space allocation dispatch center, and receives the allocation result sent by the parking space allocation dispatch center; The parking space allocation and dispatching center divides the geographical scope covered by the network reservation allocation parking service into multiple parking areas, establishes a data structure table, loads basic data and initializes the time window; opens the time window to collect the supply and demand information of parking spaces in each parking area, And judge the supply and demand of parking spaces in each parking area; based on the dynamic optimization method based on the principle of maximizing the total utilization rate of parking spaces and the principle of minimizing the fragmentation of available time for parking spaces, the parking spaces in each parking area are reserved and allocated, and the allocation results are obtained, and Send the allocation results to the parking space demander terminal, the parking space provider terminal and the parking space intelligent management system respectively; The intelligent parking space management system monitors the parking space status in real time and sends the parking space status to the parking space allocation dispatch center. 10. The system according to claim 9, wherein the parking space provider terminal includes a private parking space lessor terminal and a public parking space administrator terminal.