Abstract
The travelling salesman problem in transit planning is an extremely complex and non-deterministic polynomial problem. Many optimisation algorithms have been tested but failed to facilitate passengers getting to multiple stations by way of a complex rail transit network. Although various algorithms based on social insect species have successfully solved complex problems, bee behaviour in nature has inspired more significant solutions. The study reported in this paper aimed to identify the most efficient algorithm and develop a mathematical model based on artificial bee colony optimisation to solve this problem in light rail transit systems. For validation, the developed model was contrasted with empirical routes generated by human experience. The model was able to generate the optimal route in all cases without any error or miscalculation and could thus be used in any rail transit network in the world to determine the optimal route for multiple stations.
Sign-in/Register to access full text options 
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 callMore From: Proceedings of the Institution of Civil Engineers - Transport
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.
