Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm
Abstract: Highlights•A novel method combines a solution-based tabu search and multiple neighborhood search.•The corresponding fast neighborhood evaluation methods for intensification.•A dynamic diversification phase which varies the diversification intensity.•The conducted experiments show the efficiency of the proposed algorithm.
Loading