Page 1 |
Save page Remove page | Previous | 1 of 137 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
New Approach New Approach es for Routing Courier Delivery Services
By
Chen Wang
__________________________________________________________________
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(INDUSTRIAL AND SYSTEMS ENGINEERING)
Dec 2012
Copyright 2012 Chen Wang
Object Description
| Title | New approaches for routing courier delivery services |
| Author | Wang, Chen |
| Author email | wang20@usc.edu;chenwang.ch@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Industrial and Systems Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2012-10-17 |
| Date submitted | 2012-11-13 |
| Date approved | 2012-11-14 |
| Restricted until | 2012-11-14 |
| Date published | 2012-11-14 |
| Advisor (committee chair) |
Dessouky, Maged Ordonez, Fernando |
| Advisor (committee member) | Petros, Ioannou |
| Abstract | Courier delivery services deal with the problem of routing a fleet of vehicles from a depot to service a set of customers that are geographically dispersed. In many cases, in addition to a regular uncertain demand, the industry is faced with sporadic, tightly constrained, urgent requests. An example of such an application is the transportation of medical specimens, where timely, efficient, and accurate delivery is crucial in providing high quality and affordable patient services. ❧ In the first part of this study, we propose to develop better vehicle routing solutions that can efficiently satisfy random demand over time and rapidly adjust to satisfy these sporadic, tightly constrained, urgent requests. We formulate a multi-trip vehicle routing problem using mixed integer programming. We use stochastic programming with recourse for daily plans to address the uncertainty in customer occurrence. The recourse action considers a multi-objective function that maximizes demand coverage, maximizes the quality of delivery service, and minimizes travel cost. Because of the computational difficulty for large size problems, we devise an insertion based heuristic in the first phase, and then use Tabu Search to find an efficient solution to the problem. Simulations have been done on randomly generated data and on a real data set provided by a leading healthcare provider in Southern California. Our approach has shown significant improvement in travel costs as well as in quality of service as measured by route similarity than existing methods. ❧ In the second part of this thesis, we study a method to cluster the customers into groups without generating the actual routes. There is uncertainty in customer occurrence in the problem studied; we therefore develop a new objective function based on expected distance that includes the occurring probability of customers. We show the appropriateness of the new objective, and propose a mixed integer programming formulation for customer clustering based on it. A Tabu search based heuristic approach is developed for solving the problem, and we conduct experiments on randomly generated data. The new approach shows improvement in expected distance of routes over a clustering method based on building routes for instances where the depot is in a corner. |
| Keyword | stochastic vehicle routing; multi-trip; time window; tabu search; clustering |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Rights | Wang, Chen |
| Access conditions | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@usc.edu |
| Archival file | uscthesesreloadpub_Volume4/etd-WangChen-1292.pdf |
Description
| Title | Page 1 |
| Full text | New Approach New Approach es for Routing Courier Delivery Services By Chen Wang __________________________________________________________________ A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (INDUSTRIAL AND SYSTEMS ENGINEERING) Dec 2012 Copyright 2012 Chen Wang |
Comments
Post a Comment for Page 1
