Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics

Authors:
Linet Ozdamar;Wei Yi
Affiliations:
Yeditepe University;Nanyang Technological University
Venue:
IEEE Intelligent Systems
Year:
2008

Citing 0
Cited 4

Path selection in disaster response management based on Q-learning

International Journal of Automation and Computing
Discrete particle swarm optimization for solving a single to multiple destinations in evacuation planning

MAMECTIS/NOLASC/CONTROL/WAMUS'11 Proceedings of the 13th WSEAS international conference on mathematical methods, computational techniques and intelligent systems, and 10th WSEAS international conference on non-linear analysis, non-linear systems and chaos, and 7th WSEAS international conference on dynamical systems and control, and 11th WSEAS international conference on Wavelet analysis and multirate systems: recent researches in computational techniques, non-linear systems and control
Short Communication: Two-phase evacuation route planning approach using combined path networks for buildings and roads

Computers and Industrial Engineering
Greedy-search-based multi-objective genetic algorithm for emergency logistics scheduling

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coordinating relief activities and evacuation in emergency response involves delivering commodities to distribution centers in affected areas and picking up wounded people and transferring them to medical centers. This problem's key features are limited supply and vehicle availability, simultaneous delivery and pickup of commodities and wounded people, and split delivery. The resulting logistics problem is quite complicated. Furthermore, emergency settings are dynamic, and changing the logistics plan at each information update requires an efficient algorithm. A proposed greedy constructive algorithm explores a limited neighborhood around the vehicles' current locations in the partial solution and then appends a two-stop partial itinerary to each vehicle's available route. The algorithm's performance was tested on several networks and compared with that of optimal solutions.