A heuristic method for the minimum toll booth problem

DOI10.1007/s10898-010-9527-7zbMath1206.90172OpenAlexW2034637361MaRDI QIDQ604959

Siriphong Lawphongpanich, Lihui Bai, Donald W. Hearn

Publication date: 12 November 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9527-7

zbMATH Keywords

traffic equilibriumcongestion pricingdynamic slope scaling

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

New Complexity Results and Algorithms for the Minimum Tollbooth Problem, Unnamed Item, The minimum tollbooth problem in atomic network congestion games with unsplittable flows, On the minimization of traffic congestion in road networks with tolls, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation

Uses Software

• CPLEX
• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal multicut and maximal integer multiflow: a survey
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
• Combinatorial Benders Cuts for the Minimum Tollbooth Problem
• Decomposition techniques for the minimum toll revenue problem
• Restricted simplicial decomposition: Computation and extensions
• An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
• Multiway cuts in node weighted graphs