Abstract
Many past researchers have ignored the multi-objective nature of the transit route network design problem (TrNDP), recognizing user or operator cost as their sole objective. The main purpose of this study is to identify the inherent conflict among TrNDP objectives in the design process. The conventional scheme for transit route design is addressed. A route constructive genetic algorithm is proposed to produce a vast pool of candidate routes that reflect the objectives of design, and then, a set covering problem (SCP) is formulated for the selection stage. A heuristic algorithm based on a randomized priority search is implemented for the SCP to produce a set of nondominated solutions that achieve different tradeoffs among the identified objectives. The solution methodology has been tested using Mandl's benchmark network problem. The test results showed that the methodology developed in this research not only outperforms solutions previously identified in the literature in terms of strategic and tactical terms of design, but it is also able to produce Pareto (or near Pareto) optimal solutions. A real-scale network of Rivera was also tested to prove the proposed methodology's reliability for larger-scale transit networks. Although many efficient meta-heuristics have been presented so far for the TrNDP, the presented one may take the lead because it does not require any weight coefficient calibration to address the multi-objective nature of the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Intelligent Transportation Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.