Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in phase-time-traffic hypernetwork

Pengfei (Taylor) Li, Xuesong Zhou

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

It is a common vision that connected and automated vehicles (CAVs) will increasingly appear on the road in the near future and share roads with traditional vehicles. Through sharing real-time locations and receiving guidance from infrastructure, a CAV's arrival and request for green light at intersections can be approximately predicted along their routes. When many CAVs from multiple approaches at intersections place such requests, a central challenge is how to develop an intersection automation policy (IAP) to capture complex traffic dynamics and schedule resources (green lights) to serve both CAV requests (interpreted as request for green lights on a particular signal phase at time t) and traditional vehicles. To represent heterogeneous vehicle movements and dynamic signal timing plans, we first formulate the IAP optimization as a special case of machine scheduling problem using a mixed integer linear programming formulation. Then we develop a novel phase-time-traffic (PTR) hypernetwork model to represent heterogeneous traffic propagation under traffic signal operations. Since the IAP optimization, by nature, is a special sequential decision process, we also develop sequential branch-and-bound search algorithms over time to IAP optimization considering both CAVs and traditional vehicles in the PTR hypernetwork. As the critical part of the branch-and-bound search, special dominance and bounding rules are also developed to reduce the search space and find the exact optimum efficiently. Multiple numerical experiments are conducted to examine the performance of the proposed IAP optimization approach.

Original languageEnglish (US)
Pages (from-to)479-506
Number of pages28
JournalTransportation Research Part B: Methodological
Volume105
DOIs
StatePublished - Nov 1 2017

Fingerprint

automation
scheduling
Automation
Scheduling
traffic
road
Traffic signals
programming
time
infrastructure
Telecommunication traffic
Linear programming
experiment
resources
performance

Keywords

  • Automated vehicle
  • Branch-and-bound algorithms
  • Connected vehicle
  • Intersection automation policy
  • Phase-time network
  • Traffic signal control

ASJC Scopus subject areas

  • Transportation

Cite this

@article{4fc9ed9421974e55bc834abbc6fd0c8e,
title = "Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in phase-time-traffic hypernetwork",
abstract = "It is a common vision that connected and automated vehicles (CAVs) will increasingly appear on the road in the near future and share roads with traditional vehicles. Through sharing real-time locations and receiving guidance from infrastructure, a CAV's arrival and request for green light at intersections can be approximately predicted along their routes. When many CAVs from multiple approaches at intersections place such requests, a central challenge is how to develop an intersection automation policy (IAP) to capture complex traffic dynamics and schedule resources (green lights) to serve both CAV requests (interpreted as request for green lights on a particular signal phase at time t) and traditional vehicles. To represent heterogeneous vehicle movements and dynamic signal timing plans, we first formulate the IAP optimization as a special case of machine scheduling problem using a mixed integer linear programming formulation. Then we develop a novel phase-time-traffic (PTR) hypernetwork model to represent heterogeneous traffic propagation under traffic signal operations. Since the IAP optimization, by nature, is a special sequential decision process, we also develop sequential branch-and-bound search algorithms over time to IAP optimization considering both CAVs and traditional vehicles in the PTR hypernetwork. As the critical part of the branch-and-bound search, special dominance and bounding rules are also developed to reduce the search space and find the exact optimum efficiently. Multiple numerical experiments are conducted to examine the performance of the proposed IAP optimization approach.",
keywords = "Automated vehicle, Branch-and-bound algorithms, Connected vehicle, Intersection automation policy, Phase-time network, Traffic signal control",
author = "Li, {Pengfei (Taylor)} and Xuesong Zhou",
year = "2017",
month = "11",
day = "1",
doi = "10.1016/j.trb.2017.09.020",
language = "English (US)",
volume = "105",
pages = "479--506",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem

T2 - A sequential branch-and-bound search approach in phase-time-traffic hypernetwork

AU - Li, Pengfei (Taylor)

AU - Zhou, Xuesong

PY - 2017/11/1

Y1 - 2017/11/1

N2 - It is a common vision that connected and automated vehicles (CAVs) will increasingly appear on the road in the near future and share roads with traditional vehicles. Through sharing real-time locations and receiving guidance from infrastructure, a CAV's arrival and request for green light at intersections can be approximately predicted along their routes. When many CAVs from multiple approaches at intersections place such requests, a central challenge is how to develop an intersection automation policy (IAP) to capture complex traffic dynamics and schedule resources (green lights) to serve both CAV requests (interpreted as request for green lights on a particular signal phase at time t) and traditional vehicles. To represent heterogeneous vehicle movements and dynamic signal timing plans, we first formulate the IAP optimization as a special case of machine scheduling problem using a mixed integer linear programming formulation. Then we develop a novel phase-time-traffic (PTR) hypernetwork model to represent heterogeneous traffic propagation under traffic signal operations. Since the IAP optimization, by nature, is a special sequential decision process, we also develop sequential branch-and-bound search algorithms over time to IAP optimization considering both CAVs and traditional vehicles in the PTR hypernetwork. As the critical part of the branch-and-bound search, special dominance and bounding rules are also developed to reduce the search space and find the exact optimum efficiently. Multiple numerical experiments are conducted to examine the performance of the proposed IAP optimization approach.

AB - It is a common vision that connected and automated vehicles (CAVs) will increasingly appear on the road in the near future and share roads with traditional vehicles. Through sharing real-time locations and receiving guidance from infrastructure, a CAV's arrival and request for green light at intersections can be approximately predicted along their routes. When many CAVs from multiple approaches at intersections place such requests, a central challenge is how to develop an intersection automation policy (IAP) to capture complex traffic dynamics and schedule resources (green lights) to serve both CAV requests (interpreted as request for green lights on a particular signal phase at time t) and traditional vehicles. To represent heterogeneous vehicle movements and dynamic signal timing plans, we first formulate the IAP optimization as a special case of machine scheduling problem using a mixed integer linear programming formulation. Then we develop a novel phase-time-traffic (PTR) hypernetwork model to represent heterogeneous traffic propagation under traffic signal operations. Since the IAP optimization, by nature, is a special sequential decision process, we also develop sequential branch-and-bound search algorithms over time to IAP optimization considering both CAVs and traditional vehicles in the PTR hypernetwork. As the critical part of the branch-and-bound search, special dominance and bounding rules are also developed to reduce the search space and find the exact optimum efficiently. Multiple numerical experiments are conducted to examine the performance of the proposed IAP optimization approach.

KW - Automated vehicle

KW - Branch-and-bound algorithms

KW - Connected vehicle

KW - Intersection automation policy

KW - Phase-time network

KW - Traffic signal control

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

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

U2 - 10.1016/j.trb.2017.09.020

DO - 10.1016/j.trb.2017.09.020

M3 - Article

AN - SCOPUS:85034588523

VL - 105

SP - 479

EP - 506

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -