• DocumentCode
    1052321
  • Title

    Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics

  • Author

    Özdamar, Linet ; Yi, Wei

  • Volume
    23
  • Issue
    1
  • fYear
    2008
  • Firstpage
    14
  • Lastpage
    23
  • Abstract
    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.
  • Keywords
    disasters; emergency services; greedy algorithms; logistics; search problems; transportation; disaster relief; disaster response; emergency service; evacuation logistics; greedy neighborhood search; health care; Back; Delay effects; Logistics; Medical services; Network topology; Packaging; Road transportation; Vehicles; emergency logistics; l-neighborhood heuristic; mixed-order simultaneous delivery and pickup;
  • fLanguage
    English
  • Journal_Title
    Intelligent Systems, IEEE
  • Publisher
    ieee
  • ISSN
    1541-1672
  • Type

    jour

  • DOI
    10.1109/MIS.2008.7
  • Filename
    4444177