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

Model and Method for Multiobjective Time-Dependent Hazardous Material Transportation

1School of Management, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, China
2Laboratoire d’Informatique, Biologie Intégrative et Systèmes Complexes, Université d’Evry Val d’Essonne, 91020 Evry Cedex, France
3Laboratoire Génie Industriel, Ecole Centrale Paris, 92295 Châtenay-Malabry Cedex, France

Received 10 July 2014; Accepted 27 October 2014; Published 14 December 2014

Academic Editor: Yi-Kuei Lin

Copyright © 2014 Zhen Zhou 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. E. Erkut, S. A. Tjandra, and V. Verter, “Hazardous materials transportation,” in Handbook in OR&MS, vol. chapter 9, pp. 539–621, Elsevier, Amsterdam, The Netherlands, 2007. View at Google Scholar
  2. S. Gao and I. Chabini, “Optimal routing policy problems in stochastic time-dependent networks,” Transportation Research Part B: Methodological, vol. 40, no. 2, pp. 93–122, 2006. View at Publisher · View at Google Scholar · View at Scopus
  3. E. D. Miller-Hooks and H. S. Mahmassani, “Least possible time paths in stochastic, time-varying networks,” Computers & Operations Research, vol. 25, no. 12, pp. 1107–1125, 1998. View at Publisher · View at Google Scholar · View at Scopus
  4. E. D. Miller-Hooks and H. S. Mahmassani, “Least expected time paths in stochastic, time-varying transportation networks,” Transportation Science, vol. 34, no. 2, pp. 198–215, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. E. Miller-Hooks, “Adaptive least-expected time paths in stochastic, time-varying transportation and data networks,” Networks, vol. 37, no. 1, pp. 35–52, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  6. E. Miller-Hooks and H. Mahmassani, “Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks,” European Journal of Operational Research, vol. 146, no. 1, pp. 67–82, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. S. Opasanon and E. Miller-Hooks, “Multicriteria adaptive paths in stochastic, time-varying networks,” European Journal of Operational Research, vol. 173, no. 1, pp. 72–91, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. S. Wang, M. Wang, and J. Hu, “Shortest path problem in stochastic time-varying transportation networks considering risk measurement,” International Journal of Advancements in Computing Technology, vol. 3, no. 6, pp. 169–175, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. H. Jia, L. Zhang, M. Duan, and G. Fu, “A time-dependent flow model for Hazmat transportation routing,” in Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM '10), pp. 1553–1557, Macau, China, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. E. Erkut and O. Alp, “Integrated routing and scheduling of hazmat trucks with stops en route,” Transportation Science, vol. 41, no. 1, pp. 107–122, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. Q. Meng, D.-H. Lee, and R. L. Cheu, “Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation,” Journal of Transportation Engineering, vol. 131, no. 9, pp. 699–707, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. L. K. Nozick, G. F. List, and M. A. Turnquist, “Integrated routing and scheduling in hazardous materials transportation,” Transportation Science, vol. 31, no. 3, pp. 200–215, 1997. View at Publisher · View at Google Scholar · View at Scopus
  13. T.-S. Chang, L. K. Nozick, and M. A. Turnquist, “Multiobjective path finding in stochastic dynamic networks, with application to routing hazardous materials shipments,” Transportation Science, vol. 39, no. 3, pp. 383–399, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. E. Miller-Hooks and H. S. Mahmassani, “Optimal routing of hazardous materials in stochastic, time-varying transportation networks,” Transportation Research Record, no. 1645, pp. 143–151, 1998. View at Google Scholar · View at Scopus
  15. Z. Zhou, F. Chu, A. Che, and M. Zhou, “ε-Constraint and fuzzy logic-based optimization of hazardous material transportation via lane reservation,” IEEE Transactions on Intelligent Transportation Systems, vol. 14, no. 2, pp. 847–857, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. J. Black, “Strategic transport planning, demand analysis of transport infrastructure and transport services for the 27th summer, olympiad held in Sydney, Australia, 2000,” Journal of Transportation Systems Engineering and Information, vol. 2, no. 2, pp. 14–30, 2004. View at Google Scholar
  17. E. Zagorianakos, “Athens 2004 olympic games’ Transportation Plan: a missed opportunity for Strategic Environmental Assessment (SEA) integration,” Journal of Transport Geography, vol. 12, no. 2, pp. 115–125, 2004. View at Publisher · View at Google Scholar · View at Scopus
  18. A. F. Abdelghany, K. F. Abdelghany, H. S. Mahmassani, and P. M. Murray, “Dynamic traffic assignment in design and evaluation of high-occupancy toll lanes,” Transportation Research Record, no. 1733, pp. 39–48, 2000. View at Google Scholar · View at Scopus
  19. P. M. Murray, H. S. Mahmassani, and K. F. Abdelghany, “Methodology for assessing high-occupancy toll-lane usage and network performance,” Transportation Research Record, vol. 1765, pp. 8–15, 2001. View at Google Scholar · View at Scopus
  20. A. S. Shalaby, “Simulating performance impacts of bus lanes and supporting measures,” Journal of Transportation Engineering, vol. 125, no. 5, pp. 390–397, 1999. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Wu, C. Chu, F. Chu, and N. Wu, “Heuristic for lane reservation problem in time constrained transportation,” in Proceedings of the IEEE International Conference on Automation Science and Engineering (CASE '09), pp. 543–548, Bangalore, India, August 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Fang, F. Chu, S. Mammar, and A. Che, “An optimal algorithm for automated truck freight transportation via lane reservation strategy,” Transportation Research Part C: Emerging Technologies, vol. 26, pp. 170–183, 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. Y. Fang, F. Chu, S. Mammar, and M. Zhou, “Optimal lane reservation in transportation network,” IEEE Transactions on Intelligent Transportation Systems, vol. 13, no. 2, pp. 482–491, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. Y. Fang, F. Chu, S. Mammar, and A. Che, “A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times,” International Journal of Production Research, vol. 52, no. 4, pp. 1003–1015, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. Y. Qiao, N. Keren, and M. S. Mannan, “Utilization of accident databases and fuzzy sets to estimate frequency of HazMat transport accidents,” Journal of Hazardous Materials, vol. 167, no. 1–3, pp. 374–382, 2009. View at Publisher · View at Google Scholar · View at Scopus
  26. H. L. Khoo, L. E. Teoh, and Q. Meng, “A bi-objective optimization approach for exclusive bus lane selection and scheduling design,” Engineering Optimization, vol. 46, no. 7, pp. 987–1007, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. J. Princeton and S. Cohens, “Impact of a dedicated lane on the capacity and the level of service of an urban motorway,” Procedia—Social and Behavioral Sciences, vol. 16, pp. 196–206, 2011. View at Publisher · View at Google Scholar
  28. V. T'kindt and J.-C. Billaut, “Multicriteria scheduling problems: a survey,” RAIRO Operations Research, vol. 35, no. 2, pp. 143–163, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  29. Y. Y. Haimes, L. S. Lasdon, and D. A. Wismer, “On a bicriterion formulation of the problems of integrated system identification and system optimization,” IEEE Transactions on Systems, Man and Cybernetics, vol. SMC-1, no. 3, pp. 296–297, 1971. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. V. Chankong and Y. Haimes, Multiobjective Decision Making Theory and Methodology, Elsevier Science, New York, NY, USA, 1983.
  31. J.-F. Bérubé, M. Gendreau, and J.-Y. Potvin, “An exact ε-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits,” European Journal of Operational Research, vol. 194, no. 1, pp. 39–50, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. S. Climer and W. Zhang, “Cut-and-solve: an iterative search strategy for combinatorial optimization problems,” Artificial Intelligence, vol. 170, no. 8-9, pp. 714–738, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  33. Z. Yang, F. Chu, and H. Chen, “A cut-and-solve based algorithm for the single-source capacitated facility location problem,” European Journal of Operational Research, vol. 221, no. 3, pp. 521–532, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. B. M. Waxman, “Routing of multipoint connections,” IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 1617–1622, 1988. View at Publisher · View at Google Scholar · View at Scopus
  35. J. Li, F. Chu, and C. Prins, “Lower and upper bounds for a capacitated plant location problem with multicommodity flow,” Computers & Operations Research, vol. 36, no. 11, pp. 3019–3030, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. R. Diestel, Graph Theory, Springer, Berlin, Germany, 2005. View at MathSciNet