ACS-TS: train scheduling using ant colony system

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.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Patrick T. Harker,et al.  Two Moments Estimation of the Delay on Single-Track Rail Lines with Scheduled Traffic , 1990, Transp. Sci..

[3]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[4]  Luca Maria Gambardella,et al.  An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem , 2002, PPSN.

[5]  V. K. Jayaraman,et al.  Dynamic Optimization of Fed‐Batch Bioreactors Using the Ant Algorithm , 2001, Biotechnology progress.

[6]  Türkay Dereli,et al.  An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems , 2006 .

[7]  Ferenc Szidarovszky,et al.  A multi-objective train scheduling model and solution , 2004 .

[8]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[9]  Marco Wiering,et al.  Multiple Ant Colony Systems for the Busstop Allocation Problem , 2001 .

[10]  Francisco Herrera,et al.  A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System , 2000 .

[11]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[12]  Richard F. Hartl,et al.  Cooperative Ant Colonies for Optimizing Resource Allocation in Transportation , 2001, EvoWorkshops.

[13]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[14]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[15]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[16]  R. Saravanan,et al.  Optimization of multi-pass turning operations using ant colony system , 2003 .

[17]  Matteo Golfarelli,et al.  ANTS for Data Warehouse Logical Design , 2001 .

[18]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[19]  M. Mendes,et al.  A methodology for generation of optimal schedules for an underground railway system , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[20]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[21]  Karl Nachtigall,et al.  A genetic algorithm approach to periodic railway synchronization , 1996, Comput. Oper. Res..

[22]  Ove Frank.  Two-Way Traffic on a Single Line of Railway , 1966, Oper. Res..

[23]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[24]  Ravi Shankar,et al.  Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing , 2004, Eur. J. Oper. Res..

[25]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[26]  J. A. Bland.  OPTIMAL STRUCTURAL DESIGN BY ANT COLONY OPTIMIZATION , 2001 .

[27]  Erhan Kozan,et al.  Heuristic Techniques for Single Line Train Scheduling , 1997, J. Heuristics.

[28]  Christian Blum,et al.  ACO for Maximal Constraint Satisfaction Problems , 2001 .

[29]  Marco Laumanns,et al.  Savings based ant colony optimization for the capacitated minimum spanning tree problem , 2006, Comput. Oper. Res..

[30]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[31]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[32]  Jürgen Branke,et al.  Solving the Probabilistic TSP with Ant Colony Optimization , 2004 .

[33]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[34]  Roberto Montemanni,et al.  Time Dependent Vehicle Routing Problem with an Ant Colony System , 2003 .

[35]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[36]  Ravi Shankar,et al.  An ant algorithm for the single row layout problem in flexible manufacturing systems , 2005, Comput. Oper. Res..

[37]  In-Keun Yu,et al.  A novel short-term generation scheduling technique of thermal units using ant colony search algorithms , 2001 .

[38]  Benjamín Barán,et al.  AntNet: Routing Algorithm for Data Networks based on Mobile Agents , 2001, Inteligencia Artif..

[39]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[40]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[41]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[42]  Erhan Kozan,et al.  Modeling Train Delays in Urban Networks , 1998, Transp. Sci..

[43]  Arjang A. Assad,et al.  MODELS FOR RAIL TRANSPORTATION , 1980 .

[44]  R. Montemanni,et al.  An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference , 2002, IEEE Trans. Veh. Technol..

[45]  Martin Heusse,et al.  Adaptive Agent-Driven Routing and Load Balancing in Communication Networks , 1998, Adv. Complex Syst..

[46]  Yu Cheng.  Hybrid simulation for resolving resource conflict in train traffic rescheduling , 1998 .

[47]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[48]  E. D. Taillard,et al.  Ant Systems , 1999 .

[49]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[50]  Elpida Tzafestas.  Experiences from the Development and Use of Simulation Software for Complex Systems Education , 2000, WebNet.

[51]  Raymond S. K. Kwan,et al.  A co-evolutionary algorithm for train timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[52]  Jin Hao,et al.  Ant colony optimization algorithm with random perturbation behavior to the problem of optimal unit commitment with probabilistic spinning reserve determination , 2004 .

[53]  J. Dréo,et al.  Continuous interacting ant colony algorithm based on dense heterarchy , 2004, Future Gener. Comput. Syst..

[54]  Michael Francis Gorman,et al.  An application of genetic and tabu searches to the freight railroad operating plan problem , 1998, Ann. Oper. Res..

[55]  A. Wren,et al.  An Ant System for Bus Driver Scheduling 1 , 1997 .

[56]  Andrew Lim,et al.  Ant colony optimization with hill climbing for the bandwidth minimization problem , 2006, Appl. Soft Comput..

[57]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[58]  Patrick T. Harker,et al.  REAL-TIME SCHEDULING OF FREIGHT RAILROADS , 1995 .

[59]  Franz Oppacher,et al.  Connection Management using Adaptive Mobile Agents , 1998 .

[60]  M M Sepehri,et al.  RAILWAY CREW SCHEDULING WITHGROUPING EVOLUTIONARY ALGORITHM , 2003 .

