A model of choice a public transit network by data envelopment analysis

Abstract

The problem of public transit network design belongs to the class of NP hard combinatorial optimization problem. Since optimal solution of this problem is difficult to discover, many heuristic algorithms have been proposed in the literature. By applying various heuristic algorithms to one problem instance, various solutions could be generated. We assume, in this paper, that decisions related to public transit network choice should be made in the presence of trade-offs between two or more conflicting objectives (usually, the passengers' and operator's interests are in conflict). In this paper, we propose the model for public transit network choice. The proposed model is based on the Data Envelopment Analysis (DEA). The proposed model is tested on the one of the best known benchmark examples for the transit network design problem.

Keywords

• Transit network design problem
• Data Envelopment Analysis