CN112735172B - Parking area shared parking space dynamic reservation and allocation method - Google Patents

Parking area shared parking space dynamic reservation and allocation method Download PDF

Info

Publication number
CN112735172B
CN112735172B CN202011559595.6A CN202011559595A CN112735172B CN 112735172 B CN112735172 B CN 112735172B CN 202011559595 A CN202011559595 A CN 202011559595A CN 112735172 B CN112735172 B CN 112735172B
Authority
CN
China
Prior art keywords
parking
request
parking space
decision
matrix
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
CN202011559595.6A
Other languages
Chinese (zh)
Other versions
CN112735172A (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.)
Changan University
Original Assignee
Changan 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 Changan University filed Critical Changan University
Priority to CN202011559595.6A priority Critical patent/CN112735172B/en
Publication of CN112735172A publication Critical patent/CN112735172A/en
Application granted granted Critical
Publication of CN112735172B publication Critical patent/CN112735172B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
    • G08G1/145—Traffic control systems for road vehicles indicating individual free spaces in parking areas where the indication depends on the parking areas
    • G08G1/148—Management of a network of parking areas
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/02—Reservations, e.g. for tickets, services or events
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07B—TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B15/00—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points
    • G07B15/02—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points taking into account a variable factor such as distance or time, e.g. for passenger transport, parking systems or car rental systems
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
    • G08G1/141—Traffic control systems for road vehicles indicating individual free spaces in parking areas with means giving the indication of available parking spaces

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Finance (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a method for dynamically reserving and distributing shared parking spaces in a parking area. The method comprises the steps that a shared parking platform divides external shared time; a parking stall supplier uploads parking stall basic data to the platform; obtaining the time period that each parking space can share outwards; the parking user inputs a destination d, an acceptable walking distance w and a parking time period to the platform, obtains a parking request and generates a parking request matrix
Figure DDA0002859122550000013
The platform determines a parking area PZ according to the parking requestkAnd generates a parking zone PZkThe parking space supply matrix; the platform provides the matrix, sells the rule, the time delay request matrix that the parking user of the assigned parking stall submits according to the parking stall
Figure DDA0002859122550000011
And parking request matrix
Figure DDA0002859122550000012
And carrying out dynamic decision distribution, and updating the parking space supply matrix after decision distribution. The invention provides a method for dynamically reserving and distributing shared parking spaces in a parking area, aiming at solving the problems of low platform income and low parking space resource utilization rate in the prior art, and the parking space resources and parking requirements are coupled by establishing a shared parking platform.

Description

Parking area shared parking space dynamic reservation and allocation method
Technical Field
The invention relates to the field of intelligent parking, in particular to a shared parking space dynamic reservation and allocation method for a parking area.
Background
The problem of difficult parking at traffic attraction points such as commercial centers and office buildings is more serious due to the continuous increase of the quantity of urban motor vehicles, and due to the fact that information of a plurality of adjacent parking lots near the traffic attraction points is not communicated, parking resources are wasted and vehicles are subjected to position finding and cruising, traffic jam can be caused, and traveling time is increased. This inevitably increases the operating cost of the entire transportation system and causes environmental pollution.
In order to reduce resource waste caused by unordered parking for seeking positions in cities, a shared parking technology is researched in a large quantity. The existing shared parking space reservation and allocation technologies mainly comprise two types, one type is only reserved in a parking lot, and the other type is reserved in parking spaces in the parking lot. For the first type of reserved parking lot, the technology is simple, matching between the reserved parking time interval and the parking space idle time interval is neglected, a parking space lock is not additionally arranged on the parking space, a vehicle can select any parking space to park after entering the parking lot, the parking space idle time interval cannot be fully utilized, and management is messy. For the parking spaces in the second type of reserved parking lot, the technology can be divided into a static mode and a dynamic mode, in the static mode, reserved parking requests are generally collected one day in advance, the parking spaces are uniformly distributed the next day after global parking information is acquired, although the mode can improve the income of a shared parking platform, due to the fact that the randomness of driving and going out is high, the parking requests can also change in real time, and the existing static mode is not in accordance with the reality. In a dynamic mode, through making decisions for many times in one day, collection and distribution of reserved parking requests in a short time are realized, and the mode is more practical, but most researches aim at a single parking lot, the parking rate is fixed, the platform income is lower, and preference selection of parking users is ignored.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a method for dynamically reserving and allocating shared parking spaces in a parking area.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that:
a method for dynamically reserving and allocating shared parking spaces in a parking area comprises the following steps:
s1, dividing external shared time by the shared parking platform;
s2, uploading the parking space basic data to the shared parking platform by the parking space supplier;
s3, obtaining the external sharing time interval of each parking space according to the external sharing time obtained in the step S1 and the basic parking space data uploaded in the step S2;
s4, inputting the destination d, the acceptable walking distance w and the parking time interval to the shared parking platform by the parking user, obtaining the parking request and generating a parking request matrix
Figure BDA0002859122530000021
S5, the shared parking platform determines a parking area PZ according to the parking request matrix generated in the step S4kAnd generates a parking zone PZkThe parking space supply matrix;
s6, the shared parking platform generates a parking space supply matrix, a selling rule and a delay request matrix submitted by the parking users with the allocated parking spaces according to the step S5
Figure BDA0002859122530000022
And parking request matrix
Figure BDA0002859122530000023
And carrying out dynamic decision distribution, and updating the parking space supply matrix after decision distribution.
The invention has the following beneficial effects: the invention establishes the parking area, can realize the dynamic reservation and allocation of parking spaces, not only considers the acceptable walking distance and the delay request from the perspective of users, relieves the problem of difficult parking, but also can realize the full utilization of parking space resources and improves the income of a shared parking platform.
Preferably, step S1 includes the following substeps:
s11, the shared parking platform determines parking overflow time nodes according to the parking demand characteristics of the external shared area
Figure BDA0002859122530000024
Wherein phi is the total number of parking overflow time nodes, and the overflow degree eta is calculated and is the number of non-destination parking divided by the total number of destination parking spaces;
s12, screening 2 time nodes with larger overflow degree eta, and determining the start time and the end time of external sharing by combining the current situation of the region;
s13, dividing the time shared by the outside into a plurality of time intervals, wherein the length of each time interval is t0The total number of time periods is T.
The preferred scheme has the following beneficial effects: the sharable time of each parking space is divided into a plurality of time periods, so that subsequent steps can be calculated conveniently, and when the time periods are sufficiently small, the real-time allocation can be approximated under the real condition.
Preferably, step S2 includes the following substeps:
s21, the stall supplier uploads the stall idle time period to the shared parking platform, and establishes the variable ontTo represent the available state of the parking space, when a parking space n is available in the time period t, it is defined as 0, otherwise it is 1; establishing a parking space supply matrix formed by the platform for the ith decision of the parking space uploaded with the basic data
Figure BDA0002859122530000031
Wherein N is 1, 2.., N; t1, 2,. said, T; i1, 2, wherein I, N represents the total number of parking spaces, and I represents the total decision number;
s22, the stall supplier uploads the stall information to the shared parking platform, and variable is established
Figure BDA0002859122530000032
To represent the relationship between parking space n and parking lot l, when parking space n belongs to parking lot l, defining it as 1, otherwise, it is 0; establishing a relation matrix of parking spaces and parking lots in the ith decision
Figure BDA0002859122530000033
Wherein N is 1,2,. N; 1,2,. and L; i1, 2., I, L denotes the total number of parking lots.
The preferred scheme has the following beneficial effects: the parking space supplier uploads the parking space related information to the platform, and the platform matrixes the parking space information so as to facilitate subsequent steps of calculation processing and parking space allocation.
Preferably, step S3 includes the following substeps:
s31, selecting the rule pair in step S21
Figure BDA0002859122530000034
Optimizing, in particular setting a minimum shareable time period tminThe sliding time window is adopted to traverse each time interval of each parking space, and if the parking space n has no continuous idle time interval exceeding the minimum sharable time interval tminOtherwise, the flag is 0; traversing the mark of each parking space, selecting the parking space marked as 0, and calculating
Figure BDA0002859122530000035
The number and cost of the shared time period, trading with the parking space supplier and renting the parking space, optimized
Figure BDA0002859122530000036
Representing a leased parking space supply matrix;
s32, step S31
Figure BDA0002859122530000037
Performing embedded optimization, specifically, performing similarity matching on the idle time period of each rented parking space and the non-idle time periods of other rented parking spaces in the same parking lot one by one; two parking spaces with the similarity of 1 are used as an adjusted parking space group, a parking space supplier in the adjusted parking space group is informed that the non-idle time period can be adjusted internally, and a parking space with a longer continuous idle time period is generated after compensation and agreement are achieved; after optimization
Figure BDA0002859122530000041
Representing a parking space supply matrix which can be shared externally, according to
Figure BDA0002859122530000042
The time period of sharing outside each parking space can be obtained.
The preferred scheme has the following beneficial effects: the selection rule is adopted to select the information uploaded by the parking stall supplier, the parking stalls meeting the leasing requirement are screened out, the embedded rule is formulated, and the parking stalls with longer continuous idle time periods can be generated by internal-transfer parking stall supply through similarity matching between the non-sharing time periods of the parking stalls and the sharing time periods of other parking stalls.
Preferably, step S4 specifically includes the parking user applying for registration at the platform, the parking user inputting the destination d, the acceptable walking distance w and the parking period at the platform, and establishing the variables
Figure BDA0002859122530000043
Representing the parking request state, if the parking request m contains a time interval t, defining the parking request m as 1, otherwise, defining the parking request m as 0; establishing parking request matrix received by platform in decision (i) th time
Figure BDA0002859122530000044
Wherein M is 1, 2.. times.m; t1, 2,. said, T; i1, 2, I, M denotes the total number of parking requests at decision I.
The preferred scheme has the following beneficial effects: the parking requirement of the user is met through humanization of the user input destination d, the acceptable walking distance w and the parking period.
Preferably, step S5 includes the following substeps:
s51, establishing variable wdlThe walking distance between the destination d and the parking lot l is shown, and the walking distance between each destination and the parking lot is shown as W by the platform databaseDL＝[wdl]Wherein D is 1, 2.·, D; l, D represents the total number of destinations known to the shared parking platform database;
s52, according to the destination d and the acceptable walking distance W of each parking userDLIn the search, when satisfying w>＝wdlThen, l is extracted, and the extracted l is combined to obtain the kth parking zone PZ corresponding to the destination dk；
S53, according to the parking area PZkIn a parking lot l contained in
Figure BDA0002859122530000045
Middle screening out PZ in parking areakThe selected parking space n is used for the parking space n in the step S32
Figure BDA0002859122530000051
Optimized, optimized
Figure BDA0002859122530000052
Indicating parking zone PZkThe parking space supply matrix can be shared by the middle part and the outer part.
The preferred scheme has the following beneficial effects: the parking spaces meeting the requirements can be quickly searched out according to the information input by the user.
Preferably, step S6 includes the following substeps:
s61, amplifying parking zone PZ in step S53 according to selling ruleskParking space supply matrix capable of being shared externally
Figure BDA0002859122530000053
Specifically comprises providing a matrix according to the parking spaces
Figure BDA0002859122530000054
Copying the parking space supply with the virtual ratio alpha, and oversselling the copied virtual parking space to a parking user; for the parking lot with the over-sale parking spaces, corresponding number of emergency parking spaces are additionally arranged;
s62, receiving a delay request submitted by a parking user with an allocated parking space to the platform, judging whether the delay request conflicts with a parking request to be parked after the decision, if so, rejecting the delay request, and otherwise, accepting the delay request; establishing variables
Figure BDA0002859122530000055
Representing the delayed request state, if the delayed request b contains a time interval t, defining the delayed request as 1, otherwise, representing the parking delayed request matrix received by the platform at the decision (i) as 0
Figure BDA0002859122530000056
Wherein B is 1, 2., B; t1, 2,. said, T; i1, 2.., I, where B denotes the total number of requests at the time of the I-th decision delay; establishing decision variables
Figure BDA0002859122530000057
Representing the distribution and fixation of the delay request b, and representing the decision matrix of the initial delay request at the ith decision as
Figure BDA0002859122530000058
Wherein N is 1, 2.., N; b, meeting the delay request B and distributing the delay request B to the corresponding original parking space;
s63, establishing a parking request matrix to be parked
Figure BDA0002859122530000059
Specifically involving establishing variables
Figure BDA00028591225300000510
Where a is the parking request to be parked, indicating that parking request m was reserved successfully at decision i but not yet arrived at the next time period, the parking request matrix to be parked can be expressed as
Figure BDA00028591225300000511
Wherein a is 1, 2., a; t1, 2,. said, T; i1, 2.., I, where a represents the total number of parking requests to park;
s64, establishing decision variables
Figure BDA00028591225300000512
And variables
Figure BDA00028591225300000513
Indicating the original allocation state of the parking request a to be parked,
Figure BDA00028591225300000514
representing the new decision distribution of the parking request a to be parked; establishing
Figure BDA00028591225300000515
Original decision matrix of
Figure BDA0002859122530000061
Wherein N is 1, 2.., N; a is 1, 2.A; i1, 2, 1, I, build
Figure BDA0002859122530000062
New decision matrix of
Figure BDA0002859122530000063
Wherein N is 1, 2.., N; a 1,2, ·, a; i ═ 2.., I;
s65, establishing decision variables
Figure BDA0002859122530000064
Representing the parking space allocation condition, if the parking space n is allocated to the parking request m, defining the parking space n as 1, otherwise, defining the parking space n as 0; expressing the decision matrix at the i-th decision as
Figure BDA0002859122530000065
Wherein N is 1, 2.., N; m ═ 1,2,. said, M; 1,2, ·, I;
s66, calculating a parking zone PZ when the ith decision is distributedkDegree of tension of parking space
Figure BDA0002859122530000066
Degree of tension of parking space
Figure BDA0002859122530000067
And price factor
Figure BDA0002859122530000068
Satisfy the mapping relation
Figure BDA0002859122530000069
Adjusting parking zone PZ at decision time ikActual dynamic subscription fee per unit
Figure BDA00028591225300000610
Wherein C iskA unit basis subscription fee;
s67, the platform requests the matrix according to the time delay
Figure BDA00028591225300000611
Parking zone PZkParking space supply matrix containing over-sale parking spaces and capable of being shared externally
Figure BDA00028591225300000612
And parking request matrix
Figure BDA00028591225300000613
Performing dynamic decision distribution with the goal of maximizing platform income;
s68, updating parking area PZkParking space supply matrix capable of being shared externally
Figure BDA00028591225300000614
The preferred scheme has the following beneficial effects: the selling rule is formulated, and the virtual parking spaces with a certain proportion are sold to parking users in an over-selling mode, so that the problem that the parking spaces are free due to the fact that the virtual parking spaces do not arrive on time or do not arrive after reservation can be solved. The corresponding number of emergency parking spaces are additionally arranged, so that the conflict of the over-sale parking requests is prevented, and the emergency parking spaces can be used as emergency situations.
Preferably, step S67 includes the following substeps:
s671, calculating platform income, wherein the calculation formula is as follows:
Figure BDA00028591225300000615
wherein C issIndicating the parking fee per unit time of each parking space, CrA lease fee per unit time of each slot, a penalty factor for refusing the delay request and the parking request,
Figure BDA0002859122530000071
indicating a reservation fee paid by the parking subscriber,
Figure BDA0002859122530000072
indicating the parking fee paid by the parking user,
Figure BDA0002859122530000073
a lease fee indicating a shared parking space,
Figure BDA0002859122530000074
Figure BDA0002859122530000075
representing the loss caused by refusing the parking request, and selecting the scheme with the largest platform income U;
s672, judging whether the next time period is the starting time of the reserved parking time period or not for the parking request which is successfully distributed in the decision-making of the ith time, if so, paying the reserved fee and informing the parking user of the successful reservation by informing the parking lot and the parking space number where the parking space is located and starting the route induction, otherwise, paying the reserved fee and informing the successful reservation by informing the parking user of the successful reservation, and then, according to the shifting rule, in the parking area PZkIn which the parking request is shifted synchronously to meet the need for delay requests and other parking requests.
The preferred scheme has the following beneficial effects: the dynamic decision distribution is carried out by taking the maximum platform income as a target, the platform income is improved, a method for applying parking delay requests is provided according to the requirements of users, and the delay requirements of parking users are met without replacing parking spaces.
Preferably, the shifting rule in step S672 specifically includes first establishing a parking request matrix to be parked
Figure BDA0002859122530000076
Then establishing a compliance constraint
Figure BDA0002859122530000077
To pair
Figure BDA0002859122530000078
Is again decision-making distributed to
Figure BDA0002859122530000079
And finally, judging whether the next time period is the starting time of the reserved parking time period of the parking request, if so, finishing the shifting, informing a parking user of the parking lot where the parking space is located and the number of the parking space, starting the route guidance, and if not, continuing the shifting.
The preferred scheme has the following beneficial effects: the shift rule is formulated, and the parking request which is successfully reserved but not the starting time of the reserved parking time interval at the next moment is continuously adjusted and optimized, so that more other parking requests can be met, and the utilization rate of the parking space is improved.
Preferably, step S68 includes the following substeps:
s681, after the 1 st decision, updating the parking space supply matrix, wherein the updating mode is as follows:
Figure BDA0002859122530000081
s682, after the ith decision, i is more than or equal to 2, updating the parking space supply matrix in the following updating mode:
Figure BDA0002859122530000082
the preferred scheme has the following beneficial effects: and after the decision is made, the parking space supply matrix is updated in time, so that the conflict of subsequent parking requests is avoided.
Drawings
FIG. 1 is a flow chart of a method for dynamic reservation and allocation of shared parking spaces in a parking area according to the present invention;
fig. 2 is a schematic flow chart of an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, the present invention provides a method for dynamically reserving and allocating a shared parking space in a parking area, which includes the following steps:
s1, dividing external shared time by the shared parking platform;
in the embodiment of the present invention, step S1 includes the following sub-steps:
s11, the shared parking platform determines parking overflow time nodes according to the parking demand characteristics of the external shared area
Figure BDA0002859122530000083
Wherein phi is the total number of parking overflow time nodes, and the overflow degree eta is calculated and is the number of non-destination parking divided by the total number of destination parking spaces;
s12, screening 2 time nodes with larger overflow degree eta, and determining the start time and the end time of external sharing by combining the current situation of the region;
s13, dividing the time shared by the outside into a plurality of time intervals, wherein the length of each time interval is t0The total number of periods is T, and when T is 1, the period is a start period, and when T is T, the period is an end period. The allocation decision point is located at the start time point of each period. When the time period is sufficiently small, it will approximate real-time allocation in real-world situations.
S2, uploading the parking space basic data to the shared parking platform by the parking space supplier;
in the embodiment of the present invention, step S2 includes the following sub-steps:
s21, the stall supplier uploads the stall idle time period to the shared parking platform, and establishes the variable ontTo represent the available state of the parking space, when a parking space n is available in the time period t, it is defined as 0, otherwise it is 1; establishing a parking space supply matrix formed by the platform for the ith decision of the parking space uploaded with the basic data
Figure BDA0002859122530000091
Wherein N is 1, 2.., N; t1, 2,. said, T; i1, 2, wherein I, N represents the total number of parking spaces, and I represents the total decision number;
s22, the stall supplier uploads the stall information to the shared parking platform, and variable is established
Figure BDA0002859122530000092
To represent the relationship between parking space n and parking lot l, when parking space n belongs to parking lot l, defining it as 1, otherwise, it is 0; establishing a relation matrix of parking spaces and parking lots in the ith decision
Figure BDA0002859122530000093
Wherein N is 1, 2.., N; 1,2,. and L; i1, 2., I, L denotes the total number of parking lots.
S3, obtaining the external sharing time interval of each parking space according to the external sharing time obtained in the step S1 and the basic parking space data uploaded in the step S2;
in the embodiment of the present invention, step S3 includes the following sub-steps:
s31, selecting the rule pair in step S21
Figure BDA0002859122530000094
Optimizing, in particular setting a minimum shareable time period tminThe sliding time window is adopted to traverse each time interval of each parking space, and if the parking space n has no continuous idle time interval exceeding the minimum sharable time interval tminOtherwise, the flag is 0; traversing the mark of each parking space, selecting the parking space marked as 0, and calculating
Figure BDA0002859122530000095
The number and cost of the shared time period, trading with the parking space supplier and renting the parking space, optimized
Figure BDA0002859122530000096
Representing a leased parking space supply matrix;
s32, step S31
Figure BDA0002859122530000097
Performing embedded optimization to adjust the idle time periods of the rented parking spaces, specifically, performing similarity matching on the idle time period of each rented parking space and the non-idle time periods of other rented parking spaces of the same parking lot one by one; the similarity matching content comprises the number of continuous time periods, the total length of the time periods, the starting time of each continuous time period and the ending time of the time periods; two parking spaces with the similarity of 1 are used as an adjusted parking space group, a parking space supplier in the adjusted parking space group is informed that the non-idle time period can be adjusted internally, the compensation is carried out, and the product is produced after an agreement is reachedGenerating a parking space with a longer continuous idle time period; after optimization
Figure BDA0002859122530000101
Representing a parking space supply matrix which can be shared externally, according to
Figure BDA0002859122530000102
And obtaining the time period of each parking space which can be shared outwards.
S4, inputting the destination d, the acceptable walking distance w and the parking time interval to the shared parking platform by the parking user, obtaining the parking request and generating a parking request matrix
Figure BDA0002859122530000103
In the embodiment of the present invention, step S4 specifically includes the parking user applying for registration on the platform, the parking user inputting the destination d, the acceptable walking distance w and the parking period on the platform, and establishing the variables
Figure BDA0002859122530000104
Representing the parking request state, if the parking request m contains a time interval t, defining the parking request m as 1, otherwise, defining the parking request m as 0; establishing parking request matrix received by platform in decision (i) th time
Figure BDA0002859122530000105
Wherein M is 1, 2.. times.m; t1, 2,. said, T; i1, 2, I, M denotes the total number of parking requests at decision I.
S5, the shared parking platform determines a parking area PZ according to the parking request matrix obtained in the step S4kAnd generates a parking zone PZkThe parking space supply matrix;
in the embodiment of the present invention, step S5 includes the following sub-steps:
s51, establishing variable wdlThe walking distance between the destination d and the parking lot l is shown, and the walking distance between each destination and the parking lot is shown as W by the platform databaseDL＝[wdl]Wherein D is 1, 2.·, D; l, D represents the total number of destinations known to the shared parking platform database;
s52, according to the destination d and the acceptable walking distance W of each parking userDLIn the search, when satisfying w>＝wdlThen, l is extracted, and the extracted l is combined to obtain the kth parking zone PZ corresponding to the destination dk；
S53, according to the parking area PZkIn a parking lot l contained in
Figure BDA0002859122530000106
Middle screening out PZ in parking areakThe selected parking space n is used for the parking space n in the step S32
Figure BDA0002859122530000107
Optimized, optimized
Figure BDA0002859122530000108
Indicating parking zone PZkThe parking space supply matrix can be shared by the middle part and the outer part.
S6, the shared parking platform generates a parking space supply matrix, a selling rule and a delay request matrix submitted by the parking users with the allocated parking spaces according to the step S5
Figure BDA0002859122530000109
And parking request matrix
Figure BDA00028591225300001010
And carrying out dynamic decision distribution, and updating the parking space supply matrix after decision distribution.
In the embodiment of the present invention, step S6 includes the following sub-steps:
s61, amplifying parking zone PZ in step S53 according to selling ruleskParking space supply matrix capable of being shared externally
Figure BDA0002859122530000111
Specifically comprises providing a matrix according to the parking spaces
Figure BDA0002859122530000112
Copy the parking space with virtual ratio of alphaSupplying, and oversselling the copied virtual parking spaces to parking users; for the parking lot with the over-sale parking spaces, corresponding number of emergency parking spaces are additionally arranged; the step is to relieve the problem that the parking space is free due to untimely arrival or non-arrival after the reservation. Meanwhile, the corresponding number of emergency parking spaces are added in the parking lot with the oversaled parking spaces, the conflict of oversaled parking requests is prevented, the emergency parking spaces can also be used as emergency situations, and the virtual parking spaces participate in the tension degree of the parking spaces
Figure BDA0002859122530000113
And (4) calculating the parking stall lease fees of the emergency parking stalls.
S62, receiving a delay request submitted by a parking user with an allocated parking space to a platform, wherein the delay request is used for solving the problem that the parking user cannot return before the reserved parking time interval end time due to other reasons after parking, the user can submit the delay request before the parking time interval end time, and the delay request is preferentially fixed only in the next decision-making allocation after the delay request is submitted, and then the decision-making allocation is carried out. Judging whether the delay request conflicts with the parking request to be parked after the decision, if so, rejecting the delay request, and otherwise, accepting the delay request; the delay request is collected firstly when the decision is made; establishing variables
Figure BDA0002859122530000114
Representing the delayed request state, if the delayed request b contains a time interval t, defining the delayed request as 1, otherwise, representing the parking delayed request matrix received by the platform at the decision (i) as 0
Figure BDA0002859122530000115
Wherein B is 1, 2., B; t1, 2,. said, T; i1, 2.., I, where B denotes the total number of requests at the time of the I-th decision delay; establishing decision variables
Figure BDA0002859122530000116
The distribution and fixation of the delay request b are shown, and the decision matrix of the initial delay request at the i-th decision can be expressed as
Figure BDA0002859122530000117
Wherein N is 1, 2.., N; b, meeting the delay request B and distributing the delay request B to the corresponding original parking space;
s63, establishing a parking request matrix to be parked
Figure BDA0002859122530000118
Specifically involving establishing variables
Figure BDA0002859122530000119
Where a is the parking request to be parked, indicating that parking request m was reserved successfully at decision i but not yet arrived at the next time period, the parking request matrix to be parked can be expressed as
Figure BDA00028591225300001110
Wherein a is 1, 2., a; t1, 2,. said, T; i1, 2.., I, where a represents the total number of parking requests to park;
s64, establishing decision variables
Figure BDA0002859122530000121
And variables
Figure BDA0002859122530000122
Indicating the original allocation state of the parking request a to be parked,
Figure BDA0002859122530000123
representing the new decision distribution of the parking request a to be parked; establishing
Figure BDA0002859122530000124
Original decision matrix of
Figure BDA0002859122530000125
Wherein N is 1, 2.., N; a 1,2, ·, a; i1, 2, 1, I, build
Figure BDA0002859122530000126
New decision matrix of
Figure BDA0002859122530000127
Wherein N is 1, 2.., N; a 1,2, ·, a; i ═ 2.., I;
s65, establishing decision variables
Figure BDA0002859122530000128
Representing the parking space allocation condition, if the parking space n is allocated to the parking request m, defining the parking space n as 1, otherwise, defining the parking space n as 0; expressing the decision matrix at the i-th decision as
Figure BDA0002859122530000129
Wherein N is 1, 2.., N; m ═ 1,2,. said, M; 1,2, ·, I;
s66, calculating a parking zone PZ when the ith decision is distributedkDegree of tension of parking space
Figure BDA00028591225300001210
Degree of tension of parking space
Figure BDA00028591225300001211
And price factor
Figure BDA00028591225300001212
Satisfy the mapping relation
Figure BDA00028591225300001213
Adjusting parking zone PZ at decision time ikActual dynamic subscription fee per unit
Figure BDA00028591225300001214
Wherein C iskA unit basis subscription fee;
s67, the platform requests the matrix according to the time delay
Figure BDA00028591225300001215
Parking zone PZkParking space supply matrix containing over-sale parking spaces and capable of being shared externally
Figure BDA00028591225300001216
And parking request matrix
Figure BDA00028591225300001217
Performing dynamic decision distribution with the goal of maximizing platform income;
in the embodiment of the present invention, step S67 includes the following sub-steps:
s671, calculating platform income, wherein the calculation formula is as follows:
Figure BDA00028591225300001218
wherein C issIndicating the parking fee per unit time of each parking space, CrA lease fee per unit time of each slot, a penalty factor for refusing the delay request and the parking request,
Figure BDA00028591225300001219
indicating a reservation fee paid by the parking subscriber,
Figure BDA0002859122530000131
indicating the parking fee paid by the parking user,
Figure BDA0002859122530000132
a lease fee indicating a shared parking space,
Figure BDA0002859122530000133
Figure BDA0002859122530000134
indicating a loss due to rejection of the parking request, the conditions to be satisfied at the time of allocation being
Figure BDA0002859122530000135
Figure BDA0002859122530000136
And
Figure BDA0002859122530000137
wherein N is 1, 2.., N; m ═ 1,2,. said, M; t1, 2,. said, T; a is 1,2,..., A. Selecting a scheme with the largest platform income U;
s672, judging whether the next time period is the starting time of the reserved parking time period or not for the parking request which is successfully distributed in the decision-making of the ith time, if so, paying the reserved fee and informing the parking user of the successful reservation by informing the parking lot and the parking space number where the parking space is located and starting the route induction, otherwise, paying the reserved fee and informing the successful reservation by informing the parking user of the successful reservation, and then, according to the shifting rule, in the parking area PZkTo synchronously shift the parking request to meet the requirements of the delay request and other parking requests.
In the embodiment of the present invention, the shift rule in step S672 specifically includes first establishing a parking request matrix to be parked
Figure BDA0002859122530000138
Then establishing a compliance constraint
Figure BDA0002859122530000139
To pair
Figure BDA00028591225300001310
Is again decision-making distributed to
Figure BDA00028591225300001311
And finally, judging whether the next time period is the starting time of the reserved parking time period of the parking request, if so, finishing the shifting, informing a parking user of the parking lot where the parking space is located and the number of the parking space, starting the route guidance, and if not, continuing the shifting.
S68, updating parking area PZkParking space supply matrix capable of being shared externally
Figure BDA00028591225300001312
In the embodiment of the present invention, step S68 includes the following sub-steps:
s681, after the 1 st decision, updating the parking space supply matrix, wherein the updating mode is as follows:
Figure BDA00028591225300001313
s682, after the ith decision, i is more than or equal to 2, updating the parking space supply matrix in the following updating mode:
Figure BDA00028591225300001314
referring to fig. 2, the following describes the technical solution of the present invention with reference to an example:
s11, determining the total number phi of parking overflow time nodes to be 3 by the platform according to the parking demand characteristics of the external shared area, wherein the total number phi of the parking overflow time nodes is
Figure BDA0002859122530000141
8:30AM, 12:30PM and 17:30PM respectively, and the overflow degree eta is 150%, 120% and 140% respectively.
S12, screening the time nodes 8:30AM and 17:30PM with larger overflow degree eta, and determining the start time and the end time of external sharing by combining the current situation of the region.
S13, determining that the sharing time of the shared parking space to the outside is 10 hours from 8:00AM to 6:00PM, and the length of each time period is t0When 2 hours, T1 is the start period (i.e., 8:00AM-10:00AM) and T is the end period (i.e., 4:00PM-6:00 PM).
S21, the parking space supply matrix formed by the platform for the parking space with the uploaded basic data at the 1 st decision time can be represented as
Figure BDA0002859122530000142
S22, where the total number L of parking lots with parking spaces is 4, and the relationship matrix between parking spaces and parking lots at decision 1 can be represented as
Figure BDA0002859122530000143
S31, selecting the parking space by the platform to be not less than the minimum sharable time tmin4 hours. Setting a minimum shareable period tminTraversing each parking space by adopting the sliding time window as the sliding time window of 4 hoursA plurality of time periods. Parking space 7 does not have continuous idle time period exceeding minimum sharable time period tminFor 4 hours, the mark is 1, and the other spaces are 0. Traversing the mark of each parking space, selecting the parking space marked as 0, and calculating
Figure BDA0002859122530000151
The number of shared periods and the fee of (2), trading with the parking space supplier and renting the parking space, for step S21
Figure BDA0002859122530000152
After optimization, at this time
Figure BDA0002859122530000153
Representing the matrix of leased parking space offers,
Figure BDA0002859122530000154
and S32, optimizing and adjusting the idle time periods of the rented parking spaces according to an embedded rule, wherein the embedded rule is used for matching the idle time period of each rented parking space with the non-idle time periods of other rented parking spaces of the parking lot one by one in a similarity manner. The similarity index includes the number of consecutive periods, the total length of the periods, the start time and the end time of each consecutive period. Through calculation, if the similarity between the sharing time interval of the parking space 1 and the non-sharing time interval of the parking space 6 is 1, the two parking spaces are adjustment parking space groups, the parking space suppliers in the adjustment parking space groups are informed that the non-idle time intervals can be adjusted internally, compensation is carried out, and a parking space with a longer continuous idle time interval is generated after an agreement is reached. For step S31
Figure BDA0002859122530000155
After the inline optimization, this time
Figure BDA0002859122530000156
And representing a parking space supply matrix which can be shared externally.
Figure BDA0002859122530000157
S4, parkingThe user submits a parking request, the total number M of parking requests at decision 1 is 3, the parking requests 1 and 2 go to destination 1, and the acceptable walking distance is 500 meters. Parking request 3 is to destination 2 and the acceptable walking distance is 150 meters. The parking request matrix received by the platform at decision 1 may be expressed as
Figure BDA0002859122530000161
S51, the total number D of destinations of 3 parking requests is 2, the walking distance between each destination and the parking lot is known by the platform database, and it can be expressed as
Figure BDA0002859122530000162
S52, according to the destination d and the acceptable walking distance W of each parking user2×4In the search, when satisfying w>＝wdlThen, l is extracted. If l does not exist, the process returns to step S4 to resubmit the acceptable walking distance. Parking zone PZ corresponding to destination 1 for parking requests 1 and 21Including a parking lot 1 and a parking lot 2. Parking zone PZ corresponding to destination 2 for parking request 32Including a parking lot 4.
S53 aiming at parking area PZ1In parking zone PZ1The parking spaces in (1), 2 and 3 are selected, and the parking space pair in step S32 is selected according to the selected parking space pair
Figure BDA0002859122530000163
After the optimization, at this point in time,
Figure BDA0002859122530000164
indicating parking zone PZ1The parking space supply matrix can be shared by the middle part and the outer part.
Figure BDA0002859122530000165
For parking zone PZ2In parking zone PZ2The parking space in step S32 is 6, and the selected parking space pair is used as the parking space
Figure BDA0002859122530000166
After the optimization, at this point in time,
Figure BDA0002859122530000167
indicating parking zone PZ2The parking space supply matrix can be shared by the middle part and the outer part.
Figure BDA0002859122530000168
S61, expanding parking zone PZ in step S53 according to selling rules by the platform1Is/are as follows
Figure BDA0002859122530000169
And parking zone PZ2Is/are as follows
Figure BDA00028591225300001610
When taking up ratio
Figure BDA00028591225300001611
According to
Figure BDA00028591225300001612
Copying virtual parking space 1 to obtain parking space 4 and parking area PZ2The virtual add-on is not copied. The copied virtual parking spaces are over-sold to parking users at the same time, so that the problem that the parking spaces are free due to untimely arrival or non-arrival after reservation is solved. Meanwhile, 1 emergency parking space is additionally arranged in the parking lot 1 with the over-sale parking spaces, so that collision of over-sale parking requests is prevented, and the parking lot can be used as an emergency. At this time, the process of the present invention,
Figure BDA0002859122530000171
indicated in parking zone PZ1The parking space supply matrix comprises virtual parking spaces 4 and can be shared externally.
Since this is the 1 st decision, there is no delay request and no parking request to park before, so steps S62 to S64 are skipped.
S65, platform according to parking area PZ1Is/are as follows
Figure BDA0002859122530000172
Parking zone PZ2Is/are as follows
Figure BDA0002859122530000173
And
Figure BDA0002859122530000174
and performing dynamic allocation. For parking zone PZ1The decision matrix at decision 1 can be expressed as
Figure BDA0002859122530000175
For parking zone PZ2The decision matrix at decision 1 can be expressed as
Figure BDA0002859122530000176
S66, calculating the parking zone PZ when the 1 st decision distribution is carried out1And parking zone PZ2Degree of tension of parking space
Figure BDA0002859122530000177
Degree of tension of parking space
Figure BDA0002859122530000178
And price factor
Figure BDA0002859122530000179
Satisfy mapping relation E1As follows:
Figure BDA00028591225300001710
then the parking zone PZ at decision 11And parking zone PZ2Actual dynamic subscription fee per unit
Figure BDA00028591225300001711
Figure BDA00028591225300001712
S67, for the 1 st decision, the distributed parking request is successful, and the next time interval of the parking requests 2 and 3 is the beginning of the reserved parking time intervalTime, paying the reservation fee and informing the parking user of successful reservation to inform the parking user of the parking lot and the parking space number where the parking space is located and start path induction; and the next time period of the parking request 1 is not the starting time of the reserved parking time period, the reserved fee is paid and the reservation success is informed, and when the following parking request is distributed, the parking area PZ is positioned according to the shifting rule1The parking request is synchronously shifted to meet the requirements of the delay request and the parking request, and when the parking space supply matrix is updated, the parking request for shifting is not updated in the parking space supply. In practice, for a failed parking request assigned at decision 1, the parking user may return to step S4 to increase the acceptable walking distance.
And S68, after the decision is finished, updating the state of the parking space supply matrix. After decision 1, parking zone PZ1After the parking space supply matrix is updated, the parking space supply matrix is
Figure BDA0002859122530000181
Parking zone PZ2After the parking space supply matrix is updated, the parking space supply matrix is
Figure BDA0002859122530000182
Then according to the updated post-parking zone PZ1And PZ2Parking space supply matrix
Figure BDA0002859122530000183
And
Figure BDA0002859122530000184
new parking request
Figure BDA0002859122530000185
And delayed requests
Figure BDA0002859122530000186
And performing decision distribution of a second round, and adjusting the parking spaces for optimization through a shifting rule during decision for the parking requests to be parked, which are successfully reserved.
Since the selling rule is already described at the time of the first decision, step S61 is skipped.
And S62, if the parking user can not return before the preset parking period ending time due to other reasons after parking, submitting the delay request before the parking period ending time, and after submitting, preferentially fixing the delay request only in the next decision-making distribution and then deciding the distribution. If the delay request conflicts with the parking request to be parked after the decision, the delay request is refused, otherwise, the delay request is accepted. The delay request needs to be collected first during each decision, and if the parking request 2 during the 1 st decision submits the delay request, and the total number of the requests B during the 2 nd decision delay is 1, the parking delay request matrix received by the platform during the 2 nd decision can be represented as
Figure BDA0002859122530000187
The decision matrix for the initial latency request at decision 2 may be expressed as
Figure BDA0002859122530000188
And the delayed requests 2 are distributed to the corresponding original parking spaces when the decision is made.
S63, the new parking user submits a parking request, the total number M of parking requests at decision 2 is 2, the parking request 4 goes to the destination 1, and the acceptable walking distance is 500 meters. Parking request 5 is to destination 2 and the acceptable walking distance is 150 meters. The parking request matrix received by the platform at decision 2 may be expressed as
Figure BDA0002859122530000189
The correspondingly screened parking spaces are still in the parking area PZ1And parking zone PZ2In (1).
S64, when the 1 st decision is made, the parking request 1 is reserved successfully but does not arrive in the next time period, and the total number of the parking requests to be parked is 1. The parking request matrix to be parked can be represented as
Figure BDA0002859122530000191
For the
Figure BDA0002859122530000192
The original decision matrix of
Figure BDA0002859122530000193
According to the parking request torque to be parked
Figure BDA0002859122530000194
Figure BDA0002859122530000195
Carry out new shift distribution on the 2 nd decision to obtain
Figure BDA0002859122530000196
And judging whether the time delay request conflicts with the time delay request or not, if so, rejecting the time delay request, and otherwise, accepting the time delay request.
S65, platform according to parking area PZ1Is/are as follows
Figure BDA0002859122530000197
Parking zone PZ2Is/are as follows
Figure BDA0002859122530000198
And
Figure BDA0002859122530000199
and performing dynamic allocation. For parking zone PZ1The decision matrix at decision 2 can be expressed as
Figure BDA00028591225300001910
For parking zone PZ2The decision matrix at decision 2 can be expressed as
Figure BDA00028591225300001911
S66, calculating a parking zone PZ in the decision distribution of the 2 nd time1And parking zone PZ2Degree of tension of parking space
Figure BDA00028591225300001912
Then the 2 nd decision-making parking zone PZ1And parking zone PZ2Actual dynamic subscription fee per unit
Figure BDA00028591225300001913
Figure BDA00028591225300001914
S67, for the parking request successfully distributed in decision 2, if the next time interval of the parking request 4 is the starting time of the reserved parking time interval, paying the reserved fee and informing the parking user of successful reservation, informing the parking user of the parking lot and the parking space number where the parking space is located, and starting path induction; although the next period is not the reserved parking period start time of the parking request 5, the parking zone PZ2No other parking spaces are available for shifting, so that the shifting is finished, the parking lot and the parking space number where the parking spaces are located are informed to a parking user, and the route guidance is started. In decision distribution, the platform income is taken as a target, and the platform income refers to the loss caused by the fact that the parking request is refused to be lost after the parking request is subtracted from the shared parking space subtracted from the parking fee added to the reservation fee paid by the parking user. When C is presents16-membered, CrWhen 4 and α are 2, the platform revenue U generated by the two decisions is 118.55.
S68, after 2 nd decision, parking area PZ1After the parking space supply matrix is updated, the parking space supply matrix is
Figure BDA00028591225300001915
Figure BDA0002859122530000201
Parking zone PZ2After the parking space supply matrix is updated, the parking space supply matrix is
Figure BDA0002859122530000202
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (7)

1. A method for dynamically reserving and allocating shared parking spaces in a parking area is characterized by comprising the following steps:
s1, the shared parking platform divides external shared time and comprises the following steps:
s11, the shared parking platform determines parking overflow time nodes according to the parking demand characteristics of the external shared area
Figure FDA0003346850850000011
Wherein phi is the total number of parking overflow time nodes, and the overflow degree eta is calculated and is the number of non-destination parking divided by the total number of destination parking spaces;
s12, screening 2 time nodes with larger overflow degree eta, and determining the start time and the end time of external sharing by combining the current situation of the region;
s13, dividing the time shared by the outside into a plurality of time intervals, wherein the length of each time interval is t0The total time interval is T;
s2, the parking space supplier uploads the basic parking space data to the shared parking platform, and the method comprises the following steps:
s21, the stall supplier uploads the stall idle time period to the shared parking platform, and establishes the variable ontTo represent the available state of the parking space, when a parking space n is available in the time period t, it is defined as 0, otherwise it is 1; establishing a parking space supply matrix formed by the platform for the ith decision of the parking space uploaded with the basic data
Figure FDA0003346850850000012
Wherein N is 1, 2.., N; t1, 2,. said, T; i1, 2, wherein I, N represents the total number of parking spaces, and I represents the total decision number;
s22, the stall supplier uploads the stall information to the shared parking platform, and variable is established
Figure FDA0003346850850000013
To indicate the relation of parking space n with parking lot l, when parking space n belongs to parking lot lDefined as 1, otherwise 0; establishing a relation matrix of parking spaces and parking lots in the ith decision
Figure FDA0003346850850000014
Wherein N is 1, 2.., N; 1,2,. and L; i1, 2., I, L represents the total number of parking lots;
s3, obtaining the external sharing time interval of each parking space according to the external sharing time obtained in the step S1 and the basic parking space data uploaded in the step S2, and the method comprises the following steps:
s31, providing the parking space supply matrix in the step S21 according to the selection rule
Figure FDA0003346850850000015
Optimizing, in particular setting a minimum shareable time period tminThe sliding time window is adopted to traverse each time interval of each parking space, and if the parking space n has no continuous idle time interval exceeding the minimum sharable time interval tminOtherwise, the flag is 0; traversing the mark of each parking space, selecting the parking space marked as 0, and calculating
Figure FDA0003346850850000021
The number and the cost of the shared time period are traded with the parking space supplier and the parking space is leased, and the optimized parking space supply matrix
Figure FDA0003346850850000022
Representing a leased parking space supply matrix;
s32, step S31
Figure FDA0003346850850000023
Performing embedded optimization, specifically, performing similarity matching on the idle time period of each rented parking space and the non-idle time periods of other rented parking spaces in the same parking lot one by one; two parking spaces with the similarity of 1 are used as an adjusted parking space group, a parking space supplier in the adjusted parking space group is informed that the non-idle time period can be adjusted internally, compensation is carried out, and an agreement is reached to generate a parking spaceParking spaces with longer continuous idle time periods; optimized parking space supply matrix
Figure FDA0003346850850000024
Representing a parking space supply matrix which can be shared externally, according to
Figure FDA0003346850850000025
Obtaining the time period of each parking space which can be shared outwards;
s4, inputting the destination d, the acceptable walking distance w and the parking time interval to the shared parking platform by the parking user, obtaining the parking request and generating a parking request matrix
Figure FDA0003346850850000026
S5, the shared parking platform determines a parking area PZ according to the parking request obtained in the step S4kAnd generates a parking zone PZkThe parking space supply matrix;
s6, the shared parking platform generates the parking space supply matrix, the selling rule and the delay request matrix submitted by the parking users with the allocated parking spaces according to the step S5
Figure FDA0003346850850000027
And parking request matrix
Figure FDA0003346850850000028
And carrying out dynamic decision distribution, and updating the parking space supply matrix after decision distribution.
2. The method according to claim 1, wherein the step S4 specifically includes:
the parking user applies for registration on the platform, inputs a destination d, an acceptable walking distance w and a parking period on the platform, and establishes variables
Figure FDA0003346850850000029
Indicating stopThe vehicle request state, if the parking request m contains the time interval t, the parking request m is defined as 1, otherwise, the parking request m is 0; establishing parking request matrix received by platform in decision (i) th time
Figure FDA00033468508500000210
Wherein M is 1, 2.. times.m; t1, 2,. said, T; i1, 2, I, M denotes the total number of parking requests at decision I.
3. The method according to claim 2, wherein the step S5 comprises the following sub-steps:
s51, establishing variable wdlThe walking distance between the destination d and the parking lot l is shown, and the walking distance between each destination and the parking lot is shown as W by the platform databaseDL＝[wdl]Wherein D is 1, 2.·, D; l, D represents the total number of destinations known to the shared parking platform database;
s52, according to the destination d and the acceptable walking distance W of each parking userDLWhen the search is satisfied, w > -, wdlThen, l is extracted, and the extracted l is combined to obtain the kth parking zone PZ corresponding to the destination dk；
S53, according to the parking area PZkIn a parking lot l contained in
Figure FDA0003346850850000031
Middle screening out PZ in parking areakThe parking space n in step S32 is further paired according to the screened parking space n
Figure FDA0003346850850000032
Optimized, optimized
Figure FDA0003346850850000033
Indicating parking zone PZkThe parking space supply matrix can be shared by the middle part and the outer part.
4. The method as claimed in claim 3, wherein the step S6 comprises the following sub-steps:
s61, expanding the parking zone PZ in the step S53 according to the selling rulekParking space supply matrix capable of being shared externally
Figure FDA0003346850850000034
Specifically comprises providing a matrix according to the parking spaces
Figure FDA0003346850850000035
Copying the parking space supply with the virtual ratio alpha, and oversselling the copied virtual parking space to a parking user; for the parking lot with the over-sale parking spaces, corresponding number of emergency parking spaces are additionally arranged;
s62, receiving a delay request submitted by a parking user with an allocated parking space to the platform, judging whether the delay request conflicts with a parking request to be parked after the decision, if so, rejecting the delay request, and otherwise, accepting the delay request; establishing variables
Figure FDA0003346850850000036
Representing the delayed request state, if the delayed request b contains a time interval t, defining the delayed request as 1, otherwise, representing the parking delayed request matrix received by the platform at the decision (i) as 0
Figure FDA0003346850850000037
Wherein B is 1, 2., B; t1, 2,. said, T; i1, 2.., I, where B denotes the total number of requests at the time of the I-th decision delay; establishing decision variables
Figure FDA0003346850850000038
Representing the distribution and fixation of the delay request b, and representing the decision matrix of the initial delay request at the ith decision as
Figure FDA0003346850850000041
Wherein n is 1, 2.,n; b, meeting the delay request B and distributing the delay request B to the corresponding original parking space;
s63, establishing a parking request matrix to be parked
Figure FDA0003346850850000042
Specifically involving establishing variables
Figure FDA0003346850850000043
Where a is the parking request to be parked, indicating that parking request m was reserved successfully at decision i but not yet arrived at the next time period, the parking request matrix to be parked can be expressed as
Figure FDA0003346850850000044
Wherein a is 1, 2., a; t1, 2,. said, T; i1, 2.., I, where a represents the total number of parking requests to park;
s64, establishing decision variables
Figure FDA0003346850850000045
And variables
Figure FDA0003346850850000046
Indicating the original allocation state of the parking request a to be parked,
Figure FDA0003346850850000047
representing the new decision distribution of the parking request a to be parked; establishing
Figure FDA0003346850850000048
Original decision matrix of
Figure FDA0003346850850000049
Wherein N is 1, 2.., N; a 1,2, ·, a; i1, 2, 1, I, build
Figure FDA00033468508500000410
New decision matrix of
Figure FDA00033468508500000411
Wherein N is 1, 2.., N; a 1,2, ·, a; i ═ 2.., I;
s65, establishing decision variables
Figure FDA00033468508500000412
Representing the parking space allocation condition, if the parking space n is allocated to the parking request m, defining the parking space n as 1, otherwise, defining the parking space n as 0; expressing the decision matrix at the i-th decision as
Figure FDA00033468508500000413
Wherein N is 1, 2.., N; m ═ 1,2,. said, M; 1,2, ·, I;
s66, calculating a parking zone PZ when the ith decision is distributedkDegree of tension of parking space
Figure FDA00033468508500000414
Degree of tension of parking space
Figure FDA00033468508500000415
And price factor
Figure FDA00033468508500000416
Satisfy mapping relation E1：
Figure FDA00033468508500000417
Adjusting parking zone PZ at decision time ikActual dynamic subscription fee per unit
Figure FDA00033468508500000418
Wherein C iskA unit basis subscription fee;
s67, the platform requests the matrix according to the time delay
Figure FDA00033468508500000419
Parking zone PZkParking space supply matrix containing over-sale parking spaces and capable of being shared externally
Figure FDA00033468508500000420
And parking request matrix
Figure FDA00033468508500000421
Performing dynamic decision distribution with the goal of maximizing platform income;
s68, updating parking area PZkParking space supply matrix capable of being shared externally
Figure FDA00033468508500000422
5. The method according to claim 4, wherein the step S67 comprises the following steps:
s671, calculating platform income, wherein the calculation formula is as follows:
Figure FDA0003346850850000051
wherein C issIndicating the parking fee per unit time of each parking space, CrA lease fee per unit time of each slot, a penalty factor for refusing the delay request and the parking request,
Figure FDA0003346850850000052
indicating a reservation fee paid by the parking subscriber,
Figure FDA0003346850850000053
indicating the parking fee paid by the parking user,
Figure FDA0003346850850000054
a lease fee indicating a shared parking space,
Figure FDA0003346850850000055
Figure FDA0003346850850000056
representing the loss caused by refusing the parking request, and selecting the scheme with the largest platform income U;
s672, judging whether the next time period is the starting time of the reserved parking time period or not for the parking request which is successfully distributed in the decision-making of the ith time, if so, paying the reserved fee and informing the parking user of the successful reservation by informing the parking lot and the parking space number where the parking space is located and starting the route induction, otherwise, paying the reserved fee and informing the successful reservation by informing the parking user of the successful reservation, and then, according to the shifting rule, in the parking area PZkIn which the parking request is shifted synchronously to meet the need for delay requests and other parking requests.
6. The method as claimed in claim 5, wherein the step S672 of shifting rules comprises first establishing a parking request matrix to be parked
Figure FDA0003346850850000057
Then establishing a compliance constraint
Figure FDA0003346850850000058
To pair
Figure FDA0003346850850000059
Is again decision-making distributed to
Figure FDA00033468508500000510
And finally, judging whether the next time period is the starting time of the reserved parking time period of the parking request, if so, finishing the shifting, informing a parking user of the parking lot where the parking space is located and the number of the parking space, starting the route guidance, and if not, continuing the shifting.
7. The method as claimed in claim 6, wherein the step S68 comprises the following steps:
s681, after the 1 st decision, updating the parking space supply matrix, wherein the updating mode is as follows:
Figure FDA0003346850850000061
s682, after the ith decision, i is more than or equal to 2, updating the parking space supply matrix in the following updating mode:
Figure FDA0003346850850000062
CN202011559595.6A 2020-12-25 2020-12-25 Parking area shared parking space dynamic reservation and allocation method Active CN112735172B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011559595.6A CN112735172B (en) 2020-12-25 2020-12-25 Parking area shared parking space dynamic reservation and allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011559595.6A CN112735172B (en) 2020-12-25 2020-12-25 Parking area shared parking space dynamic reservation and allocation method

Publications (2)

Publication Number Publication Date
CN112735172A CN112735172A (en) 2021-04-30
CN112735172B true CN112735172B (en) 2021-12-28

Family

ID=75615992

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011559595.6A Active CN112735172B (en) 2020-12-25 2020-12-25 Parking area shared parking space dynamic reservation and allocation method

Country Status (1)

Country Link
CN (1) CN112735172B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114582158A (en) * 2022-01-21 2022-06-03 合肥巍华智能停车设备有限公司 Parking stall reservation service system based on multilayer circulation type garage parking
CN116052462A (en) * 2022-11-18 2023-05-02 电子科技大学长三角研究院(湖州) Shared parking space matching method, system, medium, equipment and terminal

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109785663A (en) * 2019-02-28 2019-05-21 温州美旅网络技术服务有限公司 A kind of curb parking management system
CN110070746A (en) * 2019-04-11 2019-07-30 华为技术有限公司 Parking stall Sharing Management method, apparatus and system
CN111292552A (en) * 2018-12-07 2020-06-16 广州方硅信息技术有限公司 Parking space reservation system based on mobile terminal
CN111653119A (en) * 2020-04-30 2020-09-11 南京理工大学 Shared parking space distribution system and method adapting to delay requirement
CN111932932A (en) * 2020-07-27 2020-11-13 苏州中科先进技术研究院有限公司 Method, system, terminal and storage medium for renting shared parking spaces
CN111967627A (en) * 2020-07-23 2020-11-20 同济大学 Shared parking space reservation and distribution system and method
CN111985835A (en) * 2020-08-31 2020-11-24 盐城工学院 Distribution method for shared parking berths in residential area

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107845288B (en) * 2017-11-27 2020-06-23 东南大学 Space-time capacity-based multi-type land-based parking berth allocation shared resource matching method
US20190228345A1 (en) * 2018-01-19 2019-07-25 General Motors Llc Vehicle sharing system and method
CN108898830B (en) * 2018-06-11 2020-11-03 同济大学 Parking space balancing method for calculating space-time sharing matching degree of combined parking lot
US11200807B2 (en) * 2018-09-24 2021-12-14 Here Global B.V. Method and apparatus for detecting an availability of a vehicle based on parking search behaviors

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111292552A (en) * 2018-12-07 2020-06-16 广州方硅信息技术有限公司 Parking space reservation system based on mobile terminal
CN109785663A (en) * 2019-02-28 2019-05-21 温州美旅网络技术服务有限公司 A kind of curb parking management system
CN110070746A (en) * 2019-04-11 2019-07-30 华为技术有限公司 Parking stall Sharing Management method, apparatus and system
CN111653119A (en) * 2020-04-30 2020-09-11 南京理工大学 Shared parking space distribution system and method adapting to delay requirement
CN111967627A (en) * 2020-07-23 2020-11-20 同济大学 Shared parking space reservation and distribution system and method
CN111932932A (en) * 2020-07-27 2020-11-13 苏州中科先进技术研究院有限公司 Method, system, terminal and storage medium for renting shared parking spaces
CN111985835A (en) * 2020-08-31 2020-11-24 盐城工学院 Distribution method for shared parking berths in residential area

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
城市中心区典型商场配建停车泊位共享时间窗口研究;刘志广;《中国优秀硕士学位论文全文数据库 (工程科技Ⅱ辑)》;20170315;正文第30-37页 3.3节 *

Also Published As

Publication number Publication date
CN112735172A (en) 2021-04-30

Similar Documents

Publication Publication Date Title
CN112735172B (en) Parking area shared parking space dynamic reservation and allocation method
CN109471444B (en) Parking AGV path planning method based on improved Dijkstra algorithm
CN111967627B (en) Shared parking space reservation and distribution system and method
CN111985835A (en) Distribution method for shared parking berths in residential area
CN110515380B (en) Shortest path planning method based on turning weight constraint
CN108416513B (en) Public bicycle dynamic scheduling method based on mixed heuristic algorithm
CN113870602B (en) Method and system for dispatching multiple AGV parking
CN110111601B (en) Regional parking space dynamic allocation method based on two-stage selection
CN109657820B (en) Taxi matching method capable of making reservation
Xu et al. On the supply curve of ride-hailing systems
Nakazato et al. Parking lot allocation using rematching and dynamic parking fee design
CN110070751A (en) Automatic propelling device and method are shared in parking stall sharing distribution management system, parking stall
CN115423168A (en) Customized public transport network optimization method and system considering service stability
CN114519933B (en) Method, device and storage medium for contract travel management and control based on non-oversaturation state
Boysen et al. Optimizing carpool formation along high-occupancy vehicle lanes
CN115345702A (en) Residential area private shared parking matching method and system considering user characteristics
CN111882092A (en) Taxi vehicle searching method suitable for shared trip
CN115440059A (en) Wisdom parking stall management system based on thing networking
Iyer et al. Smart resource handling module for parking
CN112270480A (en) Automatic taxi driving scheduling method and system
CN116524705A (en) Inter-city travel vehicle dispatching method and terminal
CN111738490A (en) Flexible bus line resource multiplexing distribution scheduling method
Mejri et al. An efficient cooperative parking slot assignment solution
CN115186969A (en) Multi-guide particle swarm multi-target carpooling problem solving optimization method with variable neighborhood search
CN110334723B (en) Dynamically-increased baggage picking and delivering order scheduling method

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