 Original Paper
 Open Access
 Published:
Parking equilibrium along the street
European Transport Research Review volume 8, Article number: 24 (2016)
Abstract
Purpose
The paper studies the progressive occupancy of parking capacity along the street by candidate users, under the user equilibrium paradigm. The situation depicted typically applies to a parking peak period.
Methods
In our model, the parking supply is made up of capacitated lots situated along a spatial axis, while the demand is disaggregated continuously in both destination place and preferred time of arrival. Each user selects a parking lot and time from among options on the basis of their tradeoffs between walking, driving, parking price and schedule delay. Efficient algorithms are developed and an application instance is dealt with in detail.
Results
The dynamical equilibrium pattern exhibits parking lots “efficiency regions” in the plane of destination places and preferred arrival times. These efficiency regions are dynamic market areas with strong yet simple structural characteristics, making it easy to assign each parking user to his preferred option and to derive the lot saturation times. The latter are identified as the key state variables for the parking system, since they induce the lot efficiency regions. The equilibrium state is characterized as the solution to a fixedpoint problem with respect to the saturation times.
Conclusion
Our model improves upon previous parking models in economic theory, by adopting a higher resolution in space and time on both supply and demand side. The higher resolution is enabled by focusing on the street level, thus restricting the outreach of the model. Further research may be directed to extend the model to a network of streets, on the side of traffic assignment, and to study parking management policies, on the side of parking economics.
Introduction
Context
Making a trip by means of an individual vehicle—say a private car—requires a parking space at the trip’s end or near it. Every car user that also holds a garage inside or near their houses has the opportunity to use it whenever he needs it. The rest of car users rely on public parking either on street or off street. However, as public parking is available to anybody, it may be occupied—hence unavailable—at the instant of user arrival. A parking user can adapt to the saturation of a parking lot either (i) by diverting to another lot that is still available—probably at the expense of more walking, driving or higher tariffs, (ii) by scheduling the time of his trip in order to park his car before the lot gets saturated—at the expense of schedule delay at his destination, or (iii) by some tradeoff between diversion in space and trip scheduling. User costs resulting from parking congestion impede car trips making the management of parking supply an important lever in urban transportation policies.
Problem statement
The filling up of parking capacity (indeed a storage capacity) is a physical phenomenon, as is the diversion from one parking lot to another. In an urban area on a typical working day, parking demand has a temporal profile that can be taken as an exogenous physical condition. Under these physical conditions, is there a state equation to describe the joint evolution of parking supply and demand? Such an equation would be a partial differential equation since the phenomenon extends in both time and space. It could be used to simulate the traffic effects of parking plans and to aid decisionmaking in urban mobility planning.
Literature review
There are two related scientific streams that deal with the interplay of parking supply and demand: network simulation models vs. theoretical economic models.
A network simulation model involves both a supply representation in terms of lots that are situated, capacitated and priced, and a demand representation in terms of a population of users with individual behavior for the selection of a parking lot and maybe also of a parking time if the setting is dynamic. In such a model, the “physical behavior” of the lots and the economic behaviors of the users are put together on a onetomany basis, i.e. each constituent interplays with other ones but there is no local state equation.
Previous work in this stream includes macroscopic traffic models of route choice and parking lot choice under user equilibrium. Huang et al [9] and Li et al [12] modelled a multimodal network with capacity constraints on both road segments and parking facilities under user equilibrium: the system state is characterized by a set of equations, one by system constituent (or by relation between a choice option and a user). Related but timeextended formulations have been developed later on to model system dynamics by Lam et al [10], Li et al [13] and Li et al [14].
A quasidynamic model by Gallo et al [7] addresses parking choice and cruising by distinguishing three trip phases of, first, main car path, second, cruising part and, third, pedestrian access; each phase is dealt with in a dedicated network layer. Parking search loops have been modelled in a static, traffic equilibrium of route choice and parking choice by Leurent and Boujnah [11]: lot diversion is dealt with explicitly and each lot has a status either saturated or available, yet with no timing of the saturation events.
Microscopic, multiagent traffic models have also been developed to study the search of a parking space in an area where some lots are saturated: the Parkagent model of Benenson et al [5] and Martens et al [15], the Sustapark model of Dieussaert et al [6] and the Matsimbased parking model of Horni et al [8] and Waraich and Axhausen [19]. All of these involve a two stage process of individual behaviour, first for main access to search starting point then for effective search; each stage has its own set of specific rules. But the agent paradigm belongs to the onetomany kind of interplay between supply and demand and provides no insight into a local state equation.
The other scientific stream pertains to the economic theory of parking. Models simplified in space and time have been elaborated to capture the interplay of supply and demand. Anderson and De Palma [1] modeled a corridor giving access to a city centre with parking capacity uniformly distributed along it and that is filled up progressively, starting from the centre: all of the users are destined to the centre only and park at the closest available position, yielding a state equation that is both simple and restricted to this particular situation. Arnott and Inci [4] put forward a pseudodynamic model of parking choice, more precisely of delay time to get a space under saturated lots and in stationary regime: their conditions are homogenous in space as in time and their state equation does not address diversion in space nor dynamic changes. Qian et al. [17]) studied a traffic bottleneck giving access to two parking lots more or less close to one downtown destination, during the morning peak; his state equation pertains to the bottleneck rather than to the parking lots and their filling up. This dynamic user equilibrium is further linked to the parking market determining parking fees, locations and capacities. Effects of public regulation on reaching the System Optimal (SO) are the main concern of this paper.
In a spatial configuration of a uniformly and continuously distributed parking supply along an access route between a residential origin and the CBD as a single destination, Zhang et al [20] extend the model developed by Arnott et al [2], dealing with the effects of parking fees and road tolling policies on the morning peak, to study coupled dynamics of morning and evening commutes linked through the parking location choice. Bottleneck dynamics rather than parking saturation is, again, of main concern.
Qian et al [18] study, in a quasistatic framework, discrete parking lots treated as links between origin and destination nodes with exogenous timedependent demand. Timevarying parking fee, constant during each discrete time period, and parking search time related to lot saturation, stem the generalized cost of parking at a given lot, driving temporal distribution of demand among available lots in a context of perfect information.
Literature review of the two main scientific streams which the present work refers to allows us to position the present work in the following manner.
Network simulation models, although allowing for an explicit treatment of a detailed spatial configuration of parking supply as well as cruising for parking, do not lead to local state equations, requiring a onetomany treatment of supply/demand interaction. Parking model presented in this paper elicits a key state variable: instant of parking lot saturation, linking supply and demand. This enables to reduce the onetomany complexity to the search of a finite vector, governing supply and demand interaction.
Parking models in the economic theory of parking stream are mainly analytical models of the supply and demand interaction, described through state equations. These models allow for the study of parking policies and their socioeconomic impacts. This analytical treatment is permitted by a spatial simplification of the parking supply. The model presented in the present paper, seeks to increase the spatial resolution of the parking supply and the disaggregation both spatial and temporal of the parking demand, but still preserving a reasonable level of complexity allowing for the treatment of strategic decisions, such as parking policies, at the local level.
Paper objective
This paper brings about a model of parking supply and demand. Parking supply is broken down into local lots situated along an axis, each one with given capacity and tariff. Regarding parking demand, it is made up of a population of users disaggregated by destination place along the spatial axis and by preferred time of arrival, according to a continuous joint statistical distribution. Every user behaves as a selfish individual decisionmaker to select a parking lot and a parking time, on the basis of a disutility function with respect to walking distance, invehicle distance, schedule delay and parking price. A single disutility function is taken for all users. The model further assumes perfect knowledge and therefore no cruising on behalf on the users.
This setting has medium complexity compared to the simplistic description in an economic model and the realistic one in a network simulation model. It enables us to derive the salient features of the parking lots subjected to the users’ arrivals, in the analytical form of wave propagation in the spacetime plane. The waves delineate the frontiers between the respective attractive basins of the lots – in other words, their market areas. Thus our model blends up the kinematic theory of traffic waves à la LighthillWhithamRoberts, together with the economic theory of market areas à la Alfred Weber (cf. [16]).
Method and outcome
Key to our analysis are the lot saturation times, since each user must adapt his parking time to the period of availability. Assuming a peak parking period where no user leaves the parking lots, parking capacity is only filled up and does not become available again during the period under study. Based on the vector of lot saturation times, we derive the efficiency regions (i.e. the market areas) of the lots in a bidimensional plane of destination position and preferred time of arrival – which is an intentional time, distinct from the physical time of parking. Knowing the efficiency regions, it is then easy to derive the user flows directed to each lot and to determine the saturation times. These make up the crucial variables in the interplay of supply and demand.
It is shown that the problem of deterministic, dynamic user equilibrium of parking traffic amounts to a fixed point problem with respect to the lot saturation times. Although the associated function lacks continuity at some points, it is demonstrated that an equilibrium must exist provided that the parking capacity suffices to accommodate the demand volumes. An eventbased algorithm is provided to determine the efficiency regions at a reduced computational cost. Several computation schemes are put forward to solve the fixed point problem and to get an equilibrium state.
Paper outline
The rest of the paper is organized in seven parts. After introducing the body of assumptions (Section 2), we address the uncongested case to reveal the interval structure of the efficiency domains of the lots under stationary conditions (Section 3). We then turn to dynamic analysis in two stages, by dealing first with a single parking lot that provides timed options to a given user depending on his target endpoint and preferred instant of arrival (Section 4), second with the temporal structure of the efficiency regions of the lots (Section 5). Following that, parking equilibrium is stated and cast into a fixedpoint problem with respect to the saturation times of the parking lots; the existence of an equilibrium is demonstrated and computation schemes are put forward (Section 6). After dealing with an instance (Section 7), we conclude and point to a range of issues for further research (Section 8). The Appendix provides the algorithms to determine the set of efficiency regions, together with some mathematical details.
 ℵ = [t _{min}, t _{max}]:

Period under study, encompassing all arrivals at destination such that no parking occurs outside this period
 α/ β :

Marginal value of a unit car time / Marginal value of a unit walk time
 γ/ γ ^{+} :

Marginal value of a unit time of earliness/lateness
 D :

Schedule cost
 E _{ ij } / E _{ i } / E _{ I } :

Domain in the \( \left(\tilde{x},\tilde{t}\right) \) plane where lot i dominates lot j / Efficiency domain of the option i where it dominates all other options / Set of efficiency domains for the lots i ∈ I
 G _{ s }(i, t):

Generalized cost of the parking option (i, t) to a user in the segment \( s=\left(\tilde{x},\tilde{t}\right) \)
 \( {g}_i\left(\tilde{x},\tilde{t}\right) \) :

Optimal cost of parking at the lot i to a user in the segment \( s=\left(\tilde{x},\tilde{t}\right) \) at the optimal parking time \( {t}_i^{\ast}\left(\tilde{x},\tilde{t}\right) \)
 \( H\left(\tilde{x},\tilde{t}\right) \)/ \( h\left(\tilde{x},\tilde{t}\right) \) :

Joint cumulative distribution function of \( \tilde{x} \) and \( \tilde{t} \) in the population of users / Joint probability density function associated to \( H\left(\tilde{x},\tilde{t}\right) \)
 I :

Set of parking lots numbered i ∈ I
 k _{ i }/ m _{ i } :

Capacity of the parking lot i / Tariff of the parking lot i
 L :

Street length
 Q :

Total number of users
 \( \tilde{q}\left(\tilde{t}\right) \)/ \( {\tilde{q}}_i\left(\tilde{t}\right) \) :

Flow rate of users at preferred arrival time \( \tilde{t} \)/ Flow rate of users at preferred arrival time \( \tilde{t} \) parking at the lot i
 q _{ i }(t)/ Q _{ i }(t):

Flow rate of users arriving at the lot i at time t / Cumulated flow of arrivals in the lot i up to time t
 s :

Demand segment given by \( s=\left(\tilde{x},\tilde{t}\right) \)
 t/ \( {t}_i^{\ast}\left(\tilde{x},\tilde{t}\right) \) :

Parking time / optimal parking time at the lot i for a user in the segment \( s=\left(\tilde{x},\tilde{t}\right) \)
 \( {\overline{t}}_i \) / \( {\overline{\mathbf{t}}}_I \) :

Lot i saturation time, when cumulated parking flow reaches lot capacity / Vector of lot saturation times
 \( \tilde{t} \) / t ':

