Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. W–SPSA in Practice: Approximation of Weight Matrices and Calibration of Traffic Simulation Models

W–SPSA in Practice: Approximation of Weight Matrices and Calibration of Traffic Simulation Models

Thumbnail Image
Download
Name

1-s2.0-S2352146515000812-main.pdf

Size

1.71 MB

Format

Adobe PDF

Checksum (MD5)

e07bc242f6f721e9c56f31c2c082cd97

Download all files submitted through automated deposit
sword-2018-07-26.original.zip (1.62 MB)
Author(s)
Antoniou, Constantinos
•
Azevedo, Carlos Lima
•
Lu, Lu
•
Pereira, Francisco
•
Ben-Akiva, Moshe E
Date Issued
July 2015
Journal
Transportation Research Procedia
Publisher
Elsevier BV
Citation
Antoniou, Constantinos et al. “W–SPSA in Practice: Approximation of Weight Matrices and Calibration of Traffic Simulation Models.” Transportation Research Procedia 7 (2015): 233–253 © 2015 The Authors
Version
Final published version
Abstract
The development and calibration of complex traffic models demands parsimonious techniques, because such models often involve hundreds of thousands of unknown parameters. The Weighted Simultaneous Perturbation Stochastic Approximation (W-SPSA) algorithm has been proven more efficient than its predecessor SPSA (Spall, 1998), particularly in situations where the correlation structure of the variables is not homogeneous. This is crucial in traffic simulation models where effectively some variables (e.g. readings from certain sensors) are strongly correlated, both in time and space, with some other variables (e.g. certain OD flows). In situations with reasonably sized traffic networks, the difference is relevant considering computational constraints. However, W-SPSA relies on determining a proper weight matrix (W) that represents those correlations, and such a process has been so far an open problem, and only heuristic approaches to obtain it have been considered. This paper presents W-SPSA in a formally comprehensive way, where effectively SPSA becomes an instance of W-SPSA, and explores alternative approaches for determining the matrix W. We demonstrate that, relying on a few simplifications that marginally affect the final solution, we can obtain W matrices that considerably outperform SPSA. We analyse the performance of our proposed algorithm in two applications in motorway networks in Singapore and Portugal, using a dynamic traffic assignment model and a microscopic traffic simulator, respectively. Keywords: calibration algorithms; dynamic traffic assignment; microscopic traffic simulation; large–scale applications; optimisation; heuristics
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/117166
DOI of Published Version
https://doi.org/10.1016/J.TRPRO.2015.06.013
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.