Refine
Year of publication
Document Type
Way of publication
- Open Access (1)
Keywords
- Ambiguity (1)
- Configuration graph (1)
- Cycle basis (1)
- Discrete Mathematics (1)
- Energy Innovation Center (EIZ) (1)
- P2X (1)
- Scientific Computing Lab (SCL) (1)
- Shape from shading (1)
- multiphysics multiscale problems (1)
- network optimization (1)
Institute
- FG Diskrete Mathematik und Grundlagen der Informatik (63)
- FG Algorithmische Mathematik (7)
- FG Ingenieurmathematik und Numerik der Optimierung (2)
- Energie-Innovationszentrum / Scientific Computing Lab (1)
- FG Angewandte Mathematik (1)
- FG Numerische Strömungs- und Gasdynamik (1)
- FG VWL, insbesondere Mikroökonomik (1)
In this paper, we present a cyclically time-expanded network model for simultaneous optimization of traffic assignment and traffic signal parameters, in particular offsets, split times, and phase orders. Since travel times are of great importance for developing realistic solutions for traffic assignment and traffic signal coordination in urban road networks, we perform an extensive analysis of the model. We show that a linear time-expanded model can reproduce realistic travel times especially for use with traffic signals and we verify this by simulation. Furthermore, we show how exact mathematical programming techniques can be used for optimizing the control of traffic signals. We provide computational results for real world instances and demonstrate the capabilities of the cyclically time-expanded by simulation results obtained with state-of-the-art traffic simulation tools.
Resolving ambiguities is a fundamental problem in shape from shading (SFS). The classic SFS approach allows to reconstruct the surface locally around singular points up to an ambiguity of convex, concave or saddle point type.
In this paper we follow a recent approach that seeks to resolve the local ambiguities in a global graph-based setting so that the complete surface reconstruction is consistent. To this end, we introduce a novel graph theoretic formulation for the underlying problem that allows to prove for the first time in the literature that the underlying surface orientation problem is NP-complete. Moreover, we show that our novel framework allows to define an algorithmic framework that solves the disambiguation problem. It makes use of cycle bases for dealing with the graph construction and enables an easy embedding into an optimization method that amounts here to a linear program.