Adaptive memory programming for the dynamic bipartite drawing problem.

•A solution-based tabu search to solve DBDP including adding and deleting vertices.•A constrained neighborhood structure with a fast evaluation strategy.•An adaptive perturbation phase to vary the perturbation intensity.•The conducted experiments show the efficiency of the proposed algorithm.