Abstract
This paper critically reviews applications of metaheuristics for solving the Transit Route Network Design Problem (TRNDP). A structured review is offered and prominent metaheuristics for tackling the TRNDP are evaluated, according to a benchmark network. The review findings yield a unified implementation framework, which contains common algorithmic components and different solution representations and methods, which are considered important for obtaining solutions of good quality. The paper concludes with identified gaps in research and opportunities for future research on the application of metaheuristic algorithms for solving the TRNDP.
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 callDisclaimer: 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.
