Solving the shortest route cut and fill problem using simulated annealing (original) (raw)

Solving the shortest route cut and fill problem using simulated annealing

European Journal of Operational Research, 2003

Abstract

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 ...

Ron Wakefield hasn't uploaded this paper.

Let Ron know you want this paper to be uploaded.

Ask for this paper to be uploaded.