Table of Contents
Journal of Applied Mathematics and Decision Sciences
Volume 2006, Article ID 95060, 28 pages
http://dx.doi.org/10.1155/JAMDS/2006/95060

ACS-TS: train scheduling using ant colony system

School of Railway Engineering, Iran University of Science and Technology, Tehran 16846-13114, Iran

Received 6 July 2005; Revised 15 January 2006; Accepted 18 January 2006

Copyright © 2006 Keivan Ghoseiri and Fahimeh Morshedsolouk. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. Amit and D. Goldfarb, “The timetable problem for railways,” Developments in Operations Research, vol. 2, pp. 379–387, 1971. View at Google Scholar
  2. S. Araya and K. Abe, “An optimal rescheduling for online train traffic control in disturber situations,” in Proceedings of the 22nd IEEE Conference on Decision and Control, pp. 489–494, Texas, December 1983. View at Google Scholar
  3. A. A. Assad, “Models for rail transportation,” Transportation Research, vol. 14 B, pp. 101–114, 1980. View at Google Scholar
  4. O. Baboglu, H. Meling, and A. Montresor, “Anthill: a framework for the development of agent based peer-to-peer systems,” Tech. Rep. UBLCS-2001-09, Department of Computer Science, University of Bologna, Bologna, 2001. View at Google Scholar
  5. B. Barán and R. Sosa, “AntNet routing algorithm for data networks based on mobile agents,” Intelligencia Artificial, vol. 12, pp. 75–84, 2001. View at Google Scholar
  6. A. Baykasoglu, T. Dereli, and I. Sabuncu, “An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems,” to appear in Omega.
  7. J. E. Bell and P. R. McMullen, “Ant colony optimization techniques for the vehicle routing problem,” Advanced Engineering Information, vol. 18, pp. 41–48, 2004. View at Publisher · View at Google Scholar
  8. L. Bianchi, L. M. Gambardella, and M. Dorigo, “An ant colony optimization approach to the probabilistic traveling salesman problem,” Mathematical Modeling and Algorithms, vol. 3, no. 4, pp. 403–425, 2004. View at Publisher · View at Google Scholar
  9. J. A. Bland, “Layout of facilities using an ant system approach,” Engineering Optimization, vol. 32, no. 1, pp. 101–115, 1999. View at Google Scholar
  10. J. A. Bland, “Space–planning by ant colony optimization,” International Journal of Computer Applications in Technology, vol. 12, no. 6, pp. 320–328, 1999. View at Publisher · View at Google Scholar
  11. J. A. Bland, “Optimal structural design by ant colony optimization,” Engineering Optimization, vol. 33, pp. 425–443, 2001. View at Google Scholar
  12. C. Blum, “Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop scheduling,” Computers & Operations Research, vol. 32, no. 6, pp. 1565–1591, 2005. View at Publisher · View at Google Scholar
  13. E. Bonabeau, F. Henaux, S. Guerin, D. Snyers, P. Kuntz, and G. Theraulaz, “Routing in telecommunication networks with “Smart” ant-like agents,” in Proceedings of the 2nd International Workshop on Intelligent Agents for Telecommunication Applications (IATA '98), vol. 1437 of Lectures Notes in AI, Springer, New York, 1998. View at Google Scholar
  14. G. S. Brodal and R. Jacob, “Time-dependent networks as models to achieve fast exact time-table queries,” Electronic Notes in Theoretical Computer Science, vol. 92, pp. 3–15, 2004. View at Publisher · View at Google Scholar
  15. B. Bullnheimer, R. F. Hartl, and C. Strauss, “An improved ant system algorithm for the vehicle routing problem,” Annals of Operations Research, vol. 89, pp. 319–328, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. X. Cai and C. H. Goh, “A fast heuristic for the train scheduling problem,” Computers and Operation Research, vol. 21, no. 5, pp. 499–510, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. M. Carey and D. Lockwood, “A model, algorithms and strategy for train pathing,” Operational Research Society, vol. 46, pp. 988–1005, 1985. View at Google Scholar
  18. B. Chen and P. T. Harker, “Two moments estimation of the delay on single-track rail lines with scheduled traffic,” Transportation Science, vol. 24, no. 4, pp. 261–275, 1990. View at Google Scholar · View at MathSciNet
  19. Y. Cheng, “Hybrid simulation for resolving resource conflicts in train traffic rescheduling,” Computers in Industry, vol. 35, no. 3, pp. 233–246, 1998. View at Publisher · View at Google Scholar
  20. T. Chiang, H. Hau, H. Chiang, S. Ko, and C. Hsieh, “Knowledge-based system for railway scheduling,” Data & Knowledge Engineering, vol. 27, no. 3, pp. 289–312, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. V. Cicirello, “A game-theoretic analysis of multi-agent systems for shop floor routing,” Tech. Rep. CMU-RI-TR-01-28, Robotics Institute, Carnegie Mellon University, Pennsylvania, 2001. View at Google Scholar
  22. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian, “Ant system for job shop scheduling,” Operations Research, Statistics and Computer Science, vol. 34, no. 1, pp. 39–53, 1994. View at Google Scholar
  23. J. F. Cordeau, P. Toth, and D. Vigo, “A survey of optimization models for train routing and scheduling,” Transportation Science, vol. 32, pp. 380–404, 1998. View at Google Scholar · View at Zentralblatt MATH
  24. O. Cordon, I. Fernandez de Viana, F. Herrera, and L. Moreno, “A new ACO model integrating evolutionary computation concepts: the best-worst ant system,” in Abstract Proceedings of ANTS2000 - From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant Algorithms, M. Dorigo, M. Middendorf, and T. Stutzle, Eds., pp. 22–29, Brussels, 2000. View at Google Scholar
  25. D. Costa and A. Hertz, “Ants can colour graphs,” Journal of the Operational Research Society, vol. 48, pp. 295–305, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  26. J. E. Cury, F. A. C. Gomide, and M. J. Mendes, “A methodology for generation of optimal schedules for an underground railway system,” IEEE Transaction on Automatic Control, vol. 25, no. 2, pp. 217–222, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  27. L. M. de Campos, J. M. Fernández-Luna, J. A. Gámez, and J. M. Puerta, “Ant colony optimization for learning Bayesian networks,” International Journal of Approximate Reasoning, vol. 31, no. 3, pp. 291–311, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. M. Dessouky and R. C. Leachman, “A simulation modeling methodology for analyzing large complex rail networks,” Simulation, vol. 65, no. 2, pp. 131–142, 1995. View at Google Scholar
  29. G. Di Caro and M. Dorigo, “AntNet: a mobile agents approach to adaptive routing,” Artificial Intelligence Research, vol. 9, pp. 317–365, 1997. View at Google Scholar
  30. G. Di Caro and M. Dorigo, “Extending antNet for best-effort quality-of- service routing,” in Presentation at ANTS '98 - From Ant Colonies to Artificial Ants: 1st International Workshop on Ant Colony Optimization, Brussels, October 1998. View at Google Scholar
  31. K. F. Doerner, W. J. Gutjahr, R. F. Hartl, C. Strauss, and C. Stummer, “Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection,” to appear in European Journal of Operational Research.
  32. K. F. Doerner, R. F. Hartl, and M. Reimann, Cooperative Ant Colonies for Optimizing Resource Allocation in Transportation. Applications of Evolutionary Computing, vol. 2037 of Lecture Notes in Computer Science (LNCS), Springer, Berlin, 2000.
  33. K. F. Doerner, R. F. Hartl, and M. Reimann, “CompetAnts for problem solving: the case of full truckload transportation,” Central European Journal of Operations Research, vol. 11, no. 2, pp. 115–141, 2003. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. M. Dorigo and G. Di Caro, “The ant colony optimization meta-heuristic,” in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds., pp. 11–32, McGraw-Hill, London, 1999. View at Google Scholar
  35. M. Dorigo, G. Di Caro, and L. M. Gambardella, “Ant algorithms for discrete optimization,” Artificial Life, vol. 5, no. 2, pp. 137–172, 1999. View at Publisher · View at Google Scholar
  36. M. Dorigo and L. M. Gambardella, “Ant colonies for the traveling salesman problem,” BioSystems, vol. 43, no. 2, pp. 73–81, 1997. View at Publisher · View at Google Scholar
  37. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Publisher · View at Google Scholar
  38. M. Dorigo, V. Maniezzo, and A. Colorni, “Positive feedback as a search strategy,” Tech. Rep. 91-016, Dipartimento di Elettronica, Politecnico di Milano, Milano, 1991. View at Google Scholar
  39. J. Dréo and P. Siarry, “Continuous interacting ant colony algorithm based on dense heterarchy,” Future Generation Computer Systems, vol. 20, pp. 841–856, 2004. View at Google Scholar
  40. J. Eggers, D. Feillet, S. Kehl, M. O. Wagner, and B. Yannou, “Optimization of the keyboard arrangement problem using an ant colony algorithm,” European Journal of Operational Research, vol. 148, no. 3, pp. 672–686, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  41. O. Engelhardt-Funke and M. Kolonko, “Analysing stability and investments in railway networks using advanced evolutionary algorithms,” International Transactions in Operational Research, vol. 11, no. 4, pp. 381–394, 2004. View at Publisher · View at Google Scholar
  42. M. Fabinkue, “A swarm intelligence approach to constraint satisfaction,” in Proceedings of the 6th Conference on Integrated Design and Process Technology (IDPT '02), Texas, June 2002. View at Google Scholar
  43. M. Fischetti, J. Salazar-Gonzales, and P. Toth, “The generalized traveling salesman problem and orienteering problem,” in Traveling Salesman Problem and Its Variations, G. Gutin and A. P. Punnen, Eds., pp. 609–663, Kluwer Academic, Dordrecht, 2002. View at Google Scholar
  44. P. Forsyt and A. Wren, “An ant system for bus driver scheduling,” in Proceedings of the 7th International Workshop on Computer-Aided Scheduling of Public Transport Preprints, pp. 405–421, Center for Transportation Studies, MIT, Massachusetts, 1997. View at Google Scholar
  45. O. Frank, “Two-way traffic on a single line of railway,” Operations Research, vol. 14, pp. 801–811, 1965. View at Google Scholar · View at Zentralblatt MATH
  46. L. M. Gambardella and M. Dorigo, “An ant colony system hybridized with a new local search for the sequential ordering problem,” INFORMS Journal on Computing, vol. 12, no. 3, pp. 237–255, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  47. L. M. Gambardella, E. Taillard, and G. Agazzi, “MACS-VRPTW: vehicle routing problem with time windows,” in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds., pp. 63–76, McGraw-Hill, London, 1999. View at Google Scholar
  48. L. M. Gambardella, E. Taillard, and M. Dorigo, “Ant colonies for the quadratic assignment problem,” Operational Research Society, vol. 50, no. 2, pp. 167–176, 1999. View at Google Scholar · View at Zentralblatt MATH
  49. J. A. Gámez and J. M. P. Puetra, “Searching for the best elimination sequence in Bayesian networks by using ant colony optimization,” Pattern Recognition Letters, vol. 23, no. 1–3, pp. 261–277, 2002. View at Publisher · View at Google Scholar
  50. X. Gandibleux, X. Delorme, and K. Tkindt, “An Ant Colony Optimization Algorithm for The Set Packing Problem,” submitted to Ants '04, 4th International Workshop on Ant Colony Optimization and Swarm Intelligence, 2004.
  51. K. Ghoseiri, F. Szidarovszky, and M. J. Asgharpour, “A multi-objective train scheduling: model and solution,” Transportation Research, vol. 38 B, pp. 927–952, 2004. View at Google Scholar
  52. M. F. Gorman, “An application of genetic and tabu searches to the freight railroad operating plan problem,” Annals of Operations Research, vol. 78, pp. 51–69, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  53. M. Gravel, W. Price, and C. Gagné, “Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic,” European Journal of Operational Research, vol. 143, no. 1, pp. 218–229, 2002. View at Publisher · View at Google Scholar
  54. G. Gutin and A. P. Punnen, The Traveling Salesman Problem and Its Variations, vol. 12 of Combinatorial Optimization, Kluwer Academic, Dordrecht, 2002. View at MathSciNet
  55. M. Heusse, S. Guerin, D. Snyers, and P. Kuntz, “Adaptive agent-driven routing and load balancing in communication networks,” Advances in Complex Systems, vol. 1, pp. 237–254, 1998. View at Publisher · View at Google Scholar
  56. A. Higgins and E. Kozan, “Modeling train delays in urban networks,” Transportation Science, vol. 32, no. 4, pp. 346–357, 1998. View at Google Scholar
  57. A. Higgins, E. Kozan, and L. Ferreira, “Heuristic techniques for single line train scheduling,” Journal of Heuristics, vol. 3, no. 1, pp. 43–62, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  58. C. L. Huntley, D. E. Brown, D. E. Sappington, and B. P. Markowicz, “Freight routing and scheduling at CSX,” Transportation Interfaces, vol. 25, no. 3, pp. 58–71, 1995. View at Google Scholar
  59. Y. Iida, “Timetable preparation by A.I approach,” in Proceeding of European Simulation Multiconference, pp. 163–168, Nice, 1988. View at Google Scholar
  60. V. K. Jayaraman, B. D. Kulkarni, and K. Gupta, “Dynamic optimization of fed-batch bioreactors using the ant algorithm,” Biotechnology Progress, vol. 17, no. 1, pp. 81–88, 2001. View at Publisher · View at Google Scholar
  61. V. K. Jayaraman, B. D. Kulkarni, S. Karale, and P. Shelokar, “Ant colony framework for optimal design and scheduling of batch plants,” Computers and Chemical Engineering, vol. 24, no. 8, pp. 1901–1912, 2000. View at Publisher · View at Google Scholar
  62. J. Jong and M. Wiering, “Multiple ant colony systems for the bus stop allocation problem,” in Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence, pp. 141–148, Amsterdam, 2001. View at Google Scholar
  63. D. Jovanovic and P. T. Harker, “A decision support system for train dispatching: an optimization-based methodology,” Journal of the Transportation Research Forum, vol. 30, no. 1, pp. 25–37, 1990. View at Google Scholar
  64. M. H. Keaton, “Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches,” Transportation Research Part B, vol. 23, no. 6, pp. 415–431, 1989. View at Publisher · View at Google Scholar
  65. K. Komaya and T. Fukuda, “A knowledge-based approach for railway scheduling,” in The 7th IEEE Conference on Artificial Intelligence Applications, pp. 405–411, Florida, 1991. View at Google Scholar
  66. P. Korošec, J. Šilc, and B. Robič, “Solving the mesh-partitioning problem with an ant-colony algorithm,” Parallel Computing, vol. 30, no. 5-6, pp. 785–801, 2004. View at Publisher · View at Google Scholar
  67. R. D. Kraay and P. T. Harker, “Real-time scheduling of freight railroads,” Transportation Research Part B: Methodological, vol. 29, no. 3, pp. 213–229, 1995. View at Publisher · View at Google Scholar
  68. R. S. K. Kwan and P. Mistry, “A co-evolutionary algorithm for train timetabling,” Research Report Series 2003.13, Manno, 2003. View at Google Scholar
  69. A. Lim, J. Lin, B. Rodrigues, and F. Xiao, “Ant colony optimization with hill climbing for the bandwidth minimization problem,” to appear in Applied Soft Computing.
  70. T. Lindner, Train schedule optimization in public rail transport, M.S. thesis, Technische Universitat, Braunschweig, 2000.
  71. V. Maniezzo, “Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem,” INFORMS Journal on Computing, vol. 11, no. 4, pp. 358–369, 1999. View at Google Scholar · View at MathSciNet
  72. V. Maniezzo and A. Carbonaro, “An ANTS heuristic for the frequency assignment problem,” Future Generation Computer Systems, vol. 16, no. 8, pp. 927–935, 2000. View at Publisher · View at Google Scholar
  73. V. Maniezzo, A. Carbonaro, M. Golfarelli, and S. Rizzi, “ANTS for data warehouse logical design,” in Proceedings of the 4th Metaheuristics International Conference, pp. 249–254, Porto, 2001. View at Google Scholar
  74. V. Maniezzo and A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Data and Knowledge Engineering, vol. 11, no. 5, pp. 769–778, 1999. View at Publisher · View at Google Scholar
  75. V. Maniezzo, A. Colorni, and M. Dorigo, “The ant system applied to the quadratic assignment problem,” Tech. Rep. IRIDIA/94-28, 1994. View at Google Scholar
  76. R. D. Martinelli and H. Teng, “Optimization of railway operations using meural networks,” Transportation Research, vol. 4c, pp. 33–49, 1996. View at Google Scholar
  77. P. R. Mcmullen, “An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives,” Artificial Intelligence in Engineering, vol. 15, no. 1, pp. 309–317, 2001. View at Publisher · View at Google Scholar
  78. R. Michel and M. Middendorf, “An ACO algorithm for the shortest supersequence problem,” in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds., pp. 51–61, McGraw Hill, London, 1999. View at Google Scholar
  79. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, “Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems,” Artificial Intelligence, vol. 58, no. 1–3, pp. 161–205, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  80. N. Monmarché, G. Venturini, and M. Slimane, “There how pachycondyla apicalis ants suggest is new search algorithm,” Future Generation Systems Computer, vol. 16, no. 8, pp. 937–946, 2000. View at Google Scholar
  81. R. Montemanni, L. M. Gambardella, A. E. Rizzoli, and A. V. Donati, “A new algorithm for a dynamic vehicle routing problem based on ant colony system,” Tech. Rep. IDSIA-05-02, November 2002, ftp://ftp.idsia.ch/pub/techrep/IDSIA-23-02.pdf.gz. View at Google Scholar
  82. R. Montemanni, D. H. Smith, and S. M. Allen, “An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference,” IEEE Transactions on Vehicular Technology, vol. 51, no. 5, pp. 949–953, 2002. View at Publisher · View at Google Scholar
  83. K. Nachtigall and S. Voget, “A genetic algorithm approach to periodic railway synchronization,” Computers & Operations Research, vol. 23, no. 5, pp. 453–463, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  84. N. Nahas and M. Nourelfath, “Ant system for reliability optimization of a series system with multiple-choice and budget constraints,” Reliability Engineering and System Safety, vol. 87, no. 1, pp. 1–12, 2005. View at Publisher · View at Google Scholar
  85. C. E. Noon and J. C. Bean, “A Lagrangian based approach for the asymmetric generalized traveling salesman problem,” Operations Research, vol. 39, no. 4, pp. 623–632, 1991. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  86. D. Pacciarelli and M. Pranzo, “A Tabu search algorithm for the railway scheduling problem,” in Proceedings of the 4th Metaheuristic International Conference, pp. 16–20, Porto, 2001. View at Google Scholar
  87. Peat, Marwick, and Mitchell & Co., “Train dispatching simulation model: capabilities and description. USA,” Report DOT-FR-4-5014-1, Federal Railroad Administration, Department of Transportation, Washington, DC, March 1975. View at Google Scholar
  88. E. R. Petersen, “Over the road transit time for a single track railway,” Transportation Science, vol. 8, pp. 65–74, 1974. View at Google Scholar
  89. V. Ramos and F. Almeida, “Artificial ant colonies in digital image habitats - a mass behavior effect study on pattern recognition,” in Proceedings of the 2nd International Workshop on Ant Algorithms - From Ant Colonies to Artificial Ants, September 2000. View at Google Scholar
  90. M. Reimann and M. Laumanns, “Savings based ant colony optimization for the capacitated minimum spanning tree problem,” to appear in Computers and Operations Research.
  91. A. E. Rizzoli, A. V. Donati, L. M. Gambardella, N. Casagrande, and R. Montemanni, “Time dependent vehicle routing problem with an ant colony system,” Tech. Rep. IDSIA-17-03, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Manno, 2002. View at Google Scholar
  92. A. Roli, C. Blum, and M. Dorigo, “ACO for maximal constraint satisfaction problems,” in Proceeding of the 4th Metaheuristics International Conference, vol. 1, pp. 187–191, Porto, 2001. View at Google Scholar
  93. B. Scheuermann, K. So, M. Guntsch, M. Middendorf, O. Diessel, H. ElGindy, and H. Schmeck, “FPGA implementation of population-based ant colony optimization,” Applied Soft Computing, vol. 4, no. 3, pp. 303–322, 2004. View at Publisher · View at Google Scholar
  94. R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz, “Ant based load balancing in telecommunications networks,” Adaptive Behavior, vol. 5, no. 2, pp. 169–207, 1996. View at Google Scholar
  95. M. Sepehri, “Railway crew scheduling with grouping evolutionary algorithm,” Amir Kabir Engineering Journal, vol. 14, no. 54, pp. 565–577, 2003 (). View at Google Scholar
  96. P. S. Shelokar, V. K. Jayaraman, and B. D. Kulkarni, “An ant colony approach for clustering,” Analytica Chimica Acta, vol. 509, no. 2, pp. 187–195, 2004. View at Publisher · View at Google Scholar
  97. L. Shi, J. Hao, J. Zhou, and G. Xu, “Ant colony optimization algorithm with random perturbation behavior to the problem of optimal unit commitment with probabilistic spinning reserve determination,” Electric Power Systems Research, vol. 69, no. 2-3, pp. 295–303, 2004. View at Publisher · View at Google Scholar
  98. K. Socha, M. Sampels, and M. Manfrin, “Ant algorithms for the university course timetabling problem with regard to the state-of-the-art,” Computer Science, vol. 2611, pp. 334–345, 2003. View at Google Scholar
  99. M. Solimanpur, P. Vrat, and R. Shankar, “Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing,” European Journal of Operational Research, vol. 157, no. 3, pp. 592–606, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  100. M. Solimanpur, P. Vrat, and R. Shankar, “An ant algorithm for the single row layout problem in flexible manufacturing systems,” Computers & Operations Research, vol. 32, no. 3, pp. 583–598, 2005. View at Publisher · View at Google Scholar
  101. T. Stutzle, “An ant approach to the flow shop problem,” in Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing, vol. 3, pp. 1560–1564, Aachen, 1998. View at Google Scholar
  102. T. Stutzle and H. Hoos, “MAX-MIN ant system,” Future Generation Computer Systems, vol. 16, no. 8, pp. 889–914, 2000. View at Publisher · View at Google Scholar
  103. D. Subramanian, P. Druschel, and J. Chen, “Ants and reinforcement learning: a case study in routing in dynamic networks,” in Proceedings of the International Joint Conference on Artificial Intelligence, pp. 832–838, Morgan Kaufmann, Nagoya, 1997. View at Google Scholar
  104. B. Szpigel, “Optimal train scheduling on a single-track railway,” in Operational Research '72, M. Ross, Ed., OR'72, pp. 343–351, North-Holland, Amsterdam, 1972. View at Google Scholar
  105. E. G. Talbi, O. Rouxb, C. Fonlupt, and D. Robillard, “Parallel ant colonies for the quadratic assignment problem,” Future Generation Computer Systems, vol. 17, no. 4, pp. 441–449, 2001. View at Publisher · View at Google Scholar
  106. E. S. Tzafestas, “Experiences from the development and use of simulation software for complex systems education,” in Proceedings of the World Conference on the WWW and Internet (WebNet-2000), Texas, November 2000. View at Google Scholar
  107. R. Van der Put, “Routing in the faxfactory using mobile agents,” Tech. Rep. R & D-SV-98-276, KPN Research, Groningen, 1998. View at Google Scholar
  108. M. C. Van Wezel, J. N. Kok, J. N. Van den Berg, and W. Van Kampen, “Genetic improvement of railway timetables,” Computer Science, vol. 866, pp. 566–574, 1994. View at Google Scholar
  109. K. Vijayakumar, G. Prabhaharan, P. Asokan, and R. Saravanan, “Optimization of multi-pass turning operations using ant colony system,” International Journal of Machine Tools & Manufacture, vol. 43, no. 15, pp. 1633–1639, 2003. View at Publisher · View at Google Scholar
  110. A. Wade and S. Salhi, “An ant system algorithm for the mixed vehicle routing problem with backhauls,” in Metaheuristics: Computer Decision-Making, pp. 699–719, Kluwer Academic, Dordrecht, 2004. View at Google Scholar
  111. T. White, B. Pagurek, and F. Oppacher, “Connection management using adaptive mobile agents,” in Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '98), pp. 802–809, CSREA Press, Nevada, 1998. View at Google Scholar
  112. I. K. Yu and Y. H. Song, “A novel short-term generation scheduling technique of thermal units using ant colony search algorithms,” International Journal of Electrical Power and Energy Systems, vol. 23, no. 6, pp. 471–479, 2001. View at Publisher · View at Google Scholar
  113. Z. Zhou and Z. Liu, “Intelligent ant-based algorithm with applications in dynamic routing optimization of telecommunication networks,” Telecommunications Science, vol. 14, no. 11, pp. 10–13, 1998. View at Google Scholar
  114. M. Zweben, E. Davis, E. Daun, and M. J. Deale, “Scheduling and rescheduling with iterative repair,” IEEE Transaction on Systems, Man, and Cybernetics, vol. 23, no. 6, pp. 1588–1596, 1993. View at Publisher · View at Google Scholar