Freeway service patrol deployment planning for incident management and congestion mitigation

Yingyan Lou, Yafeng Yin, Siriphong Lawphongpanich

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

This paper investigates the problem of deploying freeway service patrols to detect, respond to and clear traffic incidents in two settings, deterministic and stochastic. The deterministic setting assumes that there is only one scenario of incident occurrence and, in the stochastic counterpart, there are many scenarios, each of which occurs with a probability. The main objective of both problems is to minimize the total incident response time. Rather than minimizing the expected total response time, the stochastic model minimizes the expected total response time over the high-consequence scenarios instead. In both settings, the deployment problem can be formulated as a mixed-integer nonlinear optimization problem, a hard class of problem to solve. To obtain solutions in a reasonable amount of time, three heuristic algorithms are proposed. In particular, one makes use of the dual information, another employs a neighborhood search technique and the third uses simulated annealing, a meta-heuristic algorithm. Numerical experiments based on data from Sioux Falls demonstrate that all three algorithms provide solutions with a significant reduction in total response time without using an excessive amount of CPU time.

Original languageEnglish (US)
Pages (from-to)283-295
Number of pages13
JournalTransportation Research Part C: Emerging Technologies
Volume19
Issue number2
DOIs
StatePublished - Apr 2011
Externally publishedYes

Fingerprint

Highway systems
Heuristic algorithms
incident
Response time (computer systems)
Planning
planning
Stochastic models
Simulated annealing
management
Program processors
scenario
heuristics
Experiments
time
Mitigation
Congestion
Incidents
Response time
traffic
Scenarios

Keywords

  • Congestion mitigation
  • Deployment planning
  • Freeway service patrol
  • Incident management

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Automotive Engineering
  • Transportation

Cite this

Freeway service patrol deployment planning for incident management and congestion mitigation. / Lou, Yingyan; Yin, Yafeng; Lawphongpanich, Siriphong.

In: Transportation Research Part C: Emerging Technologies, Vol. 19, No. 2, 04.2011, p. 283-295.

Research output: Contribution to journalArticle

@article{cfbf8731e2d24e889ccfcb828b1f3ebb,
title = "Freeway service patrol deployment planning for incident management and congestion mitigation",
abstract = "This paper investigates the problem of deploying freeway service patrols to detect, respond to and clear traffic incidents in two settings, deterministic and stochastic. The deterministic setting assumes that there is only one scenario of incident occurrence and, in the stochastic counterpart, there are many scenarios, each of which occurs with a probability. The main objective of both problems is to minimize the total incident response time. Rather than minimizing the expected total response time, the stochastic model minimizes the expected total response time over the high-consequence scenarios instead. In both settings, the deployment problem can be formulated as a mixed-integer nonlinear optimization problem, a hard class of problem to solve. To obtain solutions in a reasonable amount of time, three heuristic algorithms are proposed. In particular, one makes use of the dual information, another employs a neighborhood search technique and the third uses simulated annealing, a meta-heuristic algorithm. Numerical experiments based on data from Sioux Falls demonstrate that all three algorithms provide solutions with a significant reduction in total response time without using an excessive amount of CPU time.",
keywords = "Congestion mitigation, Deployment planning, Freeway service patrol, Incident management",
author = "Yingyan Lou and Yafeng Yin and Siriphong Lawphongpanich",
year = "2011",
month = "4",
doi = "10.1016/j.trc.2010.05.014",
language = "English (US)",
volume = "19",
pages = "283--295",
journal = "Transportation Research Part C: Emerging Technologies",
issn = "0968-090X",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - Freeway service patrol deployment planning for incident management and congestion mitigation

AU - Lou, Yingyan

AU - Yin, Yafeng

AU - Lawphongpanich, Siriphong

PY - 2011/4

Y1 - 2011/4

N2 - This paper investigates the problem of deploying freeway service patrols to detect, respond to and clear traffic incidents in two settings, deterministic and stochastic. The deterministic setting assumes that there is only one scenario of incident occurrence and, in the stochastic counterpart, there are many scenarios, each of which occurs with a probability. The main objective of both problems is to minimize the total incident response time. Rather than minimizing the expected total response time, the stochastic model minimizes the expected total response time over the high-consequence scenarios instead. In both settings, the deployment problem can be formulated as a mixed-integer nonlinear optimization problem, a hard class of problem to solve. To obtain solutions in a reasonable amount of time, three heuristic algorithms are proposed. In particular, one makes use of the dual information, another employs a neighborhood search technique and the third uses simulated annealing, a meta-heuristic algorithm. Numerical experiments based on data from Sioux Falls demonstrate that all three algorithms provide solutions with a significant reduction in total response time without using an excessive amount of CPU time.

AB - This paper investigates the problem of deploying freeway service patrols to detect, respond to and clear traffic incidents in two settings, deterministic and stochastic. The deterministic setting assumes that there is only one scenario of incident occurrence and, in the stochastic counterpart, there are many scenarios, each of which occurs with a probability. The main objective of both problems is to minimize the total incident response time. Rather than minimizing the expected total response time, the stochastic model minimizes the expected total response time over the high-consequence scenarios instead. In both settings, the deployment problem can be formulated as a mixed-integer nonlinear optimization problem, a hard class of problem to solve. To obtain solutions in a reasonable amount of time, three heuristic algorithms are proposed. In particular, one makes use of the dual information, another employs a neighborhood search technique and the third uses simulated annealing, a meta-heuristic algorithm. Numerical experiments based on data from Sioux Falls demonstrate that all three algorithms provide solutions with a significant reduction in total response time without using an excessive amount of CPU time.

KW - Congestion mitigation

KW - Deployment planning

KW - Freeway service patrol

KW - Incident management

UR - http://www.scopus.com/inward/record.url?scp=78951489751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78951489751&partnerID=8YFLogxK

U2 - 10.1016/j.trc.2010.05.014

DO - 10.1016/j.trc.2010.05.014

M3 - Article

AN - SCOPUS:78951489751

VL - 19

SP - 283

EP - 295

JO - Transportation Research Part C: Emerging Technologies

JF - Transportation Research Part C: Emerging Technologies

SN - 0968-090X

IS - 2

ER -