![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Pricing in transportation networks
-
Article
A heuristic method for the minimum toll booth problem
This paper addresses the toll pricing problem in which the objective is to minimize the number of required toll facilities in a traffic network. The problem is shown to be NP-hard. To obtain a solution in a re...
-
Article
Alternative marginal-cost pricing for road networks
In the literature, several studies have algebraically characterized the set of toll vectors or patterns that, when added to a user equilibrium problem, its solution would be system optimal. Toll vectors in thi...
-
Reference Work Entry In depth
Convex-Simplex Algorithm
Keywords
-
Reference Work Entry In depth
Simplicial Decomposition
Keywords
-
Reference Work Entry In depth
Frank–Wolfe Algorithm
Keywords
-
Chapter
An Active-set Algorithm for Discrete Network Design Problems
In this paper, we formulate a discrete network design problem as a mathematical program with complementarity constraints and propose an active set algorithm to solve the problem. Each complementarity constrain...
-
Article
Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
This paper proposes a system optimal dynamic traffic assignment model that does not require the network to be empty at the beginning or at the end of the planning horizon. The model assumes that link travel ti...
-
Article
Dynamic Slope Scaling Procedure and Lagrangian Relaxation with Subproblem Approximation
The dynamic slope scaling procedure (DSSP) is an efficient heuristic algorithm that provides good solutions to the fixed-charge transportation or network flow problem. However, the procedure is graphically mot...
-
Book
-
Chapter
Relaxed Toll Sets for Congestion Pricing Problems
Congestion or toll pricing problems in [HeR98] require a solution to the system problem (the traffic assignment problem that minimizes the total travel delay) to define the set of all valid tolls or the toll set....
-
Article
An MPEC approach to second-best toll pricing
This paper addresses two second-best toll pricing problems, one with fixed and the other with elastic travel demands, as mathematical programs with equilibrium constraints. Several equivalent nonlinear program...
-
Reference Work Entry In depth
Rosen's method, global convergence, and Powell's conjectureCost approximation algorithms; Simplicial decomposition; Stochastic transportation and location problems; Traffic network equilibriumFRANK–WOLFE ALGORITHM
-
Reference Work Entry In depth
Convex-Simplex Algorithm
-
Reference Work Entry In depth
Simplicial Decomposition
-
Article
Book reviews
-
Article
Benders decomposition for variational inequalities
The partitioning technique of J.F. Benders, which was generalized to nonlinear programming by Geoffrion, is further generalized to linearly constrained variational inequality problems. The conditions under whi...