A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm

DOI10.1007/s11067-009-9100-4zbMath1170.90321OpenAlexW2067782164MaRDI QIDQ836010

Henry X. Liu, Xuegang (Jeff) Ban

Publication date: 31 August 2009

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-009-9100-4

zbMATH Keywords

relaxation algorithmdynamic user equilibriumcongestion pricingdynamic second best toll pricing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Optimal charging strategies under conflicting objectives for the protection of sensitive areas: a case study of the Trans-Pennine corridor ⋮ The cost of environmental constraints in traffic networks: assessing the loss of optimality ⋮ Correcting the market failure in work trips with work rescheduling: an analysis using bi-level models for the firm-workers interplay ⋮ An effective bilevel programming approach for the evasive flow capturing location problem

Uses Software

• CONOPT

Cites Work

• Unnamed Item
• An MPEC approach to second-best toll pricing.
• Dynamic congestion pricing in disequilibrium
• A general MPCC model and its solution algorithm for continuous network design problem
• Sensitivity analysis for the asymmetric network equilibrium problem
• Endogenous Trip Scheduling: The Henderson Approach Reformulated and Compared with the Vickrey Approach
• CONOPT—A Large-Scale GRG Code
• Some properties of regularization and penalization schemes for MPECs
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows