ACS-TS: train scheduling using ant colony system

ACS-TS: train scheduling using ant colony system

0.00 Avg rating0 Votes
Article ID: iaor200971958
Country: United States
Volume: 2006
Issue: 95060
Start Page Number: 1
End Page Number: 28
Publication Date: Jan 2006
Journal: Journal of Applied Mathematics & Decision Sciences
Authors: ,
Keywords: vehicle routing & scheduling, heuristics: ant systems, programming: travelling salesman
Abstract:

This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the sequence of trains dispatched on the graph of the TSP. Using the sequences obtained and removing the collisions incurred, train scheduling is determined. Numerical examples in small and medium sizes are solved using ACS-TS and compared to exact optimum solutions to check for quality and accuracy. Comparison of the solutions shows that ACS-TS results in good quality and time savings. A case study is presented to illustrate the solution.

Reviews

Required fields are marked *. Your email address will not be published.