A DECOMPOSITION SCHEME FOR DYNAMIC TRAFFIC ASSIGNMENT MODELS
作者： Athanasios K Ziliaskopoulos , S Travis Waller , Yue Irene Li
DOI:
关键词: Linear bottleneck assignment problem 、 Set (abstract data type) 、 Mathematical optimization 、 Generalized assignment problem 、 Scheme (programming language) 、 Decomposition (computer science) 、 Weapon target assignment problem 、 Algorithm 、 Computer science 、 Linear programming 、 Constraint (information theory)
摘要: Many models have been proposed in the literature for solving dynamic traffic assignment (DTA) problems. While various solution procedures developed certain of these formulations, approaches are often computationally expensive. In this paper, a algorithm is linear programming model DTA by applying Dantzig-Wolfe decomposition scheme. The takes advantage special structure within constraint set problem. It solves minimum-cost-flow problem as sub-problem and restricted optimization master. demonstrated that more efficient than using mathematical solvers commercially available. tested on an example network performance presented
参考文章(0)