The shortest route cut and fill problem in linear topological structure

@inproceedings{Guo2005TheSR,
  title={The shortest route cut and fill problem in linear topological structure},
  author={Songshan Guo and Weixing Li and Andrew Lim and Fan Wang},
  booktitle={SAC},
  year={2005}
}
In this paper, we study the Shortest Route Cut and Fill (SRCF) problem where a fleet of vehicles with fixed capacities travel between cut and fill points to finish all cut and fill requirements so that the travel time of the fleet is minimized. We state and classify the SRCF problem and present a complete view of its computational complexities with NP-hardness proof for the basic linear topological structure. Moreover, a simple cycle-based optimization method is proposed to solve the SRCF in… CONTINUE READING