Considering user heterogeneity in terms of a continuously distributed value of time, we investigate, on the base of so-called Wardrop’s third principle, the time-versus-cost network equilibrium and system optimum problem with fixed demand. To realize a target flow pattern through imposing...

Consider a class of variational inequality problems of finding <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${x^*\in S}$$</EquationSource> </InlineEquation>, such that <Equation ID="Equa"> <EquationSource Format="TEX">$$f(x^*)^\top (z-x^*)\geq 0,\quad \forall z\in S,$$</EquationSource> </Equation> where the underlying mapping f is hard to evaluate (sometimes its explicit form is unknown), and S has the following structure <Equation ID="Equb"> <EquationSource Format="TEX">$$S=\{x\in R^n\; | \;...</equationsource></equation></equationsource></equation></equationsource></inlineequation>

This paper proposes a combination of trial-and-error congestion pricing schemes that have been studied in the literature. It not only considers the minimization of the total system cost but also addresses the capacity constraints. A two-level iteration method is proposed for solving the hybrid...

Consider a class of variational inequality problems of finding $${x^*\in S}$$ , such that $$f(x^*)^\top (z-x^*)\geq 0,\quad \forall z\in S,$$ where the underlying mapping f is hard to evaluate (sometimes its explicit form is unknown), and S has the following structure $$S=\{x\in R^n\; | \; Ax\le...