Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 42, No. 2, May 2008, pp. 127-145
DOI: 10.1287/trsc.1070.0209
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Campbell, A. M.
Right arrow Articles by Hermann, W.

Routing for Relief Efforts

Ann Melissa Campbell, Dieter Vandenbussche, William Hermann

Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242
Axioma, Inc., Atlanta, Georgia 30350
Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801

ann-campbell{at}uiowa.edu
dvandenbussche{at}axiomainc.com
hermann2{at}uiuc.edu

In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Because it is critical that the deliveries are both fast and fair to those being served, it is not clear that the classic cost-minimizing routing problems properly reflect the relevant priorities in disaster relief. In this paper, we take the first steps toward developing new methodologies for these problems. We focus specifically on two alternative objective functions for the traveling salesman problem (TSP) and the vehicle routing problem (VRP): one that minimizes the maximum arrival time (minmax) and one that minimizes the average arrival time (minavg). To demonstrate the potential impact of using these new objective functions, we bound the worst-case performance of optimal TSP solutions with respect to these new variants and extend these bounds to include multiple vehicles and vehicle capacity. Similarly, we examine the potential increase in routing costs that results from using these alternate objectives. We present solution approaches for these two variants of the TSP and VRP, which are based on well-known insertion and local search techniques. These are used in a series of computational experiments to help identify the types of instances in which TSP and VRP solutions can be significantly different from optimal minmax and minavg solutions.

Key Words: vehicle routing; disaster relief; bounds
History: Received: March 2006; revised: August 2006; accepted: June 2007.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.