Multicommodity Maximal Covering Network Design Problem for Planning Critical Routes for Earthquake Response

Transportation Research Record

Volumn , Issue 1857, 2003, Pages 1-10

  Viswanath, Kannan ^a   Peeta, Srinivas ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRIDGES; BUDGET CONTROL; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; COSTS; DECISION MAKING; DISASTER PREVENTION; ENVIRONMENTAL IMPACT; HIGHWAY ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING; RETROFITTING; SEISMOLOGY; SET THEORY; STOCHASTIC PROGRAMMING; STRATEGIC PLANNING;

BIMODAL TRANSPORTATION SYSTEMS; ELECTRIC POWER NETWORKS; ORIGIN-DESTINATION (O-D) PAIR; VULNERABILITY ANALYSIS;

EARTHQUAKES;

EID: 2142750219     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/1857-01     Document Type: Conference Paper

References (12)

1. Haghani, A., and S. C. Oh. Formulation and Solution of a Multi-commodity, Multi-modal Network Flow Model for Disaster Relief Operations. Transportation Research A, Vol. 30, No. 3, 1996, pp. 231-250.
2. Cooper, J. D., I. M. Friedland, I. G. Buckle, R. B. Nimis, and N. M. Bobb. The Northridge Earthquake: Progress Made, Lessons Learned in Seismic-Resistant Bridge Design, www.tfhrc.gov/pubrds/summer94/p94su26.htm. Accessed May 20, 2001.
3. Magnanti, T. L., and R. T. Wong. Network Design and Transportation Planning: Models and Algorithms. Transportation Science, Vol. 18, No. 3, 1984, pp. 1-55.
4. Current, J. R., C. S. ReVelle, and J. L. Cohon. The Maximum Covering/Shortest Path Problem: A Multiobjective Network Design and Routing Formulation. European Journal of Operational Research, Vol. 21, 1985, pp. 189-199.
5. Current, J. R., C. S. ReVelle, and J. L. Cohon. The Minimum-Covering Shortest-Path Problem. Decision Science, Vol. 19, 1985, pp. 490-503.
6. Hutson, V. A., and C. S. ReVelle. Indirect Covering Tree Problems on Spanning Tree Networks. European Journal of Operational Research, Vol. 163, 1993, pp. 20-32.
7. Current, J. R., and D. A. Schilling. The Covering Salesman Problem. Transportation Science, Vol. 23, No. 3, 1989, pp. 208-213.
8. Current, J. R., and D. A. Schilling. The Median Tour and Maximal Covering Tour Problems: Formulations and Heuristics. European Journal of Operational Research, Vol. 73, 1994, pp. 114-126.
9. Gendreau, M., G. Laporte, and F. Semet. The Covering Tour Problem. Operations Research, Vol. 45, No. 4, 1997, pp. 568-576.
10. Cohon, J. L. Multiobjective Programming and Planning. Academic Press, New York, 1978.
11. Johnson, D. S., J. K. Lenstra, and A. H. G. Rinnooy Kan. The Complexity of the Network Design Problem. Networks, Vol. 8, 1978, pp. 279-285.
12. Dionne, R., and M. Florian. Exact and Approximate Algorithms for Network Design. Networks, Vol. 9, 1979, pp. 37-59.