Efficient implementation of heuristics for the continuous network design problem (Q1184530): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The gap function of a convex program / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Network design problem with congestion effects: A case of bilevel programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem / rank | |||
Normal rank |
Revision as of 16:08, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient implementation of heuristics for the continuous network design problem |
scientific article |
Statements
Efficient implementation of heuristics for the continuous network design problem (English)
0 references
28 June 1992
0 references
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.
0 references
efficient implementation of heuristic procedures
0 references
continuous network design
0 references
traffic equilibrium
0 references
0 references