Efficient implementation of heuristics for the continuous network design problem

DOI10.1007/BF02098178zbMath0756.90037MaRDI QIDQ1184530

Patrice Marcotte, Gérald Marquis

Publication date: 28 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

continuous network design; traffic equilibrium; efficient implementation of heuristic procedures

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas, A descent framework for linked signal system with network flows, The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems, Bilevel and multilevel programming: A bibliography review, Joint optimization for area traffic control and network flow, Bilevel programming in traffic planning: Models, methods and challenge, A globally convergent algorithm for transportation continuous network design problem

Cites Work

• The gap function of a convex program
• Network design problem with congestion effects: A case of bilevel programming
• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
• Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem