Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem

Publication Type

Journal Article

Publication Date

7-2005

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.

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Journal of the Operational Research Society

Volume

56

Issue

7

First Page

816

Last Page

824

ISSN

0160-5682

Identifier

10.1057/palgrave.jors.2601900

Publisher

Palgrave

Additional URL

https://doi.org/10.1057/palgrave.jors.2601900

Link to Full Text

Share

COinS