Simulation-based headway optimization for a subway network: a performance comparison of population-based algorithms

Abstract

We present a study on simulation-based optimization for the Viennese subway system. The underlying discrete event simulation model has several stochastic elements like time-dependent demand and turning maneuver times, direction-dependent vehicle travel and passenger travel as well as transfer times. Passenger creation is a Poisson process which uses hourly origin-destination-matrices based on mobile phone data. The number of waiting passengers on platforms and within vehicles are subject to capacity restrictions. As a microscopic element, passenger distribution along platforms and within vehicles is considered. There are trade-offs between service quality (e.g. waiting time) and costs (e.g. fleet mileage). This bi-objective optimization problem is transformed into a single-objective one by normalization and scalarization. The goal is to find optimal time-dependent headways. Computational experience is gained from 48 test instances which are based on real-world data. Several population-based evolutionary algorithms were applied. The covariance matrix adaptation evolution strategy (CMA-ES) performed best.