Emergency logistics planning in natural disasters

Annals of Operations Research

Volumn 129, Issue 1-4, 2004, Pages 217-245

  Özdamar, Linet ^a   Ekinci, Ediz ^b   Küçükyazici, Beste ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b Turkish Armed Forces   (Turkey)

^c YEDITEPE UNIVERSITY   (Turkey)

Author keywords

Emergency planning; Lagrangean relaxation; Linear and integer multi period multi commodity network flows; Vehicle routing

Indexed keywords

EID: 3042795375     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000030690.27939.39     Document Type: Article

References (30)

1. Aggarwal, C.C., M. Oblak, and R.R. Vemuganti. (1995). "A Heuristic Solution Procedure for Multi-Commodity Integer Flows." Computers and Operations Research 22, 1075-1087.
2. Awerbuch, B. and T. Leighton. (1993). "Multi-Commodity Flows: A Survey of Recent Research." In Proceedings of ISAAC '93, pp. 297-302.
3. Barnhart, C. and Y. Sheffi. (1993). "A Network Based Primal-Dual Heuristic for Multi-Commodity Network Flow Problems." Transportation Science 27, 102-117.
4. Barnhart, C. (1993). "Dual Ascent Methods for Large-Scale Multi-Commodity Network Flow Problems." Naval Research Logistics 40, 305-324.
5. Barnhart, C., C.A. Hane, and P.H. Vance. (1996). "Integer Multi-Commodity Flow Problems." Centre for Transportation Studies Working Paper, Centre for Transportation Studies, MIT.
6. Bodin, L.D. (1990). "Twenty Years of Routing and Scheduling." Operations Research 38, 571-579.
7. Brunetta, L., M. Conforti, and M. Fischetti. (1995). "A Polyhedral Approach to an Integer Multi-Commodity Flow Problem." Preprint No. 18, Department of Mathematics, Padova University.
8. Desrochers, M., J.K. Lenstra, M.W.P. Savelsbergh, and F. Soumis. (1988). "Vehicle Routing with Time Windows." In B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies. Amsterdam: Elsevier Science.
9. Desrochers, M., J.K. Lenstra, and M.W.P. Savelsbergh. (1990). "A Classification Scheme for Vehicle Routing and Scheduling Problems." European Journal of Operational Research 46, 322-332.
10. Desrochers, M. et al. (1998). "Towards a Model and Algorithm Management System for Vehicle Routing and Scheduling Problems." Working Paper, GERAD, Montreal, Canada.
11. Dror, M. and P. Trudeau. (1990). "Split Delivery Routing." Naval Research Logistics 37, 383-402.
12. Equi, L., G. Gallo, S. Marziale, and A. Weintraub. (1996). "A Combined Transportation and Scheduling Problem." Working Paper, Pisa University, Pisa, Italy.
13. Frangioni, A. (1997). "Dual Ascent Methods and Multi-Commodity Flow Problems." PhD Dissertation TD 5/97, Department of Informatics, Pisa University, Pisa, Italy.
14. Fisher, M. (1981). "The Lagrangean Relaxation Method for Solving Integer Problems." Management Science 27, 1-18.
15. Fisher, M. (1995). "Vehicle Routing." In M.O. Ball et al. (eds.), Handbooks in OR and MS, Vol. 8. Amsterdam: Elsevier Science.
16. Fisher, M., B. Tang, and Z. Zheng. (1995). "A Network Flow Based Heuristic for Bulk Pick Up and Delivery Routing." Transportation Science 29, 45-55.
17. Gendreau, M., F. Guertin, J.-Y. Potvin, and E. Taillard. (1999). "Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching." Transportation Science 33, 381-390.
18. Held, M. et al. (1974). "Validation of Sub-Gradient Optimization." Mathematical Programming 6, 62-88.
19. Jimenez, F. and J.L. Verdegay. (1999). "Solving Fuzzy Solid Transportation Problems by an Evolutionary Algorithm Based Parametric Approach." European Journal of Operational Research 117, 485-510.
20. Jones, K.L. et al. (1993). "Multi-Commodity Network Flows: The Impact of Formulation on Decomposition." Mathematical Programming 62, 95-117.
21. Kennington, J.L. and M. Shalaby. (1977). "An Effective Sub-Gradient Procedure for Minimal Cost Multi-Commodity Flow Problems." Management Science 23, 994-1004.
22. Laporte, G. (1992). "The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms." European Journal of Operational Research 59, 345-358.
23. Mathies, S. and P. Mevert. (1998). "A Hybrid Algorithm for Solving Network Flow Problems with Side Constraints." Computers and Operations Research 25, 745-756.
24. Orlin, J.B. (1993). "A Faster Strongly Polynomial Minimum Cost Flow Algorithm." Operations Research 41, 338-350.
25. Rathi, A.K., R.L. Church, and R.S. Solanki. (1993). "Allocating Resources to Support a Multicommodity Flow with Time Windows." Logistics and Transportation Review 28, 167-188.
26. Ribeiro, C. and F. Soumis. (1994). "A Column Generation Approach to the Multi-Depot Vehicle Scheduling Problem." Operations Research 42, 41-52.
27. Rodriguez, P. et al. (1998). "Using Global Search Heuristics for the Capacity Vehicle Routing Problem." Computers and Operations Research 25, 407-417.
28. U.S. Geological Survey Information Services. (1999). "Implications for Earthquake Risk Reduction in the United States from the Kocaeli, Turkey, Earthquake of August 17, 1999." USGS Circular # 1193.
29. Venkataramanan, M.A., J.J. Dinkel, and J. Mote. (1989). "A Surrogate and Lagrangean Approach to Constrained Network Problems." Annals of OR 20, 283-302.
30. Ziliaskopoulos, A. and W. Wardell. (2000). "An Intermodal Optimum Path Algorithm for Multimodal Networks with Dynamic Arc Travel Times and Switching Delays." European Journal of Operational Research 125, 486-502.