Scheduling and Routing of vehicles for a Transportation company
| dc.contributor.advisor | Russell E. King, Committee Chair | en_US |
| dc.contributor.advisor | Xiuli Chao, Committee Co-Chair | en_US |
| dc.contributor.advisor | Thom J. Hodgson, Committee Member | en_US |
| dc.contributor.author | Labiad, Noureddine | en_US |
| dc.date.accessioned | 2010-04-02T18:05:34Z | |
| dc.date.available | 2010-04-02T18:05:34Z | |
| dc.date.issued | 2003-02-12 | en_US |
| dc.degree.discipline | Industrial Engineering | en_US |
| dc.degree.level | thesis | en_US |
| dc.degree.name | MS | en_US |
| dc.description.abstract | This work addresses the problem of finding the minimum number of vehicles required to service weekly a set of customers subject to time windows. The specific structure of the problem requires that a full loaded vehicle serve only one customer each time it leaves the depot. As a consequence, all feasible schedules involve the same total distance traveled. The fleet is homogeneous and is located in a common depot. Vehicle capacity is finite, weekly mileage is limited, and split service is not permitted. Four heuristics are developed to obtain feasible solutions. Results are reported for 1000 randomly generated problems with up to 150 deliveries. It is shown that the new heuristics outperform the actual algorithm used by the Transportation Company in terms of computation time and the quality of solution. To gauge the quality of the solutions, three lower bounding procedures are developed. The first considers the 'bin packing aspect of the problem' with regard to the maximum weekly mileage. The second exploits the time windows constraints while the third lower bounding method uses a network flow formulation | en_US |
| dc.identifier.other | etd-11082002-120426 | en_US |
| dc.identifier.uri | http://www.lib.ncsu.edu/resolver/1840.16/1614 | |
| dc.rights | I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. | en_US |
| dc.subject | Heuristics | en_US |
| dc.subject | Scheduling | en_US |
| dc.subject | Routing | en_US |
| dc.subject | Bin-Packing | en_US |
| dc.subject | Supply Chain | en_US |
| dc.subject | VRP | en_US |
| dc.subject | VRPTW | en_US |
| dc.subject | Logistics | en_US |
| dc.title | Scheduling and Routing of vehicles for a Transportation company | en_US |
Files
Original bundle
1 - 1 of 1
