A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems

► Development of an effective parallel multi-neighborhood tabu search. ► Evaluation of performance associated with using particular neighbourhoods given instance characteristics. ► Obtaining competitive results and a number of new best-known solutions.