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

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

0.00 Avg rating0 Votes
Article ID: iaor20062902
Country: United Kingdom
Volume: 56
Issue: 7
Start Page Number: 816
End Page Number: 824
Publication Date: Jul 2005
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.