Solving the shortest route cut and fill problem using simulated annealing

@article{Henderson2003SolvingTS,
  title={Solving the shortest route cut and fill problem using simulated annealing},
  author={Darrall Henderson and Diane E. Vaughan and Sheldon H. Jacobson and Ron R. Wakefield and Edward C. Sewell},
  journal={European Journal of Operational Research},
  year={2003},
  volume={145},
  pages={72-84}
}
This paper introduces the shortest route cut and fill problem (SRCFP). The SRCFP is a NP-hard discrete optimization problem for leveling a construction project site, where the objective is to find a vehicle route that minimizes the total distance traveled by a single earthmoving vehicle between cut and fill locations. An optimal vehicle route is a route that minimizes the total haul distance that a single earthmoving vehicle travels. Simulated annealing algorithms are formulated to address the… CONTINUE READING