Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering; and, (S.M.)--Massachusetts Institute of Technology, Operations Research Center, 2005. / Includes bibliographical references (p. 89-90). / Major package delivery companies employ hundreds of thousands of people, generate billions of dollars in revenues and operate very large fleets of ground vehicles ranging from custom- built package cars to large tractors and trailers. A crucial point for the profitability of these companies is, for a given level of service, to be able to run their operations at the lowest possible cost. In this thesis, we will contemplate the problem of the scheduling and routing on a regional and daily basis of the large tractor and trailer fleet of a large package delivery company. Our aim is to design a method for building the schedules associated with minimal operating costs. We consider deterministic situations in which all parameters are known exactly and we exclude possibilities of disruptions. Nonetheless even with these simplifications, the problem we consider is complex and large-scale, containing a very large number of constraints and parameters. Throughout this thesis, we examine different theoretical approaches including optimization models and algorithms. We implement some of these approaches in order to get practical results which can be implemented in practice. / by Raphaël Tardy. / S.M.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/31141 |
| Date | January 2005 |
| Creators | Tardy, Raphaël, 1979- |
| Contributors | Cynthia Barnhart., Massachusetts Institute of Technology. Operations Research Center., Massachusetts Institute of Technology. Department of Civil and Environmental Engineering, Massachusetts Institute of Technology. Operations Research Center |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 94 p., 3832164 bytes, 3842976 bytes, application/pdf, application/pdf, application/pdf |
| Rights | M.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., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.002 seconds