A mixed integer linear programming formulation of the dynamic traffic assignment problem

@article{Kaufman1992AMI,
  title={A mixed integer linear programming formulation of the dynamic traffic assignment problem},
  author={David E. Kaufman and Jason Nonis and Robert L. Smith},
  journal={[Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics},
  year={1992},
  pages={232-235 vol.1}
}
The authors propose a new model for dynamic traffic assignment, modeling the traffic system by a mixed integer linear program solvable in finite time. The model represents link travel times, which must be the same for all vehicles which enter a link together during a single time period by means of 0-1 integer variables. Given the values of these variables, the problem is to assign traffic, modeled as multiperiod multicommodity flow, subject to constraints on capacity implied by the link travel… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

LeBlanc, “Dynamic user-optimal traffic assignment: A new model and solution technique,

D. E. Boyce, B. Ran, L.J
  • TRISTAN
  • 1991

Dynamic user optimal traffic assignment on congested mul - tidestination networks

A. Ugge
  • Managing traffic congestion in combined freeway and traffic signal networks , I T E Journal
  • 1989

Ugge, “Managing traffic congestion in combined freeway and traffic signal networks, I

M. Van Aerde, J. Voss
  • T E Journal,
  • 1989

Sheffi, Urban Zhnsportation Networks: Equilibrium Analysis with Mathematical Programming Methods

Y. ll
  • 1984

A model and an algorithm for the dynamic traffic assignment problems

G. L. Nemhauser
  • Zhnsportation Science