The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Routing for Relief Efforts
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
Sen, A., & Foster, J. (1973) · doi:10.1093/0198281935.001.0001 · Cited by 3,429
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
Hakimi, S. L. (1964) · Operations Research · doi:10.1287/opre.12.3.450 · Cited by 2,474
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II (1977) · SIAM Journal on Computing · doi:10.1137/0206041 · Cited by 837
Emergency Logistics Planning in Natural Disasters
Özdamar, L., Ekinci, E., & Küçükyazici, B. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000030690.27939.39 · Cited by 819
Cited by
Review of recent developments in OR/MS research in disaster operations management
Galindo, G., & Batta, R. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.01.039 · Cited by 637
On the appropriate objective function for post‐disaster humanitarian logistics models
Holguín‐Veras, J., Pérez, N., Jaller, M., Van Wassenhove, L. N., & Aros‐Vera, F. (2013) · Journal of Operations Management · doi:10.1016/j.jom.2013.06.002 · Cited by 553
Models, solutions and enabling technologies in humanitarian logistics
Özdamar, L., & Ertem, M. A. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.11.030 · Cited by 409
Literature review of humanitarian logistics research: trends and challenges
Leiras, A., de Brito Jr, I., Queiroz Peres, E., Rejane Bertazzo, T., & Tsugunobu Yoshida Yoshizaki, H. (2014) · Journal of Humanitarian Logistics and Supply Chain Management · doi:10.1108/jhlscm-04-2012-0008 · Cited by 336
Ahmadi, M., Seifi, A., & Tootooni, B. (2015) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2015.01.008 · Cited by 292
Metadata
- Authors
- Campbell, A. M., Vandenbussche, D., & Hermann, W.
- Venue
- Transportation Science
- Published
- 2008-05
- Volume
- 42
- Issue
- 2
- Pages
- 127-145
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W1973451304
- Cited by
- 413
- References
- 23
- FWCI
- 42.55
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Routing for Relief Efforts. https://app.cochat.ai/papers/10.1287/trsc.1070.0209
- The paper
- Campbell, A. M., Vandenbussche, D., & Hermann, W. (2008). Routing for Relief Efforts. Transportation Science. https://doi.org/10.1287/trsc.1070.0209
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.