Abstract Timetabling problems are specific types of scheduling that deal with assigning certain events to the timeslots. This is subject hard constraints should be achieved get a feasible timetable and soft must meet as many possible during forming schedule. paper introduces an adaptive tabu search. Eleven benchmark datasets year 2002 applied show effectiveness introduced algorithm. These consi...

The Split Delivery Vehicle Routing Problem (SDVRP) is a variant of the classical Capacitated Vehicle Routing Problem where multiple visits to each customer are allowed. It is an NP-hard problem where exact solutions are difficult to obtain in a reasonable time. This paper shows a tabu search heuristic with granular neighborhood called Randomized Granular Tabu Search that uses a tabu search tech...