Tabu search embedded simulated annealing for the shortest route cut and fill problem

Abstract

The shortest route cut and fill problem proposed by Henderson et al¹ is studied in this paper where we extend the model to include multiple vehicles and a makespan objective. A new tabu search embedded simulated annealing algorithm for both models is developed. Computational experiments show that the new approach is robust and achieves better solutions when compared with those found using Henderson et al's algorithm for larger test cases within significantly shorter times.

Keywords:

• cut and fill
• tabu search
• simulated annealing