Study on GA-based train dispatching

Last updated on 27 September 2013 3:21
Train dispatching is a large-scale, combinatorial and optimal problem that has been argued to be NPhard. Though this kind of problem can all get optimal solution by the enumerative method, but enumeration will cost a great lot of time. A lot of domestic and international scholars have been studying how...
Author(s): Li Ping;Jia Limin;Kang Xiong
2001
China
Log in or register to continue
Register for free individual access
  • Unlock research, articles and more
  • Get updates on RSSB’s activities