New dynamic TSP model and its solution
Jinhua Zheng · Computer Engineering and Applications Journal · 2008
The traveling sales man problem is a classical NP-hard problem.Many algorithms and methods existed in this area,however most of them are used to solve static problems which are much different from problems in dynamic environment of real world.So the Dynamic Traveling Sales man Problem (DTSP) is a new research area where researchers will concentrate on useful models and methods of practical TSP.In this paper,we proposed a new model for practical TSP called DTSP based on Gauss disturbance.Also we designed an algorithm to respond the dynamic change and improved the inver_over operator.The experimental results showed that our new model is useful for practical problem and the algorithm is effective.