Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0377-2217(02)00206-0 | European Journal of Operational Research |
Keywords | Field | DocType |
Heuristics,Simulated annealing,Traveling salesman problem,Local search algorithms,Shortest route problem | Simulated annealing,Mathematical optimization,Upper and lower bounds,Greedy algorithm,Heuristics,Travelling salesman problem,2-opt,Discrete optimization problem,Mathematics,Cut and fill | Journal |
Volume | Issue | ISSN |
145 | 1 | 0377-2217 |
Citations | PageRank | References |
8 | 1.01 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Darrall Henderson | 1 | 14 | 2.03 |
| Diane E. Vaughan | 2 | 21 | 3.39 |
| Sheldon H. Jacobson | 3 | 615 | 76.52 |
| Ron R. Wakefield | 4 | 8 | 1.01 |
| Edward C. Sewell | 5 | 115 | 13.21 |