A bi-level programming problem for transporting hazardous materials with a bi-modal transportation network Online publication date: Mon, 14-Nov-2022
by Akbar Ketabi; Abdolsalam Ghaderi; Anwar Mahmoodi
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 15, No. 3/4, 2022
Abstract: This paper investigates a hazardous materials network design problem through a bi-modal transportation network consisting of road and rail. Due to the different concerns of the government and carriers in transportation of these materials, we propose a bi-level formulation for the considered problem. The government in the upper level seeks to a fair distribution of risk by minimising the maximum network risk. On the other hand, the carrier in the lower level aims to minimise the transportation cost. The bi-level problem is transformed into a single-level mixed-integer programming problem by replacing the lower-level by Karush-Kuhn-Tucker (KKT) conditions. We also propose a heuristic algorithm, which can find appropriate solutions to the realistic size problem with acceptable computation time. Our analysis of solving two case studies including Iranian multimodal network indicates that the algorithm finds acceptable solutions with reasonable computation time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook