Title:
Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks

Simple item page
dc.contributor.advisor Al-Khayyal, Faiz
dc.contributor.author Daniel, Aang en_US
dc.contributor.committeeMember Barnes, Earl R.
dc.contributor.committeeMember Johnson, Ellis L.
dc.contributor.committeeMember Karimi, I. A.
dc.contributor.committeeMember Sokol, Joel
dc.contributor.department Industrial and Systems Engineering en_US
dc.date.accessioned 2008-02-07T18:11:02Z
dc.date.available 2008-02-07T18:11:02Z
dc.date.issued 2006-11-20 en_US
dc.description.abstract This thesis introduces a new model formulation to solve routing and scheduling problems, with the main applications in answering routing and scheduling problems faced by a sea-cargo shipping company and a railroad company. For the work in sea-cargo routing and scheduling, we focus on the tramp shipping operation. Tramp shipping is a demand-driven type of shipping operation which does not have fixed schedules. The schedules are based on the pickup and download locations of profitable service requests. Given set of products distributed among a set of ports, with each product having pickup and download time windows and a destination port, the problem is to find the schedule for a fleet of ships that maximizes profit over a specified time horizon. The problem is modeled as a Mixed Integer Non-Linear Program and reformulated as an equivalent Mixed Integer Linear Program. Three heuristic methods, along with computational results, are presented. We also exploit the special structure enjoyed by our model and introduce an upper-bounding problem to the model. With a little modification, the model is readily extendable to reflect soft time windows and inter-ship cargo-transfers. The other part of our work deals with train routing and scheduling. A typical train shipment consists of a set of cars having a common origin and destination. To reduce the handling of individual shipments as they travel, shipments are grouped into blocks. The problem is that given sets of blocks to be carried from origins to destinations, construct the most cost effective train routes and schedules and determine block-to-train assignments, such that the number of block transfers (block swaps) between trains, the number of trains used, and some other cost measures are minimized. Incorporating additional precedence requirements, the modeling techniques from the shipping research are employed to formulate a mixed integer nonlinear program for this train routing and scheduling problem. Computational results are presented. en_US
dc.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/19698
dc.publisher Georgia Institute of Technology en_US
dc.subject Scheduling en_US
dc.subject Optimal schedule en_US
dc.subject Cargo transfer model en_US
dc.subject Routing and scheduling with time windows en_US
dc.subject Bilinear constraints en_US
dc.subject Vehicle routing en_US
dc.subject Pickup and delivery problem en_US
dc.subject Train routing and scheduling en_US
dc.subject Sea cargo routing and scheduling en_US
dc.subject Sea cargo routing en_US
dc.subject VRP en_US
dc.subject Train scheduling en_US
dc.subject Soft time windows en_US
dc.subject Set packing en_US
dc.subject Optimal train schedule en_US
dc.subject.lcsh Cargo ships
dc.subject.lcsh Optimum ship routing
dc.subject.lcsh Scheduling
dc.subject.lcsh Mathematical models
dc.title Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.corporatename H. Milton Stewart School of Industrial and Systems Engineering
local.contributor.corporatename College of Engineering
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:
daniel_aang_200612_phd.pdf
Size:
735.12 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations