Disaster Relief Routing Under Uncertainty: A Robust Optimization Approach
-
2017-05-01
Details:
-
Creators:
-
Corporate Creators:
-
Corporate Contributors:
-
Subject/TRT Terms:
-
Resource Type:
-
Geographical Coverage:
-
TRIS Online Accession Number:01641068
-
Edition:Final Report, May 1, 2015 to December 31, 2016
-
Corporate Publisher:
-
Abstract:This report addresses the capacitated vehicle routing problem (CVRP) and the split delivery vehicle routing problem (SDVRP) with uncertain travel times and demands when planning vehicle routes for delivering critical supplies to the affected population in need after a disaster. A robust optimization approach is used to formulate the CVRP and the SDVRP with uncertain travel times and demands for five objective functions: minimization of the total number of vehicles deployed (minV), minimization of the total travel times/travel costs (minT), minimization of the summation of arrival times (minS), minimization of the summation of demand-weighted arrival times (minD), and minimization of the latest arrival time (minL). The minS, minD, and minL are critical for deliveries to be fast and fair in routing for relief efforts, while the minV and minT are common cost-based objective functions in the traditional VRP. A two-stage heuristic method that combines the insertion algorithm and tabu search is used to solve the VRP models for large-scale problems. The solutions of the CVRP and the SDVRP are compared for different examples. Keywords: Robust Optimization, Vehicle Routing Problem, Tabu Search, Insertion Algorithm
-
Format:
-
Funding:
-
Collection(s):
-
Main Document Checksum:
-
Download URL:
-
File Type: