Efficient implementation of heuristics for the continuous network design problem

DOI10.1007/BF02098178MaRDI QIDQ1184530zbMATH OpenOpenAlexFDO

Authors P. Marcotte, Gérald Marquis

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1007/bf02098178

zbMATH Keywords

continuous network designefficient implementation of heuristic procedurestraffic equilibrium

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Review text

The authors present an efficient implementation of heuristic procedures for solving the continuous network design problem where network users behave according to Wardrop's first principle of traffic equilibrium. Numerical results involving a ``standard benchmark problem are given. Also, it is shown that the cost mapping arising in the iterative optimization-assignment algorithm is integrable if and only if the volume-delay function is of either the BPR or some logarithmic form.

Recommendations

• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• A heuristic algorithm for network equilibration
• scientific article; zbMATH DE number 1057915
• A subgradient optimization model for continuous road network design problem
• Network flow assignment as a fixed point problem

Cites work

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

Cited in

(20)

• 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
• An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
• Designing an optimal contract mechanism in a cellulosic biofuel enterprise
• A new genetic approach for transport network design and optimization
• A review of urban transportation network design problems
• A globally convergent algorithm for transportation continuous network design problem
• Hybrid constructive heuristics for the critical node problem
• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Complexity and approximation of the continuous network design problem
• Optimized Design of Dynamic Networks with Heuristic Algorithms
• Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas
• Bilevel Programming: The Montreal School
• Optimization strategies for the bilevel network design problem with affine cost functions
• Global optimum search in the network design problem
• Swarm intelligence technique for capacity optimization of a transportation network
• A descent framework for linked signal system with network flows

This page was built for publication: Efficient implementation of heuristics for the continuous network design problem

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