Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation

References

• Abkowitz, M. D., M. Lepofsky, and P. Cheng. 1992. “Selecting Criteria for Designating Hazardous Materials Highway Routes.” Transportation Research Record 1333: 30–35.
   Google Scholar
• Akgün, V., E. Erkut, and R. Batta. 2000. “On Finding Dissimilar Paths.” European Journal of Operational Research 121 (2): 232–246.
   Web of Science ®Google Scholar
• Androutsopoulos, K. N., and K. G. Zografos. 2008. “Solving the k-shortest Path Problem with Time Windows in a Time Varying Network.” Operations Research Letters 36 (6): 692–695.
   Web of Science ®Google Scholar
• Androutsopoulos, K. N., and K. G. Zografos. 2010. “Solving the Bicriterion Routing and Scheduling Problem for Hazardous Materials Distribution.” Transportation Research Part C 18 (5): 713–726.
   Web of Science ®Google Scholar
• Batta, R., and S. S. Chiu. 1988. “Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials.” Operations Research 36 (1): 84–92.
   Web of Science ®Google Scholar
• Bektaş, T., and G. Laporte. 2011. “The Pollution-routing Problem.” Transportation Research Part B 45 (8): 1232–1250.
   Google Scholar
• Bellman, R. E. 1958. “On a Routing Problem.” Quarterly of Applied Mathematics 16: 87–90.
   Google Scholar
• Charnes, A., and W. W. Cooper. 1959. “Chance-constrained Programming.” Management Science 6 (1): 73–79.
   Web of Science ®Google Scholar
• Cheng, R., M. Gen, and T. Tozawa. 1995. “Vehicle Routing Problem with Fuzzy Due-time Using Genetic Algorithms.” Journal of Japan Society for Fuzzy Theory and Systems 7 (5): 1050–1061.
   Google Scholar
• Cooke, K. L., and E. Halsey. 1966. “The Shortest Route through a Network with Time-dependent Internodal Transit Times.” Journal of Mathematical Analysis and Applications 14 (3): 493–498.
   Web of Science ®Google Scholar
• Davies, C., and P. Lingras. 2003. “Genetic Algorithms for Rerouting Shortest Paths in Dynamic and Stochastic Networks.” European Journal of Operational Research 144 (1): 27–38.
   Web of Science ®Google Scholar
• Deng, Y., Y. Chen, Y. Zhang, and S. Mahadevan. 2012. “Fuzzy Dijkstra Algorithm for Shortest Path Problem under Uncertain Environment.” Applied Soft Computing 12 (3): 1231–1237.
   Web of Science ®Google Scholar
• Desai, S., and G. J. Lim. 2013. “Solution Time Reduction Techniques of a Stochastic Dynamic Programming Approach for Hazardous Material Route Selection Problem.” Computers & Industrial Engineering 65 (4): 634–645.
   Web of Science ®Google Scholar
• Dijkstra, E. W. 1959. “A Note on Two Problems in Connection with Graphs.” Numerische Mathematik 1 (1): 269–271.
   Google Scholar
• Dreyfus, S. E. 1969. “An Appraisal of Some Shortest-path Algorithms.” Operations Research 17 (3): 395–412.
   Web of Science ®Google Scholar
• Dubois, D., and H. Prade. 1980. Fuzzy Sets and Systems: Theory and Applications. New York: Academic Press.
   Google Scholar
• Erkut, E., and A. Ingolfsson. 2000. “Catastrophe Avoidance Models for Hazardous Materials Route Planning.” Transportation Science 34 (2): 165–179.
   Web of Science ®Google Scholar
• Erkut, E., and A. Ingolfsson. 2005. “Transport Risk Models for Hazardous Materials: Revisited.” Operations Research Letters 33 (1): 81–89.
   Web of Science ®Google Scholar
• Frank, H. 1969. “Shortest Paths in Probability Graphs.” Operations Research 17 (4): 583–599.
   Web of Science ®Google Scholar
• Fu, L., and L. R. Rilett. 1998. “Expected Shortest Paths in Dynamic and Stochastic Traffic Networks.” Transportation Research Part B 32 (7): 499–516.
   Google Scholar
• Ghatee, M., S. Mehdi, M. Zarepisheh Hashemi, and E. Khorram. 2009. “Preemptive Priority-based Algorithms for Fuzzy Minimal Cost Flow Problem: An Application in Hazardous Materials Transportation.” Computers and Industrial Engineering 57 (1): 341–354.
   Web of Science ®Google Scholar
• Holland, J. H. 1975. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Oxford: University of Michigan Press.
   Google Scholar
• Ji, X., K. Iwamura, and Z. Shao. 2007. “New Models for Shortest Path Problem with Fuzzy Arc Lengths.” Applied Mathematical Modelling 31 (2): 259–269.
   Web of Science ®Google Scholar
• Kara, B. Y., E. Erkut, and V. Verter. 2003. “Accurate Calculation of Hazardous Materials Transport Risks.” Operations Research Letters 31 (4): 285–292.
   Web of Science ®Google Scholar
