A PTS-PGATS based approach for data-intensive scheduling in data grids
Frontiers of Computer Science in China
Hi-index | 0.00 |
TS (Tabu Search) is one of the meta-heuristic algorithms that can solve the combinatorial optimization problems, which is NP-hard such as TSPs (traveling salesman problems), satisfied. With the requirement of solving large-scale problems, we proposed a new Parallel Tabu Search (PTS) approach, which was cooperated with genetic crossover operation, for TSPs. In addition, a novel adaptive search strategy of intensification and diversification was proposed to improve the solution quality and efficiency in TS. Taking TSPs as sample, some simulate experiments were implemented. It was showed that our proposed PTS approach was feasible and effective.