Land Leveling Using Optimal Earthmoving Vehicle Routing

Land Leveling Using Optimal Earthmoving Vehicle Routing

This thesis presents new solution approaches for land leveling, using optimal earthmoving vehicle routing. It addresses the Shortest Route Cut and Fill Problem (SRCFP) developed by Henderson, Vaughan, Wakefield and Jacobson [2000]. The SRCFP is a discrete optimization search problem, proven to be...

Full description

Bibliographic Details
Main Author: McInvale, Howard D.
Other Authors: Industrial and Systems Engineering
Format: Others
Published: Virginia Tech 2014
Subjects:
Discrete Optimization
Traveling Salesman Problem
Heuristics
Vehicle Routing Problems
Local Search Algorithms
Shortest Route Cut-Fill Problem
Generalized Hill Climbing Algorithms
Online Access:http://hdl.handle.net/10919/42356
http://scholar.lib.vt.edu/theses/available/etd-04292002-164112/

Internet

http://hdl.handle.net/10919/42356
http://scholar.lib.vt.edu/theses/available/etd-04292002-164112/

Similar Items