A Computationally Efficient Simulation-Based Optimization Algorithm for Large-Scale Urban Transportation Problems

doi:10.1287/trsc.2014.0550

Return

A Computationally Efficient Simulation-Based Optimization Algorithm for Large-Scale Urban Transportation Problems

2015-08-01

PRE

Carolina Osorio *

DOI：10.1287/trsc.2014.0550

Original

Original request for help

Save

Abstract

En 中文

This paper proposes a computationally efficient simulation-based optimization ( SO) algorithm suitable to address large-scale generally constrained urban transportation problems. The algorithm is based on a novel metamodel formulation. We embed the metamodel within a derivative-free trust region algorithm and evaluate the performance of this SO approach considering tight computational budgets. We address a network-wide traffic signal control problem using a calibrated microscopic simulation model of evening peak period traffic of the full city of Lausanne, Switzerland, which consists of more than 600 links and 200 intersections. We control 99 signal phases of 17 intersections distributed throughout the entire network. This SO problem is a high-dimensional nonlinear constrained problem. It is considered large-scale and complex in the fields of derivative-free optimization, traffic signal optimization, and simulation-based optimization. We compare the performance of the proposed metamodel method to that of a traditional metamodel method and that of a widely used commercial signal control software. The proposed method systematically and efficiently identifies signal plans with improved average city-wide travel times.

Keywords:

simulation-based optimization

metamodel

large-scale urban transportation problems

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.