This paper develops an algorithm for the train scheduling problemusing the ant colony system metaheuristic called ACS-TS. At first,a mathematical model for a kind of train scheduling problem isdeveloped and then the algorithm based on ACS is presented tosolve the problem. The problem is considered as atraveling salesman problem (TSP) wherein cities representthe trains. ACS determines the sequence of trains dispatched onthe graph of the TSP. Using the sequences obtained and removingthe collisions incurred, train scheduling is determined.Numerical examples in small and medium sizes are solved usingACS-TS and compared to exact optimum solutions to check forquality and accuracy. Comparison of the solutions shows thatACS-TS results in good quality and time savings. A case study ispresented to illustrate the solution.
展开▼
