出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：This paper deals with the optimization of the capacity of a terminal railway station using theAnt Colony Optimization algorithm. The capacity of the terminal station is defined as thenumber of trains that depart from the station in unit interval of time. The railway capacityoptimization problem is framed as a typical symmetrical Travelling Salesman Problem (TSP),with the TSP nodes representing the train arrival /departure events and the TSP total costrepresenting the total time-interval of the schedule. The application problem is then optimizedusing the ACO algorithm. The simulation experiments validate the formulation of the railwaycapacity problem as a TSP and the ACO algorithm produces optimal solutions superior to thoseproduced by the domain experts.
