An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
Computers and Operations Research
Approximation algorithms for min-max capacitated path covers
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Planning for a bus-based evacuation
OR Spectrum
Computers and Operations Research
Spatial and objective decompositions for very large SCAPs
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A multi-criteria optimization model for humanitarian aid distribution
Journal of Global Optimization
Approximation results for a min-max location-routing problem
Discrete Applied Mathematics
Strategic planning for disaster recovery with stochastic last mile distribution
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Multiple-resource and multiple-depot emergency response problem considering secondary disasters
Expert Systems with Applications: An International Journal
Approximation hardness of min-max tree covers
Operations Research Letters
Randomized adaptive vehicle decomposition for large-scale power restoration
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Computers and Operations Research
Heuristics for the traveling repairman problem with profits
Computers and Operations Research
A math-heuristic for the warehouse location-routing problem in disaster relief
Computers and Operations Research
Computational disaster management
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Humanitarian/emergency logistics models: a state of the art overview
Proceedings of the 2013 Summer Computer Simulation Conference
A Market-based Solution to the Multiple Traveling Salesmen Problem
Journal of Intelligent and Robotic Systems
Hi-index | 0.00 |
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.