Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The continuous dynamic network loading problem (CDNLP) consists in determining, on a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departue rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. ,  present a formulation of the CDNLP where travel delays may be nonlinear functions of arc traffic volumes.  prove, under a boundedness condition, that there exists a unique solution to the problem and propose for its solution a finite-step algorithm. Some computational results are reported for a discretized version of the algorithm.
['Y W Xu', 'Jia Hao Wu', 'Michael Florian', 'Patrice Marcotte', 'Daoli Zhu']
I am writing a research paper on a idea Advances in the Continuous Dynamic Network Loading Problem
[{"from": "human", "value": "I am writing a research paper on a idea Advances in the Continuous Dynamic Network Loading Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The continuous dynamic network loading problem (CDNLP) consists in determining, on a congested network, time-dependent arc volumes, together with arc and path travel times, given the time-varying path flow departue rates over a finite time horizon. This problem constitutes an intrinsic part of the dynamic traffic assignment problem. ,  present a formulation of the CDNLP where travel delays may be nonlinear functions of arc traffic volumes.  prove, under a boundedness condition, that there exists a unique solution to the problem and propose for its solution a finite-step algorithm. Some computational results are reported for a discretized version of the algorithm."}]