Skip to main content
Log in

Guiding traffic in the case of big events with spot checks on traffic and additional parking space requirements

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

Big events lead to temporary very high traffic volumes which usually exceed traffic capabilities of the existing infrastructure. Hence, it is necessary to control traffic in a way that helps to keep traffic congestion as low as possible. In this paper we introduce a traffic planning model for big events which optimizes traffic routing, allocates parking space, and defines locations for spot checks on traffic. We extend and modify a traffic flow model that has successfully been used in previous work on evacuation planning. A computational study demonstrates the model’s applicability to a real world situation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Abbreviations

T :

Set of periods of the planning horizon with | T | as the last period

N :

Set of different cell sizes

I :

Set of cells

I n :

Set of cells of cell size n

c i :

Weight of cell i

β ij :

= 1, if a connection between cell i and cell j exists (0, otherwise)

N i :

Maximum number of vehicles that can reside in cell i in one period per lane

Q i :

Maximum number of vehicles that can flow into/flow out from a cell i per period/lane

s i :

Number of existing lanes in cell i

C i :

Maximum parking capacity in cell i

x it :

Number of vehicles that reside in cell i at the end of period t

b it :

Number of vehicles that start their trip in cell i in period t

y ijt :

Number of vehicles that leave cell i in period t and arrive in cell j in period t + 1

\({y^k_{iit}}\) :

Number of vehicles that move inside of cell i in period t for the kth time This decision variable is used because of the different sell sizes

I Q :

Set of cells where entering the network is possible

I S :

Set of cells where parking is possible

E i :

Number of vehicles entering the network in cell i

p it :

Number of vehicles that start parking in cell i in period t

P it :

Number of vehicles parking in cell i in period t

z it :

Number of lanes that are used for parking in cell i in period t

R :

Set of different regions in the network

I r :

Set of cells within region r

I A :

Set of cells where the vehicles can leave the network (I A I Q )

I S :

Set of cells from where the vehicles start their trip home. These cells can be used for parking during the length of the event

P i :

Number of vehicles starting their trip home in cell i. These vehicles have been allocated to the cells for parking within the planning of the incoming traffic (PiP i T).

Z i :

Number of restricted lanes in cell i. This parameter results from the Planning of the incoming traffic. The lanes are restricted for parking (Z i z iT )

V :

Number of police patrol cars that can be allocated to do spot checks

kd :

Duration of a spot check

 km :

Number of vehicles that have to pass the spot check

 km S :

Maximum number of vehicles that can be checked by one police patrol car at the same time

a it :

Number of vehicles leaving the network through cell i in period t

g it :

Number of vehicles that start the spot check in cell i in period t

G it :

Number of vehicles residing in the spot check in cell i in period t

v i :

Number of police patrol cars placed in cell i to realize spot checks

\({ \hat{z_i}}\) :

Number of lanes that have to be restricted for realizing spot checks

References

  • Daganzo CF (1994) The cell transmission model: a dynamic representation of highway traffic consistent with the Hydrodynamic theory. Transp Res Part B 28(4): 269–287

    Article  Google Scholar 

  • Daganzo CF (1995) The Cell transmission model, part II: network traffic. Transp Res Part B 29(2): 79–93

    Article  Google Scholar 

  • Ganji SS, Barari A, Ibsen LB, Domairry G (2010) Differential transform method for mathematical modeling of jamming transition problem in traffic congestion flow. Cent Eur J Operat Res (to appear)

  • Gipps PG (1981) A behavioural car-following model for computer simulation. Transp Res Part B 15: 105–111

    Article  Google Scholar 

  • Kimms A, Maassen K-C (2009) Extended cell-transmission-based evacuation planning in Urban areas, working paper. University of Duisburg-Essen

  • Meng Q, Khoo HL, Cheu RL (2008) Microscopic traffic simulation model-based optimization approach for the contraflow lane configuration problem. J Transp Eng 134(1): 41–49

    Article  Google Scholar 

  • Pusztai P (2008) An application of the greedy Heuristic of set cover to traffic checks. Cent Eur J Operat Res 16(4): 407–414

    Article  Google Scholar 

  • Si BF, Long JC, Gao ZY (2008) Optimization model and algorithm for mixed traffic of Urban road network with flow interference. Sci China Ser E Technol Sci 51(12): 2223–2232

    Article  Google Scholar 

  • Yao T, Mandala SR, Chung BD (2009) Evacuation transportation planning under uncertainty: a Robust optimization approach. Networks Spatial Econ 9: 171–189

    Article  Google Scholar 

  • Zhang H, Gao Z (2007) Two-way road network design problem with variable lanes. J Syst Sci Syst Eng 16(1): 50–61

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Kimms.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kimms, A., Maassen, KC. & Pottbäcker, S. Guiding traffic in the case of big events with spot checks on traffic and additional parking space requirements. Cent Eur J Oper Res 20, 755–773 (2012). https://doi.org/10.1007/s10100-011-0202-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-011-0202-y

Keywords

Navigation