A Heuristic for the Doubly Constrained Entropy Distribution/Assignment Problem

研究成果: 雜誌貢獻期刊論文同行評審

2 引文 斯高帕斯(Scopus)


The doubly constrained entropy distribution/assignment (DEDA) problem that combines a gravity-based trip distribution (TD) problem and a traffic assignment (TA) problem has long been formulated as an optimization model and solved by two solution algorithms, i.e., partial- and full-linearization solution algorithms. As an alternative, this research first treats the DEDA problem by the augmented Lagrangian dual (ALD) method as the singly constrained entropy distribution/assignment (SEDA) problem, which in turn is addressed, via a tactical supernetwork representation, as an “extended” 1-origin-to-1-destination TA problem. A quick-precision TA solution algorithm, − called TAPAS (Traffic Assignment by Paired Alternative Segments), − is then adopted for solutions. The proposed approach is demonstrated with a numerical example for the correctness of the result, using Lingo 11 solver and the partial linearization solution (PLS) algorithm. Moreover, through the use of TAPAS in the innermost loop, the proposed approach also has the merit of generating unique path flow solution, which is very useful in route guidance under the intelligent transportation systems environment, among other academic applications. In addition, the proposed approach can be easily applied, or with minor modification at most, to various combined models in travel demand forecasting.

頁(從 - 到)107-128
期刊Networks and Spatial Economics
出版狀態已出版 - 1 3月 2017


深入研究「A Heuristic for the Doubly Constrained Entropy Distribution/Assignment Problem」主題。共同形成了獨特的指紋。