This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics
January/February 2008 (vol. 23 no. 1)
pp. 14-23
Linet Özdamar, Yeditepe University
Wei Yi, Nanyang Technological University
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.

1. J. Dethloff, "Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pickup," OR Spektrum, vol. 23, no. 1, 2001, pp. 29–96.
2. M. Gendreau, G. Laporte, and D. Vigo, "Heuristics for the Traveling Salesman Problem with Pickup and Delivery," Computers and Operations Research, vol. 26, no. 7, 1999, pp. 699–714.
3. G. Nagy and S. Salhi, "Heuristic Algorithms for Single and Multi-depot Vehicle Routing Problems with Pickups and Deliveries," European J. Operational Research, vol. 162, no. 1, 2005, pp. 126–141.
4. P. Toth and D. Vigo, "An Exact Algorithm for the Vehicle Routing Problem with Backhauls," Transportation Science, vol. 31, no. 4, 1997, pp. 372–385.
5. I. Osman and N.A. Wassan, "A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Backhauls," J. Scheduling, vol. 5, no. 4, 2002, pp. 263–285.
6. R. Bent and P. Van Henteryck, "A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows," Computers and Operations Research, vol. 33, no. 4, 2006, pp. 875–893.
7. Y. Zhong and M.H. Cole, "A Vehicle Routing Problem with Backhauls and Time Windows: A Guided Local Search Solution," Transportation Research Part E, vol. 41, no. 2, 2005, pp. 131–144.
8. S. Ropke and D. Pisinger, "A Unified Heuristic for a Large Class of Vehicle Routing Problems with Backhauls," European J. Operational Research, vol. 171, no. 3, 2006, pp. 750–775.
9. J.M. Belenguer, M.C. Martinez, and E. Mota, "A Lower Bound for the Split Delivery Vehicle Routing Problem," Operations Research, vol. 48, no. 5, 2000, pp. 801–810.
10. S.C. Ho and D. Haugland, "A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries," Computers and Operations Research, vol. 31, no. 12, 2004, pp. 1947–1964.
11. W. Yi and L. Ozdamar, "A Dynamic Logistics Coordination Model for Evacuation and Support in Disaster Response Activities," European J. Operational Research, vol. 179, no. 3, 2006, pp. 1177–1193.

Index Terms:
emergency logistics, mixed-order simultaneous delivery and pickup, l-neighborhood heuristic
Citation:
Linet Özdamar, Wei Yi, "Greedy Neighborhood Search for Disaster Relief and Evacuation Logistics," IEEE Intelligent Systems, vol. 23, no. 1, pp. 14-23, Jan.-Feb. 2008, doi:10.1109/MIS.2008.7
Usage of this product signifies your acceptance of the Terms of Use.