Abstract

In most of the hazardous material transportation problems, risk factors are assumed to be constant, which ignores the fact that they can vary with time throughout the day. In this paper, we deal with a novel time-dependent hazardous material transportation problem via lane reservation, in which the dynamic nature of transportation risk in the real-life traffic environment is taken into account. We first develop a multiobjective mixed integer programming (MIP) model with two conflicting objectives: minimizing the impact on the normal traffic resulting from lane reservation and minimizing the total transportation risk. We then present a cut-and-solve basedε-constraint method to solve this model. Computational results indicate that our method outperforms theε-constraint method based on optimization software package CPLEX.

Highlights

  • Hazardous materials are a kind of goods with physical, chemical, and biological properties, which could cause lots of accidents, such as flame, explosion, and leak, in the course of production, storage, and transportation

  • We investigate a novel multiobjective hazardous material transportation problem via lane reservation with a deterministic time-dependent transportation risk

  • Columns T1 and T2 represent the average computation time of five instances for each set by the proposed ε-constraint method, in which singleobjective problem P1 is solved by the optimization software package CPLEX and the CS based method, respectively

Read more

Summary

Introduction

Hazardous materials are a kind of goods with physical, chemical, and biological properties, which could cause lots of accidents, such as flame, explosion, and leak, in the course of production, storage, and transportation. Erkut and Alp [10] proposed an integrated routing and scheduling problem for hazardous material transportation in a network with stochastic time-dependent accident probability, population exposure, and travel time. Miller-Hooks and Mahmassani [14] proposed an optimal routing algorithm for a single hazardous material shipment in a stochastic time-dependent network, where the travel time and risk followed time-dependent normal distribution functions They presented several procedures for determining the best compromise path to minimize the total travel time and risk (population exposure). We investigate a novel multiobjective hazardous material transportation problem via lane reservation with a deterministic time-dependent transportation risk.

Problem Formulation
Solution Algorithm
Computational Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.