By Topic

Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Two major activities in disaster response are evacuation and logistics support. Evacuation from affected areas to medical centers occurs during the initial response phase. Logistics support from supply centers to distribution centers in affected areas tends to continue for a longer time to sustain the basic needs of survivors remaining there. Minimizing delay in providing priority commodities and healthcare to the survivors can greatly improve the survival rate. As a first step toward solving the emergency-logistics problem, we developed Path-Builder, a simple, fast constructive heuristic for identifying a feasible, acceptable solution. Path-Builder is based on a greedy l-neighborhood search technique that extends the definition of neighborhood to suit the problem's special needs. The heuristic selects partial paths to append to vehicle itineraries on the basis of the vehicles' utilities. It constructs all vehicle itineraries in parallel and iteratively, trying to exploit foreseeable opportunities within the vehicles' limited neighborhood.

Published in:

Intelligent Systems, IEEE  (Volume:23 ,  Issue: 1 )