Notes on Bus User Assignment Problem Using Section Network Representation Method

Abstract

A recurrent solution to consecutive transit assignment problems is typically required to help address the bus network design problem (BNDP). Intriguingly, the transit assignment issue is differentiated by a number of distinctive characteristics. In this article, a complete analysis of one of the well-known graphical representations of the problem is conducted. The presented design is founded on the representation of the transit network by 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 complexities of the problem. This study is organized to thoroughly investigate and review the model to shed light on its capabilities for use in BNDP solution schemes. The review provides the needed information to give the reader a full assessment of the selected bus assignment model. The importance of this review is shown by the fact that 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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 26 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.