The access-control problem on capacitated FIFO networks with unique O-D paths is hard

Operations Research

Volumn 50, Issue 4, 2002, Pages 736-743

  Erera, Alan L ^a   Daganzo, Carlos F ^a   Lovell, David J ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTROL THEORY; HAMILTONIANS; HIGHWAY SYSTEMS; HIGHWAY TRAFFIC CONTROL; MATHEMATICAL MODELS; QUEUEING THEORY; SET THEORY;

CAPACITATED FIRST IN FIRST OUT NETWORKS; MULTICOMMODITY NETWORKS; TRAFFIC MODELS; UNIQUE ORIGIN-DESTINATION PATHS;

OPTIMIZATION;

EID: 0036657304     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.50.4.736.2863     Document Type: Article

References (12)

1. Traffic control: Theory and application
2. Reducibility among combinatorial problems
3. Traffic control on metered networks without route choice
4. Access control on networks with unique origin-destination paths
5. Experimentation with manual and automatic ramp control
6. An integrated control approach for traffic corridors
7. Adaptive demand-diversion prediction for integrated control of freeway corridors
8. Peak-period control of a freeway system - Some theoretical considerations
9. Peak-period analysis and control of a freeway system
10. An optimal control algorithm for ramp metering of urban freeways