Routing for Relief Efforts

By A. Campbell, D. Vandenbussche, W. Hermann. Transportation Science, 2008

424 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty (2011, background): “Models for relief distribution have been proposed by Haghani and Oh (1996), Fiedrich et al. (2000), Viswanath and Peeta (2003), Sakakibara et al. (2004), Ozdamar et al. (2004), Barbarosoglu and Arda (2004), Amiri (2006), Jia et al. (2007a), Lodree and Taskin (2008), Campbell et al. (2008) , Sheu (2”
Mathematical Models in Humanitarian Supply Chain Management: A Systematic Literature Review (2016, background): “[32] developed a model in which they considered two objective functions, the first one for a travelling salesman problem to minimize the maximum arrival time and the second one for the vehicle routing problem to minimize the average arrival time.”
Models for Relief Routing: Equity, Efficiency and Efficacy (2011, result): “With alternative objectives of minimizing the last arrival time and minimizing the sum of arrival times, the authors demonstrate that superior service times may be achieved than those resulting from a traditional VRP objective.”
A multi-criteria optimization model for humanitarian aid distribution (2011, methodology): “[7] take the first steps toward developing new methodologies for these problems, formulating two different objective functions for a TSP (Traveling Salesman Problem) and a VRP (Vehicle Routing Problem) in a disaster relief application and studying the corresponding models.”