Title:
Dray Optimization in Truck/Rail Networks

dc.contributor.advisor Nemhauser, George L.
dc.contributor.advisor Sokol, Joel S.
dc.contributor.author Ileri, Yetkin en_US
dc.contributor.committeeMember Erera, Alan L.
dc.contributor.committeeMember Wikum, Erik
dc.contributor.committeeMember Ergun, Özlem
dc.contributor.department Industrial and Systems Engineering en_US
dc.date.accessioned 2007-03-27T18:03:42Z
dc.date.available 2007-03-27T18:03:42Z
dc.date.issued 2007-02-06 en_US
dc.description.abstract Daily drayage operations involve moving loaded or empty equipment between customer locations and rail ramps. Drayage orders are generally pickup and delivery requests with time windows. The repositioning of empty equipment may also be required in order to facilitate loaded movements. The drayage orders are satisfied by a heterogeneous fleet of drivers. Driver routes must satisfy various operational constraints. In the first part of the dissertation, our goal is to minimize the cost of daily drayage operations in a region on a given day. We present an optimization methodology for finding cost-effective schedules for regional daily drayage operations. The core of the formulation is a set partitioning model whose columns represent routes. Routes are added to the formulation by column generation. We present numerical results for real-world data which demonstrate that our methodology produces low cost solutions in a reasonably short time. The second part of the dissertation addresses minimizing total empty mileage when driver capacity is not restrictive and new orders are added to the problem in an online fashion. We present a lower bound for the worst case guarantee of any deterministic online algorithm. We develop a solution methodology and provide results for the performance of different scheduling policies and parameters in a simulated environment. In the third part of the dissertation, we study a system with one rail ramp and one customer location which is served by a single driver. The problem has discrete time periods and at most one new order is released randomly each time period. The objective is to maximize the expected number of orders covered. With this simple problem, we seek to learn more about route planning for a single driver under uncertainty. We prove that carrying out an order ready to be picked up at the driver's current location is optimal for the case with one customer location. We show that the structure of the optimal policies is not simple and depends on various parameters. We devise a simple policy which yields provably near-optimal results and identify a case for which that policy is optimal. en_US
dc.description.degree Ph.D. en_US
dc.format.extent 779153 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/13968
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject Online scheduling and routing en_US
dc.subject Drayage en_US
dc.subject Logistics optimization en_US
dc.title Dray Optimization in Truck/Rail Networks en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Nemhauser, George L.
local.contributor.advisor Sokol, Joel S.
local.contributor.corporatename H. Milton Stewart School of Industrial and Systems Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication cc31c1dc-5388-470a-9c3f-f8976a299674
relation.isAdvisorOfPublication fd687063-25e2-4172-bb19-8398f525e7c1
relation.isOrgUnitOfPublication 29ad75f0-242d-49a7-9b3d-0ac88893323c
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ileri_yetkin_200612_phd.pdf
Size:
760.89 KB
Format:
Adobe Portable Document Format
Description: