Abstract
The currently most hazmat transportation scheduling models mainly aim to minimize total costs in order to take into both transportation out-of-pocket expenses and risk-related costs which are viewed as static. In this work, we consider the following hazmat transportation routing strategies problem: a given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous materials from a specific origin point to a specific destination within the time limitation. Here we mainly concern how time factors affect hazmat transportation routing selection through accident rates and the number of suffered people(in-road, off-road and cener), and provide a bilevel time-dependent programming formulation represents the distinct decisions made by the government and the carrier for hazmat transportation scheduling problem. Then we separated the problems into two parts for solving the model. At first, we solve the outer and inner problems of the bilevel model iteratively on modified/restricted graphs. Secondly we provide a heuristic for the time-dependent shortest model. The proposed bilevel model and heuristic algorithm are experimented on real scenarios of a regional network. (6 pages)
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
