3D Dynamic TSP Model and a Solution Based on GA
Dynamic TSP(DTSP), a time-constrained dynamic optimization problem, raise an attention these years due to be a practical extension on a classical NP hard problem. Being much harder, the 3D DTSP is modeled and solved by ultilizing a 3D GSInver-over and a Optimization operator and employing a gene-pool to shrink the search space consumedly. Experiments showed that a near global optimum could be always reached in real-time based on the above approaches.
Dynamic TSP Dynamic Optimization gene-pool
Dan Zhao Zhenhua Li Jing Chen
Computer School, China University of Geosciences. Computer School, China University of Geosciences
国际会议
武汉
英文
2007-09-21(万方平台首次上网日期,不代表论文的发表时间)