Abstract
In this study, for the first time, a relatively new method entitled the ant colony algorithm was used to optimize the departure interval of a public bus system. To use the ant colony algorithm, a day was divided into several time intervals. For each time interval, several candidate bus departure interval plans were proposed. The candidate departure interval plans can be considered road sections in a TSP (traveling salesman) problem. Thus, the bus departure interval problem was transferred into a TSP problem and the ant colony algorithm can be applied to this TSP problem to find out the optimal departure interval plan. In this study, the use of the ant colony algorithm was tested using data from a case study in Tangshan City. It was found that the ant colony algorithm provided reasonable optimization results.
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 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.
