Decomposition techniques for the minimum toll revenue problem

DOI10.1002/NET.20024MaRDI QIDQ3156828zbMATH OpenOpenAlexFDO

Authors Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich

Publication date 12 January 2005

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20024

zbMATH Keywords

Congestion pricingcutting plane methodDantzig-Wolfe decomposition

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Solving the minimum toll revenue problem in real transportation networks
• Combinatorial Benders cuts for the minimum tollbooth problem
• Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
• A convergent and efficient decomposition method for the traffic assignment problem
• Approach to congestion optimum toll in traffic networks.

Cites work

• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 1488062 (Why is no real title available?)
• Restricted simplicial decomposition: Computation and extensions

Cited in

(6)

• Solving the minimum toll revenue problem in real transportation networks
• Demand-independent optimal tolls
• On the minimization of traffic congestion in road networks with tolls
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A heuristic method for the minimum toll booth problem
• Existence and computation of optimal tolls in multiclass network equilibrium problems

Describes a project that uses

Uses Software

• CPLEX
• GAMS

This page was built for publication: Decomposition techniques for the minimum toll revenue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156828)