IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i2p459-471.html
   My bibliography  Save this article

A bi-level network interdiction model for solving the hazmat routing problem

Author

Listed:
  • Amirsaman Kheirkhah
  • HamidReza Navidi
  • Masume Messi Bidgoli

Abstract

In the current work, we considered the problem of hazardous material distribution where the distributer chooses the routes on the network, and a regulatory agency controls the behaviour of the distributer to traverse the specified routes. In these circumstances, the distributer sets to select some routes to minimise the total distributing costs. Mostly, this occurs due to selecting risky arcs in which more individuals are exposed to risk. To prevent this and increase the capability to deal with the risk of hazardous material transportation through roads, the regulatory agency obliges carriers to traverse through the most secure arcs, though imposing more distribution costs. The problem is modelled as a bi-level routing problem. The bi-level model is difficult to solve and may be ill-posed. Two meta-heuristic algorithms are proposed to solve the bi-level model, and some randomly generated problems are applied to show the applicability and efficiency of the proposed algorithms.

Suggested Citation

  • Amirsaman Kheirkhah & HamidReza Navidi & Masume Messi Bidgoli, 2016. "A bi-level network interdiction model for solving the hazmat routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 459-471, January.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:2:p:459-471
    DOI: 10.1080/00207543.2015.1084061
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1084061
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1084061?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Matteo Fischetti & Paolo Toth & Daniele Vigo, 1994. "A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs," Operations Research, INFORMS, vol. 42(5), pages 846-859, October.
    2. Vedat Verter & Erhan Erkut, 1997. "Incorporating Insurance Costs in Hazardous Materials Routing Models," Transportation Science, INFORMS, vol. 31(3), pages 227-236, August.
    3. Erhan Erkut & Vedat Verter, 1998. "Modeling of Transport Risk for Hazardous Materials," Operations Research, INFORMS, vol. 46(5), pages 625-642, October.
    4. George F. List & Pitu B. Mirchandani & Mark A. Turnquist & Konstantinos G. Zografos, 1991. "Modeling and Analysis for Hazardous Materials Transportation: Risk Analysis, Routing/Scheduling and Facility Location," Transportation Science, INFORMS, vol. 25(2), pages 100-114, May.
    5. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    6. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    7. Erhan Erkut & Armann Ingolfsson, 2000. "Catastrophe Avoidance Models for Hazardous Materials Route Planning," Transportation Science, INFORMS, vol. 34(2), pages 165-179, May.
    8. Karkazis, J. & Boffey, T. B., 1995. "Optimal location of routes for vehicles transporting hazardous materials," European Journal of Operational Research, Elsevier, vol. 86(2), pages 201-215, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    2. Shahla Jafari & Hamidreza Navidi, 2018. "A Game-Theoretic Approach for Modeling Competitive Diffusion over Social Networks," Games, MDPI, vol. 9(1), pages 1-13, February.
    3. Ditta, A. & Figueroa, O. & Galindo, G. & Yie-Pinedo, R., 2019. "A review on research in transportation of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).
    4. Wu, Weitiao & Ma, Jian & Liu, Ronghui & Jin, Wenzhou, 2022. "Multi-class hazmat distribution network design with inventory and superimposed risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    5. Yan Sun & Xinya Li & Xia Liang & Cevin Zhang, 2019. "A Bi-Objective Fuzzy Credibilistic Chance-Constrained Programming Approach for the Hazardous Materials Road-Rail Multimodal Routing Problem under Uncertainty and Sustainability," Sustainability, MDPI, vol. 11(9), pages 1-27, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    2. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    3. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    4. Kumar, Anand & Roy, Debjit & Verter, Vedat & Sharma, Dheeraj, 2018. "Integrated fleet mix and routing decision for hazmat transportation: A developing country perspective," European Journal of Operational Research, Elsevier, vol. 264(1), pages 225-238.
    5. Vigo, Daniele, 1996. "A heuristic algorithm for the asymmetric capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 89(1), pages 108-126, February.
    6. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
    7. Abdelkader Sbihi & Richard W. Eglese, 2007. "The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey," Working Papers hal-00644133, HAL.
    8. Rongrong Li & Yee Leung, 2011. "Multi-objective route planning for dangerous goods using compromise programming," Journal of Geographical Systems, Springer, vol. 13(3), pages 249-271, September.
    9. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    10. Szeto, W.Y. & Farahani, R.Z. & Sumalee, Agachai, 2017. "Link-based multi-class hazmat routing-scheduling problem: A multiple demon approach," European Journal of Operational Research, Elsevier, vol. 261(1), pages 337-354.
    11. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    12. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 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, Elsevier, vol. 236(3), pages 789-799.
    13. Hosseini, S. Davod & Verma, Manish, 2018. "Conditional value-at-risk (CVaR) methodology to optimal train configuration and routing of rail hazmat shipments," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 79-103.
    14. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    15. Erhan Erkut & Armann Ingolfsson, 2000. "Catastrophe Avoidance Models for Hazardous Materials Route Planning," Transportation Science, INFORMS, vol. 34(2), pages 165-179, May.
    16. Toth, Paolo & Vigo, Daniele, 1999. "A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls," European Journal of Operational Research, Elsevier, vol. 113(3), pages 528-543, March.
    17. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
    18. Misagh Rahbari & Alireza Arshadi Khamseh & Yaser Sadati-Keneti & Mohammad Javad Jafari, 2022. "A risk-based green location-inventory-routing problem for hazardous materials: NSGA II, MOSA, and multi-objective black widow optimization," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 24(2), pages 2804-2840, February.
    19. Yates, Justin & Sanjeevi, Sujeevraja, 2013. "A length-based, multiple-resource formulation for shortest path network interdiction problems in the transportation sector," International Journal of Critical Infrastructure Protection, Elsevier, vol. 6(2), pages 107-119.
    20. N A Wassan, 2006. "A reactive tabu search for the vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 111-116, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:54:y:2016:i:2:p:459-471. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.