Issue No.01 - January/February (2008 vol.23)
Linet Özdamar , Yeditepe University
Wei Yi , Nanyang Technological University
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MIS.2008.7
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.
emergency logistics, mixed-order simultaneous delivery and pickup, l-neighborhood heuristic
Linet Özdamar, Wei Yi, "Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics", IEEE Intelligent Systems, vol.23, no. 1, pp. 14-23, January/February 2008, doi:10.1109/MIS.2008.7