Nov 15, 2010 · To solve the bi-level dynamic NDP, this study develops a dual variable approximation-based heuristic, which identifies the system-wide gradient ...
Oct 19, 2011 · To solve the bi-level dynamic NDP, this study develops a dual variable approximation-based heuristic. This dual variable identifies the system- ...
Bibliographic details on A Dual Variable Approximation-Based Descent Method for a Bi-level Continuous Dynamic Network Design Problem.
Lin D. A Dual Variable Approximation-Based Descent Method for a Bi-level Continuous Dynamic Network Design Problem // Computer-Aided Civil and Infrastructure ...
Fingerprint. Dive into the research topics of 'A dual variable approximation-based descent method for a bi-level continuous dynamic network design problem'.
This paper addresses the problem of determining which links should be improved in an urban road network so that total congestion in the city is minimized.
A Dual Variable Approximation‐Based Descent Method for a Bi‐level Continuous Dynamic Network Design Problem · Dung-Ying Lin. Computer Science, Engineering.
A dual approximation-based quantum-inspired genetic algorithm for the dynamic network design problem. Article. Mar 2017. Dung-Ying Lin · Peng-Hsueh ...
Missing: Descent | Show results with:Descent
In this paper we propose a simulated annealing algorithm for the equilibrium network design problem. We demonstrate the ability of this algorithm to determine ...
We have presented an effective and efficient dynamic discretization discovery algorithm for solving the continuous-time service network design problem. The ...
Missing: Dual Descent Bi-