deletions | additions       diff --git a/section_Strategic_planning_for_disaster__.tex b/section_Strategic_planning_for_disaster__.tex  index 6670a29..630491a 100644  --- a/section_Strategic_planning_for_disaster__.tex  +++ b/section_Strategic_planning_for_disaster__.tex 
...
\section{Strategic planning for disaster recovery with stochastic last mile distribution}  network flow and distribution plan or location-routing\\ Van et al. \cite{VanEtal2010} consider the problem of allocating relief items among certain depots for hurricane disaster recovery. In particular, they present the problem as single commodity allocation problem (SCAP) in which vertices can be a supplier (e.g., warehouses holding relief items) and/or a demand center (i.e., customer of relief item) and the edges represent travel time between sites. Give starting and ending sites for each homogeneous vehicle, the problem is to determine amount of stored commodity at each site, and distribution plan of the vehicles for each scenario, whit the objective of minimizing aggregated costs of distribution(time of the last mile delivery), inventory and unsatisfied demand. Morever, unlike original location routing problems(LRP), each warehouse may have multiple deliveries for a single costumer, and each costumer may be served by several warehouses.   To capture the real world constraints, depending on probability of a scenario, there is specific set of available sites, their demands and travel times between sites.