Show simple item record

dc.contributor.advisorDimitris Bertsimas.en_US
dc.contributor.authorJernigan, Nicholas R. (Nicholas Richard)en_US
dc.contributor.otherMassachusetts Institute of Technology. Operations Research Center.en_US
dc.date.accessioned2014-11-04T21:33:51Z
dc.date.available2014-11-04T21:33:51Z
dc.date.issued2014en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/91399
dc.descriptionThesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2014.en_US
dc.description33en_US
dc.description"June 2014." Cataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 51-54).en_US
dc.description.abstractIn this paper we present a mixed integer optimization framework for modeling the shipment of goods between origin destination (O-D) pairs by vehicles of different types over a time-space network. The output of the model is an optimal schedule and routing of vehicle movements and assignment of goods to vehicles. Specifically, this framework allows for: multiple vehicles of differing characteristics (including speed, cost of travel, and capacity), transshipment locations where goods can be transferred between vehicles; and availability times for goods at their origins and delivery time windows for goods at their destinations. The model is composed of three stages: In the first, vehicle quantities, by type, and goods are allocated to routes in order to minimize late deliveries and vehicle movement costs. In the second stage, individual vehicles, specified by vehicle identification numbers, are assigned routes, and goods are assigned to those vehicles based on the results of the first stage and a minimization of costs involved with the transfer of goods between vehicles. In the third stage we reallocate the idle time of vehicles in order to satisfy crew rest constraints. Computational results show that provably optimal or near optimal solutions are possible for realistic instance sizes.en_US
dc.description.statementofresponsibilityby Nicholas R. Jernigan.en_US
dc.format.extent54 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectOperations Research Center.en_US
dc.titleMulti-modal, multi-period, multi-commodity transportation : models and algorithmsen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Center.en_US
dc.identifier.oclc893482869en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record