Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2011, Article ID 874526, 25 pages
http://dx.doi.org/10.1155/2011/874526
Research Article

Real-Time Vehicle Routing for Repairing Damaged Infrastructures Due to Natural Disasters

1Department of Civil Engineering, National Central University, 300, Jung-Da Road, Jung-Li, Taoyuan 320, Taiwan
2Department of Information Management, National Central University, 300, Jung-Da Road, Jung-Li, Taoyuan 320, Taiwan

Received 22 August 2010; Revised 10 January 2011; Accepted 28 February 2011

Academic Editor: J. J. Judice

Copyright © 2011 Huey-Kuo Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Central Weather Bureau Ministry of Transportation and Communications, (Taiwan), “Scale of seismic intensity,” 2000, http://www.cwb.gov.tw/.
  2. Directorate-General of Budget, Accounting and Statistics, Executive Yuan, (Taiwan), 1999, http://www.dgbas.gov.tw/.
  3. FEMA, Guide for All-Hazard Emergency Operation Planning-State and Local Guide (SlG-101), 1996.
  4. F. Fiedrich, F. Gehbauer, and U. Rickers, “Optimized resource allocation for emergency response after earthquake disasters,” Safety Science, vol. 35, no. 1–3, pp. 41–57, 2000. View at Publisher · View at Google Scholar · View at Scopus
  5. L. W. Chang, Emergency scheduling for repairing damaged infrastructures after disasters, M.S. thesis, Graduate Institute of Transportation Science, Tamkang University, Taipei, Taiwan, 2001.
  6. G. Barbarosoğlu, L. Özdamar, and A. Çevik, “An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations,” European Journal of Operational Research, vol. 140, no. 1, pp. 118–133, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. C. H. Lee, Using the genetic algorithm to solve the scheduling problem for repairing the post earthquake road networks, M.S. thesis, Department of Transportation Management, National Cheng-Kung University, Tainan, Taiwan, 2003.
  8. L. Özdamar, E. Ekinci, and B. Küçükyazici, “Emergency logistics planning in natural disasters,” Annals of Operations Research, vol. 129, no. 1–4, pp. 217–245, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. H. K. Liao, A study on network reconstruction and relief logistics, M.S. thesis, National Central University, Jungli, Taiwan, 2005.
  10. S. J. Pettit and A. K. C. Beresford, “Emergency relief logistics: an evaluation of military, non-military and composite response models,” International Journal of Logistics: Research and Applications, vol. 8, no. 4, pp. 313–332, 2005. View at Google Scholar
  11. E. Jennings, A. K. C. Beresford, and R. Banomyong, “Emergency relief logistics: a disaster response model,” in Proceedings of the Logistics Research Network Conference, pp. 121–128, 2002.
  12. C. F. Hsueh, H. K. Chen, and H. W. Chou, “Vehicle routing for rescue operation in natural disasters,” in Vehicle Routing Problem, T. Caric and H. Gold, Eds., pp. 71–84, I-Tech Education and Publishing KG, Vienna, Austria, 2008. View at Google Scholar
  13. F. S. Wang, Scheduling for repairing damaged networks under imprecise information in earthquakes, M.S. thesis, Department of Civil Engineering, National Central University, Chung-Li, Taiwan, 2008.
  14. H. K. Chen, C. F. Hsueh, and M. S. Chang, “The real-time time-dependent vehicle routing problem,” Transportation Research Part E, vol. 42, no. 5, pp. 383–408, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: an autocatalytic optimizing process,” Tech. Rep., Politecnico di Milano, Milano, Italy, 1991. View at Google Scholar
  16. M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 26, no. 1, pp. 29–41, 1996. View at Google Scholar · View at Scopus
  17. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Google Scholar · View at Scopus
  18. T. Stützle and H. Hoos, “The MAX-MIN ant system and local search for the traveling salesman problem,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '97), pp. 309–314, April 1997. View at Scopus
  19. B. Bullnheimer, R. F. Hartl, and C. Strauss, “A new rank-based version of the ant system: a computational study,” Tech. Rep. POM 3, Institute of Management Science, University of Vienna, Vienna, Austria, 1997. View at Google Scholar
  20. E. D. Taillard and L. M. Gambardella, “Adaptive memories for the quadratic assignment problem,” Tech. Rep., IDSIA, 1997. View at Google Scholar
  21. V. Maniezzo, “Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem,” Tech. Rep. CSR 1, C.L. in Scienze dell Informazione, Universita di Bologna, Sede di Cesena, Cesena, Italy, 1998. View at Google Scholar