• Kundu, P., S. Kar, and M. Maiti. 2013. “Multi-objective Multi-item Solid Transportation Problem in Fuzzy Environment.” Applied Mathematical Modelling 37 (4): 2028–2038.
   Web of Science ®Google Scholar
• Li, X. 2013. Credibilistic Programming: An Introduction to Models and Applications. New York: Springer.
   Google Scholar
• Li, X., and B. Liu. 2006. “A Sufficient and Necessary Condition for Credibility Measures.” International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 14 (5): 527–535.
   Web of Science ®Google Scholar
• Lin, K. C., and M. S. Chern. 1993. “The Fuzzy Shortest Path Problem and its Most Vital Arcs.” Fuzzy Sets and Systems 58 (3): 343–353.
   Web of Science ®Google Scholar
• Liu, B. 2004. Uncertainty Theory: An Introduction to its Axiomatic Foundations. Berlin, Heidelberg: Springer.
   Google Scholar
• Liu, B., and K. Iwamura. 1998. “Chance Constrained Programming with Fuzzy Parameters.” Fuzzy Sets and Systems 94 (2): 227–237.
   Web of Science ®Google Scholar
• Marianov, V., and C. ReVelle. 1998. “Linear, Non-approximated Models for Optimal Routing in Hazardous Environments.” Journal of the Operational Research Society 49 (2): 157–164.
   Web of Science ®Google Scholar
• Nielsen, L. R., K. A. Andersen, and D. Pretolani. 2013. “Ranking Paths in Stochastic Time-dependent Networks.” European Journal of Operational Research 236 (3): 903–914.
   Web of Science ®Google Scholar
• Peteghem, V. V., and M. Vanhoucke. 2010. “A Genetic Algorithm for the Preemptive and Non-preemptive Multi-mode Resource-constrained Project Scheduling Problem.” European Journal of Operational Research 201 (2): 409–418.
   Web of Science ®Google Scholar
• ReVelle, C., J. Cohon, and D. Shobrys. 1991. “Simultaneous Siting and Routing in the Disposal of Hazardous Wastes.” Transportation Science 25 (2): 138–145.
   Web of Science ®Google Scholar
• Saccomanno, F. F., and A. Y. W. Chan. 1985. “Economic Evaluation of Routing Strategies for Hazardous Road Shipments.” Transportation Research Record 1020: 12–18.
   Google Scholar
• Sherali, H. D., L. D. Brizendine, T. S. Glickman, and S. Subramanian. 1997. “Low Probability-high Consequence Consideration in Routing Hazardous Material Shipments.” Transportation Science 31 (3): 237–251.
   Web of Science ®Google Scholar
• Sivakumar, R. A., R. Batta, and M. H. Karwan. 1993. “A Network-based Model for Transporting Extremely Hazardous Materials.” Operations Research Letters 13 (2): 85–93.
   Web of Science ®Google Scholar
• Taş, D., M. Gendreau, N. Dellaert, T. Woensel, and A. G. Kok. 2014. “Vehicle Routing with Soft Time Windows and Stochastic Travel Times: A Column Generation and Branch-and-Price Solution Approach.” European Journal of Operational Research 236 (3): 789–799.
   Web of Science ®Google Scholar
• Toumazis, I., and C. Kwon. 2013. “Routing Hazardous Materials on Time-dependent Networks Using Conditional Value-at-risk.” Transportation Research Part C 37: 73–92.
   Web of Science ®Google Scholar
• Yang, X., X. Li, Z. Gao, H. Wang, and T. Tang. 2013. “A Cooperative Scheduling Model for Timetable Optimization in Subway Systems.” IEEE Transactions on Intelligent Transportation System 14 (1): 438–447.
   Web of Science ®Google Scholar
• Yang, X., B. Ning, X. Li, and T. Tang. 2014. “A Two-objective Timetable Optimization Model in Subway Systems.” IEEE Transactions on Intelligent Transportation Systems 15 (5): 1913–1921.
   Web of Science ®Google Scholar
• Yuan, S., B. Skinner, S. Huang, and D. Liu. 2013. “A New Crossover Approach for Solving the Multiple Travelling Salesmen Problem Using Genetic Algorithms.” European Journal of Operational Research 228 (1): 72–82.
   Web of Science ®Google Scholar
• Zamani, R. 2013. “A Competitive Magnet-based Genetic Algorithm for Solving the Resource-constrained Project Scheduling Problem.” European Journal of Operational Research 229 (2): 552–559.
   Web of Science ®Google Scholar
• Zhang, J., J. Hodgson, and E. Erkut. 2000. “Using GIS to Assess the Risks of Hazardous Materials Transport in Networks.” European Journal of Operational Research 121 (2): 316–329.
   Web of Science ®Google Scholar
• Zografos, K. G., and K. N. Androutsopoulos. 2004. “A Heuristic Algorithm for Solving Hazardous Materials Distribution Problems.” European Journal of Operation Research 152 (2): 507–519.
   Web of Science ®Google Scholar