McInvale, Howard D.2014-03-142014-03-142002-04-22etd-04292002-164112http://hdl.handle.net/10919/42356This 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 NP-hard. The SRCFP describes the process of reshaping terrain through a series of cuts and fills. This process is commonly done when leveling land for building homes, parking lots, etc. The model used to represent this natural system is a variation of the Traveling Salesman Problem. The model is designed to limit the time needed to operate expensive, earthmoving vehicles. The model finds a vehicle route that minimizes the total time required to travel between cut and fill locations while leveling the site. An optimal route is a route requiring the least amount of travel time for an individual earthmoving vehicle. This research addresses the SRCFP by evaluating minimum function values across an unknown response surface. The result is a cost estimating strategy that provides construction planners a strategy for contouring terrain as cheaply as possible. Other applications of this research include rapid runway repair, and robotic vehicle routing.In CopyrightDiscrete OptimizationTraveling Salesman ProblemHeuristicsVehicle Routing ProblemsLocal Search AlgorithmsShortest Route Cut-Fill ProblemGeneralized Hill Climbing AlgorithmsThesishttp://scholar.lib.vt.edu/theses/available/etd-04292002-164112/