Abstract
This study reviews in two parts the formulation, interpretation and solution methodology of the traffic assignment problem. An extensive literature exists on this subject, and in the study an attempt is made to classify it. The first paper (Part I) is devoted to non‐equilibrium assignment models. The accompanying paper (Part II) examines algorithmic approaches which are based on or make use of the Wardropian principle of equal travel times and which are thereafter characterized as equilibrium assignments. Non‐equilibrium models are classified into: (1) all‐or‐nothing assignments; (2) capacity‐restraint assignments; (3) diversion models; (4) multipath assignments; and (5) combined models. In each category the operating principles are described in brief, together with other details such as advantages‐disadvantages, validation efforts and applications of these models.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
