Skip to main content
Contribution to Book
A Bio-Inspired Approach for a Dynamic Railway Problem
Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007) (2007)
  • P.C. Pop
  • Camelia Pintea
  • C.P. Sitar
  • D. Dumitrescu
Abstract
We consider the Railway Traveling Salesman Problem, denoted RTSP, in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having the goal to minimize the overall time of the journey. The RTSP is NP-hard and it is related to the Generalized Traveling Salesman Problem. The work done so far deals with static problems, where all the data are known in advance, i.e. before the optimization has started. The technological advances of the last few years give rise to a new class of problems, namely the dynamic railway traveling salesman problems, where new information are received as time progresses and must be dynamically incorporated into an evolving schedule. In this paper a dynamic railway traveling salesman problem is examined and a solving strategy, based on the Ant Colony Optimization, is proposed. Finally, computational results are reported for real-world and synthetic data.
Keywords
  • railway problem,
  • dynamism,
  • ant colony
Publication Date
2007
Citation Information
P.C. Pop, Camelia Pintea, C.P. Sitar and D. Dumitrescu. "A Bio-Inspired Approach for a Dynamic Railway Problem" Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007) (2007)
Available at: http://works.bepress.com/cmpintea/21/