Preferred time of arrival / Effective instant of arrival at destination endpoint
 \( {t}_i^{\#}\left(\tilde{x}\right) \) :

Instant on the \( \tilde{t} \) axis when the saturation wave will reach \( \tilde{x} \). Equivalently arrival time at destination when parking in a saturated parking lot
 v / w :

Average car speed / Average walking speed
 V _{ i }/ W _{ i } :

Cost of invehicle parking access / Cost of pedestrian access from parking lot to destination endpoint
 x / x _{ i } :

Curvilinear abscissa on the street / Position of the parking lot i on the street
 \( \tilde{x} \) :

Destination location
 \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \)/ \( {\widehat{x}}_{ij}^0 \) :

Boundary function between domains where i/j dominates j/i / Initial constant boundary in the unsaturated configuration
 \( {x}_i^{}\left(\tilde{t}\right) \)/ \( {x}_i^{+}\left(\tilde{t}\right) \) :

Lower/upper boundary of the efficiency domain E _{ i } of the lot i, function of \( \tilde{t} \)
Model assumptions
The model assumptions pertain to either the parking supply or the parking demand. The spatial dimension is described by a curvilinear abscissa along the street, denoted x, which ranges from minimum value 0 to maximum value L. As for the temporal dimension, the continuous distribution of instants, denoted t, is considered during a period under study, ℵ = [t _{min}, t _{max}] encompassing the period of preferred arrival at destination such that no parking occurs outside this period.
Supply side
On the supply side, we consider onstreet or offstreet parking spaces that are accessible from the street to every user. Parking spaces with similar position and same tariff conditions are grouped into a parking lot, say i, of which the main characteristics are its position x _{ i }, capacity k _{ i } and tariff, m _{ i }.
Thus, by grouping onstreet lots similar in position and sharing the same tariff and management conditions into a highercapacity lot, positioned at the mean location along the street, onstreet supply can be described. The criterion for grouping lots according to their position should be based on the walking cost. Onstreet parking supply on very long streets should therefore be discretized into shorter sections of a few minutes of walking time.
The description of an offstreet parking lot is also simplified since its internal geometry and access conditions from the street are neglected. So are the cost of search for an available space inside the lot and the pedestrian access from lot to street: however some related user cost can be included in the lot tariff, which is taken independent from the duration of parking. This additional search cost could be made dynamic, depending on the information provided, parking saturation level and spatial arrangement of the parking lot.
The parking capacity is the residual capacity that stems from the total capacity minus the number of spaces occupied at the beginning of the period and not vacated during it.
Due to the users’ arrivals during the period under study, the parking lot will progressively fill up until its capacity is reached at some time, denoted \( {\overline{t}}_i \) and called its saturation time. A default setting of t _{max} is associated to a lot that does not get saturated. Thus, parking in lot i occurs at the latest at time t _{max}.
On the one hand, higher capacity lots, rather than individualized parking spaces, are made compatible with the macroscopic description of the parking flows, discussed below. On the other hand, discretizing parking supply into a finite number of lots is necessary to reduce the complexity of the supply/demand interaction, through state variables—instants of saturation. Both of these conditions are core to the present model allowing a detailed spatial description of the parking supply and statistic spatiotemporal description of parking demand, while preserving analytical tractability of the problem.
Demand side
On the demand side, the parking users are disaggregated according to destination point, denoted \( \tilde{x}\in \left[0,L\right] \), and preferred instant of arrival, denoted \( \tilde{t}\in \aleph \). Both \( \tilde{x} \) and \( \tilde{t} \) are continuous variables. Their joint cumulative distribution function in the population of users is denoted \( H\left(\tilde{x},\tilde{t}\right) \) with joint probability density function \( h\left(\tilde{x},\tilde{t}\right) \). The total number of users is Q. From these assumptions stems the flow rate of users by preferred arrival time, \( \tilde{q}\left(\tilde{t}\right)=Q{\displaystyle {\int}_{\;\tilde{x}}h\left(\tilde{x},\tilde{t}\right)d\tilde{x}} \), and the marginal probability density conditional on \( \tilde{t} \),
\( \tilde{h}\left(\tilde{x}\left\;\tilde{t}\right.\right)=h\left(\tilde{x},\tilde{t}\right)/{\displaystyle {\int}_{\;x}h\left(x,\tilde{t}\right)dx} \).
Apart from the endpoint and preferred instant of arrival, a single travel behavior is hypothesized for all users. Each user chooses an (i, t) pair of parking lot i and parking time t at that lot. He is assumed to have perfect information about the lot positions, tariffs and saturation times—arguably from past experience and reiterated situations. The hypothesis of perfect information involves no stress on the part of the user, therefore searching time is not penalized higher than travel invehicle time. Cruising for parking is not modelled in the present approach concentrating on the street level. A further statistical treatment of dynamic parking conditions on the street level would allow for the introduction of cruising for parking at the network level taking into account spatial and temporal diversion incurred by progressive parking saturation (building on static approaches developed in Leurent and Boujnah [11]). Imperfect information would result in a stochastic equilibrium. This approach is left for further research.
Denote by \( s=\left(\tilde{x},\tilde{t}\right) \) the particular demand segment of a user. To a user in segment s, a parking option (i, t) involves three travel phases as follows: first, car access from street entry point to lot position, x _{ i }; second, pedestrian access from lot position to destination endpoint, \( \tilde{x} \); furthermore, to avoid saturation the user may adapt his instant of parking hence his instant of arrival, by rescheduling his trip thus incurring some inconveniency.
Each travel phase induces a disutility, or generalized cost, to the user. First, the cost of parking access is a function V _{ i } that depends only on the lot position and tariff, both in an increasing way. Let us assume here that entry point is located at x = 0. For simplicity, let
With v an average car speed, α the marginal value of a unit car time and m _{ i } the parking tariff.
Second, the cost of pedestrian access is a function \( {W}_i\left(\tilde{x}\right) \) that depends on the distance between the respective positions of parking lot and trip endpoint. For simplicity, let
With w an average walk speed and β the marginal value of a unit walk time.
Third, the schedule cost is a function \( D\left({t}^{\prime },\tilde{t}\right) \) in which t′ is the effective instant of arrival at the destination endpoint. Denoting by t the instant of user parking at lot i, it holds that
The schedule cost diminishes with t′ up to \( \tilde{t} \) and then it increases. For simplicity, a piecewise linear affine function is assumed:
Wherein (x)^{+} = max{x, 0} and γ (resp. γ ^{+}) is the marginal value of a unit time of earliness (resp. lateness).
To sum up, the cost of parking option (i, t) to a user in segment \( s=\left(\tilde{x},\tilde{t}\right) \) amounts to
The disaggregation of demand into several segments with different socioeconomic parameters α, β, γ/γ ^{+} and physical parameters v, w is discussed at the end of the section 5 (§5.4).
Supply and demand interaction in the uncongested case
Let us derive the consequences of the modeling assumptions in the uncongested case when no parking lot reaches its capacity during the studied period.
To a user in segment \( s=\left(\tilde{x},\tilde{t}\right) \), option i is available at reduced cost with no schedule delay on selecting a parking time t which matches the preferred time of destination arrival, \( \tilde{t} \):
Thus, the schedule cost vanishes and the optimal cost is a function of \( \left(\tilde{x},\tilde{t}\right) \), that depends on \( \tilde{x} \) only:
Then, the problem of selecting the best parking option merely amounts to solve:
This problem is easy to solve at each position \( \tilde{x} \) along the spatial axis. Furthermore, there is a collective pattern of cost minimization due to the shape of the reduced cost functions. Function g _{ i } is a Vshaped, piecewise affine function with minimum value V _{ i } at point x _{ i }. Between two options i < j to denote x _{ i } < x _{ j }, as the half lines of their cost functions are parallel (by side), they do not intersect so either the two function graphs do not intersect (as illustrated in Fig. 1a) or there is only one intersection point (as shown in Fig. 1b). The condition for no intersection is that
Or
If \( {g}_i\left({x}_j,\tilde{t}\right)\ge {V}_j \) and \( {g}_j\left({x}_i,\tilde{t}\right)\ge {V}_i \) then there is a unique intersection point, denoted \( {\widehat{x}}_{ij}^0 \), such that
From the Vshapes and the parallel half lines this point must be located in the region where g _{ i } increases and g _{ j } decreases, i.e. in [x _{ i }, x _{ j }]. So (3.5) is equivalent to
Notation ^ indicates the frontier status and “0” stands for the absence of congestion.
Denote by E _{ ij } the domain of \( \tilde{x} \) where i dominates j, i.e. \( {g}_i\left(\tilde{x},\tilde{t}\right)\le {g}_j\left(\tilde{x},\tilde{t}\right) \). In the absence of intersection, either E _{ ij } = [0, L] and E _{ ji } = ∅, or the converse, whereas if there is an intersection then \( {E}_{ij}=\left[0,{\widehat{x}}_{ij}^0\right] \) and \( {E}_{ji}=\left[{\widehat{x}}_{ij}^0,L\right] \). Whatever the case, E _{ ij } is an interval for all \( \tilde{t} \).
When all parking lots are considered, for all \( \tilde{t} \), the efficiency domain of lot i on \( \tilde{x} \) is defined as
Then being an intersection of intervals, E _{ i } is an interval. Thus the collection of parking choice problems parameterized by \( \tilde{x} \) amounts to a sequence of efficiency intervals: the sequence is ordered by the lot positions since a larger position induces an efficiency interval with larger values. Let us denote x _{ i } ^{−} = min E _{ i } and x _{ i } ^{+} = max E _{ i }, with respective default values of L and 0, respectively, if E _{ i } is empty.
The usage pattern of the parking lot i is as follows: at instant t it receives the users in E _{ i } with preferred endpoint arrival at \( \tilde{t}=t+\left\tilde{x}{x}_i\right/w \). Formally, their flow rate is
From this stems the cumulative flow of arrival in lot i up to t,
Wherein \( {H}_{\tilde{x}}(t)={\displaystyle {\int}_{\;u\le t}h\left(\tilde{x},u\right)\;du} \).
Property 1: In absence of parking congestion, the demand domain is divided into market areas of each parking option, separated exclusively by spatial limits based on relative positions of parking lots and tariffs.
In the Appendix, an algorithm Uncongested Efficiency Frontier is provided to determine the efficiency domains in the uncongested case.
If there are no tariffs i.e. m _{ i } = 0, and if the parameters check that \( {\scriptscriptstyle \frac{\alpha }{v}}\le {\scriptscriptstyle \frac{\beta }{w}} \), then it holds that
The reason is that \( {g}_i\left({x}_j,\tilde{t}\right){g}_j\left({x}_j,\tilde{t}\right)=\left({\scriptscriptstyle \frac{\beta }{w}}{\scriptscriptstyle \frac{\alpha }{v}}\right)\left({x}_j{x}_i\right) \), which is non negative since x _{ i } < x _{ j } and β/w > α/v by assumption. Conversely, since \( {g}_j\left({x}_i,\tilde{t}\right){g}_i\left({x}_i,\tilde{t}\right)=\left({\scriptscriptstyle \frac{\beta }{w}}+{\scriptscriptstyle \frac{\alpha }{v}}\right)\left({x}_j{x}_i\right) \),
The condition that β/w > α/v is consistent with the individual behaviors of most users because car speed v should be higher than walk speed w (which will be identified as H1), while walk time is likely to be less comfortable than car time, i.e. β > α (identified as H2). Under the two conditions of null tariffs and adequate values of the behavioral parameters, it follows that every parking lot is efficient around its location. This joint efficiency of all parking options holds if the structure of tariffs does not “distort” too much the preference structure of the parking lots based on their location (which will be identified as H3) (i.e. if the tariff of an option is too high compared to its neighbors, this option will become preferable only when other options are saturated). Then, it is not necessary to apply the algorithm Uncongested Efficiency Frontier.
A parking lot as a timed option for car users
Having solved the stationary problem with uncongested lots, let us now address the dynamic setting, at first for a single parking lot i with saturation time \( {\overline{t}}_i<{t}_{\max } \).
A user of segment \( s=\left(\tilde{x},\tilde{t}\right) \) minimizes his cost of parking at i by matching his instant of parking, t, to \( \tilde{t} \) in the following way (recall eqn. (3.1)): \( t=\tilde{t}\left\tilde{x}{x}_i\right/w \).
This is possible only if \( t\le {\overline{t}}_i \) hence if \( \tilde{t}\le {t}_i^{\#}\left(\tilde{x}\right)\equiv {\overline{t}}_i+\left\tilde{x}{x}_i\right/w \).
Of course the shorthand \( {t}_i^{\#}\left(\tilde{x}\right) \), which defines the saturation wave in the demand space, is conditional on \( {\overline{t}}_i \). If \( \tilde{t}\ge {t}_i^{\#}\left(\tilde{x}\right) \) then the parking times that would match \( \tilde{t} \) are not available to the user. After parking at t the user arrives at his destination at \( {t}^{\prime }=t+\left\tilde{x}{x}_i\right/w \), which is less than \( \tilde{t} \), meaning an early arrival, hence a schedule delay \( D\left({t}^{\prime },\tilde{t}\right) \) which is minimized by minimizing \( \left{t}^{\prime }\tilde{t}\right \), yielding \( {t}^{\prime }={t}_i^{\#}\left(\tilde{x}\right) \) or equivalently \( t={\overline{t}}_i \). Late arrival could only occur after some parking capacity becomes available anew.
Property 2: To a user in segment \( s=\left(\tilde{x},\tilde{t}\right) \), the optimum instant of parking at i is either \( {t}_i^{\ast}\left(\tilde{x},\tilde{t}\right)=\tilde{t}\left\tilde{x}{x}_i\right/w \) if \( \tilde{t}\le {t}_i^{\#}\left(\tilde{x}\right) \) or \( {t}_i^{\ast}\left(\tilde{x},\tilde{t}\right)={\overline{t}}_i \) if \( \tilde{t}\ge {t}_i^{\#}\left(\tilde{x}\right) \). So, in general,
This optimal parking time gives rise to the optimal cost of parking at i to the user,
Given \( \tilde{t}>{\overline{t}}_i \), on the spatial interval \( \tilde{x}\in {x}_i\pm w\left(\tilde{t}{\overline{t}}_i\right) \), the user in segment \( s=\left(\tilde{x},\tilde{t}\right) \) must arrive early at his destination and he incurs a schedule cost \( D\left({\overline{t}}_i+{\scriptscriptstyle \frac{1}{w}}\left\tilde{x}{x}_i\right,\;\tilde{t}\right) \) which decreases when \( {\overline{t}}_i+{\scriptscriptstyle \frac{1}{w}}\left\tilde{x}{x}_i\right \) increases hence when \( \left\tilde{x}{x}_i\right \) increases. It is highest at \( \tilde{x}={x}_i \). So its variations are opposite to those of \( {W}_i\left(\tilde{x}\right) \), which stems from the walk distance between the parking lot and the trip endpoint (time needed to walk from the parking lot to the destination partly reduces earliness). The overall effect of \( \tilde{x} \) on g _{ i } depends on the respective coefficients in W _{ i } and D in the detailed formula:
If β ≥ γ then W _{ i } prevails upon D and g _{ i } is Vshaped as in the uncongested case, yet with reduced slope around its minimal point (Fig. 2). But if γ > β then g _{ i } is Wshaped with two minimum points and a local maximum at x _{ i } between them. In the rest of the paper we shall keep to the assumption (identified as H4) that β ≥ γ which not only makes things easier but also and above all is more behavioral since a unit walking time is less useful—hence more costly – to the user than a unit time at the destination where he can undertake a short complementary activity.
The temporal structure of efficiency domains
We are now ready to address the general case with several parking lots and eventual saturation. In this section, the main working assumption is to take the lot saturation times as exogenous parameters in order to derive from them the structure of the lots’ efficiency domains with respect to time: a bidimensional efficiency domain along time \( \tilde{t} \) as well as space by location \( \tilde{x} \) will be called an efficiency region.
We shall first study the bilateral competition between two lots (§ 5.1) and then the multilateral competition between all lots (§ 5.2). Next, the traffic consequences are established by deriving the lot instantaneous and cumulative flows (§ 5.3). Lastly, we will present the treatment of multiple classes of demand (§ 5.4). In the appendix, an eventbased algorithm is provided to compute the efficiency regions in an efficient way.
Bilateral competition
Bilateral competition between two lots is analyzed according to parameter \( \tilde{t} \) and proceeds in 3 stages: first, departing at an initial \( \tilde{t} \) while both lots are unsaturated, then, while \( \tilde{t} \) increases it reaches the saturation wave of one lot which gets saturated while the other one remains unsaturated, then when the second lot reaches saturation two alternative outcomes are discussed. So the parametric analysis is conditioned by the saturation times of the two lots, which thus constitute fundamental parameters.
Initial uncongested configuration
Take two lots i and j in I such that x _{ i } < x _{ j }, which can be denoted also as i < j. Assume that each lot has a nonempty efficiency domain at the initial instant \( \tilde{t}={t}_{\min } \) a preferred time of arrival. As described in section 3, from their respective positions, lot i has an initial domain \( \left[0,{\widehat{x}}_{ij}^0\right] \) and that of lot j is \( \left[{\widehat{x}}_{ij}^0,\;L\right] \). Each domain is a specific side, left or right, with respect to the pivot value \( {\widehat{x}}_{ij}^0 \) where the lot costs are equal. Point \( {\widehat{x}}_{ij}^0 \) must lay between the two lots to ensure the joint efficiency; so the cost function g _{ j } decreases with \( \tilde{x} \) on \( \left[0,{\widehat{x}}_{ij}^0\right] \) whereas function g _{ i } increases with \( \tilde{x} \) on \( \left[{\widehat{x}}_{ij}^0,\;L\right] \) (as illustrated in Fig. 3). As \( \tilde{t} \) increases, under the behavioral condition that β ≥ γ (H4), the respective efficiency domains are maintained since, as described in section 3, the cost structure is independent of \( \tilde{t} \) until schedule delay is introduced due to saturation.
Unilateral saturation of a lot
Efficiency domains start evolving when \( {\widehat{x}}_{ij}^0 \) is reached by a saturation wave from one lot (introduced in section 4), at instant \( {t}_i^{\#}\left({\widehat{x}}_{ij}^0\right) \). For users in the saturation area, parking time in the saturated lot is constrained by the saturation time \( {\overline{t}}_i \) which leads to an additional delay cost making the unsaturated lot more attractive. Some users will then switch from the saturated lot to the unsaturated lot to avoid the delay cost, moving the \( {\widehat{x}}_{ij} \) frontier as to extend the efficiency domain of unsaturated lot (see the \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) curve in Fig. 3 where lot i is saturated first). This holds because, until the saturation wave reaches \( {\widehat{x}}_{ij}^0 \), any congested point of option say i has position \( \tilde{x}\le {\widehat{x}}_{ij}^0 \) and an option cost less than that at \( {\widehat{x}}_{ij}^0 \). From the latter fact, it stems that
\( {g}_i\left(\tilde{x},\tilde{t}\right)\le {g}_i\left({\widehat{x}}_{ij}^0,\tilde{t}\right)={g}_j\left({\widehat{x}}_{ij}^0,\tilde{t}\right) \),
whereas the condition that \( \tilde{x}\le {\widehat{x}}_{ij}^0 \) implies that
On combining, it follows that
Let us then consider the first instant when lot saturation reaches \( {\widehat{x}}_{ij}^0 \):
Assuming that t _{ i } ^{#} < t _{ j } ^{#} (case 1) at \( {\widehat{x}}_{ij}^0 \), after t _{ ij } ^{∗} and at \( \tilde{x} \) around \( {\widehat{x}}_{ij}^0 \) the cost of lot i is increased yet still Vshaped whereas that of lot j is maintained along a halfline where it decreases with \( \tilde{x} \) (as shown in Fig. 3). So there is a unique intersection of the two cost functions, at \( {\widehat{x}}_{ij}\left(\tilde{t}\right)\le {\widehat{x}}_{ij}^0 \).
Bilateral frontier evolution in case of unilateral saturation
For case 1, \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) is a decreasing function of \( \tilde{t} \) (as shown in Fig. 3), it is defined by the equality of the congested cost of i and the uncongested cost of j, as follows: \( {g}_i\left(\widehat{x},\tilde{t}\right)={g}_j\left(\widehat{x},\tilde{t}\right) \) or
Wherein ε _{ i } = + 1 if \( \widehat{x}>{x}_i \) or 1 if \( \widehat{x}\le {x}_i \) and ε _{ j } = + 1 if \( \widehat{x}>{x}_j \) or 1 if \( \widehat{x}\le {x}_j \).
Let us denote α′ = α/v, β′ = β/w, γ′ = γ/w and ζ _{ k } ^{′} = ζ′. ε _{ k } for ζ ∈ {α, β, γ} and k ∈ {i, j}.
In abridged form,
After \( {t}_i^{\#}\left({\widehat{x}}_{ij}^0\right) \), the function \( \tilde{t}\mapsto {\widehat{x}}_{ij}\left(\tilde{t}\right) \) decreases at slope − wγ/(2β − γ) as long as \( {\widehat{x}}_{ij}\ge {x}_i \), then at slope − w (since β _{ i } ^{′} = β _{ j } ^{′} = − β′ and γ _{ i } ^{′} = − γ/w if \( {\widehat{x}}_{ij}<{x}_i \)). The instant at which \( {\widehat{x}}_{ij}={x}_i \) is \( {t}_i^{\#}\left({\widehat{x}}_{ij}^0\right)+{\scriptscriptstyle \frac{2\beta \gamma }{\gamma w}}\left({\widehat{x}}_{ij}^0{x}_i\right) \).
Conversely in case 2, if t _{ i } ^{#} ≥ t _{ j } ^{#} then the function \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) increases with \( \tilde{t} \) after \( {t}_j^{\#}\left({\widehat{x}}_{ij}^0\right) \). It is defined by interchanging the i and j indices in (5.1), which yields that \( {m}_i+{\alpha}^{\prime }{x}_i+{\beta}_i^{\prime}\left(\widehat{x}{x}_i\right)={m}_j+{\alpha}^{\prime }{x}_j+{\beta}_j^{\prime}\left(\widehat{x}{x}_j\right)+\gamma \left(\tilde{t}{\overline{t}}_j\right){\gamma}_j^{\prime}\left(\widehat{x}{x}_j\right) \), hence that
After \( {t}_j^{\#}\left({\widehat{x}}_{ij}^0\right) \), the function \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) increases with \( \tilde{t} \) at slope wγ/(2β − γ) up to value x _{ j } at time \( {t}_j^{\#}\left({\widehat{x}}_{ij}^0\right)+\left({x}_j{\widehat{x}}_{ij}^0\right){\scriptscriptstyle \frac{2\beta \gamma }{\gamma w}} \), then at slope w.
Joint saturation of both lots
There remains the issue of the joint saturation of both lots. From previous arguments, this has an effect at time \( \tilde{t} \) only if it affects the limit point \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \): in that case, the equality of the two lot costs will be maintained there at all subsequent times (leading to domain stabilization of the saturated lot) since each cost function at \( \tilde{x} \) will increase with time at slope γ. The limit time satisfies that
Or
In the latter case, as the saturation wave from lot i has slope w, the equality can take place only at \( \widehat{x}\le {x}_j \) since beyond x _{ j } the \( \widehat{x} \) has the same slope so there can be no intersection. A similar condition applies to the former case.
By continuity, the condition for a limit time to exist is that the saturation wave of the other lot should reach the lot position before it is passed by the frontier function:
Or
Two alternative outcomes: domain stabilization or domain closure
From (5.4), the event of domain stabilization can easily be predicted. If it occurs, then the efficiency region of each lot is defined by a frontier function \( \tilde{t}\mapsto {\widehat{x}}_{ij}\left(\tilde{t}\right) \) in three pieces, first a constant at \( {\widehat{x}}_{ij}^0 \), then an affine function, third another constant at \( {\widehat{x}}_{ij}^{\max } \) characterized by (5.3). This configuration is shown in Fig. 4a where the saturation wave of lot i is first to reach \( {\widehat{x}}_{ij}^0 \) (case 1). If the saturation wave of lot j was the first to reach \( {\widehat{x}}_{ij}^0 \) (case 2), the graph would be symmetrical.
The alternative situation without domain stabilization is another kind of efficiency region for each lot: the frontier function is still in three pieces (corresponding to the “undisturbed” bilateral frontier described in the section 5.1.2), first at \( {\widehat{x}}_{ij}^0 \), then an affine function with slope ε _{ b } wγ/(2β − γ), third another affine function with slope ε _{ b } w (ε _{ b } = + 1 in case 2 and 1 in case 1). This second possible configuration of efficiency regions is shown in Fig. 4b (again, case 1 is illustrated, the graph for the case 2 would be symmetrical).
In both situations, the function \( \tilde{t}\mapsto \widehat{x}\left(\tilde{t}\right) \) is piecewise affine and continuous (Fig. 4a and b for case 1, symmetrical figures for case 2). At any \( \tilde{t} \) the efficiency domain of each option is an interval.
Synthesis
Summarizing previous results, under the behavioral condition β ≥ γ (H4) and on the basis of property 1, in the initial configuration both lots have an efficiency domain, which is maintained until its frontier is reached by the saturation wave from one lot (as discussed in section 5.1.1). A parametric analysis with respect to \( \tilde{t} \) yields the evolution of the bilateral frontier in the demand space \( \left(\tilde{x},\tilde{t}\right) \) (as described in section 5.1.2). This frontier is only modified when it is met by the second lot’s saturation wave, as discussed in section 5.1.3. Altogether, based on this parametric study, two possible configurations are identified in section 5.1.3: domain stabilization of the first saturated lot or its closure, based on the moment when the second lot saturates. This analysis results in the following proposition.
Proposition 1. In a situation of bilateral competition, the efficiency domains of the competing options are separated by a frontier in three affine pieces. For a given set of saturation times and parking lot positions, there are only two possible configurations for this frontier (depicted in Fig. 4): efficiency domain stabilization or definitive elimination of one option.
These properties depend crucially on the initial joint efficiency of all options (H3). If only one lot is efficient at the beginning, then after its saturation instant the saturation wave could make the other lot efficient, but on a specific interval that would split the efficiency domain of the first lot in two parts, thereby breaking the interval structure.
Multilateral competition
Let us denote the efficiency regions of the lot i that result from the bilateral competition between options i and j such as j < i as E _{ ij } ^{−} and the efficiency regions of the lot i in its competition with lots j such as j > i as E _{ ij } ^{+} .
In the general case, the efficiency region of lot i is the domain in the \( \left(\tilde{x},\tilde{t}\right) \) plane where g _{ i } is less than any other g _{ j } for j ∈ I:
From its definition, \( {E}_i={\displaystyle {\cap}_{j\in I}\left\{\left(\tilde{x},\tilde{t}\right):\kern0.5em {g}_i\le {g}_j\right\}} \). Note that given \( \tilde{t} \), \( \forall \tilde{x} \), ∃ i such that \( \left(\tilde{x},\tilde{t}\right)\in {\mathrm{E}}_i \).
Definition that can also be written as:
As \( {E}_{ij}^{}=\left\{\left(\tilde{x},\tilde{t}\right):\kern0.5em \tilde{x}\ge {\widehat{x}}_{ij}\left(\tilde{t}\right)\right\} \), it turns out that \( {\displaystyle {\cap}_{j<i}{E}_{ij}^{}}=\left\{\left(\tilde{x},\tilde{t}\right):\kern0.5em \tilde{x}\ge { \max}_{j<i}{\widehat{x}}_{ij}\left(\tilde{t}\right)\right\} \).
Let us define \( {x}_i^{}\left(\tilde{t}\right)={ \max}_{j<i}{\widehat{x}}_{ij}\left(\tilde{t}\right) \) (or 0 if i has the smallest x _{ i }). Then it holds that:
Similarly, as \( {E}_{ij}^{+}=\left\{\left(\tilde{x},\tilde{t}\right):\kern0.5em \tilde{x}\le {\widehat{x}}_{ij}\left(\tilde{t}\right)\right\} \) it turns out that \( {\displaystyle {\cap}_{j>i}{E}_{ij}^{+}}=\left\{\left(\tilde{x},\tilde{t}\right):\kern0.5em \tilde{x}\le { \min}_{j>i}{\widehat{x}}_{ij}\left(\tilde{t}\right)\right\} \)
Let us define \( {x}_i^{+}\left(\tilde{t}\right)={ \min}_{j>i}{\widehat{x}}_{ij}\left(\tilde{t}\right) \) (or L if i has the largest x _{ i }). Then it also holds that:
By combination of the two sides, it follows that
Hence
As the \( {\widehat{x}}_{ij} \) functions are piecewise affine and continuous, so is the maximum (or the minimum) of a subset of them: thus the x _{ i } ^{−} and x _{ i } ^{+} as functions of \( \tilde{t} \) are piecewise affine and continuous.
The width function \( \tilde{t}\mapsto {\left({x}_i^{+}\left(\tilde{t}\right){x}_i^{}\left(\tilde{t}\right)\right)}^{+} \) is also piecewise and continuous. It decreases to zero on ℵ only if there is a limit instant from which option i is no longer efficient. In the Appendix, it is shown that each efficiency region is a single connected region.
Assignment functions
Knowing the respective efficiency regions of the parking lots, it is easy to assign each user with \( \left(\tilde{x},\tilde{t}\right) \) to the option which is optimal to him. For every lot, the user flow results from the aggregation of the flow elements across the population of users.
Denote by \( {\tilde{q}}_i\left(\tilde{t}\right) \) the flow rate of users with \( \tilde{t} \) as preferred arrival time and that select lot i: \( {\tilde{q}}_i\left(\tilde{t}\right)=\tilde{q}\left(\tilde{t}\right){.1}_{\left\{{x}_i^{+}\left(\tilde{t}\right)\ge {x}_i^{}\left(\tilde{t}\right)\right\}}.{\displaystyle {\int}_{\;{x}_i^{}\left(\tilde{t}\right)}^{\;{x}_i^{+}\left(\tilde{t}\right)}\;\tilde{h}\left(\tilde{x}\Big\tilde{t}\right)d\tilde{x}} \), hence
By construction, \( \forall \tilde{t} \) all demand elements \( Q\tilde{h}\left(\tilde{x}\Big\tilde{t}\right) \) are assigned between the parking lots, so that \( {\displaystyle {\sum}_{i\in \mathrm{I}}{\tilde{q}}_i\left(\tilde{t}\right)=\tilde{q}\left(\tilde{t}\right)} \).
By time integration we get the cumulative flow of users selecting i up to a ceiling value t of \( \tilde{t} \):
The total demand for option i based on the lot saturation times amounts to \( {\tilde{Q}}_i\left({t}_{\max}\right) \).
By aggregation over \( \tilde{t} \), it stems that \( {\displaystyle {\sum}_{i\in \mathrm{I}}{\tilde{\mathrm{Q}}}_i(t)={\displaystyle {\int}_{\;\tilde{t}\le t}\tilde{q}\left(\tilde{t}\right)d\tilde{t}}} \), hence that:
Formulae (5.9) and (5.10) combined to the regularity properties of \( {x}_i^{}\left(\tilde{t}\right) \) and \( {x}_i^{+}\left(\tilde{t}\right) \) yield obvious regularity properties for the option flow rate and cumulative flow.
These flows depend on the preferred time of arrival at the destination: this time is intentional in nature.
With respect to the time of parking, let us distinguish between times prior to saturation i.e. \( t<{\overline{t}}_i \) and the saturation time, \( {\overline{t}}_i \). Prior to saturation, the parking time and the preferred arrival time are linked by \( \tilde{t}=t+\left\tilde{x}{x}_i\right/w \). Given \( \tilde{x} \), there is a time shift with no effect of time distortion between t and \( \tilde{t} \) so the flow of users with \( \tilde{t} \) that park at t in lot i is simply
Define the frontier set \( {F}_{i,t}=\left\{\left(\tilde{x},\tilde{t}\right):\tilde{t}=t+{w}^{1}\left\tilde{x}{x}_i\right\right\} \).
The users who park at t are those in E _{ i } ∩ F _{ i,t }, so
The cumulative flow at t stems from the region below the frontier, i.e. set E _{ i } ≤ F _{ i,t }:
At a given t, define the functions \( {y}_{it}^{}\left(\tilde{t}\right)={x}_iw\left(\tilde{t}t\right) \) and \( {y}_{it}^{+}\left(\tilde{t}\right)={x}_i+w\left(\tilde{t}t\right) \) of \( \tilde{t}\ge t \). A point \( \left(\tilde{x},\tilde{t}\right) \) is below F _{ i,t } if \( \tilde{t}<t \) or if \( \tilde{t}\ge t \) and \( \tilde{x}\notin \left]{y}_{it}^{}\left(\tilde{t}\right),{y}_{it}^{+}\left(\tilde{t}\right)\right[ \). So
The inner integral amounts to:
As for the flow of users that park at the saturation time \( {\overline{t}}_i \), it is cumulated over the time interval of \( \tilde{t}\ge {t}_i^{\#}\left(\tilde{x}\right) \) for each destination point \( \tilde{x} \). With respect to \( \tilde{t} \), \( \tilde{x} \) must belong to \( \left[{x}_i^{}\left(\tilde{t}\right),{x}_i^{+}\left(\tilde{t}\right)\right]\cap \left[{y}_{it}^{}\left(\tilde{t}\right),{y}_{it}^{+}\left(\tilde{t}\right)\right] \) for \( t={\overline{t}}_i \). So each \( \tilde{t}\ge {\overline{t}}_i \) yields flow rate of
Then the cumulative flow is (under \( t={\overline{t}}_i \)):
Based on these formulas, regularity properties for \( {z}_i\left(\tilde{t}\right) \) and Z _{ i }(t) follow from those of their operands.
At \( {\overline{t}}_i \) the overall cumulative flow is
Multiple demand classes
Sections 5.1 to 5.3 apply specifically to one class of demand, say A, sharing the same behavioral characteristics (α, β, γ, v, w) and entry point (the 0 extremity). From an exogenous set of lot saturation times, the treatment derives the dynamic market areas of the parking lots and the assignment of demand to their preferred parking options. At the street level it is easy to deal with multiple classes of demand, for instance a class B of users entering by L, sharing parameters (α′, β′, γ′, v′, w′) and distributed along time and space with \( {h}^{\prime}\left(\tilde{x},\tilde{t}\right) \) and \( {H}^{\prime}\left(\tilde{x},\tilde{t}\right) \). We also assume, as in sections 5.1 to 5.3, the set of lot saturation time is exogenous, therefore demand classes do not interact directly in their choice of preferred parking option. Parking quality of service and resulting market areas for each demand class are entirely derived from the parking saturation times and the classspecific behavioral characteristics as well as entry point. The first step is then to adapt the algorithm determining parking options efficiency domains.
Classspecific parking costs
In general, for a class B of users, the costs of parking at one of the lots offered on the street level would be specific: \( {V}_i^{\prime },{W}_i^{\prime}\left(\tilde{x}\right),{D}^{\prime}\left({t}^{{\prime\prime} },\tilde{t}\right) \). Transposing previously presented reasoning for the class A to the characteristics of the class B would provide classspecific efficiency domains E’ _{ i }.
In the particular case of a class B, differing from the class A by the entry point only, the invehicle cost of parking access to a given lot is solely modified. Indeed, \( {V}_i={m}_i+\frac{\alpha .{x}_i}{v} \) becomes \( {V}_i^{\prime }={m}_i+\frac{\alpha \left(L.{x}_i\right)}{v} \), therefore increasing the minimal cost of parking at lots such that \( {x}_i<\frac{L}{2} \) and decreasing it for lots \( {x}_i>\frac{L}{2} \). Therefore following properties of the bilateral frontier between two lots can be easily derived.
Classspecific efficiency domains
Property 3: In the uncongested case, the position of the bilateral frontier between lots i and j depends on the user class. The Bfrontier is closer to 0extremity than the Afrontier.
The reason for that is that lot j, being closer to the Lextremity, has a larger efficiency interval for class B than for class A.
This is summarized in the following expression, to be compared with the equation (3.6) pertaining to the class A:
Then, since the saturation wave of a parking lot depends only on the saturation time and walking speed (shared by the classes A and B) it is identical for both classes A and B. Indeed, recalling its expression (case 1, lot i saturates first), \( {t}_i^{\#}\left(\tilde{x}\right)\equiv {\overline{t}}_i+\left\tilde{x}{x}_i\right/w \) and keeping in mind that \( {x}_i<\widehat{x}{\hbox{'}}_{ij}^0<{\widehat{x}}_{ij}^0 \), leads to, since \( {t}_i^{\#}\left(\tilde{x}\right) \) is increasing on this interval:
Conversely, in the case 2, when lot j saturates first, \( {t}_j^{\#}\left(\tilde{x}\right) \) is decreasing for \( \tilde{x}<{x}_j \) leading to \( {t}_j^{\#}\left(\widehat{x}{\hbox{'}}_{ij}^0\right)>{t}_j^{\#}\left({\widehat{x}}_{ij}^0\right) \). This leads to property 4.
Property 4: In the case of unilateral saturation of the lot i (case 1), the saturation wave will be met sooner by users in class B – they will switch earlier to the unsaturated lot j which is closer to their entry point. Conversely, in the case of unilateral saturation of lot j (case 2), the saturation wave will be met later, users in the class B are keeping their preference for lot j, closer to their entry point, for a longer period.
This stronger preference for the lot closer to the entry point L is also seen in the further evolution of the bilateral frontier. It has the same piecewise structure and conserves the characteristic slopes. After t ' _{ ij } ^{*} , the function \( \tilde{t}\mapsto \widehat{x}{\hbox{'}}_{ij}\left(\tilde{t}\right) \) evolves at slope ε _{ b } wγ/(2β − γ) as long as \( \widehat{x}{\hbox{'}}_{ij}\ge {x}_i \), then at slope ε _{ b } w (where ε _{ b } = − 1 for case 1 and ε _{ b } = + 1 for case 2).
Property 5: These slope expressions lead to identical values as for class A, since behavioral characteristics are kept identical. Although, the instant at which \( \widehat{x}{\hbox{'}}_{ij}={x}_i \) is \( {t}_i^{\#}\left(\widehat{x}{\hbox{'}}_{ij}^0\right)+{\scriptscriptstyle \frac{2\beta \gamma }{\gamma w}}\left(\widehat{x}{\hbox{'}}_{ij}^0{x}_i\right) \), lower than for class A (case 1). Conversely, in case 2, the instant at which \( \widehat{x}{\hbox{'}}_{ij}={x}_j \) is \( {t}_j^{\#}\left(\widehat{x}{\hbox{'}}_{ij}^0\right)+\left({x}_j\widehat{x}{\hbox{'}}_{ij}^0\right){\scriptscriptstyle \frac{2\beta \gamma }{\gamma w}} \), higher than for class A.
Domain stabilization of the first saturated lot can also occur if the condition (5.4) is met. Although, the general shift to the left of the bilateral frontier (property 3), and subsequent modifications of the moment at which the saturation waves meet this frontier (properties 4 and 5) lead to the following property 6:
Property 6: The general shape (stabilized or closed) of the efficiency domains might be different for users in the classes A and B.
Joint assignment and cumulated flows
Property 7: Once the parking lots efficiency domains are established independently for the demand classes, based on common lot saturation times, the demand classes are assigned jointly to their preferred options.
Then for every lot, the user flow results from the aggregation of the flow elements across the population of users, summed over the demand classes:
\( {\tilde{q}}_i\left(\tilde{t}\right)={\tilde{q}}_{i,A}\left(\tilde{t}\right)+{\tilde{q}}_{i,B}\left(\tilde{t}\right) \) using equation (5.9) and specific efficiency frontiers and joint cumulative distribution functions.
With respect to time of parking, using equations (5.12), (5.13) and (5.16) to define respective contributions of categories A and B, the instantaneous flow of users parking at a lot i is:
q _{ i }(t) = q _{ i,B }(t) + q _{ i,B }(t), the cumulative flow at t is Q _{ i }(t) = Q _{ i,A }(t) + Q _{ i,B }(t) for \( t<{\overline{t}}_i \), and the cumulative flow at the saturation moment is \( {Z}_i\left({\overline{t}}_i\right)={Z}_{i,A}\left({\overline{t}}_i\right)+{Z}_{i,B}\left({\overline{t}}_i\right) \).
Dealing with the particular class of users entering through the Lextremity of the street is a step towards route choice integration, though, to be complete, it would need to take into account departure time choice due to dynamically varying traffic conditions at the network level, possibly different for each entry point according to the route choice. Hints of further developments are presented in the conclusion section.
Parking traffic equilibrium
A parking user makes his decision of parking lot and parking time based on the costs of the options available to him. He evaluates the option costs from their physical characteristics, including the saturation time but probably not the capacity which he is unlikely to know accurately. Thus the saturation times are macroscopic parameters that induce the assignment of demand to parking options. This makes the demand side of parking traffic equilibrium. On the supply side, by parking lot the saturation time is determined by the filling up of the lot capacity.
We shall first define precisely the traffic equilibrium of parking demand and supply, then analyze it mathematically as a Fixed Point Problem and demonstrate the existence of an equilibrium state, and lastly provide a solution algorithm.
Demand and supply in equilibrium
Conditional on the vector \( {\overline{\mathbf{t}}}_I=\left[{\overline{t}}_i:i\in I\right] \) of lot saturation times, the determination of the efficiency regions E _{ I } = [E _{ i } : i ∈ I] yields the preferred option (i _{ s }, t _{ s }) of each demand segment \( s=\left(\tilde{x},\tilde{t}\right) \). As each demand segment has a flow element \( Qh\left(\tilde{x},\tilde{t}\right) \), the assignment of the flow elements to the preferred options induces the lot flow functions \( {\tilde{q}}_i\left(\tilde{t}\right) \) and \( {\tilde{Q}}_i\left(\tilde{t}\right) \) with respect to preferred time of arrival and q _{ i }(t) and Q _{ i }(t) with respect to parking time. Let Q _{ I } = [Q _{ i } : i ∈ I] be the vector of cumulative flow functions with respect to parking times.
Definition: Parking Traffic User Equilibrium (PTUE) is a system state \( {\overline{\mathbf{t}}}_I,{\mathbf{E}}_I,{\mathbf{Q}}_I \) such that

(i)
The efficiency regions E _{ I } are based on \( {\overline{\mathbf{t}}}_I \).

(ii)
∀ i ∈ I, function t ↦ Q _{ i }(t) satisfies (5.14) and (5.17) based on \( {\overline{\mathbf{t}}}_I \).

(iii)
∀ i ∈ I, \( {\overline{t}}_i= \inf \left\{\kern0.5em t\le {t}_{\max }:\;{Q}_i(t)\ge {k}_i\right\} \).
Condition (i) states that every demand segment is associated to its preferred option. Condition (ii) means that the lot flows stem from demand assignment under the principle of selfish user behavior. Condition (iii) states that the saturation time of lot i is the instant at which lot i saturates due to the demand flows.
Mathematical analysis
Denote by \( {\overline{\mathbf{t}}}_{Ii}=\left[{\overline{t}}_j:j\in I,j\ne i\right] \) the vector \( {\overline{\mathbf{t}}}_I \) deprived from its ith component, \( {\overline{t}}_i \). Let us also define from (5.10),
Conditional on \( {\overline{\mathbf{t}}}_{Ii} \), \( {\widehat{Q}}_i \) evaluated at \( t={\overline{t}}_i \) yields the flow of lot i cumulated over the period and conditional on \( {\overline{\mathbf{t}}}_I=\left({\overline{\mathbf{t}}}_{Ii},t\right) \). From its definition, function \( {\widehat{Q}}_i \) increases with t. It is continuous everywhere except at critical points where a change in t induces a radical shift from one typical situation of bilateral competition to the other, i.e. when some \( {\widehat{x}}_{ij} \) or \( {\widehat{x}}_{ji} \) reaches a lot position x _{ i } or x _{ j } (cf. § 5.1).
Time \( t={\overline{t}}_i \) is a correct saturation time for lot i conditional on the other saturation times \( {\overline{\mathbf{t}}}_{Ii} \) if and only if it solves the following conditions of complementary slackness:
For this set of conditions (notably 6.2b) to hold, it requires that Q ≤ ∑_{ i ∈ I} k _{ i }. Recalling that \( Q={\displaystyle {\sum}_{i\in \mathrm{I}}{\tilde{Q}}_i\left({t}_{\max}\right)} \) from subsection 5.3. This condition will be identified as H5.
Proposition 2. Given \( {\overline{\mathbf{t}}}_{Ii} \), as \( {\widehat{Q}}_i \) is monotone there is a unique solution to (6.2), namely
Proof. Existence. Given \( {\overline{\mathbf{t}}}_{Ii} \), \( {\widehat{Q}}_i \) is monotone increasing. If there is a t < t _{max} for which \( {\widehat{Q}}_i(t)={k}_i \) , then t is a solution to (6.2). Else \( {\widehat{Q}}_i \) increases without reaching the lot’s capacity k _{ i } , then t _{max} verifies the conditions (6.2) and is therefore a solution to the problem. Uniqueness. Following the definition (6.3) points to the minimal solution, hence unique.
Definition: the Fixed Point Problem (FPP) on saturation times, \( {\overline{\mathbf{t}}}_I \), is made up of the set of conditions as follows:
Proposition 3. For PTUE to have a solution, it must hold that \( {\displaystyle \sum_{i\in I}{\widehat{Q}}_i(t)}=Q \) (where Q is the total demand), hence that \( Q\le {\displaystyle \sum_{i\in I}{k}_i} \). Under that condition, the FPP and the PTUE problem are equivalent in that any solution to the FPP gives rise to a solution of the PTUE and any solution to PTUE satisfies the FPP.
Proof. A vector \( {\overline{\mathbf{t}}}_I \) that solves the FPP satisfies (6.2) on each of its components: so its \( {\overline{t}}_i \) is a correct saturation time for lot i. From the definition of T _{ i } and in turn of \( {\widehat{Q}}_i \), the efficiency regions E _{ I } based on \( {\overline{\mathbf{t}}}_I \) and the associated flow functions Q _{ I } jointly satisfy conditions (i), (ii) and (iii) that define a PTUE. Conversely, a traffic equilibrium must check (6.2) for every lot, hence (6.4) which is equivalent to the system of (6.2) ∀ i ∈ I.
Set of assumptions

H1: v > w Car speed is higher than walk speed

H2: β > α A unit walk time is less comfortable than a unit drive time

H3: The tariff structure allows for initial joint efficiency of all lots

H4: β ≥ γ A unit walk time is less useful (more costly) than a unit (early) time at destination

H5: Q ≤ ∑_{ i ∈ I } k _{ i } Total demand does not exceed total capacity
Proposition 4. Given the set of assumptions, there exists an equilibrium state for the parking problem.
Proof. The mapping T _{ I } = (T _{ i })_{ i ∈ I } is defined on the closed convex domain ℵ ^{I} and onto it. Also \( \forall {\overline{\mathbf{t}}}_I,{\mathbf{T}}_I\left({\overline{\mathbf{t}}}_I\right) \) is a singleton, hence non void and closed. Additionally, we show in the Appendix that, under complementary assumption of \( \tilde{H}\left(x\Big\tilde{t}\right) \) being continuous, T _{ I } is upper semi continuous with respect to \( {\overline{\mathbf{t}}}_I \). Therefore the Kakutani theorem applies and T _{ I } must have a fixed point, which is an equilibrium state. Thus an equilibrium must exist.
Solution algorithm
A parking equilibrium may be computed using any of the following iterative schemes.
First, a naïve algorithm is to compute a sequence \( {\left({\overline{\mathbf{t}}}_I^{(n)}\right)}_{n\ge 0} \) such that
This simple scheme can work well if the T _{ I } mapping is a contraction.
Second, a slightly more sophisticated scheme is to get the next state by progressive updating the components in it, à la GaussSeidel:
In (6.5) or (6.6), function T _{ i } is evaluated by solving for (6.3) which amounts to search for t such that \( {\widehat{Q}}_i \) is equal to the capacity or t = t _{max}. As \( {\widehat{Q}}_i \) is increasing, this can be done simply e.g. by dichotomy.
Third, a more sophisticated and more robust algorithm is a Method of Successive Averages that updates only a fraction of the current state. It utilizes a sequence (ζ _{ n })_{ n ≥ 0} of positive numbers that decrease to zero and on the following updating rule:
As each of the equilibration schemes deals with the saturation times as basic variables, it is a dual approach to parking equilibrium. Whatever the scheme, the FPP formulation provides a convergence criterion which is both simple and rigorous:
The relaxation scheme was used to obtain the equilibrium demonstrated in the next section.
Instance
An instance of application of the model developed in this paper will be presented in this section. For clarity reasons, we will keep to one class of demand only, entering through the 0extremity of the street. First the theoretical case study will be described and hypothesis on parameter values will be introduced. Then the model will be applied to the case study and the analysis of the results will be presented.
Case study and hypotheses
In this example users are willing to park in a street of 400 meters of total length where 3 parking lots are available. The parking options are numbered 1,2 and 3 and located respectively at 50, 200 and 300 meters from the entry node. Their respective capacities are 30, 10 and 60 vehicles during the parking period and to make this example easier to interpret, tariffs were taken null.
Total demand for parking is 80 vehicles and users’ destination locations are uniformly distributed on the entire street stretch. Additionally, users are willing to arrive at destination between 8 h and 9 h and demand is also uniformly distributed in time during this onehour period. Such a demand can be characterized by a rectangular demand domain in the \( \left(\tilde{x},\tilde{t}\right) \) plane with a uniform demand density function \( \tilde{h}\left(\tilde{x},\tilde{t}\right)=\tilde{h} \) constant over the entire demand domain and null elsewhere.
All users are assumed to have identical walking and driving speeds given by: w = 4km/h and v = 20km/h. Users are also assumed to value their time identically and characteristic parameters of their generalized cost function are given as follows: α = 1, β = 1.5 and γ = 0.5.
Figure 5 shows on the \( \left(\tilde{x},\tilde{t}\right) \) plane the configuration of the demand domain and the efficiency domains of the three lots in the first iteration of the algorithm, where saturation has not been detected. In this case, the choice of parking lot is exclusively based on its location with respect to the destination location and entry node. The efficiency conditions between the three parking options divide the demand domain in three domains of roughly similar width.
The assignment of the demand to the parking lots according to the efficiency domains, leads to a progressive filling of the parking lots. The time evolution of the cumulated parking flow on each parking option is represented in Fig. 6. As expected, the demand is almost evenly distributed among parking options.
Table 1 gives the total number of vehicles received in each parking lot. These numbers can be compared with the capacity of each parking option:

Lot 1 received less vehicles than its maximum capacity and therefore is not saturated;

Lot 2 received more vehicles than allowed by its capacity, it is expected to be saturated in the solution;

Lot 3 received less vehicles than its maximum capacity and is not saturated.
It is obvious that, given the capacity of parking lot 2, all vehicles will not be able to park at this parking lot and some of them will transfer to other available options. Final equilibrium is not trivial though, as vehicles could transfer to lot 1 and lead to its saturation or transfer to lot 3, in which case options 1 and 3 will not be saturated whereas lot 2 will reach its capacity. We will now apply the algorithm presented in this paper and analyze resulting equilibrium.
Results and analysis
The search for a solution consists of looking for a vector of saturation times of the three parking lots that jointly provide a parking assignment within the parking capacity constraints. As explained previously this problem is essentially a fixedpoint problem. Table 2 provides the final values of the saturation times and Fig. 7 illustrates the convergence of the saturation times during the application of the relaxation algorithm. It should be reminded that in the algorithm, whenever a parking is not saturated, its saturation time is assigned the value of the maximum preferred arrival time in the demand domain, as it has no consequence on the assignment process. A saturation time of 9 h is therefore equivalent to no saturation.
It can be seen that saturation times stabilize approximately after 60 iterations. The most constrained parking lot 2, is saturated at 8 h22’ approximately (8.3605 hours). The parking option 1 is second to be saturated at 8 h45’ approximately (8.757 hours). The third option is never saturated as its capacity allows it to absorb the remaining users.
Figure 8 shows the efficiency domains of the three parking lots, at the solution of the fixedpoint problem. In particular the frontier between lot 1 and lot 2 is made up of two segments (out of three present in the entire frontier resulting from bilateral competition between these options): a vertical segment where \( {\widehat{x}}_{12}^0 \) is a constant and a tilted segment where \( d{\widehat{x}}_{12}/d\tilde{t}=w\gamma /\left(2\beta \gamma \right)=0.8\mathrm{km}/\mathrm{h} \). The corresponding bilateral frontier is incomplete as it is intersected by the bilateral frontier \( {\widehat{x}}_{23}\left(\tilde{t}\right) \) which is made up of three linear segments of which the last one, which intersects \( {\widehat{x}}_{12}\left(\tilde{t}\right) \), has a characteristic slope of \( d{\widehat{x}}_{23}/d\tilde{t}=w=4\mathrm{km}/\mathrm{h} \) meaning that \( {\widehat{x}}_{23}\left(\tilde{t}\right) \) decreases w.r.t. preferred time of arrival. Once the efficiency domain of lot 2 is closed, competition occurs between options 1 and 3 and results in a bilateral frontier \( {\widehat{x}}_{13}\left(\tilde{t}\right) \) made up of three segments (in order of increasing \( \tilde{t} \)): constant \( {\widehat{x}}_{13}^0 \); tilted segment with slope \( d{\widehat{x}}_{13}/d\tilde{t}=w\gamma /\left(2\beta \gamma \right)=0.8\mathrm{km}/\mathrm{h} \); and tilted segment with slope \( d{\widehat{x}}_{13}/d\tilde{t}=w=4\mathrm{km}/\mathrm{h} \). Saturation waves \( {t}_1^{\#}\left(\tilde{x}\right) \), \( {t}_2^{\#}\left(\tilde{x}\right) \) and \( {t}_3^{\#}\left(\tilde{x}\right) \) present a characteristic slope \( \leftd\tilde{t}/d\tilde{x}\right=1/w=0.25\mathrm{h}/\mathrm{km} \) or equivalently \( \leftd\tilde{x}/d\tilde{t}\right=w=4\mathrm{km}/\mathrm{h} \).
As the third lot is closer to the second lot (their relative distance is 100 meters) than the first one (150 meters away from the second lot), a simplistic reasoning would suggest that all users who cannot park in the second lot would transfer to the third lot leaving the first parking lot unsaturated. As it turns out, users’ transfers are more complex. If we compare the configuration of efficiency domains presented in Fig. 8 with the very simple efficiency domains of the first iteration presented in Fig. 5, the following kinematics of transfer can be inferred:

When lot 2 gets saturated, vehicles are partly transferred to lot 1 and, in almost equal proportion to lot 3;

This additional parking flow on lot 1 leads to its saturation, subsequent users are then transferred from lot1 1 to lot 3.
Once efficiency domains are built, users (characterized by their destination point \( \tilde{x} \) and preferred arrival time \( \tilde{t} \)) choosing each parking option are known and it is possible to perform parking assignment on the three parking options. Figure 9 provides the time evolution of the cumulated parking flow on each parking lot, calculated at discrete times, where the solid lines guide the eye. A few general observations on this time evolution:

Cumulated flows of parking lots 1 and 2 present a steady increase up to their saturation times where a discontinuity appears: a group of users arrive to the parking at the same time in a “final rush”;

Saturation of lot 2 is followed by an increase of the cumulated flow slopes for parking lots 1 and 3: users transferred from the saturated parking lot 2, add to the users willing to park at the parking options 1 and 3;

In the same manner when parking lot 1 gets saturated, it is followed by an increase in lot 3 cumulated flow’s slope.
As a reminder, users choose not only the parking option but also the parking time, within time saturation constraints of the parking option, allowing them to minimize their generalized cost. It is equivalent to minimizing the gap between their preferred arrival time and possible early arrival. When unconstrained, they will park at a time such that walking time from the parking lot to their destination will make them reach their destination exactly on time. When constrained they will park at the saturation time of the parking option. Constrained users will therefore arrive at the same time, forming a group of “final rush” to the parking lot, saturating it completely. This group is formed by approximately 6 vehicles for the parking option 1 and 1 vehicle for the parking option 2.
Table 3 provides total cumulated parking flows on the three parking lots. Parking lots 1 and 2 are saturated and their total cumulated flow is equal to their capacity of 30 and 10 vehicles respectively. Parking lot 3 is not saturated, its total cumulated flow is equal to 40 vehicles, less than its capacity of 60 vehicles. Compared to the initial demand given in the table 1, net variation of the demand was calculated. 14 users were transferred from the parking option 2 to the other lots, 3 net additional vehicles were transferred to lot 1 (the actual positive transfers might be more important but negative transfers occur too), 11 additional vehicles were transferred to lot 3 (both from parking lots 1 and 2 as described in Fig. 8).
Assignment at equilibrium leads to the generalized cost for different users that is depicted in Fig. 10. Continuity of the generalized cost at the efficiency domains boundaries between the three options can be noted. Lower values of generalized cost are observable for abscissae equal to the location of the parking lots at respectively 50, 200 and 300 meters, in the unconstrained region of these lots. Indeed for users in these points, generalized cost is only due to driving time from the entry node to the parking lot. In the unconstrained regions, generalized cost increases when destination location is located further away from the parking lot due to the additional walking time from there to the destination. In the constrained regions additional cost is due to the gap between preferred arrival time and early arrival time.
Maximum cost is observed for users whose destination is the entry node and who are willing to arrive at 9 h. These users either have to park at the parking lot 1 at 8h45min, which implies driving 50 meters (0.15 minutes with a marginal cost of 1/min), walk 50 meters back (0.75 minutes with a marginal cost of 1.5/min) and arrive very early at the destination (approximately 14 min early with a marginal cost of 0.5/min) leading to a generalized cost of approximately 9 min or 0.15 hours. Alternatively they can park at the parking lot 3 located at the opposite end of the street, which implies driving there and then walking back 300 meters (4.5minute walk with a marginal cost of 1.5/min and approximately 1min drive with a marginal cost of 1/min) leading to a generalized cost of approximately 8 min or 0.13 hours. Parking at the parking lot 2 is even more costly as it would imply parking at 8 h22’ with a preceding 0.6min drive and a subsequent 3min walk, arriving approximately 35 min early, which would lead to a generalized cost of 23 min or 0.38 hours. This result is counterintuitive as parking lot 2 is closer to the entry node than the parking lot 3, it would therefore be expected that users choose between parking lots 1 and 2 rather than between lots 1 and 3.
Conclusion
To summarize, the interplay of parking supply and demand has been modeled in a framework of deterministic, dynamic user equilibrium. Parking demand is continuously disaggregated according to destination point and preferred time of arrival. Every user behaves as a selfish, individual decisionmaker in the choice of parking lot and time. The pattern of preferences for the options’ attributes is homogenous. Parking supply is made up of a set of lots each with a position, a capacity and a saturation time. Based on the saturation times, to each lot is associated an efficiency region in the plane of destination places and preferred times. In turn, the aggregation of user flows according to their selected lot and parking time yields the lot saturation times. The user equilibrium of parking traffic amounts to a fixed point problem with respect to the saturation times: when parking capacity exceeds demand volume then there exists an equilibrium state. Computation schemes have been provided for efficiency regions and for equilibrium saturation times.
The two main properties are, first, the structure of the lots’ efficiency regions in space and time, second, the fundamental role of the saturation times as the basic state variables of the parking system. These endogenous variables act as dual variables for market coordination. A lot saturation time bears some resemblance to a critical time at which a traffic bottleneck gets saturated: parking capacity, however, is a storage capacity that enables for the joint arrival of the last customers, contrarily to the bottleneck capacity which is a flow capacity that preserves the order of vehicles [3].
Our model contributes to bridging a gap between theoretical economic models of parking, on the one hand, and network simulation models, on the other hand. The microeconomic theory of parking relies upon simplified models where supply is stylized with one or two places or a uniform distribution along an interval, whereas demand is stylized with one or two destination places and a homogenous pattern of behavior. Our model of supply is much richer as it can accommodate any set of lots along an axis – yet for trips from one or two origins only and with no route choice, while network simulation models cover multiple origins and routes. Our model of demand is richer than in economic models, too, as both the destination places and the preferred times of arrival are disaggregated continuously: yet with homogenous behavior and no issue of parking duration, while network simulation models can address several types of behaviors and distributed duration.
Further research along our lines can be developed in diverse directions:

To model the influences of complex parking tariff schemes on the efficiency regions, by adapting our eventbased algorithm.

To model a network structure with multiple routes and origindestination pairs.

To theorize system optimum for the modeled parking system, paying consideration to optimal pricing and capacity sizing.

To theorize imperfect information and compare it to the present model under perfect information

To differentiate several user classes in terms of walk / drive / delay / tariff preferences and of parking duration.

To model withinday dynamics and the tidal cycle of parking lots during the day and night.

Keeping to the street level, to model parking supply continuously in order to derive local state equations.
References
 1.
Anderson SP, De Palma A (2004) The economics of pricing parking. J Urban Econ 55:1–20
 2.
Arnott R, de Palma A, Lindsey R (1991) A temporal and spatial equilibrium analysis of commuter parking. J Publ Econ 45:301–335
 3.
Arnott R, de Palma A, Lindsey R (1993) A structural model of peak period congestion: a traffic bottleneck with elastic demand. Am Econ Rev 83:161–179
 4.
Arnott R, Inci E (2006) An integrated model of downtown parking and traffic congestion. J Urban Econ 60:418–442
 5.
Benenson I, Martens K, Birfir S (2008) PARKAGENT: an agentbased model of parking in the city. Comput, Environ Urban Syst 32:431–439
 6.
Dieussaert K, Aerts K, Steenberghen T, Maerivoet S, Spitaels K (2009) SUSTAPARK: an agentbased model for simulating parking search, proceedings of the 12th agile international conference on geographic information science. Leibnitz Universität, Hannover
 7.
Gallo M, D’Acierno L, Montella B (2011) A multilayer model to simulate cruising for parking in urban areas. Transp Policy 18:735–744
 8.
Horni A, Montini L, Waraich RA, Axhausen KW (2012) An agentbased cellular automaton cruisingforparking simulation. 13th Int Conf Travel Res Behav (IATBR), Toronto
 9.
Huang HJ, Li ZC, Lam WHK, Wong SC (2005) A timedependent activity and travel choice model with multiple parking options. In: Mahmassani H (ed) Transportation and traffic theory. Elsevier, 717–739
 10.
Lam WHK, Li ZC, Huang HJ, Wong SC (2006) Modeling timedependent travel choice problems in road networks with multiple user classes and multiple parking facilities. Transp Res B 40:368–395
 11.
Leurent F, Boujnah H (2012) Traffic equilibrium in a network model of parking and route choice, with search circuits and cruising flows. Elsevier Proc  Soc Behav Sci 54:808–821
 12.
Li ZC, Huang HJ, Lam WHK, Wong SC (2007) A model for evaluation of transport policies in multimodal networks with road and parking capacity constraints. J Math Model Algorithms 6:239–257
 13.
Li ZC, Huang HJ, Lam WHK, Wong SC (2007b) Timedifferential pricing of road tolls and parking charges in a transport network with elastic demand. In: Bell MGH et al. (eds) Transportation and Traffic Theory
 14.
Li ZC, Lam WHK, Wong SC, Huang HJ, Zhu DL (2008) Reliability evaluation for stochastic and timedependent networks with multiple parking facilities. Netw Spatial Econ 8:355–381
 15.
Martens K, Benenson I, Levy N (2010) The dilemma of onstreet parking policy: exploring cruising for parking using an agentbased model. In: B. Jiang and X. Yao, eds., Geospatial analysis and modelling of urban structure and dynamics, GeoJournal Library 99, Springer Science Business Media B.V., 121–138
 16.
Niérat P (1997) Market area of railtrucks terminals: pertinence of the spatial theory. Transp Res A 31(2):109–127
 17.
Qian ZS, Xiao FE, Zhang HM (2011) The economics of parking provision for the morning commute. Transp Res A 45:861–879
 18.
Qian ZS, Rajagopal R (2013) Optimal parking pricing in general networks with provision of occupancy information. Proc – Soc Behav Sci 80:779–805
 19.
Waraich RA, Axhausen KW (2012) An agentbased parking choice model, paper presented at the 91st annual Meeting of the Transportation Research Board, Washington, DC
 20.
Zhang X, Huang HJ, Zhang HM (2008) Integrated daily commuting patterns and optimal road tolls and parking fees in a linear city. Transp Res B 42:38–56
Acknowledgments
This work takes place in the Research and Education Chair on the EcoDesign of Building Sets and Infrastructure, a partnership between ParisTech and the Vinci Group, which we thank for their support. We are also grateful to two anonymous referees and an editor for their helpful comments and suggestions.
Author information
Appendix
Appendix
Notations introduced in the Appendix
 \( d\mu =\tilde{q}\left(\tilde{t}\right)\;d\tilde{t} \) :

Lebesgue measure, used in the integration of \( f\left({\overline{\mathbf{t}}}_{\mathrm{I}}\Big\tilde{t}\right) \)
 e :

Vector of efficient lots, of size N
 e(n):

Efficient lot of rank n, e(n) ∈ I
 \( {E}_i\left(\tilde{t}\right) \) :

Efficiency interval of the lot i at the time e(n)
 \( f\left({\overline{\mathbf{t}}}_{\mathrm{I}}\Big\tilde{t}\right) \) :

Auxiliary function, used to simplify notations
 g _{ i } ^{∗} :

Minimal cost of parking at the lot i
 \( {g}_i\left(\tilde{x}\right) \) :

Uncongested cost of parking at the lot i for a user with the preferred destination \( \tilde{x} \)
 hyp(.):

Hypograph of a function
 μ/λ :

Auxiliary variables, μ ∈ ℜ and λ ∈ ℜ
 N :

Number of nonempty efficient domains
 n :

Sequenced efficiency rank of the parking option e(n)
 P :

Intersection point between \( {x}_i^{}\left(\tilde{t}\right) \) and \( {x}_i^{+}\left(\tilde{t}\right) \)
 π(i)/ σ(i):

Active predecessor/successor of the lot i at the current base time \( {\widehat{t}}_i \)
 ℜ :

Set of real numbers
 \( {\widehat{t}}_i \) :

Current base time defining the current state of the lot i
 t _{ i } ^{−} / t _{ i } ^{+} :

Predicted moment (from the current state of the lot i) when saturation wave from the lot i reaches lower/upper efficiency frontier x _{ i } ^{−} / x _{ i } ^{+}
 t _{ i } ^{max} :

Minimal time when x _{ i } ^{−} (t _{ i } ^{max} ) = x _{ i } ^{+} (t _{ i } ^{max} ), or equivalently when the width function of the efficiency domain of the lot i becomes null
 \( {\overset{.}{x}}_i^{} \)/ \( {\overset{.}{x}}_i^{+} \) :

Derivatives of the lower/upper boundary function \( {x}_i^{}\left(\tilde{t}\right) \)/ \( {x}_i^{+}\left(\tilde{t}\right) \) with respect to \( \tilde{t} \)
An algorithm to determine the efficiency domains
Let us provide an algorithm to determine the sequence of efficiency domains.
Endogenous variables are the number of nonempty efficient domains, N, and a vector of integers, e = [e(n) : n = 1,.. I], such that n is the efficiency rank of the parking option e(n) ∈ I in the ordered sequence of nonempty efficiency domains. Provisional values are progressively updated by considering every parking option in turn. Let also i, j, k be working variables for options under consideration.
The algorithm Uncongested Efficiency Frontier consists in the following steps.
Denote N the number of nonempty efficiency intervals (the value of n at the end of the algorithm). Once the sequence of efficient options is known given by the vector e, it only remains to evaluate the limit values \( {\widehat{x}}_{ij} \) for i = e(n), j = e(n + 1), for n ∈ {1,.. N − 1} on the basis of (3.6). From these stem the x _{ i } ^{−} and x _{ i } ^{+} values of nonempty efficient domains, to be completed by x _{1} ^{−} = 0 and x _{ N } ^{+} = L.
In the performance of the Main step, the i variable is incremented so that there are at most I such steps. Within a main step, there are two Repeat loops that are mutually exclusive; any iteration of an internal loop dismisses an option that is inefficient, so it will not be considered any further. The number of such elementary loops is equal to the number of inefficient options. Furthermore, as each Main step yields an efficient option, there are at most I of them. So the computational cost of the main steps save for their repeat steps is O(I), as is that of the repeat steps throughout the algorithms. To sum up, the overall complexity is O(I).
An eventbased algorithm to build the efficiency regions
To build the efficiency regions, a naïve algorithm is to build the efficiency domains of a predetermined sequence of say K preferred times, hence to scan the time axis for such domains. At a given instant, that search would amount to the Uncongested Efficiency Frontier algorithm provided in § 3.1. So the overall complexity of the naïve algorithm will be O(K. I). Furthermore, between two successive times of scanning the efficiency domains must be interpolated, yielding approximate results only.
A more clever, eventbased algorithm is to build the efficiency regions in a progressive way on the basis of “critical instants” at which significant events may occur.
For a parking lot i, starting from its initial efficiency domain [x _{ i } ^{−} (t _{min}), x _{ i } ^{+} (t _{min})], the major events are respectively:

(i)
initial saturation at x _{ i }, at time \( {\overline{t}}_i \): starting point of the saturation wave from lot i,

(ii)
upper saturation at x _{ i } ^{+} : saturation wave from lot i meeting the upper efficiency frontier,

(iii)
lower saturation at x _{ i } ^{−} : saturation wave from lot i meeting the lower efficiency frontier,

(iv)
closure of the efficiency domain when x _{ i } ^{+} = x _{ i } ^{−} .
Event (i) must occur prior to (ii) and (iii), which must both be accomplished for (iv) to occur (apart from meeting an external bound i.e. x _{ i } ^{−} = 0 or x _{ i } ^{+} = L). These events are generated from the lot itself on the basis of a current state characterized by a base time \( {\widehat{t}}_i \) and the associated timed values of x _{ i } ^{−} , \( {\overset{.}{x}}_i^{} \), x _{ i } ^{+} , \( {\overset{.}{x}}_i^{+} \). These data enable one to predict the critical instants: for instance, when \( {\widehat{t}}_i>{\overline{t}}_i \) and saturation wave has not yet reached the lower bound x _{ i } ^{−} , then under constant conditions the occurrence instant of lower saturation can be predicted as t _{ i } ^{−} such that the position of the predicted lower bound at that time,
would be reached by lot saturation wave, which would occur at time \( {\overline{t}}_i+\left({x}_i{x}_i^{}\right)/w \) since the lower bound lies under the lot position. Thus \( {t}_i^{}={\overline{t}}_i+\left({x}_i{x}_i^{}{\overset{.}{x}}_i^{}.\;\left({t}_i^{}{\widehat{t}}_i\right)\right)/w \) under the current values of x _{ i } ^{−} and \( {\overset{.}{x}}_i^{} \), leading to
While \( {\widehat{t}}_i<{\overline{t}}_i \) it is useless to predict t _{ i } ^{−} . To describe the state of lot i completely it suffices to add the current “active neighbors” i.e. predecessor π(i) and successor σ(i) at \( {\widehat{t}}_i \), and to indicate by binary variables whether central saturation, lower saturation and upper saturation, respectively, has already occurred.
Aside from its own major events, the lot can be affected by events minor to it but major to an immediate neighbor, π(i) or σ(i): a change in \( {\overset{.}{x}}_{\pi (i)}^{+} \) or \( {\overset{.}{x}}_{\sigma (i)}^{} \) will induce an equal change in \( {\overset{.}{x}}_i^{} \) or \( {\overset{.}{x}}_i^{+} \), respectively.
The closure of lot i as an efficiency region will lead to reassign active neighbors, by letting σ(π(i)) := σ(i), π(σ(i)) := π(i) and evaluating the intermediary speed \( {\overset{.}{x}}_{\pi}^{+}={\overset{.}{x}}_{\sigma}^{} \) on the basis of the current state of both active lots.
To correctly enumerate the critical instants, it suffices to maintain a list of the next critical times, one by active lot, and to deal with the event of minimum critical time in the list. The treatment of the event involves the associated lot and its two active neighbors, of which the current time will be updated as well as their current states and prediction of next events; their position in the waiting list must be revised accordingly.
An initialization step is needed to determine the initial efficiency domains and the related states. It is performed in O(I).
Each treatment involves at most three lots and a small number of operations for each of them – by lot, at most two next critical instants need to be reevaluated. By dealing with the waiting list as a binary heap, the search for the minimum has a computational cost of O(ln I), as has the deletion of an outdated “next” event and the insertion of an updated next event.
As there are at most 4 treatments by lot, the overall complexity of the eventbased algorithm is O(I. ln I). Not only can the term in ln I be expected to be much lower than the number of predetermined times in the naïve algorithm, but also the treatment of one event is much more economical than the search of the efficiency domains at a given time and the interpolation of efficiency domains between successive instants of scanning. Overall, the eventbased algorithm is a greedy algorithm that will perform much better than the naïve one.
The connectedness of an efficiency region
In section 5.2 we established that an efficiency domain of a parking lot i, E _{ i }, is bounded on the left side by function x _{ i } ^{−} and on the right side by function x _{ i } ^{+} , both of which are continuous and affine:
Let us now consider the efficiency domain E _{ i } of lot i. If it is not empty, then it comprises at least one connected region including its efficiency interval at the initial instant (as postulated from Section 3). Two situations may hold, depending on whether the width function \( \tilde{t}\mapsto {\left({x}_i^{+}\left(\tilde{t}\right){x}_i^{}\left(\tilde{t}\right)\right)}^{+} \) remains strictly positive or reaches zero on the demand domain. In the former case, at every \( \tilde{t} \) the efficiency interval of i, \( {E}_i\left(\tilde{t}\right) \), is an interval and there can be no point \( \left(\tilde{x},\tilde{t}\right) \) outside of it where lot i would be efficient. In the latter case, let t _{ i } ^{max} denote the minimum time at which x _{ i } ^{−} (t _{ i } ^{max} ) = x _{ i } ^{+} (t _{ i } ^{max} ) and P denote the intersection point between \( {x}_i^{}\left(\tilde{t}\right) \) and \( {x}_i^{+}\left(\tilde{t}\right) \). The following proof by contradiction will show that the width function cannot become positive at a later moment, thereby proving the connectedness of the efficiency region. We shall study the case where P is located in the \( \tilde{x}\ge {x}_i \) region and symmetrical reasoning will hold in the \( \tilde{x}\le {x}_i \) region.
Let us consider three moments t _{1} < t _{2} = t _{ i } ^{max} < t _{3} such that (illustrated in Fig. 11):

At t _{1} and until t _{2}, x _{ i } ^{−} is defined through bilateral competition between lot i and j _{ 1 } and x _{ i } ^{+} is defined through bilateral competition between lot i and k _{ 1 }. And the width function \( \tilde{t}\mapsto {\left({x}_i^{+}\left(\tilde{t}\right){x}_i^{}\left(\tilde{t}\right)\right)}^{+} \) is strictly positive (first efficiency region). Therefore \( {x}_i^{}\left({t}_1\right)={\widehat{x}}_{i{j}_1}\left({t}_1\right)<{\widehat{x}}_{i{k}_1}\left({t}_1\right)={x}_i^{+}\left({t}_1\right) \).

At t _{2} = t _{ i } ^{max} , the width function reaches zero for the first time: \( {x}_i^{}\left({t}_2\right)={\widehat{x}}_{i{j}_1}\left({t}_2\right)={\widehat{x}}_{i{k}_1}\left({t}_2\right)={x}_i^{+}\left({t}_2\right) \).

At t _{3}, by assumption, the width function has become positive again (second efficiency region): x _{ i } ^{−} stems from bilateral competition between lots i and j _{ 2 } whereas x _{ i } ^{+} comes from bilateral competition between lots i and k _{ 2 }. This can be expressed as: \( {x}_i^{}\left({t}_3\right)={\widehat{x}}_{i{j}_2}\left({t}_3\right)<{\widehat{x}}_{i{k}_2}\left({t}_3\right)={x}_i^{+}\left({t}_3\right) \).
From their definitions in section 5.2, \( {x}_i^{}\left(\tilde{t}\right)={ \max}_{j<i}{\widehat{x}}_{ij}\left(\tilde{t}\right) \) and \( {x}_i^{+}\left(\tilde{t}\right)={ \min}_{j>i}{\widehat{x}}_{ij}\left(\tilde{t}\right) \), the following relations can also be established:
\( {\widehat{x}}_{i{j}_1}\left({t}_3\right)\le {\widehat{x}}_{i{j}_2}\left({t}_3\right) \) and \( {\widehat{x}}_{i{k}_1}\left({t}_3\right)\ge {\widehat{x}}_{i{k}_2}\left({t}_3\right) \) (property A.3.1)
For \( {x}_i^{}\left(\tilde{t}\right) \) to cross \( {x}_i^{+}\left(\tilde{t}\right) \) in region \( \tilde{x}\ge {x}_i \), the segment resulting from the competition between i and j _{ 1 } crossing \( {x}_i^{+}\left(\tilde{t}\right) \) must have the slope w since this is the only way to pass x _{ i } in a bilateral competition between i and any lot j < i. Therefore, at P lot i must be saturated and further evolution of the bilateral competition frontier \( {\widehat{x}}_{i{j}_1}\left(\tilde{t}\right) \) is strictly monotonously increasing (bilateral competition of type shown in Fig. 4b). This leads to \( {\widehat{x}}_{i{j}_1}\left({t}_3\right)>{\widehat{x}}_{i{j}_1}\left({t}_2\right) \). Therefore, using property A.3.1, \( {\widehat{x}}_{i{j}_2}\left({t}_3\right)>{\widehat{x}}_{i{j}_1}\left({t}_2\right) \)
Consider now the lot k _{1} > i that induces the segment of \( {x}_i^{+}\left(\tilde{t}\right) \) intersecting \( {x}_i^{}\left(\tilde{t}\right) \). Either it is saturated at P (case 1) and its competitive frontier with i has the type shown in Fig. 4a: then the segment of \( {\widehat{x}}_{i{k}_1}\left(\tilde{t}\right) \) intersecting \( {x}_i^{}\left(\tilde{t}\right) \) is vertical (upper stable frontier) and its further evolution (for \( \tilde{t}>{t}_i^{\max } \)) can be considered as monotonously decreasing. Or, it is unsaturated at P (case 2), in which case the intersecting segment has slope − wγ/(2β − γ) and the further evolution of the bilateral frontier \( {\widehat{x}}_{i{k}_1}\left(\tilde{t}\right) \) is also monotonously decreasing. This leads to \( {\widehat{x}}_{i{k}_1}\left({t}_3\right)\le {\widehat{x}}_{i{k}_1}\left({t}_2\right) \). Therefore, using property A.3.1, \( {\widehat{x}}_{i{k}_2}\left({t}_3\right)\le {\widehat{x}}_{i{k}_1}\left({t}_2\right) \).
As a consequence \( {x}_i^{}\left({t}_3\right)={\widehat{x}}_{i{j}_2}\left({t}_3\right)>{\widehat{x}}_{i{j}_1}\left({t}_2\right)={\widehat{x}}_{i{k}_1}\left({t}_2\right)\ge {\widehat{x}}_{i{k}_2}\left({t}_3\right)={x}_i^{+}\left({t}_3\right) \), leading to x _{ i } ^{−} (t _{3}) > x _{ i } ^{+} (t _{3}), in contradiction with the initial hypothesis.
Thus E _{ i } is reduced to its initial region – meaning that it is a connected subspace.
Regularity properties of T _{ I }
In this section we will turn to the analysis of a lot i and in particular to the analysis of the regularity properties of function \( {T}_i\left({\overline{\mathbf{t}}}_{Ii}\right)= \inf \left\{\kern0.5em t\le {t}_{\max }:\;{\widehat{Q}}_i\left(t\left\;{\overline{\mathbf{t}}}_{Ii}\right.\right)\ge {k}_i\right\} \) in order to derive those of function T _{ I }.
Lot i has potentially neighbouring lots j < i and/or k > i. With these neighbours the lot i shares a bilateral frontier respectively \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) and \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \).
From the analysis of the expressions given in the section 5.1, it is easy to derive following properties for the two functions \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) and \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \):

Recalling section 5.1, for a given set \( \left({\overline{t}}_j,{\overline{t}}_i,{\overline{t}}_k\right) \), \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) and \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \) are piecewise affine, continuous and monotonous (either increasing or decreasing). In particular \( {\widehat{x}}_{ij}^0 \) and \( {\widehat{x}}_{ik}^0 \) are constants, independent of \( \left({\overline{t}}_j,{\overline{t}}_i,{\overline{t}}_k\right) \).

Their expressions are valid only for certain values of \( {\overline{t}}_i \) relative to \( {\overline{t}}_j \) and \( {\overline{t}}_k \). See Figs. 12 and 13 showing schematically the four regions of \( {\overline{t}}_i \) with respect to \( {\overline{t}}_j \) and \( {\overline{t}}_k \) and corresponding types of bilateral frontier, referring to the Fig. 4a and b and their symmetrical graphs. Let us denote \( {\beta}_r={\scriptscriptstyle \frac{2\beta \gamma }{\gamma w}} \) then these expressions become :

For \( {t}_{\max }>{\overline{t}}_i\ge {\overline{t}}_j+{\beta}_r\left({\widehat{x}}_{ij}^0{x}_j\right){w}^{1}\left({x}_i{\widehat{x}}_{ij}^0\right) \), \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) is decreasing and is of type presented in Fig. 4b. Equivalently for \( {t}_{\max }>{\overline{t}}_i\ge {\overline{t}}_k+{\beta}_r\left({x}_k{\widehat{x}}_{ik}^0\right){w}^{1}\left({\widehat{x}}_{ij}^0{x}_i\right) \), \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \) is increasing and of type symmetrical to the one presented in Fig. 4b.

For \( {\overline{t}}_j+\frac{{\widehat{x}}_{ij}^0{x}_j}{w}\frac{x_i{\widehat{x}}_{ij}^0}{w}\le {\overline{t}}_i<{\overline{t}}_j+{\beta}_r\left({\widehat{x}}_{ij}^0{x}_j\right)\frac{x_i{\widehat{x}}_{ij}^0}{w} \), \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) is decreasing and is of type presented in Fig. 4a. Equivalently for \( {\overline{t}}_k+\frac{x_k{\widehat{x}}_{ik}^0}{w}\frac{{\widehat{x}}_{ik}^0{x}_i}{w}\le {\overline{t}}_i<{\overline{t}}_k+{\beta}_r\left({x}_k{\widehat{x}}_{ik}^0\right)\frac{{\widehat{x}}_{ij}^0{x}_i}{w} \), \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \) is increasing and of type symmetrical to the one presented in Fig. 4a.

For \( {\overline{t}}_j+\frac{{\widehat{x}}_{ij}^0{x}_j}{w}{\beta}_r\left({x}_i{\widehat{x}}_{ij}^0\right)\le {\overline{t}}_i<{\overline{t}}_j+\frac{{\widehat{x}}_{ij}^0{x}_j}{w}\frac{x_i{\widehat{x}}_{ij}^0}{w} \), \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) is increasing and of type symmetrical to the one presented in Fig. 4a. Equivalently for \( {\overline{t}}_k+\frac{x_k{\widehat{x}}_{ik}^0}{w}{\beta}_r\left({\widehat{x}}_{ik}^0{x}_i\right)\le {\overline{t}}_i<{\overline{t}}_k+\frac{x_k{\widehat{x}}_{ik}^0}{w}\frac{{\widehat{x}}_{ik}^0{x}_i}{w} \), \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \) is decreasing and is of type presented in the Fig. 4a

For \( {t}_{\min}\le {\overline{t}}_i<{\overline{t}}_j+\frac{{\widehat{x}}_{ij}^0{x}_j}{w}{\beta}_r\left({x}_i{\widehat{x}}_{ij}^0\right) \), \( {\widehat{x}}_{ij}\left(\tilde{t}\right) \) is increasing and of type symmetrical to the one presented in Fig. 4b. Equivalently for \( {t}_{\min}\le {\overline{t}}_i<{\overline{t}}_k+\frac{x_k{\widehat{x}}_{ik}^0}{w}{\beta}_r\left({\widehat{x}}_{ik}^0{x}_i\right) \), \( {\widehat{x}}_{ik}\left(\tilde{t}\right) \) is decreasing and is of type presented in Fig. 4b

From this stems that for a given \( \tilde{t} \), \( {\widehat{x}}_{ij}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_j\right) \) is continuous everywhere except for two parametric curves \( \left({\overline{t}}_i={\overline{t}}_j+\frac{{\widehat{x}}_{ij}^0{x}_j}{w}{\beta}_r\left({x}_i{\widehat{x}}_{ij}^0\right),{\overline{t}}_j\right) \) and \( \left({\overline{t}}_i={\overline{t}}_j+{\beta}_r\left({\widehat{x}}_{ij}^0{x}_j\right)\frac{x_i{\widehat{x}}_{ij}^0}{w}\right),{\overline{t}}_j\Big) \), \( {\overline{t}}_j\in \aleph \), defined above (it can be easily shown that \( {\widehat{x}}_{ij}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_j\right) \) is continuous upon crossing \( \left({\overline{t}}_i={\overline{t}}_j+\frac{{\widehat{x}}_{ij}^0{x}_j}{w}\frac{x_i{\widehat{x}}_{ij}^0}{w},{\overline{t}}_j\right) \), \( {\overline{t}}_j\in \aleph \)). Since \( {\widehat{x}}_{ij}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_j\right) \) is decreasing with \( {\overline{t}}_i \) and increasing with \( {\overline{t}}_j \), by crossing such a curve in the leftupper direction (see schematic representation Fig. 12) the following piece of the function \( {\widehat{x}}_{ij}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_j\right) \) is continuous, and the value \( {\widehat{x}}_{ij}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_j\right) \) decreases: the function is rightcontinuous in the upperleft direction, see Fig. 12 in particular.
Equivalently \( {\widehat{x}}_{ik}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_k\right) \) is continuous everywhere except for two parametric curves \( \left({\overline{t}}_i={\overline{t}}_k+\frac{x_k{\widehat{x}}_{ik}^0}{w}{\beta}_r\left({\widehat{x}}_{ik}^0{x}_i\right),{\overline{t}}_k\right) \) and \( \left({\overline{t}}_i={\overline{t}}_k+{\beta}_r\left({x}_k{\widehat{x}}_{ik}^0\right)\frac{{\widehat{x}}_{ij}^0{x}_i}{w},{\overline{t}}_k\right) \), \( {\overline{t}}_k\in \aleph \) (see Fig. 13). Since \( {\widehat{x}}_{ik}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_k\right) \) is increasing with \( {\overline{t}}_i \) and decreasing with \( {\overline{t}}_k \), the function \( {\widehat{x}}_{ik}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_k\right) \) is rightcontinuous in the upperleft direction upon crossing such a curve, and the value \( {\widehat{x}}_{ik}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_k\right) \) increases (see in particular Fig. 13).
This analysis proves that ∀ j < i, \( {\widehat{x}}_{ij}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_j\right) \) is lower semicontinuous (l.s.c.); whereas ∀ k > i, \( {\widehat{x}}_{ik}^{\left(\tilde{t}\right)}\left({\overline{t}}_i,{\overline{t}}_k\right) \) is upper semicontinuous (u.s.c.).
These properties extend to \( {x}_i^{}\left(\tilde{t}\right)={ \max}_{j<i}{\widehat{x}}_{ij}\left(\tilde{t}\right) \) and \( {x}_i^{+}\left(\tilde{t}\right)={ \min}_{k>i}{\widehat{x}}_{ik}\left(\tilde{t}\right) \), therefore \( {x}_i^{}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right) \) is decreasing with \( {\overline{t}}_i \) and increasing with \( {\overline{t}}_j \), ∀ j < i, and is l.s.c.; whereas \( {x}_i^{+}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right) \) is increasing with \( {\overline{t}}_i \) and decreasing with \( {\overline{t}}_k \), ∀ k > i, and is u.s.c.
For a given \( \tilde{t} \), \( \tilde{h}\left(x\Big\tilde{t}\right) \) is nonnegative. Further let us assume that its integral function \( \tilde{H}\left(x\Big\tilde{t}\right) \) is continuous. This holds notably when \( \tilde{h}\left(x\Big\tilde{t}\right) \) is piecewise continuous. Then by composition of an u.s.c. function and a continuous function, \( \tilde{H}\left({x}_i^{+}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right)\Big\tilde{t}\right) \) is increasing with \( {\overline{t}}_i \) and decreasing with \( {\overline{t}}_k \), ∀ k > i, and is u.s.c. Whereas \( \tilde{H}\left({x}_i^{}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right)\Big\tilde{t}\right) \) is decreasing with \( {\overline{t}}_i \) and increasing with \( {\overline{t}}_j \), ∀ j < i, and is l.s.c. Hence \( \tilde{H}\left({x}_i^{}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right)\Big\tilde{t}\right) \) is increasing with \( {\overline{t}}_i \) and decreasing with \( {\overline{t}}_j \), ∀ j < i, and is u.s.c. Then, as the sum of two u.s.c. functions, \( \tilde{H}\left({x}_i^{+}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right)\Big\tilde{t}\right)\tilde{H}\left({x}_i^{}\left({\overline{t}}_i,{\overline{\mathbf{t}}}_{Ii}\right)\Big\tilde{t}\right) \) is increasing with \( {\overline{t}}_i \) and decreasing with \( {\overline{t}}_j \), ∀ j, and is upper semicontinuous.
Let us then denote (recalling (6.1) and (5.9)):
Given \( \tilde{t} \), denote \( f\left({\overline{\mathbf{t}}}_{\mathrm{I}}\Big\tilde{t}\right) \) \( \equiv {\left(\tilde{H}\left({x}_i^{+}\left(\tilde{t}\right)\Big\tilde{t}\right)\tilde{H}\left({x}_i^{}\left(\tilde{t}\right)\Big\tilde{t}\right)\right)}^{+} \) the u.s.c. function of \( {\overline{\mathbf{t}}}_I \).
Using suitable conditions of smoothness on the nonnegative function \( \tilde{q}\left(\tilde{t}\right) \), we can assume that for every \( {\overline{\mathbf{t}}}_I \), \( f\left({\overline{\mathbf{t}}}_{\mathrm{I}}\Big\tilde{t}\right) \) as a function of \( \tilde{t} \) is Lebesgueintegrable with respect to the measure \( d\mu =\tilde{q}\left(\tilde{t}\right)\;d\tilde{t} \). Then the integration of \( f\left({\overline{\mathbf{t}}}_{\mathrm{I}}\Big\tilde{t}\right) \) with respect to \( \tilde{t} \) and that measure, preserves the previously noted properties of u.s.c. with respect to \( {\overline{\mathbf{t}}}_I \) and of specific monotonicity with respect to \( {\overline{t}}_i \) and \( {\overline{\mathbf{t}}}_{Ii} \).
The u.s.c. property of function \( \left(t,{\overline{\mathbf{t}}}_{Ii}\right)\mapsto {\widehat{Q}}_i\left(t\left\;{\overline{\mathbf{t}}}_{Ii}\right.\right) \) is equivalent to the closedness of its hypograph set: recall that \( hyp\left({\widehat{Q}}_i\right)=\left\{\kern0.5em \left(t,{\overline{\mathbf{t}}}_{Ii},\mu \right)\in {\aleph}^I\times \Re\;:\kern0.62em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge \mu\;\right\} \) is closed.
As the intersection of closed sets is a closed set, the intersection of the hypograph with the closed set { μ = k _{ i }}, namely \( \left\{\kern0.5em \left(t,{\overline{\mathbf{t}}}_{Ii},{k}_i\right)\;:\kern0.62em \left(t,{\overline{\mathbf{t}}}_{Ii}\right)\in {\aleph}^I,\kern0.5em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge {k}_i\right\} \), is closed, too. So is its projection onto ℵ ^{I}, \( \left\{\kern0.1em \left(t,{\overline{\mathbf{t}}}_{Ii}\right)\in {\aleph}^I:\kern0.5em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge {k}_i\right\} \).
Thus the product set \( \left\{\kern0.1em \left(t,{\overline{\mathbf{t}}}_{Ii}\right)\in {\aleph}^I:\kern0.5em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge {k}_i\;\right\}\times \Re \) is closed, too: it can be rewritten as \( \left\{\kern0.1em \left(t,{\overline{\mathbf{t}}}_{Ii},\lambda \right)\in {\aleph}^I\times \Re :\kern0.5em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge {k}_i\right\} \).
As set \( \left\{\kern0.5em \left(t,{\overline{\mathbf{t}}}_{Ii},\lambda \right)\in {\aleph}^I\times \Re :\kern0.5em t\le \lambda\;\right\} \) is closed, so is its intersection with the previous one: \( \left\{\kern0.1em \left(t,{\overline{\mathbf{t}}}_{Ii},\lambda \right)\in {\aleph}^I\times \Re :\kern0.2em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge {k}_i, \kern0.5em t\le \lambda\;\right\} \).
Thus the restriction to every t ∈ ℵ, \( {\mathrm{R}}_t=\left\{\kern0.2em \left({\overline{\mathbf{t}}}_{Ii},\lambda \right)\in {\aleph}^{I1}\times \Re :\kern0.5em {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right)\ge {k}_i,\kern0.5em \lambda \ge t\;\right\} \) is closed.
Now, let us take the intersection over {t ≤ t _{max} } of the collection of such sets parameterized by t ∈ ℵ: it is a closed set as an intersection of closed sets. Furthermore, as \( {\widehat{Q}}_i\left(t,{\overline{\mathbf{t}}}_{Ii}\right) \) is increasing with respect to t, the most stringent condition of inequality involving \( {\widehat{Q}}_i \) applies at the minimal value of t, so the intersection set amounts to
This shows that the hypograph of mapping T _{ i } is closed, hence that T _{ i } is upper semicontinuous.
Lastly, the mapping T _{ I } = (T _{ i } : i ∈ I) is u.s.c. with respect to \( {\overline{\mathbf{t}}}_I \) as the product of u.s.c. mappings.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Received
Accepted
Published
DOI
Keywords
 Parking capacity
 Demandsupply equilibrium
 Utility function
 Market area
 Traffic wave