Solving the shortest route cut and fill problem using simulated annealing

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 2003-02, Vol.145 (1), p.72-84
Hauptverfasser: Henderson, Darrall, Vaughan, Diane E, Jacobson, Sheldon H, Wakefield, Ron R, Sewell, Edward C
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 SRCFP. To assess the effectiveness of simulated annealing on the SRCFP, a greedy algorithm is constructed to compute an upper bound and the Held–Karp 1-tree lower bound is used to compute a lower bound. Extensive computational results are reported using several randomly generated instances of the SRCFP.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(02)00206-0