Optimal supply location selection and routing for emergency material delivery

Proceedings of the 3rd IEEE International Conference on Automation Science and Engineering, IEEE CASE 2007

Volumn , Issue , 2007, Pages 1039-1044

  Han, Yunjun ^b   Guan, Xiaohong ^a,c   Shi, Leyuan ^a,d  

^a IEEE

^b TSINGHUA UNIVERSITY   (China)

^c XI'AN JIAOTONG UNIVERSITY   (China)

^d University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LOGISTICS; PROBLEM SOLVING; ROUTING ALGORITHMS; SITE SELECTION; WAREHOUSES;

ROUTING PROBLEM; WAREHOUSE SELECTION;

SUPPLY CHAIN MANAGEMENT;

EID: 44449177670     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COASE.2007.4341789     Document Type: Conference Paper

References (23)

1. B. Wolshon, E. Urbina, C. Wilmot, and M. Levitan. Review of policies and practices for hurricane evacuation. I: transportation planning, preparedness, and response. Natural Hazards Review. Vol. 6, Issue 3, pp. 129-142, Aug. 2005.
2. Y. Liu, N. Zou, and G. L. Chang. An integrated emergency evacuation system for real-time operations- A case study of ocean city, Maryland under hurricane attacks. Proceedings of the 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria, September 13-16, 2005.
3. H. Zhao, V. Deshpande, J. K. Ryan. Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests. Naval Research Logistics, Vol. 53, Issue 6, pp. 547-567, 2006.
4. H. Akkermans. Emergent supply networks: system dynamics simulation of adaptive supply agents. System Sciences. Proceedings of the 34th Annual Hawaii International Conference, 2001.
5. N. Schieritz and A. Crobler. Emergent structures in supply chains - a study integrating agent-based and system dynamic modeling. System Sciences. Proceedings of the 36th Annual Hawaii International Conference, 2003.
6. H. W. Hamacher, S. A. Tjandra. Mathematical modeling of evacuation problems: a state of art. Technical Report.
7. P. Athukorala and B. P. Resosudarmo. The Indian Ocean Tsunami: economic impact, disaster management and lessons. Asian Economic Papers; Winter2005, Vol. 4 Issue 1, pp.1-39.
8. F. Fragos Townsend. The federal response to Hurricane Katrina: lessons learned. White House report, Feb. 23, 2006.
9. H. Min, V. Jayaraman, R. Sirivastava. Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research. Vol. 108, pp. 1-15, 1998.
10. G. Laporte, Y. Nobert, S. Taillefe. Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science. Vol. 22, Issue 172, 1988.
11. A. Dasei, and G. Laporte. An analytical approach to the facility location and capacity acquisition problem under demand uncertainty. Journal of the Operational Research Society. Vol. 56, pp. 397-405, 2005.
12. T. H. Wu, C. Y. Low, J. W. Bai. Heuristic solutions to multi-deport location-routing problems. Computers & Operations Research. Vol.29, pp. 1393-1415, 2002.
13. C. Prins, C. Prodhon, R. Wolfler Calvo. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR, 4(3), pp. 221-238, 2006.
14. M. T. Melo, S. Nickel, and F. S. d. Gama. Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning. Computers & Operations Research. Vol. 33, pp. 181-208, 2005.
15. S. H. Owen and M. S. Daskin. Strategic facility location: A review. European Journal of Operational Research. Vol. 111, pp. 423-447, 1998.
16. L. Shi, R. R. Meyer, M. Bozbay, and A. J. Miller. A nested partitions framework for solving large-scale multicommodity facility location problems. Journal of Systems Science and systems Engineering, 2004.
17. L. R. Ford, JR. and Fulkerson. A suggested computation for maximal multi-commodity network flow problem. Management Science. Vol.5, No. 1, pp. 97-101, 1958.
18. A. Hall, S. Hippler, and M. Skutella. Multicommodity flows over time: efficient algorithms and complexity. Lecture Notes in Computer Science. Vol. 2917, pp. 397-409, 2003.
19. L. Fleicher and M. Skutella. The quickest multicommodity flow problem. IPCO, LNCS 2337, pp 36-53, 2002.
20. B. Hoppe. The quickest transshipment problem. Doctor's thesis. 1995.
21. B. Klinz, G. J. Woeginger. Minimum-cost dynamic flows: the series-parallel case. Networks. Vol. 43 (3), 153-162, 2004.
22. R. K. Ahuja, T. L. Magnanti and J. N. Orlin. Network flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
23. X. Guan., Q. Zhai, and F. Lai. New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems. Journal of Optimization Theory and Applications. Vol. 113, No. 1, pp. 65-82, 2002.