[61]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[62]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[63]  Jose Miguel Puerta,et al.  Searching for the best elimination sequence in Bayesian networks by using ant colony optimization , 2002, Pattern Recognit. Lett..

[64]  Vincent T'Kindt,et al.  An Ant Colony Optimisation Algorithm for the Set Packing Problem , 2004, ANTS Workshop.

[65]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[66]  Marc Gravel,et al.  Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..

[67]  David R. Martinelli,et al.  Optimization of railway operations using neural networks , 1996 .

[68]  Roberto Montemanni,et al.  A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System , 2002 .

[69]  Antonella Carbonaro,et al.  An ANTS heuristic for the frequency assignment problem , 2000, Future Gener. Comput. Syst..

[70]  Guy Theraulaz,et al.  Routing in Telecommunications Networks with Ant-Like Agents , 1999, IATA.

[71]  Vittorio Maniezzo,et al.  Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..

[72]  Devika Subramanian,et al.  Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.

[73]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

[74]  Mark H. Keaton,et al.  Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches , 1989 .

[75]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[76]  Cyril Fonlupt,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

[77]  Joost N. Kok,et al.  Genetic Improvement of Railway Timetables , 1994, PPSN.

[78]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

[79]  B. Kulkarni,et al.  An ant colony approach for clustering , 2004 .

[80]  S. Araya,et al.  An optimal rescheduling for online train traffic control in disturbed situations , 1983, The 22nd IEEE Conference on Decision and Control.

[81]  J. A. Bland.  Space-planning by ant colony optimisation , 1999 .

[82]  Michael Kolonko,et al.  Analysing stability and investments in railway networks using advanced evolutionary algorithms , 2004 .

[83]  Richard F. Hartl,et al.  Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection , 2006, Eur. J. Oper. Res..

[84]  Te-Wei Chiang,et al.  Knowledge-Based System for Railway Scheduling , 1998, Data Knowl. Eng..

[85]  A. Mcguire,et al.  What is it to be a model? , 2000, HEPAC Health Economics in Prevention and Care.

[86]  Dario Pacciarelli,et al.  A Tabu Search Algortihm for the Railway Scheduling Problem , 2001 .

[87]  U. T. Zimmermann,et al.  Train Schedule Optimization in Public Rail Transport , 2003 .

[88]  X. Cai,et al.  A fast heuristic for the train scheduling problem , 1994, Comput. Oper. Res..

[89]  Patrick R. McMullen,et al.  An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives , 2001, Artif. Intell. Eng..

[90]  J. A. Bland.  LAYOUT OF FACILITIES USING AN ANT SYSTEM APPROACH , 1999 .

[91]  Vitorino Ramos,et al.  Artificial Ant Colonies in Digital Image Habitats - A Mass Behaviour Effect Study on Pattern Recognition , 2004, ArXiv.

[92]  Said Salhi,et al.  An ant system algorithm for the mixed vehicle routing problem with backhauls , 2004 .

[93]  Bernd Scheuermann,et al.  FPGA implementation of population-based ant colony optimization , 2004, Appl. Soft Comput..

[94]  Donald E. Brown,et al.  Freight Routing and Scheduling at CSX Transportation , 1992 .

[95]  Bernard Yannou,et al.  Optimization of the keyboard arrangement problem using an Ant Colony algorithm , 2003, Eur. J. Oper. Res..

[96]  E. R. Petersen.  Over-the-Road Transit Time for a Single Track Railway , 1974 .

[97]  Y Iida.  TIMETABLE PREPARATION BY A. I. APPROACH , 1988 .

[98]  Vincent A. Cicirello.  A Game-Theoretic Analysis of Multi-Agent Systems for Shop Floor Routing , 2001 .

[99]  T. Fukuda,et al.  A knowledge-based approach for railway scheduling , 1991, [1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application.

[100]  E. Bonabeau,et al.  Routing in Telecommunications Networks with “ Smart ” Ant-Like Agents , 1998 .

[101]  Patrick T. Harker,et al.  A DECISION SUPPORT SYSTEM FOR TRAIN DISPATCHING: AN OPTIMIZATION-BASED METHODOLOGY , 1990 .

[102]  Mustapha Nourelfath,et al.  Ant system for reliability optimization of a series system with multiple-choice and budget constraints , 2005, Reliab. Eng. Syst. Saf..

[103]  V. K. Jayaraman,et al.  Ant colony framework for optimal design and scheduling of batch plants , 2000 .

[104]  Jose Miguel Puerta,et al.  Ant colony optimization for learning Bayesian networks , 2002, Int. J. Approx. Reason..

[105]  Jurij Silc,et al.  Solving the mesh-partitioning problem with an ant-colony algorithm , 2004, Parallel Comput..

[106]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[107]  Maged M. Dessouky,et al.  A Simulation Modeling Methodology for Analyzing Large Complex Rail Networks , 1995, Simul..

[108]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[109]  Gerth Stølting Brodal,et al.  Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries , 2004, ATMOS.

[110]  Nicolas Monmarché,et al.  On how Pachycondyla apicalis ants suggest a new search algorithm , 2000, Future Gener. Comput. Syst..