Simulations Practice Test
•13 QuestionsA transportation agency uses a traffic flow simulation to test a new bus-only lane downtown. The real-world problem is predicting whether reallocating one lane improves total travel time or just shifts congestion. The simulation represents vehicles as agents that follow basic rules: maintain safe distance, accelerate when space opens, and stop at red lights. Variables include vehicleDensity (15–90 vehicles/km/lane), lightCycleTime (50–150 seconds), and peakHourFactor (1.0–3.0) that increases arrivals near 8 a.m. The algorithm iterates each second: it spawns vehicles based on peakHourFactor, updates positions and speeds, and records queue lengths at intersections. After a full simulated hour, it computes average delay per vehicle. To refine results, it repeats the hour-long simulation across many random arrival patterns, then modifies lightCycleTime to reduce the worst delays while keeping cross-street waits within a fairness limit. Scenario-specific example: at very high vehicleDensity, even a well-tuned lightCycleTime may not prevent gridlock if too many vehicles enter the network.
A transportation agency uses a traffic flow simulation to test a new bus-only lane downtown. The real-world problem is predicting whether reallocating one lane improves total travel time or just shifts congestion. The simulation represents vehicles as agents that follow basic rules: maintain safe distance, accelerate when space opens, and stop at red lights. Variables include vehicleDensity (15–90 vehicles/km/lane), lightCycleTime (50–150 seconds), and peakHourFactor (1.0–3.0) that increases arrivals near 8 a.m. The algorithm iterates each second: it spawns vehicles based on peakHourFactor, updates positions and speeds, and records queue lengths at intersections. After a full simulated hour, it computes average delay per vehicle. To refine results, it repeats the hour-long simulation across many random arrival patterns, then modifies lightCycleTime to reduce the worst delays while keeping cross-street waits within a fairness limit. Scenario-specific example: at very high vehicleDensity, even a well-tuned lightCycleTime may not prevent gridlock if too many vehicles enter the network.