Oral Presentation

Mahmoud Owais

Civil Engineering Department, Faculty of Engineering, Assiut University, Assiut, Egypt

A recursive solution to consecutive transit assignment problems is typically required to solve the Bus Network Design Problem (BNDP). Intriguingly, the transit assignment issue is confounded by a number of distinctive characteristics. In this article, a complete analysis is conducted of one of the well-known graphical transit assignment models. The presented model is based on the transit network representation of De Cea and Fernandez (1993). They developed an innovative section-based graph augmentation of the real transit network to overcome many of the mathematical formulation complexity of the problem. The study is organized to thoroughly investigate and review the model to shed light on its capabilities to be used in the BNDP solution schemes. The study provides the needed information to give the reader a full assessment of the selected transit assignment model. The most widely utilized transit assignment models in the BNDP are inadequate in their fundamental assumptions when compared to the model under consideration. The model's graphical representation and solution technique are described in depth in addition to the constraints that will be integrated into the BNDP solution approaches. We want to refocus emphasis on this approach for further BNDP research since it is infrequently used in BNDP solution frameworks.

Section assignment; Transit Assignment; Network equilibrium; Bus network design problem

Transportation and Infrastructure Engineering